What does a random contingency table look like?
From MaRDI portal
Abstract: Let R=(r_1, ..., r_m) and C=(c_1, ..., c_n) be positive integer vectors such that r_1 +... + r_m=c_1 +... + c_n. We consider the set Sigma(R, C) of non-negative mxn integer matrices (contingency tables) with row sums R and column sums C as a finite probability space with the uniform measure. We prove that a random table D in Sigma(R,C) is close with high probability to a particular matrix ("typical table) Z defined as follows. We let g(x)=(x+1) ln(x+1)-x ln x for non-negative x and let g(X)=sum_ij g(x_ij) for a non-negative matrix X=(x_ij). Then g(X) is strictly concave and attains its maximum on the polytope of non-negative mxn matrices X with row sums R and column sums C at a unique point, which we call the typical table Z.
Recommendations
- Matrices with prescribed row and column sums
- Random generation of 2�n contingency tables
- Enumerating Contingency Tables via Random Permanents
- Improved bounds for sampling contingency tables
- Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
Cites work
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- Asymptotics and random matrices with row-sum and column sum-restrictions
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
- Sampling contingency tables
- Testing for independence in a two-way table: New interpretations of the chi-square statistic
- The concentration of measure phenomenon
Cited in
(21)- On uniform marginal representation of contingency tables
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- Statistical enumeration of groups by double cosets
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
- False discovery variance reduction in large scale simultaneous hypothesis tests
- Lower bounds for contingency tables via Lorentzian polynomials
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- Characterizing optimal sampling of binary contingency tables via the configuration model
- Characterization of the maximum probability fixed marginals \(r \times c\) contingency tables
- Phase transition in random contingency tables with non-uniform margins
- Asymptotic properties of random contingency tables with uniform margin
- On properties of random binary contingency tables with non-uniform margin
- On the number of contingency tables and the independence heuristic
- Random graphs with a given degree sequence
- Random transpositions on contingency tables
- Capacity bounds on integral flows and the Kostant partition function
- Improved estimates for the number of non-negative integer matrices with given row and column sums
- New directions in algebraic statistics: three challenges from 2023
- Matrices with prescribed row and column sums
- Random sampling of contingency tables via probabilistic divide-and-conquer
- Contingency tables with variable margins (with an appendix by Pavel Etingof)
This page was built for publication: What does a random contingency table look like?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933598)
