A genuinely polynomial-time algorithm for sampling two-rowed contingency tables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 339-350

  Dyer, Martin ^a   Greenhill, Catherine ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MARKOV PROCESSES; MIXING;

CONTINGENCY TABLE; MIXING TIME; PATH COUPLING; POLYNOMIAL-TIME ALGORITHMS; RAPID MIXING; RAPIDLY MIXING;

POLYNOMIAL APPROXIMATION;

EID: 84878606501     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055065     Document Type: Conference Paper

References (15)

1. Albert, J.H., Gupta, A.K.: Estimation in contingency tables using prior information. J. Hoy. Statist. Soc. Ser. B 45 (1083) 60-69.
2. Aldons, D.: Random walks on finite groups and rapidly mixing Markov chains. In: Dold, A., Eckmann, M. (eds.): Séminaire de Probabilités XVII 1981/1982. Lecture Notes in Mathematics, Vol. 986. Springer-Verlag, New York (1983) 243-297.
3. Barlow, R.: Statistics. John Wiley and Sons, Chichester (1989).
4. Bubley, R., Dyer, M.: Path coupling: A technique for proving rapid mixing in Markov chains. In: 38th Annual Symposium on Foundations of Computer Science, IEEE, Miami Beach, Florida (1997) 223-231.
5. Bubley, R., Dyer, M., Greenhill, C., Beating the 2δ bound for approximately counting colourings: A computer-assisted proof of rapid mixing. In: 9th Annual Symposium on Discrete Algorithms, ACM-SIAM, San Francisco, California (1998) 355-363.
6. Chung, F.R.K., Graham, R.L., Yau, S.T.: On sampling with Markov chains. Random Structures Algorithms 9 (1996) 55-77.
7. Diaconis, P., Effron, B.: Testing for independence in a two-way table: new inter-pretations of the chi-square statistic (with discussion). Ann. Statist. 13 (1985) 845-913.
8. Diaconis, P., Gangolli, A.: Rectangular arrays with fixed margins. In Aldous, D., Varaiya, P.P., Spencer, J., Steele, J.M. (eds.): Discrete Probability and Algorithms. IMA Volumes on Mathematics and its Applications, Vol. 72. Springer-Verlag, New York (1995) 15-41.
9. Diaconis, P., and Saloff-Coste, L.: Random walk on contingency tables with fixed row and column sums. Tech. rep., Department of Mathematics, Harvard University (1995).
10. Dyer, M., Greenhill, C.: A more rapidly mixing Markov chain for graph colourings. Preprint (1997).
11. Dyer, M., Kannan, R., Mount, J.: Sampling contingency tables. Random Structures Algorithms 10 (1997) 487-506.
12. Hernek, D.: Random generation and counting of rectangular arrays with fixed margins. Preprint (1997).
13. Jerrum, M., Sinclair, A.: The Markov chain Monte Carlo method: an approach to approximate counting and integration. In Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston (1996) 432-520.
14. Kannan, R., Tetali, P., Vempala, S.: Simple Markov chain algorithms for generating bipartite graphs and tournaments. In: 8th Annual Symposium on Discrete Algorithms. ACM-SIAM, San Francisco, California (1997) 193-200.
15. Kaufmann, A.: Graphs, Dynamic Programming and finite games. Academic Press, New York (1967).