How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
Authors:
- James Gary ProppJPJames Gary Propp
- David Bruce WilsonDWDavid Bruce Wilson
- 1 May 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 27 (2) , 170-217
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Two Algorithms for Unranking ArborescencesJournal of Algorithms, 1996
- Spectral Analysis for Discrete Longitudinal DataAdvances in Mathematics, 1994
- Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-ImpedancesThe Annals of Probability, 1993
- Stationarity detection in the initial transient problemACM Transactions on Modeling and Computer Simulation, 1992
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled TreesSIAM Journal on Discrete Mathematics, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Unranking and ranking spanning trees of a graphJournal of Algorithms, 1989
- Generating random spanning trees1989
- Significance of nucleotide sequence alignments: a method for random sequence permutation that preserves dinucleotide and codon usage.Molecular Biology and Evolution, 1985
- Random walks, universal traversal sequences, and the complexity of maze problems1979