• DOI:10.1016/S0012-365X(98)00333-1
Corpus ID: 2942330

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}
}

• Russ Bubley, M. Dyer
• Published 1998
• Computer Science, Mathematics
• Discret. Math.

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

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed