Markov Chains for Linear Extensions, the Two-Dimensional Case

We study the generation of uniformly distributed linear extensions using Markov chains. In particular we show that monotone coupling from the past can be applied in the case of linear extensions of two-dimensional orders. For width two orders a mixing rate of O(n3 logn) is proved. We conjecture that this is the mixing rate in the general case and support the conjecture by empirical data. On the course we obtain several nice structural results concerning Bruhat order and weak Bruhat order of permutations.

• Type: Conference
• Year: 1997
• Where: SODA
• Authors: Stefan Felsner, Lorenz Wernisch
• Keywords: Algorithms, Bruhat Order, Linear Extensions, Mixing Rate, SODA 1997