arXiv subjects

Anupam Gupta

Publications and source records attributed to Anupam Gupta.

At least 127 records · Page 7Linked to original sources

arXiv2016

Online and Dynamic Algorithms for Set Cover

In this paper, we study the set cover problem in the fully dynamic model. In this model, the set of active elements, i.e., those that must be covered at any given time, can change due to element arrivals and departures. The goal is to maintain an algorithmic solution that is competitive with respect to the current optimal solution. This model is popular in both the dynamic algorithms and online algorithms communities. The difference is in the restriction placed on the algorithm: in dynamic algorithms, the running time of the algorithm making updates (called update time) is bounded, while in online algorithms, the number of updates made to the solution (called recourse) is limited. In this paper we show the following results: In the update time setting, we obtain O(log n)-competitiveness with O(f log n) amortized update time, and O(f^3)-competitiveness with O(f^2) update time. The O(log n)-competitive algorithm is the first one to achieve a competitive ratio independent of f in this setting. In the recourse setting, we show a competitive ratio of O(min{log n,f}) with constant amortized recourse. Note that this matches the best offline bounds with just constant recourse, something that is impossible in the classical online model. Our results are based on two algorithmic frameworks in the fully-dynamic model that are inspired by the classic greedy and primal-dual algorithms for offline set cover. We show that both frameworks can be used for obtaining both recourse and update time bounds, thereby demonstrating algorithmic techniques common to these strands of research.

cs.DS↗

arXiv2016

Deformation and break-up of viscoelastic droplets Using Lattice Boltzmann Models

We investigate the break-up of Newtonian/viscoelastic droplets in a viscoelastic/Newtonian matrix under the hydrodynamic conditions of a confined shear flow. Our numerical approach is based on a combination of Lattice-Boltzmann models (LBM) and Finite Difference (FD) schemes. LBM are used to model two immiscible fluids with variable viscosity ratio (i.e. the ratio of the droplet to matrix viscosity); FD schemes are used to model viscoelasticity, and the kinetics of the polymers is introduced using constitutive equations for viscoelastic fluids with finitely extensible non-linear elastic dumbbells with Peterlin's closure (FENE-P). We study both strongly and weakly confined cases to highlight the role of matrix and droplet viscoelasticity in changing the droplet dynamics after the startup of a shear flow. Simulations provide easy access to quantities such as droplet deformation and orientation and will be used to quantitatively predict the critical Capillary number at which the droplet breaks, the latter being strongly correlated to the formation of multiple neckings at break-up. This study complements our previous investigation on the role of droplet viscoelasticity (A. Gupta \& M. Sbragaglia, {\it Phys. Rev. E} {\bf 90}, 023305 (2014)), and is here further extended to the case of matrix viscoelasticity.

cond-mat.soft↗

arXiv2016

Two-dimensional, homogeneous, isotropic fluid turbulence with polymer additives

We present the most extensive direct numerical simulations, attempted so far, of statistically steady, homogeneous, isotropic turbulence in two-dimensional fluid films with air-drag-induced friction and with polymer additives. Our study reveals that the polymers (a) reduce the total fluid energy, enstrophy, and palinstrophy, (b) modify the fluid energy spectrum both in inverse- and forward-cascade regimes, (c) reduce small-scale intermittency, (d) suppress regions of large vorticity and strain rate, and (e) stretch in strain-dominated regions. We compare our results with earlier experimental studies; and we propose new experiments.

physics.flu-dyn↗

arXiv2016

Binary-Fluid Turbulence: Signatures of Multifractal Droplet Dynamics and Dissipation Reduction

We present an extensive direct numerical simulation of statistically steady, homogeneous, isotropic turbulence in two-dimensional, binary-fluid mixtures with air-drag-induced friction by using the Cahn-Hilliard-Navier-Stokes equations. We choose parameters, e.g., the surface tension, such that we have a droplet of the minority phase moving inside a turbulent background of the majority phase. We characterize the deformation of the droplet and show that it displays multifractal dynamics. The probability distribution functions of the components of the acceleration of the center of mass of the droplet exhibit wide, non-Gaussian tails. Our study reveals that the droplet enhances the energy spectrum $E(k)$ when the wavenumber $k$ is large; this enhancement leads to dissipation reduction.

physics.flu-dyn↗

arXiv2016

A Lattice Boltzmann study of the effects of viscoelasticity on droplet formation in microfluidic cross-junctions

