Pages that link to "Item:Q805042"
From MaRDI portal
The following pages link to Generating a random linear extension of a partial order (Q805042):
Displaying 21 items.
- Sequential importance sampling of binary sequences (Q746178) (← links)
- On the random generation and counting of weak order extensions of a poset with given class cardinalities (Q867611) (← links)
- Random preorders and alignments (Q960973) (← links)
- On the random generation of monotone data sets (Q963446) (← links)
- On methods for generating random partial orders (Q1085055) (← links)
- Counting linear extensions (Q1183942) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- Linear extensions of random orders (Q1322254) (← links)
- Linear extensions of a random partial order (Q1327606) (← links)
- Mixing times of lozenge tiling and card shuffling Markov chains (Q1431558) (← links)
- Rank tests from partially ordered data using importance and MCMC sampling methods (Q1790345) (← links)
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets (Q2224808) (← links)
- Bottom-up: a new algorithm to generate random linear extensions of a poset (Q2279676) (← links)
- Fast perfect sampling from linear extensions (Q2368931) (← links)
- Random orders and gambler's ruin (Q2571263) (← links)
- Rapid mixing and Markov bases (Q2835838) (← links)
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction (Q3191146) (← links)
- (Q4591356) (← links)
- Reconstruction of Partial Orders and List Representation as Random Structures (Q4982079) (← links)
- Effective Poset Inequalities (Q6046818) (← links)
- Log-concave poset inequalities (Q6601492) (← links)
