14 research outputs found
An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials
For "large" class of continuous probability density functions
(p.d.f.), we demonstrate that for every there is mixture of
discrete Binomial distributions (MDBD) with
distinct Binomial distributions that -approximates a
discretized p.d.f. for all , where
. Also, we give two efficient parallel
algorithms to find such MDBD.
Moreover, we propose a sequential algorithm that on input MDBD with
for that induces a discretized p.d.f. ,
that is either Laplacian or SDDM matrix and parameter ,
outputs in time a spectral
sparsifier of a matrix-polynomial, where
notation hides factors.
This improves the Cheng et al.'s [CCLPT15] algorithm whose run time is
.
Furthermore, our algorithm is parallelizable and runs in work
and depth . Our main algorithmic contribution is to
propose the first efficient parallel algorithm that on input continuous p.d.f.
, matrix as above, outputs a spectral sparsifier of
matrix-polynomial whose coefficients approximate component-wise the discretized
p.d.f. .
Our results yield the first efficient and parallel algorithm that runs in
nearly linear work and poly-logarithmic depth and analyzes the long term
behaviour of Markov chains in non-trivial settings. In addition, we strengthen
the Spielman and Peng's [PS14] parallel SDD solver
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
Graph sparsification underlies a large number of algorithms, ranging from
approximation algorithms for cut problems to solvers for linear systems in the
graph Laplacian. In its strongest form, "spectral sparsification" reduces the
number of edges to near-linear in the number of nodes, while approximately
preserving the cut and spectral structure of the graph. In this work we
demonstrate a polynomial quantum speedup for spectral sparsification and many
of its applications. In particular, we give a quantum algorithm that, given a
weighted graph with nodes and edges, outputs a classical description of
an -spectral sparsifier in sublinear time
. This contrasts with the optimal classical
complexity . We also prove that our quantum algorithm is optimal
up to polylog-factors. The algorithm builds on a string of existing results on
sparsification, graph spanners, quantum algorithms for shortest paths, and
efficient constructions for -wise independent random strings. Our algorithm
implies a quantum speedup for solving Laplacian systems and for approximating a
range of cut problems such as min cut and sparsest cut.Comment: v2: several small improvements to the text. An extended abstract will
appear in FOCS'20; v3: corrected a minor mistake in Appendix
Density Independent Algorithms for Sparsifying k-Step Random Walks
We give faster algorithms for producing sparse approximations of the transition matrices of k-step random walks on undirected and weighted graphs. These transition matrices also form graphs, and arise as intermediate objects in a variety of graph algorithms. Our improvements are based on a better understanding of processes that sample such walks, as well as tighter bounds on key weights underlying these sampling processes. On a graph with n vertices and m edges, our algorithm produces a graph with about nlog(n) edges that approximates the k-step random walk graph in about m + k^2 nlog^4(n) time. In order to obtain this runtime bound, we also revisit "density independent" algorithms for sparsifying graphs whose runtime overhead is expressed only in terms of the number of vertices
Quantum speedup for graph sparsification, cut approximation, and Laplacian solving
Graph sparsification underlies a large number of algorithms, ranging from approximation algorithms for cut problems to solvers for linear systems in the graph Laplacian. In its strongest form, “spectral sparsification” reduces the number of edges to near-linear in the number of nodes, while approximately preserving the cut and spectral structure of the graph. In this work we demonstrate a polynomial quantum speedup for spectral sparsification and many of its applications. In particular, we give a quantum algorithm that, given a weighted graph with n nodes and m edges, outputs a classical description of an ϵ -spectral sparsifier in sublinear time O˜(mn−−−√/ϵ) . This contrasts with the optimal classical complexity O˜(m) . We also prove that our quantum algorithm is optimal up to polylog-factors. The algorithm builds on a string of existing results on sparsification, graph spanners, quantum algorithms for shortest paths, and efficient constructions for k -wise independent random strings. Our algorithm implies a quantum speedup for solving Laplacian systems and for approximating a range of cut problems such as min cut and sparsest cut
Better Sparsifiers for Directed Eulerian Graphs
Spectral sparsification for directed Eulerian graphs is a key component in
the design of fast algorithms for solving directed Laplacian linear systems.
Directed Laplacian linear system solvers are crucial algorithmic primitives to
fast computation of fundamental problems on random walks, such as computing
stationary distribution, hitting and commute time, and personalized PageRank
vectors. While spectral sparsification is well understood for undirected graphs
and it is known that for every graph -sparsifiers with
edges exist [Batson-Spielman-Srivastava, STOC '09]
(which is optimal), the best known constructions of Eulerian sparsifiers
require edges and are based on short-cycle
decompositions [Chu et al., FOCS '18].
In this paper, we give improved constructions of Eulerian sparsifiers,
specifically:
1. We show that for every directed Eulerian graph there exist an
Eulerian sparsifier with edges. This result is based on combining
short-cycle decompositions [Chu-Gao-Peng-Sachdeva-Sawlani-Wang, FOCS '18,
SICOMP] and [Parter-Yogev, ICALP '19], with recent progress on the matrix
Spencer conjecture [Bansal-Meka-Jiang, STOC '23].
2. We give an improved analysis of the constructions based on short-cycle
decompositions, giving an -time algorithm for any constant
for constructing Eulerian sparsifiers with
edges
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence
We design fast algorithms for repeatedly sampling from strongly Rayleigh
distributions, which include random spanning tree distributions and
determinantal point processes. For a graph , we show how to
approximately sample uniformly random spanning trees from in
time per sample after an initial
time preprocessing. For a determinantal point
process on subsets of size of a ground set of elements, we show how to
approximately sample in time after an initial
time preprocessing, where is
the matrix multiplication exponent. We even improve the state of the art for
obtaining a single sample from determinantal point processes, from the prior
runtime of to
.
In our main technical result, we achieve the optimal limit on domain
sparsification for strongly Rayleigh distributions. In domain sparsification,
sampling from a distribution on is reduced to sampling
from related distributions on for . We show that for
strongly Rayleigh distributions, we can can achieve the optimal
. Our reduction involves sampling from
domain-sparsified distributions, all of which can be produced efficiently
assuming convenient access to approximate overestimates for marginals of .
Having access to marginals is analogous to having access to the mean and
covariance of a continuous distribution, or knowing "isotropy" for the
distribution, the key assumption behind the Kannan-Lov\'asz-Simonovits (KLS)
conjecture and optimal samplers based on it. We view our result as a moral
analog of the KLS conjecture and its consequences for sampling, for discrete
strongly Rayleigh measures
On Fully Dynamic Graph Sparsifiers
We initiate the study of dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polylogarithmic time after each update in the graph. Our three main results are as follows. First, we give a fully dynamic algorithm for maintaining a -spectral sparsifier with amortized update time . Second, we give a fully dynamic algorithm for maintaining a -cut sparsifier with \emph{worst-case} update time . Both sparsifiers have size . Third, we apply our dynamic sparsifier algorithm to obtain a fully dynamic algorithm for maintaining a -approximation to the value of the maximum flow in an unweighted, undirected, bipartite graph with amortized update time