The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees 论文
1990SIAM Journal on Discrete Mathematics引用 328
Stochastic processes and statistical mechanicsAdvanced Graph Theory ResearchLimits and Structures in Graph Theory
摘要
A random walk on a finite graph can be used to construct a uniform random spanning tree.We show 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.