SAMPLING CONTINGENCY-TABLES

Authors
DYER M KANNAN R MOUNT J
Citation
M. Dyer et al., SAMPLING CONTINGENCY-TABLES, Random structures & algorithms, 10(4), 1997, pp. 487-506
Citations number
27
Categorie Soggetti
Mathematics,Mathematics,Mathematics,"Computer Science Software Graphycs Programming
Journal title
Random structures & algorithms → ACNP
ISSN journal
10429832
Volume
10
Issue
4
Year of publication
1997
Pages
487 - 506
Database
ISI
SICI code
1042-9832(1997)10:4<487:SC>2.0.ZU;2-T
Abstract
We give polynomial time algorithms for random sampling from a set of c ontingency tables, which is the set of m x n matrices with given row a nd column sums, provided the row and column sums are sufficiently larg e with respect to m, n. We use this to approximately count the number of such matrices. These problems are of interest in Statistics and Com binatorics. (C) 1997 John Wiley & Sons, Inc.