How to get an exact sample from a generic Markov chain and sample a random spanning tree prom a directed graph, both within the cover time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 448-457

  Wilson, David Bruce ^a   Propp, James Gary ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; DIRECTED GRAPHS; LEARNING ALGORITHMS; MARKOV PROCESSES;

DIRECTED SPANNING TREES; EDGE WEIGHTS; LOWER BOUNDS; PROBABILITY PROPORTIONAL; RANDOM SPANNING TREE; RANDOM WALK; SAMPLING ALGORITHM; WEIGHTED DIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 0039660957     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

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. Laurent Alonso and René Schott. Random Generation of Trees: Random Generators in Computer Science. Kluwer Academic Publishers, 1995.
5. Søren Asmussen, Peter W. Glynn, and Hermann Thorisson. Stationary detection in the initial transient problem. A CM Transactions on Modeling and Computer Simulation, 2(2):130-157, 1992.
6. Rodney J. Baxter. Exactly Solved Models in Statistical Mechanics. Academic Press, 1982.
7. J.J. Binney, N.J. Dowrick, A.J. Fisher, and M.E.J. Newman. The Theory of Critical Phenomena: An Introduction to the Renormalization Group. Oxford University Press, 1992.
8. Béla Bollobás. Graph Theory: An Introductory Course. Springer-Verlag, 1979. Graduate texts in mathematics, #63.
9. Andrei Broder. Generating random spanning trees. In Foundations of Computer Science, pages 442-447, 1989.
10. Charles J. Colbourn. The Combinatorics of Network Reliability. Oxford University Press, 1987.
11. 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.
12. Charles J. Colbourn, Bradley M. Debroni, and Wendy J. Myrvold. Estimating the coefficients of the reliability polynomial. Congressus Numerantium, 62:217-223, 1988.
13. Charles J. Colbourn, Wendy J. Myrvold, and Eugene Neufeld. Two algorithms for unranking arborescences. Journal of Algorithms, 1995. To appear.
14. Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. In Symposium on the Theory of Computing, pages 1-6, 1987.
15. W. Fernandez de la Vega and A. Guénoche. Construction de mots circulaires aléatoires uniformément distribués. Mathématiques et Sciences Humaines, 58:25-29, 1977.
16. Persi Diaconis. Group Representations in Probability and Statistics. Institute of Mathematical Statistics, 1988.
17. 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.
18. Persi Diaconis and Daniel Stroock. Geometric bounds for eigenvalues of Markov chains. The Annals of Applied Probability, 1(1):36-61, 1991.
19. C. M. Fortuin and P. W. Kasteleyn. On the random cluster model. I. Introduction and relation to other models. Physica, 57(4):536-564, 1972.
20. A. Guénoche. Random spanning tree. Journal of Algorithms, 4:214-220, 1983. In French.
21. Mark Jerrum and Alistair Sinclair. Approximating the permanent. SIAM Journal on Computing, 18(6):1149-1178, 1989.
22. D. Kandel, Y. Matias, R. Unger, and P. Winkler. Shuffling biological sequences, 1995. Preprint.
23. P.W. Kasteleyn. The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice. Physica, 27:1209-1225, 1961.
24. Jeong Han Kim, Peter Shor, and Peter Winkler. Random independent sets. Article in preparation.
25. V.G. Kulkarni. Generating random combinatorial objects. Journal of Algorithms, 11(2):185-207, 1990.
26. Elliott Lieb. Residual entropy of square ice. Physical Review, 162:162-172, 1967.
27. 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.
28. László Lovász and Peter Winkler. Exact mixing in an unknown Markov chain. Electronic Journal of Combinatorics, 2, 1995. Paper #R15.
29. Michael Luby, Dana Randall, and Alistair Sinclair. Markov chain algorithms for planar lattice structures (extended abstract). In Foundations of Computer Science, pages 150-159, 1995.
30. Louis D. Nel and Charles J. Colbourn. Combining Monte Carlo estimates and bounds for network reliability. Networks, 20:277-298, 1990.
31. James G. Propp and David B. Wilson. Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms, 1995. To appear.
32. Alistair Sinclair. Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, 1993.