Choosing a random spanning subtree: A case study

DOI10.1007/BF01259553MaRDI QIDQ1181414zbMATH OpenFDO

Authors Richard A. Stong

Publication date 27 June 1992

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

zbMATH Keywords

Markov chainrandom graphsstopping-time

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1256746
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• scientific article; zbMATH DE number 953290

Cites work

• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• Asymptotic analysis of a random walk on a hypercube with many dimensions
• Generating random combinatorial objects
• Geometric bounds for eigenvalues of Markov chains
• Improving Monte Carlo Efficiency by Increasing Variance
• Maximal coupling
• Shuffling Cards and Stopping Times
• Strong uniform times and finite random walks
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

Cited in

(4)

• A combinatorial proof of Aldous–Broder theorem for general Markov chains
• Models of random subtrees of a graph
• Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
• The nearest neighbor random walk on subspaces of a vector space and rate of convergence

This page was built for publication: Choosing a random spanning subtree: A case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181414)