50 research outputs found
Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple
We show how to perform sparse approximate Gaussian elimination for Laplacian
matrices. We present a simple, nearly linear time algorithm that approximates a
Laplacian by a matrix with a sparse Cholesky factorization, the version of
Gaussian elimination for symmetric matrices. This is the first nearly linear
time solver for Laplacian systems that is based purely on random sampling, and
does not use any graph theoretic constructions such as low-stretch trees,
sparsifiers, or expanders. The crux of our analysis is a novel concentration
bound for matrix martingales where the differences are sums of conditionally
independent variables
The Mixing Time of the Dikin Walk in a Polytope - A Simple Proof
We study the mixing time of the Dikin walk in a polytope - a random walk
based on the log-barrier from the interior point method literature. This walk,
and a close variant, were studied by Narayanan (2016) and Kannan-Narayanan
(2012). Bounds on its mixing time are important for algorithms for sampling and
optimization over polytopes. Here, we provide a simple proof of their result
that this random walk mixes in time O(mn) for an n-dimensional polytope
described using m inequalities.Comment: 5 pages, published in Operations Research Letter
A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs
We demonstrate that for expander graphs, for all there exists
a data structure of size which can be used to
return -approximations to effective resistances in
time per query. Short of storing all effective resistances,
previous best approaches could achieve size and
time per query by storing Johnson-Lindenstrauss
vectors for each vertex, or size and
time per query by storing a spectral sketch.
Our construction is based on two key ideas: 1) -sparse,
-additive approximations to for all can be used to
recover -approximations to the effective resistances, 2) In
expander graphs, only coordinates of a vector
similar to are larger than We give an efficient
construction for such a data structure in
time via random walks. This results in an algorithm for computing
-approximate effective resistances for vertex pairs in
expanders that runs in time, improving
over the previously best known running time of for
We employ the above algorithm to compute a -approximation to the
number of spanning trees in an expander graph, or equivalently, approximating
the (pseudo)determinant of its Laplacian in time. This improves on the previously best known result of
time, and matches the best known
size of determinant sparsifiers