TY - JOUR
T1 - Sequential Monte Carlo methods for statistical analysis of tables
AU - Chen, Yuguo
AU - Diaconis, Persi
AU - Holmes, Susan P.
AU - Liu, Jun S.
N1 - Funding Information:
Yuguo Chen is Assistant Professor, Institute of Statistics and Decision Sciences, Duke University, Durham, NC 27708 (E-mail: [email protected]). Persi Diaconis is Mary V. Sunseri Professor and Susan P. Holmes is Associate Professor (E-mail: [email protected]), Department of Statistics, Stanford University, Stanford, CA 94305. Jun S. Liu is Professor, Department of Statistics and Department of Biostatistics, Harvard University, Cambridge, MA 02138 (E-mail: [email protected]). This work was supported in part by National Science Foundation grants DMS-02-03762, DMS-02-04674, and DMS-02-44638. The authors thank Arnab Chakraborty, Dylan Small, Charles Stein, the associate editor, and two referees for helpful discussions and valuable suggestions.
PY - 2005/3
Y1 - 2005/3
N2 - We describe a sequential importance sampling (SIS) procedure for analyzing two-way zero-one or contingency tables with fixed marginal sums. An essential feature of the new method is that it samples the columns of the table progressively according to certain special distributions. Our method produces Monte Carlo samples that are remarkably close to the uniform distribution, enabling one to approximate closely the null distributions of various test statistics about these tables. Our method compares favorably with other existing Monte Carlo-based algorithms, and sometimes is a few orders of magnitude more efficient. In particular, compared with Markov chain Monte Carlo (MCMC)-based approaches, our importance sampling method not only is more efficient in terms of absolute running time and frees one from pondering over the mixing issue, but also provides an easy and accurate estimate of the total number of tables with fixed marginal sums, which is far more difficult for an MCMC method to achieve.
AB - We describe a sequential importance sampling (SIS) procedure for analyzing two-way zero-one or contingency tables with fixed marginal sums. An essential feature of the new method is that it samples the columns of the table progressively according to certain special distributions. Our method produces Monte Carlo samples that are remarkably close to the uniform distribution, enabling one to approximate closely the null distributions of various test statistics about these tables. Our method compares favorably with other existing Monte Carlo-based algorithms, and sometimes is a few orders of magnitude more efficient. In particular, compared with Markov chain Monte Carlo (MCMC)-based approaches, our importance sampling method not only is more efficient in terms of absolute running time and frees one from pondering over the mixing issue, but also provides an easy and accurate estimate of the total number of tables with fixed marginal sums, which is far more difficult for an MCMC method to achieve.
KW - Conditional inference
KW - Contingency table
KW - Counting problem
KW - Exact test
KW - Sequential importance sampling
KW - Zero-one table
UR - http://www.scopus.com/inward/record.url?scp=14944358428&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=14944358428&partnerID=8YFLogxK
U2 - 10.1198/016214504000001303
DO - 10.1198/016214504000001303
M3 - Article
AN - SCOPUS:14944358428
SN - 0162-1459
VL - 100
SP - 109
EP - 120
JO - Journal of the American Statistical Association
JF - Journal of the American Statistical Association
IS - 469
ER -