Pages that link to "Item:Q1301730"
From MaRDI portal
The following pages link to Faster random generation of linear extensions (Q1301730):
Displaying 30 items.
- Generating a random linear extension of a partial order (Q805042) (← links)
- On the random generation and counting of weak order extensions of a poset with given class cardinalities (Q867611) (← links)
- On the random generation of monotone data sets (Q963446) (← links)
- Convergence rates of Markov chains for some self-assembly and non-saturated Ising models (Q1008719) (← links)
- On the conductance of order Markov chains (Q1182035) (← links)
- Balanced pairs in partial orders (Q1301727) (← links)
- Fast Gaussian random number generation using linear transformations (Q1377297) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics (Q1755656) (← links)
- Using TPA to count linear extensions (Q1757459) (← links)
- Rank tests from partially ordered data using importance and MCMC sampling methods (Q1790345) (← links)
- Algorithms for computing the Shapley value of cooperative games on lattices (Q1800390) (← links)
- Complexity reduction and approximation of multidomain systems of partially ordered data (Q2143036) (← links)
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets (Q2224808) (← links)
- Combinatorial Markov chains on linear extensions (Q2248568) (← links)
- Bottom-up: a new algorithm to generate random linear extensions of a poset (Q2279676) (← links)
- Fast perfect sampling from linear extensions (Q2368931) (← links)
- On random generation of fuzzy measures (Q2445561) (← links)
- Mixing time for Markov chain on linear extensions (Q2680908) (← links)
- Linear extension diameter of downset lattices of 2-dimensional posets (Q2851481) (← links)
- Spectral Gap for Random-to-Random Shuffling on Linear Extensions (Q2969993) (← links)
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction (Q3191146) (← links)
- Generating Linear Extensions Fast (Q4291563) (← links)
- Deterministic Random Walks for Rapidly Mixing Chains (Q4584953) (← links)
- Sampling biased monotonic surfaces using exponential metrics (Q4987255) (← links)
- Upper Bounds on Mixing Time of Finite Markov Chains (Q5055645) (← links)
- A Sequential Importance Sampling Algorithm for Counting Linear Extensions (Q6039921) (← links)
- Bijecting hidden symmetries for skew staircase shapes (Q6088388) (← links)
- An approximation algorithm for random generation of capacities (Q6615234) (← links)
- Counting Cherry reduction sequences in phylogenetic tree-child networks is counting linear extensions (Q6639832) (← links)
