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. Th
โฆ LIBER โฆ
Sampling Binary Contingency Tables
โ Scribed by Bezakova, I.
- Book ID
- 119807070
- Publisher
- American Institute of Physics
- Year
- 2008
- Tongue
- English
- Weight
- 357 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1521-9615
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Sampling contingency tables
โ
Martin Dyer; Ravi Kannan; John Mount
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 231 KB
Negative Examples for Sequential Importa
โ
Ivona Bezรกkovรก,Alistair Sinclair,Daniel
๐
Article
๐
2011
๐
Springer
๐
English
โ 497 KB
Characterizing optimal sampling of binar
โ
Jose Blanchet; Alexandre Stauffer
๐
Article
๐
2012
๐
John Wiley and Sons
๐
English
โ 261 KB
A Note on Binary Contingency Tables
โ
Dr. Graham J. G. Upton
๐
Article
๐
1985
๐
John Wiley and Sons
๐
English
โ 127 KB
๐ 1 views
This paper considers contingency tables in which the marginal frequencies for one variable are all I. This could occur with two-category binary data or when a continuous variable is treated in categorical fashion. Some results concerning the expectation of goodneea-of-fit statistics are reported. In
Analysis of Contingency Tables Under Clu
โ
Stephen S. Brier
๐
Article
๐
1980
๐
Oxford University Press
๐
English
โ 596 KB
Bayesian methods for contingency tables
โ
Paul E. Green; Taesung Park
๐
Article
๐
2004
๐
Springer-Verlag
๐
English
โ 555 KB