Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes

DOI10.1016/j.aam.2010.01.004zbMath1213.05015arXiv0903.5223OpenAlexW2096896614MaRDI QIDQ984027

J. A. Hartigan, Alexander I. Barvinok

Publication date: 13 July 2010

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

volumeentropypolyhedronpolytopecentral limit theoreminteger pointscontingency tabletransportation polytope

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

Maximum entropy and integer partitions, Independent sets of a given size and structure in the hypercube, Consistency under sampling of exponential random graph models, Probabilistic existence of regular combinatorial structures, Maximum likelihood estimation in the \(\beta\)-model, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), Smoothed counting of 0–1 points in polyhedra, Random graphs with a given degree sequence, Unnamed Item, Random doubly stochastic matrices: the circular law, When the degree sequence is a sufficient statistic, Phase transition in random contingency tables with non-uniform margins, Statistical properties of the single linkage hierarchical clustering estimator, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, The number of graphs and a random graph with a given degree sequence, Matrices with prescribed row and column sums, An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums, Random sampling of contingency tables via probabilistic divide-and-conquer

Cites Work

• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• A polynomial-time algorithm, based on Newton's method, for linear programming
• On the application of symmetric Dirichlet distributions and their mixtures to contingency tables
• Asymptotic enumeration of dense 0-1 matrices with specified line sums
• The many aspects of counting lattice points in polytopes
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• Information Theory and Statistical Mechanics
• Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
• Residue formulae, vector partition functions and lattice points in rational polytopes
• The Complexity of Three-Way Statistical Tables
• Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item