Generating a random linear extension of a partial order
From MaRDI portal
Publication:805042
DOI10.1214/AOP/1176990349zbMATH Open0728.60009OpenAlexW2058947027MaRDI QIDQ805042FDOQ805042
Authors: N. E. Zubov 
Publication date: 1991
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176990349
Recommendations
Convergence of probability measures (60B10) Partial orders, general (06A06) Sums of independent random variables; random walks (60G50)
Cited In (22)
- Random orders and gambler's ruin
- Random preorders and alignments
- Title not available (Why is that?)
- On methods for generating random partial orders
- Rapid mixing and Markov bases
- On the random generation of monotone data sets
- Entropic uniform sampling of linear extensions in series-parallel posets
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
- Effective Poset Inequalities
- Counting linear extensions
- Fast perfect sampling from linear extensions
- Log-concave poset inequalities
- Linear extensions of a random partial order
- Faster random generation of linear extensions
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- Mixing times of lozenge tiling and card shuffling Markov chains
- Sequential importance sampling of binary sequences
- Rank tests from partially ordered data using importance and MCMC sampling methods
- Reconstruction of partial orders and list representation as random structures
- Measurable order and simulation
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction
This page was built for publication: Generating a random linear extension of a partial order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805042)
