Abstract
In this paper, we propose a perfect (exact) sampling algorithm according to a discretized Dirichlet distribution. The Dirichlet distribution appears as prior and posterior distribution for the multinomial distribution in many statistical methods in bioinformatics. Our algorithm is a monotone coupling from the past algorithm, which is a Las Vegas type randomized algorithm. We propose a new Markov chain whose limit distribution is a discretized Dirichlet distribution. Our algorithm simulates transitions of the chain O(n 3 lnΔ) times where n is the dimension (the number of parameters) and 1/Δ is the grid size for discretization. Thus the obtained bound does not depend on the magnitudes of parameters. In each transition, we need to sample a random variable according to a discretized beta distribution (2-dimensional Dirichlet distribution). To show the polynomiality, we employ the path coupling method carefully and show that our chain is rapidly mixing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bubley, R. and Dyer, M. (1997) Path coupling: A technique for proving rapid mixing in Markov chains, 38th Annual Symposium on Foundations of Computer Science, IEEE, San Alimitos, 223–231.
Bubley, R. (2001) Randomized Algorithms: Approximation, Generation, and Counting, Springer-Verlag, New York.
Burr, T.L. (2000) Quasi-equilibrium theory for the distribution of rare alleles in a subdivided population: justification and implications, Ther. Popul. Biol., 57 297–306.
Burr, D., Doss, H., Cooke, G.E. and Goldschmidt-Clermont, P.J. (2003) A metaanalysis of studies on the association of the platelet PlA polymorphism of glycoprotein IIIa and risk of coronary heart disease, Stat. Med., 22 1741–1760.
Dimakos, X.K. (2001) A guide to exact simulation, International Statistical Review, 69 27–48.
Durbin, R., Eddy, R., Krogh, A. and Mitchison, G. (1998) Biological sequence analysis: probabilistic models of proteins and nucleic acids, Cambridge Univ. Press.
Graham, J., Curran, J. and Weir, B.S. (2000) Conditional genotypic probabilities for microsatellite loci, Genetics, 155 1973–1980.
Kijima, S. and Matsui, T. Polynomial time perfect sampling algorithm for two-rowed contingency tables, Random Structures and Algorithms (to appear).
Kitada, S., Hayashi, T. and Kishino, H. (2000) Empirical Bayes procedure for estimating genetic distance between populations and effective population size, Genetics, 156 2063–2079.
Laval, G., SanCristobal, M. and Chevalet C. (2003) Maximum-likelihood and Markov chain Monte Carlo approaches to estimate inbreeding and effective size form allele frequency changes, Genetics, 164 1189–1204.
Matsui, T., Motoki, M. and Kamatani, N. (2003) Polynomial time approximate sampler for discretized Dirichlet distribution, 14th ISAAC 2003, Kyoto, Japan, LNCS, Springer-Verlag, 2906 676–685.
Matsui, T., Motoki, M. and Kamatani, N. (2003) Polynomial time approximate sampler for discretized Dirichlet distribution, METR 2003-10, Mathematical Engineering Technical Reports, University of Tokyo (available from http://www.keisu.t.u-tokyo.ac.jp/Research/techrep.0.html)
Niu, T., Qin, Z.S., Xu, X. and Liu, J.S. (2002) Bayesian haplotype inference for multiple linked single-nucleotide polymorphisms, Am. J. Hum. Genet., 70 157–169.
Pritchard, J.K., Stephens, M. and Donnely, P. (2000) Inference of population structure using multilocus genotype data, Genetics, 155 945–959.
Propp, J. and Wilson, D. (1996) Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures and Algorithms, 9 232–252.
Propp, J. and Wilson, D. (1998) How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph, J. Algorithms, 27 170–217.
Robert, C.P. (2001) The Bayesian Choice, Springer-Verlag, New York.
Wilson, D. (2000) How to couple from the past using a read-once source of randomness, Random Structures and Algorithms, 16 85–113.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer
About this paper
Cite this paper
Matsui, T., Kijima, S. (2008). Polynomial Time Perfect Sampler for Discretized Dirichlet Distribution. In: Tsubaki, H., Yamada, S., Nishina, K. (eds) The Grammar of Technology Development. Springer, Tokyo. https://doi.org/10.1007/978-4-431-75232-5_13
Download citation
DOI: https://doi.org/10.1007/978-4-431-75232-5_13
Received:
Accepted:
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-75231-8
Online ISBN: 978-4-431-75232-5
eBook Packages: EngineeringEngineering (R0)