Premium
Sampling contingency tables
Author(s) -
Dyer Martin,
Kannan Ravi,
Mount John
Publication year - 1997
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/(sici)1098-2418(199707)10:4<487::aid-rsa4>3.0.co;2-q
Subject(s) - contingency table , mathematics , column (typography) , combinatorics , sampling (signal processing) , set (abstract data type) , statistics , discrete mathematics , computer science , geometry , connection (principal bundle) , filter (signal processing) , computer vision , programming language
We give polynomial time algorithms for random sampling from a set of contingency tables, which is the set of m × n matrices with given row and column sums, provided the row and column sums are sufficiently large with respect to m , n . We use this to approximately count the number of such matrices. These problems are of interest in Statistics and Combinatorics. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 10 , 487–506, 1997