Choosing a random spanning subtree: A case study

DOI10.1007/BF01259553zbMath0737.60059MaRDI QIDQ1181414

Richard A. Stong

Publication date: 27 June 1992

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

zbMATH Keywords

random graphsMarkov chainstopping-time

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

The nearest neighbor random walk on subspaces of a vector space and rate of convergence

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric bounds for eigenvalues of Markov chains
• Strong uniform times and finite random walks
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Asymptotic analysis of a random walk on a hypercube with many dimensions
• Generating random combinatorial objects
• Shuffling Cards and Stopping Times
• Improving Monte Carlo Efficiency by Increasing Variance
• Maximal coupling