The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
暂无分享,去创建一个
[1] Andrei Z. Broder,et al. Bounds on the cover time , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[2] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .
[3] George Szekeres,et al. Distribution of labelled trees by diameter , 1983 .
[4] D. Aldous. Hitting times for random walks on vertex-transitive graphs , 1989, Mathematical Proceedings of the Cambridge Philosophical Society.
[5] V. Anantharam,et al. A proof of the Markov chain tree theorem , 1989 .
[6] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] Daniel J. Kleitman,et al. Spanning trees with many leaves in cubic graphs , 1989, J. Graph Theory.
[8] Michael Doob,et al. Spectra of graphs , 1980 .
[9] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.
[10] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.
[11] Brendan D. McKay,et al. Spanning Trees in Regular Graphs , 1983, Eur. J. Comb..
[12] N. Linial,et al. On the cover time of random walks on graphs , 1989 .
[13] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[14] R. Pemantle. Choosing a Spanning Tree for the Integer Lattice Uniformly , 1991, math/0404043.
[15] David Aldous,et al. The Continuum Random Tree III , 1991 .
[16] J. Moon. Counting labelled trees , 1970 .
[17] N. Biggs. Algebraic Graph Theory: The multiplicative expansion , 1974 .