Based on mesoscale lattice Boltzmann (LB) numerical simulations, we investigate the effects of viscoelasticity on the break-up of liquid threads in microfluidic cross-junctions, where droplets are formed by focusing a liquid thread of a dispersed (d) phase into another co-flowing continuous (c) immiscible phase. Working at small Capillary numbers, we investigate the effects of non-Newtonian phases in the transition from droplet formation at the cross-junction (DCJ) to droplet formation downstream of the cross-junction (DC) (Liu $\&$ Zhang, ${\it Phys. ~Fluids.}$ ${\bf 23}$, 082101 (2011)). We will analyze cases with ${\it Droplet ~Viscoelasticity}$ (DV), where viscoelastic properties are confined in the dispersed phase, as well as cases with ${\it Matrix ~Viscoelasticity}$ (MV), where viscoelastic properties are confined in the continuous phase. Moderate flow-rate ratios $Q \approx {\cal O}(1)$ of the two phases are considered in the present study. Overall, we find that the effects are more pronounced in the case with MV, where viscoelasticity is found to influence the break-up point of the threads, which moves closer to the cross-junction and stabilizes. This is attributed to an increase of the polymer feedback stress forming in the corner flows, where the side channels of the device meet the main channel. Quantitative predictions on the break-up point of the threads are provided as a function of the Deborah number, i.e. the dimensionless number measuring the importance of viscoelasticity with respect to Capillary forces.

physics.flu-dyn↗

arXiv2016

Effects of viscoelasticity on droplet dynamics and break-up in microfluidic T-Junctions: a lattice Boltzmann study

The effects of viscoelasticity on the dynamics and break-up of fluid threads in microfluidic T-junctions are investigated using numerical simulations of dilute polymer solutions at changing the Capillary number ($\mbox {Ca}$), i.e. at changing the balance between the viscous forces and the surface tension at the interface, up to $\mbox{Ca} \approx 3 \times 10^{-2}$. A Navier-Stokes (NS) description of the solvent based on the lattice Boltzmann models (LBM) is here coupled to constitutive equations for finite extensible non-linear elastic dumbbells with the closure proposed by Peterlin (FENE-P model). We present the results of three-dimensional simulations in a range of $\mbox{Ca}$ which is broad enough to characterize all the three characteristic mechanisms of breakup in the confined T-junction, i.e. ${\it squeezing}$, ${\it dripping}$ and ${\it jetting}$ regimes. The various model parameters of the FENE-P constitutive equations, including the polymer relaxation time $τ_P$ and the finite extensibility parameter $L^2$, are changed to provide quantitative details on how the dynamics and break-up properties are affected by viscoelasticity. We will analyze cases with ${\it Droplet ~Viscoelasticity}$ (DV), where viscoelastic properties are confined in the dispersed (d) phase, as well as cases with ${\it Matrix ~Viscoelasticity}$ (MV), where viscoelastic properties are confined in the continuous (c) phase. Moderate flow-rate ratios $Q \approx {\cal O}(1)$ of the two phases are considered in the present study. Overall, we find that the effects are more pronounced in the case with MV, as the flow driving the break-up process upstream of the emerging thread can be sensibly perturbed by the polymer stresses.

physics.flu-dyn↗

arXiv2016

LAST but not Least: Online Spanners for Buy-at-Bulk

The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-costs exhibit economy-of-scale. Previous approaches to this problem used tree- embeddings, giving us randomized algorithms. Moreover, the optimal results with a logarithmic competitive ratio requires the metric on which the network is being built to be known up-front; the competitive ratios then depend on the size of this metric (which could be much larger than the number of terminals that arrive). We consider the buy-at-bulk problem in the least restrictive model where the metric is not known in advance, but revealed in parts along with the demand points seeking connectivity arriving online. For the single sink buy-at-bulk problem, we give a deterministic online algorithm with competitive ratio that is logarithmic in k, the number of terminals that have arrived, matching the lower bound known even for the online Steiner tree problem. In the oblivious case when the buy-at-bulk function used to compute the edge-costs of the network is not known in advance (but is the same across all edges), we give a deterministic algorithm with competitive ratio polylogarithmic in k, the number of terminals. At the heart of our algorithms are optimal constructions for online Light Approximate Shortest-path Trees (LASTs) and spanners, and their variants. We give constructions that have optimal trade-offs in terms of cost and stretch. We also define and give constructions for a new notion of LASTs where the set of roots (in addition to the points) expands over time. We expect these techniques will find applications in other online network-design problems.

