Random posets, lattices, and lattices terms
Jaroslav Ježek, Václav Slavík (2000)
Mathematica Bohemica
Similarity:
Algorithms for generating random posets, random lattices and random lattice terms are given.
Displaying similar documents to “Generating random elements of finite distributive lattices.”
Random posets, lattices, and lattices terms
Directed animals and gas models revisited.
Le Borgne, Yvan, Marckert, Jean-François (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random walks on trees and matchings.
Diaconis, Persi, Holmes Susan (2002)
Electronic Journal of Probability [electronic only]
Similarity:
Lattice paths, sampling without replacement, and limiting distributions.
Kuba, M., Panholzer, A., Prodinger, H. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dynamical properties of the automorphism groups of the random poset and random distributive lattice
Alexander S. Kechris, Miodrag Sokić (2012)
Fundamenta Mathematicae
Similarity:
A method is developed for proving non-amenability of certain automorphism groups of countable structures and is used to show that the automorphism groups of the random poset and random distributive lattice are not amenable. The universal minimal flow of the automorphism group of the random distributive lattice is computed as a canonical space of linear orderings but it is also shown that the class of finite distributive lattices does not admit hereditary order expansions with the Amalgamation...
Perfect simulation of Vervaat perpetuities.
Fill, James Allen, Huber, Mark L. (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Random even graphs.
Grimmett, Geoffrey, Janson, Svante (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hit and run as a unifying device
Hans C. Andersen, Persi Diaconis (2007)
Journal de la société française de statistique
Similarity:
We present a generalization of hit and run algorithms for Markov chain Monte Carlo problems that is ‘equivalent’ to data augmentation and auxiliary variables. These algorithms contain the Gibbs sampler and Swendsen-Wang block spin dynamics as special cases. The unification allows theorems, examples, and heuristics developed in one domain to illuminate parallel domains.