Choosing a random spanning subtree: A case study
From MaRDI portal
Recommendations
Cites work
- Asymptotic analysis of a random walk on a hypercube with many dimensions
- Generating random combinatorial objects
- Geometric bounds for eigenvalues of Markov chains
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- 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
(6)- The nearest neighbor random walk on subspaces of a vector space and rate of convergence
- 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 1256746 (Why is no real title available?)
- Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
- A combinatorial proof of Aldous–Broder theorem for general Markov chains
- Models of random subtrees of a graph
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)
