Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
From MaRDI portal
(Redirected from Publication:623726)
Recommendations
- Algorithms and Computation
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
- \(L _{ \infty }\)-discrepancy analysis of polynomial-time deterministic samplers emulating rapidly mixing chains
- Practical perfect sampling using composite bounding chains: the Dirichlet-multinomial model
- Exact sampling with coupled Markov chains and applications to statistical mechanics
Cites work
- scientific article; zbMATH DE number 1566488 (Why is no real title available?)
- scientific article; zbMATH DE number 1631958 (Why is no real title available?)
- scientific article; zbMATH DE number 1545677 (Why is no real title available?)
- A Guide to Exact Simulation
- Algorithms and Computation
- An interruptible algorithm for perfect sampling via Markov chains
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Biological Sequence Analysis
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- How to couple from the past using a read-once source of randomness
- Markov chain Monte Carlo and models of consideration set and parameter heterogeneity
- Polynomial time perfect sampling algorithm for two-rowed contingency tables
- Polynomial-time counting and sampling of two-rowed contingency tables
- Quasi-equilibrium theory for the distribution of rare alleles in a subdivided population: Justification and implications
- Random generation of 2 2 2 J contingency tables
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
Cited in
(7)- Algorithms and Computation
- Practical perfect sampling using composite bounding chains: the Dirichlet-multinomial model
- Exact sublinear binomial sampling
- \(L _{ \infty }\)-discrepancy analysis of polynomial-time deterministic samplers emulating rapidly mixing chains
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
- Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex
- Exact Sublinear Binomial Sampling
This page was built for publication: Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623726)