cs.DS↗

arXiv2016

How long do particles spend in vortical regions in turbulent flows?

We obtain the probability distribution functions (PDFs) of the time that a Lagrangian tracer or a heavy inertial particle spends in vortical or strain-dominated regions of a turbulent flow, by carrying out direct numerical simulation (DNS) of such particles advected by statistically steady, homogeneous and isotropic turbulence in the forced, three-dimensional, incompressible Navier-Stokes equation. We use the two invariants, $Q$ and $R$, of the velocity-gradient tensor to distinguish between vortical and strain-dominated regions of the flow and partition the $Q-R$ plane into four different regions depending on the topology of the flow; out of these four regions two correspond to vorticity-dominated regions of the flow and two correspond to strain-dominated ones. We obtain $Q$ and $R$ along the trajectories of tracers and heavy inertial particles and find out the time $\mathrm{t_{pers}}$ for which they remain in one of the four regions of the $Q-R$ plane. We find that the PDFs of $\mathrm{t_{pers}}$ display exponentially decaying tails for all four regions for tracers and heavy inertial particles. From these PDFs we extract characteristic times scales, which help us to quantify the time that such particles spend in vortical or strain-dominated regions of the flow.

physics.flu-dyn↗

arXiv2016

Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions

Suppose we are given a submodular function $f$ over a set of elements, and we want to maximize its value subject to certain constraints. Good approximation algorithms are known for such problems under both monotone and non-monotone submodular functions. We consider these problems in a stochastic setting, where elements are not all active and we can only get value from active elements. Each element $e$ is active independently with some known probability $p_e$, but we don't know the element's status \emph{a priori}. We find it out only when we \emph{probe} the element $e$---probing reveals whether it's active or not, whereafter we can use this information to decide which other elements to probe. Eventually, if we have a probed set $S$ and a subset $\text{active}(S)$ of active elements in $S$, we can pick any $T \subseteq \text{active}(S)$ and get value $f(T)$. Moreover, the sequence of elements we probe must satisfy a given \emph{prefix-closed constraint}---e.g., these may be given by a matroid, or an orienteering constraint, or deadline, or precedence constraint, or an arbitrary downward-closed constraint---if we can probe some sequence of elements we can probe any prefix of it. What is a good strategy to probe elements to maximize the expected value? In this paper we study the gap between adaptive and non-adaptive strategies for $f$ being a submodular or a fractionally subadditive (XOS) function. If this gap is small, we can focus on finding good non-adaptive strategies instead, which are easier to find as well as to represent. We show that the adaptivity gap is a constant for monotone and non-monotone submodular functions, and logarithmic for XOS functions of small \emph{width}. These bounds are nearly tight. Our techniques show new ways of arguing about the optimal adaptive decision tree for stochastic problems.

cs.DS↗

arXiv2016

Pure Exploration of Multi-armed Bandit Under Matroid Constraints

We study the pure exploration problem subject to a matroid constraint (Best-Basis) in a stochastic multi-armed bandit game. In a Best-Basis instance, we are given $n$ stochastic arms with unknown reward distributions, as well as a matroid $\mathcal{M}$ over the arms. Let the weight of an arm be the mean of its reward distribution. Our goal is to identify a basis of $\mathcal{M}$ with the maximum total weight, using as few samples as possible. The problem is a significant generalization of the best arm identification problem and the top-$k$ arm identification problem, which have attracted significant attentions in recent years. We study both the exact and PAC versions of Best-Basis, and provide algorithms with nearly-optimal sample complexities for these versions. Our results generalize and/or improve on several previous results for the top-$k$ arm identification problem and the combinatorial pure exploration problem when the combinatorial constraint is a matroid.

cs.LG↗

arXiv2015

How the Experts Algorithm Can Help Solve LPs Online

We consider the problem of solving packing/covering LPs online, when the columns of the constraint matrix are presented in random order. This problem has received much attention and the main focus is to figure out how large the right-hand sides of the LPs have to be (compared to the entries on the left-hand side of the constraints) to allow $(1+ε)$-approximations online. It is known that the right-hand sides have to be $Ω(ε^{-2} \log m)$ times the left-hand sides, where $m$ is the number of constraints. In this paper we give a primal-dual algorithm that achieve this bound for mixed packing/covering LPs. Our algorithms construct dual solutions using a regret-minimizing online learning algorithm in a black-box fashion, and use them to construct primal solutions. The adversarial guarantee that holds for the constructed duals helps us to take care of most of the correlations that arise in the algorithm; the remaining correlations are handled via martingale concentration and maximal inequalities. These ideas lead to conceptually simple and modular algorithms, which we hope will be useful in other contexts.

