An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
By Alexander I. Barvinok, John Hartigan. 2009
52 citations recorded by the source corpus.
We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of matrices within a relative error which approaches 0 as m and n grow.
Subfields: Discrete Mathematics and Combinatorics, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/8c94dacc325b3e1d9b55d08edc4b3c552dc404c3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
- Sourav Chatterjee
- Persi Diaconis
- Allan Sly
- Nathan Ross
- Lee H. Dicker
- Ronen Eldan
- Amir Dembo
- Nathaniel Thiem
In Statistics and Probability
- Sourav Chatterjee
- Persi Diaconis
- Allan Sly
- Nathan Ross
- Elizabeth Meckes
- Victor Chernozhukov
- Giovanni Peccati
- Martin J. Wainwright
Citations in the corpus
- Random graphs with a given degree sequence (2010, background): “By Sourav Chatterjee1, Persi Diaconis and Allan Sly”