In this manuscript we show that the above described Markov chain has the required monotonicity in the special case of two-dimensional orders. We report on ...
We study the generation of uniformly distributed linear extensions using Markou chains. In particu- lar we show that monotone coupling from the past.
Markov chains for linear extensions, the two-dimensional case. Authors: Stefan Felsner.
Abstract. We investigate almost uniform sampling from the set of linear extensions of a given partial order. The most efficient schemes stem from Markov ...
Sep 10, 2013 · In one case, the stationary state is uniform, that is, every linear extension is equally likely to occur (see Theorem 4.3). In the other case, ...
May 31, 2012 · By assigning weights to the edges of the graph in two different ways, we study two Markov chains, both of which are irreducible. The ...
Missing: Dimensional | Show results with:Dimensional
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 coupling. We show that ...
Markov chains for linear extensions, the two-dimensional case. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (1997). p. 239–247.
By assigning weights to the edges of the graph in two different ways, we study two Markov chains, both of which are irreducible. The stationary state of one ...
Missing: Dimensional | Show results with:Dimensional
We show that the transition matrix of the Markov chain has eigenvalues that are linear in the transition probabilities in the case when P is a union of ordinal ...