cs.DS↗

arXiv2015

On the Lovász Theta function for Independent Sets in Sparse Graphs

We consider the maximum independent set problem on graphs with maximum degree~$d$. We show that the integrality gap of the Lovász $\vartheta$-function based SDP is $\widetilde{O}(d/\log^{3/2} d)$. This improves on the previous best result of $\widetilde{O}(d/\log d)$, and almost matches the integrality gap of $\widetilde{O}(d/\log^2 d)$ recently shown for stronger SDPs, namely those obtained using poly-$(\log(d))$ levels of the $SA^+$ semidefinite hierarchy. The improvement comes from an improved Ramsey-theoretic bound on the independence number of $K_r$-free graphs for large values of $r$. We also show how to obtain an algorithmic version of the above-mentioned $SA^+$-based integrality gap result, via a coloring algorithm of Johansson. The resulting approximation guarantee of $\widetilde{O}(d/\log^2 d)$ matches the best unique-games-based hardness result up to lower-order poly-$(\log\log d)$ factors.

cs.DS↗

arXiv2015

An Improved Integrality Gap for Asymmetric TSP Paths

The Asymmetric Traveling Salesperson Path Problem (ATSPP) is one where, given an asymmetric metric space $(V,d)$ with specified vertices s and t, the goal is to find an s-t path of minimum length that passes through all the vertices in V. This problem is closely related to the Asymmetric TSP (ATSP), which seeks to find a tour (instead of an $s-t$ path) visiting all the nodes: for ATSP, a $ρ$-approximation guarantee implies an $O(ρ)$-approximation for ATSPP. However, no such connection is known for the integrality gaps of the linear programming relaxations for these problems: the current-best approximation algorithm for ATSPP is $O(\log n/\log\log n)$, whereas the best bound on the integrality gap of the natural LP relaxation (the subtour elimination LP) for ATSPP is $O(\log n)$. In this paper, we close this gap, and improve the current best bound on the integrality gap from $O(\log n)$ to $O(\log n/\log\log n)$. The resulting algorithm uses the structure of narrow $s$-$t$ cuts in the LP solution to construct a (random) tree spanning tree that can be cheaply augmented to contain an Eulerian $s$-$t$ walk. We also build on a result of Oveis Gharan and Saberi and show a strong form of Goddyn's conjecture about thin spanning trees implies the integrality gap of the subtour elimination LP relaxation for ATSPP is bounded by a constant. Finally, we give a simpler family of instances showing the integrality gap of this LP is at least 2.

cs.DS↗

arXiv2014

Online Packing and Covering Framework with Convex Objectives

We consider online fractional covering problems with a convex objective, where the covering constraints arrive over time. Formally, we want to solve $\min\,\{f(x) \mid Ax\ge \mathbf{1},\, x\ge 0\},$ where the objective function $f:\mathbb{R}^n\rightarrow \mathbb{R}$ is convex, and the constraint matrix $A_{m\times n}$ is non-negative. The rows of $A$ arrive online over time, and we wish to maintain a feasible solution $x$ at all times while only increasing coordinates of $x$. We also consider "dual" packing problems of the form $\max\,\{c^\intercal y - g(μ) \mid A^\intercal y \le μ,\, y\ge 0\}$, where $g$ is a convex function. In the online setting, variables $y$ and columns of $A^\intercal$ arrive over time, and we wish to maintain a non-decreasing solution $(y,μ)$. We provide an online primal-dual framework for both classes of problems with competitive ratio depending on certain "monotonicity" and "smoothness" parameters of $f$; our results match or improve on guarantees for some special classes of functions $f$ considered previously. Using this fractional solver with problem-dependent randomized rounding procedures, we obtain competitive algorithms for the following problems: online covering LPs minimizing $\ell_p$-norms of arbitrary packing constraints, set cover with multiple cost functions, capacity constrained facility location, capacitated multicast problem, set cover with set requests, and profit maximization with non-separable production costs. Some of these results are new and others provide a unified view of previous results, with matching or slightly worse competitive ratios.

cs.DS↗

arXiv2014

Greedy Algorithms for Steiner Forest

In the Steiner Forest problem, we are given terminal pairs $\{s_i, t_i\}$, and need to find the cheapest subgraph which connects each of the terminal pairs together. In 1991, Agrawal, Klein, and Ravi, and Goemans and Williamson gave primal-dual constant-factor approximation algorithms for this problem; until now, the only constant-factor approximations we know are via linear programming relaxations. We consider the following greedy algorithm: Given terminal pairs in a metric space, call a terminal "active" if its distance to its partner is non-zero. Pick the two closest active terminals (say $s_i, t_j$), set the distance between them to zero, and buy a path connecting them. Recompute the metric, and repeat. Our main result is that this algorithm is a constant-factor approximation. We also use this algorithm to give new, simpler constructions of cost-sharing schemes for Steiner forest. In particular, the first "group-strict" cost-shares for this problem implies a very simple combinatorial sampling-based algorithm for stochastic Steiner forest.

cs.DS↗

arXiv2014

Universal Statistical Properties of Inertial-particle Trajectories in Three-dimensional, Homogeneous, Isotropic, Fluid Turbulence

We uncover universal statistical properties of the trajectories of heavy inertial particles in three-dimensional, statistically steady, homogeneous, and isotropic turbulent flows by extensive direct numerical simulations. We show that the probability distribution functions (PDFs) $P(ϕ)$, of the angle $ϕ$ between the Eulerian velocity ${\bf u}$ and the particle velocity ${\bf v}$, at this point and time, shows a power-law region in which $P(ϕ) \sim ϕ^{-γ}$, with a new universal exponent $γ\simeq 4$. Furthermore, the PDFs of the trajectory curvature $κ$ and modulus $θ$ of the torsion $\vartheta$ have power-law tails that scale, respectively, as $P(κ) \sim κ^{-h_κ}$, as $κ\to \infty$, and $P(θ) \sim θ^{-h_θ}$, as $θ\to \infty$, with exponents $h_κ\simeq 2.5$ and $h_θ\simeq 3$ that are universal to the extent that they do not depend on the Stokes number ${\rm St}$ (given our error bars). We also show that $γ$, $h_κ$ and $h_θ$ can be obtained by using simple stochastic models. We characterize the complexity of heavy-particle trajectories by the number $N_{\rm I}(t,{\rm St})$ of points (up until time $t$) at which $\vartheta$ changes sign. We show that $n_{\rm I}({\rm St}) \equiv \lim_{t\to\infty} \frac{N_{\rm I}(t,{\rm St})}{t} \sim {\rm St}^{-Δ}$, with $Δ\simeq 0.4$ a universal exponent.

physics.flu-dyn↗

arXiv2014

Homogeneous Isotropic Superfluid Turbulence in Two Dimensions: Inverse and Forward Cascades in the Hall-Vinen-Bekharevich-Khalatnikov model

We present the first direct-numerical-simulation study of the statistical properties of two-dimensional superfluid turbulence in the Hall-Vinen-Bekharevich-Khalatnikov two-fluid model. We show that both normal-fluid and superfluid energy spectra can exhibit two power-law regimes, the first associated with an inverse cascade of energy and the second with the forward cascade of enstrophy. We quantify the mutual-friction-induced alignment of normal and superfluid velocities by obtaining probability distribution functions of the angle between them and the ratio of their moduli. Our study leads to specific suggestions for experiments.

physics.flu-dyn↗

arXiv2014

Regimes of nonlinear depletion and regularity in the 3D Navier-Stokes equations

The periodic $3D$ Navier-Stokes equations are analyzed in terms of dimensionless, scaled, $L^{2m}$-norms of vorticity $D_{m}$ ($1 \leq m < \infty$). The first in this hierarchy, $D_{1}$, is the global enstrophy. Three regimes naturally occur in the $D_{1}-D_{m}$ plane. Solutions in the first regime, which lie between two concave curves, are shown to be regular, owing to strong nonlinear depletion. Moreover, numerical experiments have suggested, so far, that all dynamics lie in this heavily depleted regime \cite{DGGKPV13}\,; new numerical evidence for this is presented. Estimates for the dimension of a global attractor and a corresponding inertial range are given for this regime. However, two more regimes can theoretically exist. In the second, which lies between the upper concave curve and a line, the depletion is insufficient to regularize solutions, so no more than Leray's weak solutions exist. In the third, which lies above this line, solutions are regular, but correspond to extreme initial conditions. The paper ends with a discussion on the possibility of transition between these regimes.

nlin.CD↗