The Mixing of Markov Chains on Linear Extensions in Practice

  title={The Mixing of Markov Chains on Linear Extensions in Practice},
  author={Topi Talvitie and Teppo Niinimaki and Mikko Koivisto},
We investigate almost uniform sampling from the set of linear extensions of a given partial order. The most efficient schemes stem from Markov chains whose mixing time bounds are polynomial, yet impractically large. We show that, on instances one encounters in practice, the actual mixing times can be much smaller than the worst-case bounds, and particularly so for a novel Markov chain we put forward. We circumvent the inherent hardness of estimating standard mixing times by introducing a… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.

Random Structures & Algorithms

  • James G. Propp, David B. Wilson. Exact sampling with coupled Markov chains, applications to statistical mechanics
  • 9(1-2):223–252,
  • 1996
Highly Influential
5 Excerpts

of the International Joint Conference on Artificial Intelligence (IJCAI)

  • Kustaa Kangas, Teemu Hankala, Teppo Niinimäki, Mikko Koivisto. Counting linear extensions of sparse pos Proc
  • pages 603–609,
  • 2016
Highly Influential
3 Excerpts


  • Maxim Rabinovich, Aaditya Ramdas, Michael I. Jordan, Martin J. Wainwright. Function-specific mixing times, concentration away from equilibrium
  • abs/1605.02077,
  • 2016

Optimal partialorder plan relaxation via MaxSAT

  • Teppo Niinimäki, Pekka Parviainen, Mikko Koivisto
  • J . Artificial Intelligence Research
  • 2016
1 Excerpt

of the 24th International Joint Conference on Artificial Intelligence

  • Supratik Chakraborty, Dror Fried, Kuldeep S. Meel, Moshe Y. Vardi. From weighted to unweighted model counti Proc
  • (IJCAI), pages 689–695,
  • 2015
1 Excerpt

Similar Papers

Loading similar papers…