scientific article; zbMATH DE number 871943

MaRDI QIDQ4875218zbMATH OpenFDO

Authors James Propp, David B. Wilson

Publication date 28 April 1996

zbMATH Keywords

tree sampling algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• 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
• Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs

Cited in

(9)

• Non-uniform random spanning trees on weighted graphs
• Random walks and hyperplane arrangements
• Non-coupling from the past
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• Generating a random sink-free orientation in quadratic time
• Efficient edge rewiring strategies for enhancing PageRank fairness
• Linear extensions of rotor-routing in directed graphs: reachability problems
• Coalescence in Markov chains. In celebration of Svante Janson's 70th birthday
• Rayleigh processes, real trees, and root growth with re-grafting

This page was built for publication:

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