Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
From MaRDI portal
Publication:623726
DOI10.1007/s13160-010-0002-0zbMath1204.60068OpenAlexW2078147999MaRDI QIDQ623726
Naoyuki Kamatani, Mitsuo Motoki, Shuji Kijima, Tomomi Matsui
Publication date: 8 February 2011
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-010-0002-0
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables
- An interruptible algorithm for perfect sampling via Markov chains
- Markov chain Monte Carlo and models of consideration set and parameter heterogeneity
- Polynomial-time counting and sampling of two-rowed contingency tables
- Polynomial time perfect sampling algorithm for two-rowed contingency tables
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Biological Sequence Analysis
- A Guide to Exact Simulation
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- How to couple from the past using a read-once source of randomness
- Algorithms and Computation
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Quasi-equilibrium theory for the distribution of rare alleles in a subdivided population: Justification and implications
This page was built for publication: Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
