Improved Bounds for Sampling Contingency Tables

Random Structures and Algorithms

Volumn 21, Issue 2, 2002, Pages 135-146

  Morris, Ben J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036355796     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10049     Document Type: Article

References (11)

1. P. Diaconis and B. Efron, Testing for independence in a two-way table: new interpretations of the chi-squared statistic, Ann Stat 13 (1985), 845-913.
2. M. E. Dyer, A. M. Frieze, and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, J ACM 38 (1991), 1-17.
3. M. Dyer and C. Greenhill, Polynomial-time counting and sampling of two-rowed contingency tables, Theoret Comput Sci 246 (2000), 265-278.
4. M. E. Dyer, R. Kannan, and J. Mount, Sampling contingency tables, Random Struct Alg 10 (1997), 487-506.
5. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Am Stat Assoc 58 (1963), 13-30.
6. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret Comput Sci 43 (1986), 169-188.
7. 5) volume algorithm for convex bodies, Random Struct Alg 11 (1997), 1-50.
8. R. Kannan and S. Vempala, Sampling lattice points, Proc ACM Symp Theory Comput, 1997, 696-700.
9. L. Lovász, Hit and run mixes fast, Math Program 86 (1999), 443-461.
10. L. Lovász and R. Kannan, Faster mixing via average conductance, Proc ACM Symp Theory Comput, 1999, 282-287.
11. A. J. Sinclair, Randomised algorithms for counting and generating combinatorial structures, Advances in Theoretical Computer Science, Birkhäuser, Boston, 1993.