Fast perfect sampling from linear extensions
Author:
- Mark HuberMHMark Huber
- 1 March 2006
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 306 (4) , 420-428
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Path coupling: A technique for proving rapid mixing in Markov chains2002
- Extension of Fill's perfect rejection sampling algorithm to general chainsRandom Structures & Algorithms, 2000
- On Exact Simulation of Markov Random Fields Using Coupling from the PastScandinavian Journal of Statistics, 1999
- Faster random generation of linear extensionsDiscrete Mathematics, 1999
- Exact sampling and approximate counting techniques1998
- Generating a Random Linear Extension of a Partial OrderThe Annals of Probability, 1991
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Counting linear extensionsOrder, 1991
- On the conductance of order Markov chainsOrder, 1991
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986