Fast Generation of Random Spanning Trees and the Effective Resistance Metric

  title={Fast Generation of Random Spanning Trees and the Effective Resistance Metric},
  author={Aleksander Madry and Damian Straszak and Jakub Tarnawski},
  booktitle={ACM-SIAM Symposium on Discrete Algorithms},
We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected $\tilde{O}(m^{4/3})$ time. This improves over the best previously known bound of $\min(\tilde{O}(m\sqrt{n}),O(n^{\omega}))$ -- that follows from the work of Kelner and M\k{a}dry [FOCS'09] and of Colbourn et al. [J. Algorithms'96] -- whenever the input graph is sufficiently sparse. At a high level, our result stems from carefully exploiting the… 

Figures from this paper

Sampling random spanning trees faster than matrix multiplication

An algorithm is presented that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in (n5/3 m1/3) time, based on Gaussian elimination, and the fact that effective resistance is preserved in the graph resulting from eliminating a subset of vertices (called a Schur complement).

Fully Dynamic Effective Resistances

A data-structure is given that maintains $(1+\epsilon)-approximations to all-pair effective resistances of a fully-dynamic unweighted, undirected multi-graph $G$ with expected amortized update and query time, against an oblivious adversary.

An almost-linear time algorithm for uniform random spanning tree generation

An m1+o(1)βo( 1)-time algorithm for generating uniformly random spanning trees in weighted graphs with max-to-min weight ratio β is given and it is shown that most random walk steps occur far away from an unvisited vertex.

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs

This work gives a fully dynamic algorithm that maintains $(1+\varepsilon)-approximations of the all-pairs effective resistances of an $n$-vertex graph undergoing edge insertions and deletions with worst-case update time and query time, and shows that this algorithm is close to optimal.

Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More

This paper provides faster algorithms for computing various fundamental quantities associated with random walks on a directed graph, including the stationary distribution, personalized PageRank vectors, hitting times, and escape probabilities, and shows how to compute each quantity in time Õ(m3/4n + mn2/3), where the Ó notation suppresses polylog factors in n.

Local Access to Random Walks

It is proved that no algorithm with subconstant error given probe access to an input d-regular graph can have runtime better than Ω( √ n/ log(n) per query in expectation when the input graph is drawn from G(n, d), obtaining a nearly matching lower bound.

Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence

This work achieves the optimal limit on domain sparsification for strongly Rayleigh distributions and improves the state of the art for obtaining a single sample from a determinantal point process from the prior runtime of ${\widetilde{O}(k)$.

Walks on undirected graphs and generation of random spanning trees

The Kelner-M ↪ adry algorithm (FOCS 2009) is presented which builds on these connections to sample a random spanning tree from the uniform distribution in Õ(m) time.

A Distributed Laplacian Solver and its Applications to Electrical Flow and Random Spanning Tree Computation

This work uses queueing networks to present a new approach to solving Laplacian systems that can be used to adapt the approach by Kelner and M\k{a}dry (2009) to give the first distributed algorithm to compute approximate random spanning trees efficiently.

Spectral Sparsification via Bounded-Independence Sampling

An inherent tradeoff is demonstrated between the amount of (bounded) independence used in the edge sampling algorithm, denoted by $k$ above, and the resulting sparsity that can be achieved.



Faster Generation of Random Spanning Trees

A new approach to the problem that integrates discrete random walk-based techniques with continuous linear algebraic methods is introduced, and the use of electrical networks and sparse linear system solvers in conjunction with random walks and combinatorial partitioning techniques is used.

Expanders via random spanning trees

It is proved that for any bounded-degree n-vertex graph, the union of two random spanning trees approximates the expansion of every cut of the graph to within a factor of O(log n).

Generating random spanning trees

  • A. Broder
  • Computer Science, Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
It is shown that the Markov chain on the space of all spanning trees of a given graph where the basic step is an edge swap is rapidly mixing.

Generating random spanning trees more quickly than the cover time

This paper gives a new algorithm for generating random spanning trees of an undirected graph that is easy to code up, has small running time constants, and has a nice proof that it generates trees with the right probabilities.

A Randomized Rounding Approach to the Traveling Salesman Problem

This work gives a (3/2-\eps_0)-approximation algorithm that finds a spanning tree whose cost is upper bounded by the optimum, then it finds the minimum cost Eulerian augmentation (or T-join) of that tree.

Random Walks on Graphs: a Survey

Dedicated to the marvelous random walk of Paul Erd} os through universities, c ontinents, and mathematics Various aspects of the theory of random walks on graphs are surveyed. In particular,

The electrical resistance of a graph captures its commute and cover times

Known relations between random walks and electrical networks are extended by showing that resistance in this network is intimately connected with the lengths of random walks on the graph, and bounds on cover time obtained are better than those obtained from previous techniques such as the eigenvalues of the adjacency matrix.

Unranking and Ranking Spanning Trees of a Graph

The cover time, the blanket time, and the Matthews bound

The upper and lower bounds and an approximation algorithm for the cover time of the random walk on a graph are proved and it is proved that M/2<C= O(M(lnlnn)/sup 2/).

Random walks, universal traversal sequences, and the complexity of maze problems

Results are derived suggesting that the undirected reachability problem is structurally different from, and easier than, the directed version of NSPACE(logn), an affirmative answer to a question of S. Cook.