An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums

DOI10.1090/S0002-9947-2012-05585-1zbMath1269.05006arXiv0910.2477OpenAlexW2964236213MaRDI QIDQ2841356

J. A. Hartigan, Alexander I. Barvinok

Publication date: 25 July 2013

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.2477

zbMATH Keywords

contingency tables

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computational aspects related to convexity (52B55) Asymptotic enumeration (05A16)

Related Items

Independent sets of a given size and structure in the hypercube, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Probabilistic existence of regular combinatorial structures, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), On combinatorial rectangles with minimum ∞−discrepancy, Threshold functions for small subgraphs in simple graphs and multigraphs, Asymptotic Enumeration of Difference Matrices over Cyclic Groups, On the number of contingency tables and the independence heuristic, Lower bounds for contingency tables via Lorentzian polynomials, Random graphs with a given degree sequence, Unnamed Item, Random doubly stochastic matrices: the circular law, When the degree sequence is a sufficient statistic, Testing goodness of fit of random graph models, Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes, Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence, Random sampling of contingency tables via probabilistic divide-and-conquer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The enumeration of arrays and a generalization related to contingency tables
• Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
• Matrix integrals and map enumeration: an accessible introduction
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• The asymptotic number of non-negative integer matrices with given row and column sums
• Computing mixed discriminants, mixed volumes, and permanents
• Automorphisms of the extended affine root system and modular property for the flat theta invariants
• Asymptotic enumeration of integer matrices with large equal row and column sums
• An approximation algorithm for counting contingency tables
• Reverse Holder Inequalities for Spherical Harmonics
• Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
• Sampling contingency tables
• Improved bounds for sampling contingency tables
• The number of graphs and a random graph with a given degree sequence
• What Does a Random Contingency Table Look Like?
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant