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.
No takes yet. Share an insight, caveat, or question.
David Aldous (1990) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: