Generating random spanning trees more quickly than the cover time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 296-303

  Wilson, David Bruce ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL TECHNIQUES; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING; TREES (MATHEMATICS);

CYCLE POPPING PROCEDURE; RANDOM SUCCESSOR; RANDOM TREE WITH ROOT; SAMPLING METHOD;

COMPUTATION THEORY;

EID: 0029711422     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237880     Document Type: Conference Paper

References (26)

1. David Aldous. On simulating a Markov chain stationary distribution when transition probabilities are unknown, 1994. Preprint.
2. David J. Aldous. A random walk construction of uniform spanning trees and uniform labelled trees. SIAM Journal of Discrete Mathematics, 3(4):450-465, 1990.
3. David J. Aldous and James A. Fill. Reversible Markov Chains and Random Walks on Graphs. Book in preparation, 1995.
4. Søren Asmussen, Peter W. Glynn, and Hermann Thorisson. Stationary detection in the initial transient problem. ACM Transactions on Modeling and Computer Simulation, 2(2):130-157, 1992.
5. Béla Bollobás. Graph Theory: An Introductory Course. Springer-Verlag, 1979. Graduate texts in mathematics, #63.
6. Andrei Broder. Generating random spanning trees. In Foundations of Computer Science, pages 442-447, 1989.
7. Robert Burton and Robin Pemantle. Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances. The Annals of Probability, 21(3):1329-1371, 1993.
8. Charles J. Colbourn, Robert P. J. Day, and Louis D. Nel. Unranking and ranking spanning trees of a graph. Journal of Algorithms, 10:271-286, 1989.
9. Charles J. Colbourn, Bradley M. Debroni, and Wendy J. Myrvold. Estimating the coefficients of the reliability polynomial. Congressus Numerantium, 62:217-223, 1988.
10. Charles J. Colbourn, Wendy J. Myrvold, and Eugene Neufeld. Two algorithms for unranking arborescences. Journal of Algorithms, 1995. To appear.
11. Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
12. Persi Diaconis. Group Representations in Probability and Statistics. Institute of Mathematical Statistics, 1988.
13. Persi Diaconis and Laurent Saloff-Coste. What do we know about the Metropolis algorithm? In Symposium on the Theory of Computing, pages 112-129, 1995.
14. Persi Diaconis and Daniel Stroock. Geometric bounds for eigenvalues of Markov chains. The Annals of Applied Probability, 1(1):36-61, 1991.
15. James A. Fill, 1995. Personal communication.
16. A. Guénoche. Random spanning tree. Journal of Algorithms, 4:214-220, 1983. In French.
17. Mark Jerrum and Alistair Sinclair. Approximating the permanent. SIAM Journal on Computing, 18(6):1149-1178, 1989.
18. D. Kandel, Y. Matias, R. Unger, and P. Winkler. Shuffling biological sequences, 1995. Preprint.
19. V. G. Kulkarni. Generating random combinatorial objects. Journal of Algorithms, 11(2):185-207, 1990.
20. Gregory F. Lawler. Intersections of Random Walks. Birkhäuser, 1991.
21. László Lovász and Miklós Simonovits. On the randomized complexity of volume and diameter. In Foundations of Computer Science, pages 482-491, 1992.
22. László Lovász and Peter Winkler. Exact mixing in an unknown Markov chain. Electronic Journal of Combinatorics, 2, 1995. Paper #R15.
23. Robin Pemantle. Choosing a spanning tree for the integer lattice uniformly. The Annals of Probability. 19(4):1559-1574, 1991.
24. James G. Propp and David B. Wilson. Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms, 1996. To appear.
25. Alistair Sinclair. Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, 1993.
26. David B. Wilson and James G. Propp. 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. In Symposium on Discrete Algorithms, 1996.