Copyright © 2004 Elsevier B.V. All rights reserved.
Random generation of 2×2×
×2×J contingency tables
Received 9 October 2002;
revised 9 April 2004;
accepted 9 June 2004.
Communicated by O. Watanabe.
Available online 14 July 2004.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We propose two Markov chains for sampling (m+1)-dimensional contingency tables indexed by 1,2 m× 1,2,…,n . Stationary distributions of our chains are the uniform distribution and a conditional multinomial distribution (which is equivalent to the hypergeometric distribution if m=1). Mixing times of our chains are bounded by , where d is the average of the values in the cells and ε is a given error bound. We use the path coupling method for estimating the mixing times of our chains and showed that our chains mix rapidly.
Keywords: Contingency table; Markov chain Monte Carlo method; Rapidly mixing; Path coupling






E-mail Article
Add to my Quick Links

Cited By in Scopus (1)






