ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 326, Issues 1-3, 20 October 2004, Pages 117-135
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (339 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2004.06.014    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Random generation of 2×2×cdots, three dots, centered×2×J contingency tables

Tomomi Matsuia, Corresponding Author Contact Information, E-mail The Corresponding Author, E-mail The Corresponding Author, Yasuko Matsuib, E-mail The Corresponding Author and Yoko Onoc, E-mail The Corresponding Author

aDepartment of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Bunkyo-ku, Tokyo 113-0033, Japan. bDepartment of Mathematical Sciences, School of Science, Tokai University, Kitakaname, Hiratsuka-shi, Kanagawa 259-1292, Japan. cDepartment of Management Science, Faculty of Engineering, Tokyo University of Science, Shinjuku-ku, Tokyo 162-8601, Japan.

Received 9 October 2002; 
revised 9 April 2004; 
accepted 9 June 2004. 
Communicated by O. Watanabe. 
Available online 14 July 2004.

Purchase the full-text article



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 View the MathML source, 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


Theoretical Computer Science
Volume 326, Issues 1-3, 20 October 2004, Pages 117-135
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.