Generating a random linear extension of a partial order
From MaRDI portal
Recommendations
Cited in
(22)- Mixing times of lozenge tiling and card shuffling Markov chains
- On the random generation of monotone data sets
- Rapid mixing and Markov bases
- Reconstruction of partial orders and list representation as random structures
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- On methods for generating random partial orders
- Counting linear extensions
- Random orders and gambler's ruin
- Measurable order and simulation
- Linear extensions of a random partial order
- Sequential importance sampling of binary sequences
- Entropic uniform sampling of linear extensions in series-parallel posets
- Faster random generation of linear extensions
- scientific article; zbMATH DE number 6806844 (Why is no real title available?)
- Fast perfect sampling from linear extensions
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
- Log-concave poset inequalities
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
- Rank tests from partially ordered data using importance and MCMC sampling methods
- Random preorders and alignments
- Effective Poset Inequalities
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)
