Generating random spanning trees more quickly than the cover time

@inproceedings{Wilson1996GeneratingRS,
  title={Generating random spanning trees more quickly than the cover time},
  author={David Bruce Wilson},
  booktitle={STOC '96},
  year={1996}
}
  • D. Wilson
  • Published in STOC '96 1 July 1996
  • Computer Science
It is widely known how to generate random spanning trees of an undirected graph. Broder showed how at FOCS [6], and Aldous too found the algorithm [2]. Start at any vertex and do a simple random walk on the graph. Each time a vertex is first encountered, mark the edge from which it was discovered. When all the vertices are discovered, the marked edges form a random spanning tree. This algorithm is easy to code up, has small running time constants, and has a nice proof that it generates trees… 

Figures and Tables from this paper

An almost-linear time algorithm for uniform random spanning tree generation
TLDR
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.
Counting trees with random walks
Generating Random Spanning Trees via Fast Matrix Multiplication
TLDR
The best algorithm for dense graphs can produce a uniformly random spanning tree of an n-vertex graph in time \(O(n^{2.38})\).
Faster generation of random spanning trees by Aleksander M 4 dry
  • A. Madry
  • Computer Science, Mathematics
  • 2010
TLDR
A new algorithm for generating approximately uniformly random spanning trees in undirected graphs by exploiting the connection between random walks on graphs and electrical networks is introduced to introduce a new approach to the problem that integrates discrete random walk-based techniques with continuous linear algebraic methods.
Sampling random spanning trees faster than matrix multiplication
TLDR
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).
Random spanning forests, Markov matrix spectra and well distributed points
This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size n, find a probability law on
PR ] 2 4 Ju l 2 01 9 A Reverse Aldous / Broder Algorithm
The Aldous/Broder algorithm provides a way of sampling a uniform spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop
Generating a Random Sink-free Orientation in Quadratic Time
TLDR
A simple randomized algorithm inspired by Wilson's cycle popping method is presented which obtains an exact sample in mean time at most $O(nm)$, where $n$ is the number of vertices.
Distributed Random Walks
TLDR
A sublinear time distributed algorithm for performing random walks whose time complexity is sublinear in the length of the walk and which is fully decentralized and can serve as a building block in the design of topologically-aware networks.
Two Applications of Random Spanning Forests
We use random spanning forests to find, for any Markov process on a finite set of size n and any positive integer $$m \le n$$m≤n, a probability law on the subsets of size m such that the mean hitting
...
...

References

SHOWING 1-10 OF 35 REFERENCES
Generating random spanning trees
  • A. Broder
  • Computer Science, Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
TLDR
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.
How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time
This paper shows how to obtain unbiased samples from an unknown Markov chain by observing it for O(T{sub c}) steps, where T{sub c} is the cover time. This algorithm improves on several previous
Lower bounds for covering times for reversible Markov chains and random walks on graphs
For simple random walk on aN-vertex graph, the mean time to cover all vertices is at leastcN log(N), wherec>0 is an absolute constant. This is deduced from a more general result about stationary
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
  • D. Aldous
  • Mathematics
    SIAM J. Discret. Math.
  • 1990
TLDR
It is shown how random walk techniques can be applied to the study of several properties of the uniform random spanning tree: the proportion of leaves, the distribution of degrees, and the diameter.
Two Algorithms for Unranking Arborescences
TLDR
Two algorithms are presented for the more general problem of ranking and unranking rooted spanning arborescences of a directed graph and the number of arithmetic operations can be reduced to the same as that of the best known algorithms for matrix multiplication.
Generating Random Combinatorial Objects
Approximating the Permanent
TLDR
A randomised approximation scheme for the permanent of a 0–1s presented, demonstrating that the matchings chain is rapidly mixing, apparently the first such result for a Markov chain with genuinely c...
On the randomized complexity of volume and diameter
The authors give an O(n/sup 7/log/sup 2/n) randomised algorithm to approximate the volume of a convex body, and an O(n/sup 6/log n) algorithm to sample a point from the uniform distribution over a
Algorithms for Random Generation and Counting: A Markov Chain Approach
  • A. Sinclair
  • Computer Science
    Progress in Theoretical Computer Science
  • 1993
TLDR
The Markov chain approach to generation problems, and a robust notion of approximate counting, and self-embeddable relations, are presented.
Shuffling Biological Sequences
...
...