arXiv Analytics

Sign in

arXiv:2010.05124 [math.CO]AbstractReferencesReviewsResources

A Note on Asymptotic Enumeration of Contingency Tables with Non-Uniform Margins

Da Wu

Published 2020-10-11Version 1

In this short note, we compute the precise asymptotics for the number of contingency tables with non-uniform margins. More precisely, for parameter $n,\delta, B,C>0$, we consider the set of matrices whose first $[n^\delta]$ rows and columns have sum $[BCn]$ and the rest $n$ rows and columns have sum $[Cn]$. We compute the precise asymptotics of the cardinality of this set when $B<B_c=1+\sqrt{1+1/C}$ using the maximal entropy methods developed by Barvinok and Hartigan.

Comments: 7 pages. Comments are welcome
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1401.7381 [math.CO] (Published 2014-01-29)
Asymptotic enumeration of sparse connected 3-uniform hypergraphs
arXiv:1303.4218 [math.CO] (Published 2013-03-18, updated 2013-09-22)
Asymptotic enumeration of sparse multigraphs with given degrees
arXiv:1010.2516 [math.CO] (Published 2010-10-12, updated 2011-05-25)
Asymptotic enumeration of sparse 2-connected graphs