2,468 research outputs found
Optimal Principal Component Analysis in Distributed and Streaming Models
We study the Principal Component Analysis (PCA) problem in the distributed
and streaming models of computation. Given a matrix a
rank parameter , and an accuracy parameter , we
want to output an orthonormal matrix for which where is the best rank- approximation to .
This paper provides improved algorithms for distributed PCA and streaming
PCA.Comment: STOC2016 full versio
Incorporating Forcing Terms in Cascaded Lattice-Boltzmann Approach by Method of Central Moments
Cascaded lattice-Boltzmann method (Cascaded-LBM) employs a new class of
collision operators aiming to improve numerical stability. It achieves this and
distinguishes from other collision operators, such as in the standard single or
multiple relaxation time approaches, by performing relaxation process due to
collisions in terms of moments shifted by the local hydrodynamic fluid
velocity, i.e. central moments, in an ascending order-by-order at different
relaxation rates. In this paper, we propose and derive source terms in the
Cascaded-LBM to represent the effect of external or internal forces on the
dynamics of fluid motion. This is essentially achieved by matching the
continuous form of the central moments of the source or forcing terms with its
discrete version. Different forms of continuous central moments of sources,
including one that is obtained from a local Maxwellian, are considered in this
regard. As a result, the forcing terms obtained in this new formulation are
Galilean invariant by construction. The method of central moments along with
the associated orthogonal properties of the moment basis completely determines
the expressions for the source terms as a function of the force and macroscopic
velocity fields. In contrast to the existing forcing schemes, it is found that
they involve higher order terms in velocity space. It is shown that the
proposed approach implies "generalization" of both local equilibrium and source
terms in the usual lattice frame of reference, which depend on the ratio of the
relaxation times of moments of different orders. An analysis by means of the
Chapman-Enskog multiscale expansion shows that the Cascaded-LBM with forcing
terms is consistent with the Navier-Stokes equations. Computational experiments
with canonical problems involving different types of forces demonstrate its
accuracy.Comment: 55 pages, 4 figure
Oscillatory Shear Flow-Induced Alignment of Lamellar Melts of Hydrogen-Bonded Comb Copolymer Supramolecules
In this work we present the orientational behavior of comb copolymer-like supramolecules P4VP(PDP)1.0, obtained by hydrogen bonding between poly(4-vinylpyridine) and pentadecylphenol, during large-amplitude oscillatory shear flow experiments over a broad range of frequencies (0.001-10 Hz). The alignment diagram, presenting the macroscopic alignment in T/TODT vs ω/ωc, contains three regions of parallel alignment separated by a region of perpendicular alignment. For our material, the order-disorder temperature TODT = 67 °C and ωc, the frequency above which the distortion of the chain conformation dominates the materials’ viscoelasticity, is around 0.1 Hz at 61 °C. For the first time flipping from a pure transverse alignment via biaxial transverse/perpendicular alignment to a perpendicular alignment as a function of the strain amplitude was found.
Remarks on the KLS conjecture and Hardy-type inequalities
We generalize the classical Hardy and Faber-Krahn inequalities to arbitrary
functions on a convex body , not necessarily
vanishing on the boundary . This reduces the study of the
Neumann Poincar\'e constant on to that of the cone and Lebesgue
measures on ; these may be bounded via the curvature of
. A second reduction is obtained to the class of harmonic
functions on . We also study the relation between the Poincar\'e
constant of a log-concave measure and its associated K. Ball body
. In particular, we obtain a simple proof of a conjecture of
Kannan--Lov\'asz--Simonovits for unit-balls of , originally due to
Sodin and Lata{\l}a--Wojtaszczyk.Comment: 18 pages. Numbering of propositions, theorems, etc.. as appeared in
final form in GAFA seminar note
Distributed Edge Connectivity in Sublinear Time
We present the first sublinear-time algorithm for a distributed
message-passing network sto compute its edge connectivity exactly in
the CONGEST model, as long as there are no parallel edges. Our algorithm takes
time to compute and a
cut of cardinality with high probability, where and are the
number of nodes and the diameter of the network, respectively, and
hides polylogarithmic factors. This running time is sublinear in (i.e.
) whenever is. Previous sublinear-time
distributed algorithms can solve this problem either (i) exactly only when
[Thurimella PODC'95; Pritchard, Thurimella, ACM
Trans. Algorithms'11; Nanongkai, Su, DISC'14] or (ii) approximately [Ghaffari,
Kuhn, DISC'13; Nanongkai, Su, DISC'14].
To achieve this we develop and combine several new techniques. First, we
design the first distributed algorithm that can compute a -edge connectivity
certificate for any in time .
Second, we show that by combining the recent distributed expander decomposition
technique of [Chang, Pettie, Zhang, SODA'19] with techniques from the
sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup,
STOC'15], we can decompose the network into a sublinear number of clusters with
small average diameter and without any mincut separating a cluster (except the
`trivial' ones). Finally, by extending the tree packing technique from [Karger
STOC'96], we can find the minimum cut in time proportional to the number of
components. As a byproduct of this technique, we obtain an -time
algorithm for computing exact minimum cut for weighted graphs.Comment: Accepted at 51st ACM Symposium on Theory of Computing (STOC 2019
On Local Behavior of Holomorphic Functions Along Complex Submanifolds of C^N
In this paper we establish some general results on local behavior of
holomorphic functions along complex submanifolds of \Co^{N}. As a corollary,
we present multi-dimensional generalizations of an important result of Coman
and Poletsky on Bernstein type inequalities on transcendental curves in
\Co^{2}.Comment: minor changes in the formulation and the proof of Lemma 8.
The central limit problem for random vectors with symmetries
Motivated by the central limit problem for convex bodies, we study normal
approximation of linear functionals of high-dimensional random vectors with
various types of symmetries. In particular, we obtain results for distributions
which are coordinatewise symmetric, uniform in a regular simplex, or
spherically symmetric. Our proofs are based on Stein's method of exchangeable
pairs; as far as we know, this approach has not previously been used in convex
geometry and we give a brief introduction to the classical method. The
spherically symmetric case is treated by a variation of Stein's method which is
adapted for continuous symmetries.Comment: AMS-LaTeX, uses xy-pic, 23 pages; v3: added new corollary to Theorem
On the Three-dimensional Central Moment Lattice Boltzmann Method
A three-dimensional (3D) lattice Boltzmann method based on central moments is
derived. Two main elements are the local attractors in the collision term and
the source terms representing the effect of external and/or self-consistent
internal forces. For suitable choices of the orthogonal moment basis for the
three-dimensional, twenty seven velocity (D3Q27), and, its subset, fifteen
velocity (D3Q15) lattice models, attractors are expressed in terms of
factorization of lower order moments as suggested in an earlier work; the
corresponding source terms are specified to correctly influence lower order
hydrodynamic fields, while avoiding aliasing effects for higher order moments.
These are achieved by successively matching the corresponding continuous and
discrete central moments at various orders, with the final expressions written
in terms of raw moments via a transformation based on the binomial theorem.
Furthermore, to alleviate the discrete effects with the source terms, they are
treated to be temporally semi-implicit and second-order, with the implicitness
subsequently removed by means of a transformation. As a result, the approach is
frame-invariant by construction and its emergent dynamics describing fully 3D
fluid motion in the presence of force fields is Galilean invariant. Numerical
experiments for a set of benchmark problems demonstrate its accuracy.Comment: 55 pages, 8 figure
Parameterized Complexity of Maximum Edge Colorable Subgraph
A graph is {\em -edge colorable} if there is a coloring , such that for distinct , we have
. The {\sc Maximum Edge-Colorable Subgraph} problem
takes as input a graph and integers and , and the objective is to
find a subgraph of and a -edge-coloring of , such that . We study the above problem from the viewpoint of Parameterized
Complexity. We obtain \FPT\ algorithms when parameterized by: the vertex
cover number of , by using {\sc Integer Linear Programming}, and ,
a randomized algorithm via a reduction to \textsc{Rainbow Matching}, and a
deterministic algorithm by using color coding, and divide and color. With
respect to the parameters , where is one of the following: the
solution size, , the vertex cover number of , and l -
{\mm}(G), where {\mm}(G) is the size of a maximum matching in ; we show
that the (decision version of the) problem admits a kernel with vertices. Furthermore, we show that there is no kernel of size
, for any and computable
function , unless \NP \subseteq \CONPpoly
A parametric integer programming algorithm for bilevel mixed integer programs
We consider discrete bilevel optimization problems where the follower solves
an integer program with a fixed number of variables. Using recent results in
parametric integer programming, we present polynomial time algorithms for pure
and mixed integer bilevel problems. For the mixed integer case where the
leader's variables are continuous, our algorithm also detects whether the
infimum cost fails to be attained, a difficulty that has been identified but
not directly addressed in the literature. In this case it yields a ``better
than fully polynomial time'' approximation scheme with running time polynomial
in the logarithm of the relative precision. For the pure integer case where the
leader's variables are integer, and hence optimal solutions are guaranteed to
exist, we present two algorithms which run in polynomial time when the total
number of variables is fixed.Comment: 11 page
- …