Perfect sampling methods for random forests
From MaRDI portal
Publication:3535658
DOI10.1239/AAP/1222868191zbMATH Open1160.05334OpenAlexW2051445099MaRDI QIDQ3535658FDOQ3535658
Authors: Hongsheng Dai 
Publication date: 13 November 2008
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1222868191
Recommendations
- Tree and forest weights and their application to nonuniform random graphs
- Random forests and networks analysis
- Non-uniform random spanning trees on weighted graphs
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
Cites Work
- Experiments in stochastic computation for high-dimensional graphical models
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Improved bounds for the number of forests and acyclic orientations in the square lattice
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Perfect sampling using bounding chains.
- Unranking and ranking spanning trees of a graph
- On the Number of Distinct Forests
- Perfect Simulation of Conditionally Specified Models
- Random spanning tree
- Tree and forest weights and their application to nonuniform random graphs
Cited In (3)
This page was built for publication: Perfect sampling methods for random forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535658)
