Random generation of 2 × n contingency tables

Random Structures and Algorithms

Volumn 13, Issue 1, 1998, Pages 71-79

  Hernek, Diane ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039494816     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199808)13:1<71::AID-RSA4>3.0.CO;2-P     Document Type: Article

References (8)

1. D. Aldous, Random walks on finite groups and rapidly mixing Markov chains, in Séminaire de Probabilités XVII, Springer Lecture Notes in Mathematics, A. Dold and B. Eckmann, Eds., 1982, pp. 243-297.
2. G. K. Bhattacharyya and R. A. Johnson, Statistical Concepts and Methods, John Wiley & Sons, New York, 1977.
3. P. Diaconis and B. Effron, Testing for independent in a two-way table: new interpretations of the chi-square statistic (with discussion), Ann. Statist. 13, 845-913 (1985).
4. P. Diaconis and A. Gangolli, Rectangular arrays with fixed margins, in Discrete Probability and Algorithms, D. Aldous, P. Diaconis, J. Spencer, and J. M. Steele, Eds., Springer-Verlag, Berlin/New York, 1995, pp. 15-41.
5. P. Diaconis and L. Saloff-Coste, Nash inequalities for Markov chains, J. of Theoret. Probab. 9(2), 459-510 (1996).
6. P. Diaconis and L. Saloff-Coste, Random walk on contingency tables with fixed row and column sums, unpublished manuscript.
7. R. Durrett, Probability: Theory and Examples, Duxbury Press, Belmont, California, 1996.
8. M. Dyer, R. Kannan, and J. Mount, Sampling contingency tables, Random Structures and Algorithms, 10(4), 487-506 (1997).