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(n3 ln n), making the technique as fast as the mixing time of the Karzanov/Khachiyan chain upon which it is based.

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Mark Huber
• Keywords: Arbitrary Partial Order, Bounding Chain, DM 2006, Markov Chain