Faster random generation of linear extensions

@article{Bubley1998FasterRG,
  title={Faster random generation of linear extensions},
  author={Russ Bubley and M. Dyer},
  journal={Discret. Math.},
  year={1998},
  volume={201},
  pages={81-88}
}
Abstract This paper examines the problem of sampling (almost) uniformly from the set of linear extensions of a partial order, a classic problem in the theory of approximate sampling. Previous techniques have relied on deep geometric arguments, or have not worked in full generality. Recently, focus has centred on the Karzanov and Khachiyan Markov chain. In this paper, we define a slightly different Markov chain, and present a very simple proof of its rapid mixing, using the method of path… Expand
Fast perfect sampling from linear extensions
  • M. Huber
  • Computer Science, Mathematics
  • Discret. Math.
  • 2006
A Sequential Importance Sampling Algorithm for Counting Linear Extensions
Bounds on mixing time of finite Markov chains.
Mixing times of lozenge tiling and card shuffling Markov chains
Path coupling: A technique for proving rapid mixing in Markov chains
  • Russ Bubley, M. Dyer
  • Mathematics, Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
Using TPA to count linear extensions
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
The Markov chain Monte Carlo method: an approach to approximate counting and integration
On Markov chains f or independent sets, 1997. (Preprint)
  • 1997
Counting linear ex tensions.Order
  • 1991
Generating linear exten sions fast
  • SIAM Journal on Computing
  • 1994
Generating a random linear extension o f a partial order.The Annals of Probability
  • 1991