Lower bounds for contingency tables via Lorentzian polynomials

DOI10.1007/s11856-022-2364-9OpenAlexW4307157081MaRDI QIDQ2698417

Petter Brändén, Jonathan Leake, Igor Pak

Publication date: 24 April 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Bayesian inference (62F15) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Contingency tables (62H17)

Related Items

Stellahedral geometry of matroids, Tautological classes of matroids, On the number of contingency tables and the independence heuristic, Signed permutohedra, delta‐matroids, and beyond

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practical volume algorithm
• Exact sampling and counting for fixed-margin matrices
• Combinatorics and complexity of partition functions
• 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)
• Brunn--Minkowski inequalities for contingency tables and integer flows
• Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
• Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
• A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor
• Kostant partitions functions and flow polytopes
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• On the application of symmetric Dirichlet distributions and their mixtures to contingency tables
• The Ehrhart polynomial of the Birkhoff polytope
• Counting integer flows in networks
• Algebraic algorithms for sampling from conditional distributions
• Asymptotic enumeration of integer matrices with large equal row and column sums
• Four questions on Birkhoff polytopes
• A faster FPTAS for counting two-rowed contingency tables
• A generalization of permanent inequalities and applications in counting and optimization
• Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
• Bounds on Kronecker coefficients via contingency tables
• Lorentzian polynomials
• Volumes and Ehrhart polynomials of flow polytopes
• An algebraic identity and the Jacobi-Trudi formula
• Counting integer points in higher-dimensional polytopes
• Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• Unimodality, log-concavity, real-rootedness and beyond
• An approximation algorithm for counting contingency tables
• Multivariate stable polynomials: theory and applications
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Combinatorics and Geometry of Transportation Polytopes: An Update
• The asymptotic volume of the Birkhoff polytope
• Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
• On multivariate Newton-like inequalities
• Counting the Number of r × c Contingency Tables with Fixed Margins
• Sampling contingency tables
• Practical Polytope Volume Approximation
• The Complexity of Three-Way Statistical Tables
• The number of graphs and a random graph with a given degree sequence
• What Does a Random Contingency Table Look Like?
• On the Volume of the Polytope of Doubly Stochastic Matrices
• Algorithms for Convex Optimization
• ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE
• Phase transition in random contingency tables with non-uniform margins
• Contingency Table Analysis
• A combinatorial model for computing volumes of flow polytopes
• Statistical Analysis of Contingency Tables
• Approximately Counting Integral Flows and Cell-Bounded Contingency Tables
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Asymptotic Enumeration of Hypergraphs by Degree Sequence
• Counting matchings via capacity-preserving operators
• On the number of contingency tables and the independence heuristic