Fast perfect sampling from linear extensions

In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded algorithms that generate approximately uniform samples. Here, we create a bounding chain for one such Markov chain, and by using a non-Markovian coupling together with a modified form of coupling from the past, we build an algorithm for perfectly generating samples. The expected running time of the procedure is O(n^3lnn), making the technique as fast as the mixing time of the Karzanov/Khachiyan chain upon which it is based.

[1]  G. Brightwell,et al.  Counting linear extensions , 1991 .

[2]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[3]  Stefan Felsner,et al.  Markov chains for linear extensions, the two-dimensional case , 1997, SODA '97.

[4]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[5]  Martin E. Dyer,et al.  Faster random generation of linear extensions , 1999, SODA '98.

[6]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[7]  P. Matthews.  Generating a Random Linear Extension of a Partial Order , 1991 .

[8]  O. Haggstrom,et al.  On Exact Simulation of Markov Random Fields Using Coupling from the Past , 1999 .

[9]  James Allen Fill,et al.  Extension of Fill's perfect rejection sampling algorithm to general chains , 2000, Random Struct. Algorithms.

[10]  Martin E. Dyer,et al.  Path coupling: A technique for proving rapid mixing in Markov chains , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[11]  Mark Huber,et al.  Exact sampling and approximate counting techniques , 1998, STOC '98.

[12]  M. Huber.  Perfect sampling using bounding chains , 2004, math/0405284.

[13]  L. Khachiyan,et al.  On the conductance of order Markov chains , 1991 .

[14]  D. Aldous.  Some Inequalities for Reversible Markov Chains , 1982 .

[15]  D. Wilson.  Mixing times of lozenge tiling and card shuffling Markov chains , 2001, math/0102193.