On the number of contingency tables and the independence heuristic
Hanbaek Lyu, Igor Pak

TL;DR
This paper provides precise asymptotic estimates for the number of large contingency tables with specified margins, revealing a phase transition and highlighting limitations of the independence heuristic in certain regimes.
Contribution
It introduces sharp asymptotic formulas for contingency tables with linear margins and identifies a phase transition point affecting heuristic accuracy.
Findings
A second order phase transition at B_c = 1 + sqrt(1 + 1/C)
The independence heuristic undercounts tables for B > B_c
Asymptotic estimates depend on the ratio of margins and reveal critical behavior.
Abstract
We obtain sharp asymptotic estimates on the number of contingency tables with two linear margins and . The results imply a second order phase transition on the number of such contingency tables, with a critical value at \ts . As a consequence, for \ts , we prove that the classical \emph{independence heuristic} leads to a large undercounting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Topological and Geometric Data Analysis · Commutative Algebra and Its Applications
