Phase transition in random contingency tables with non-uniform margins

DOI10.1090/TRAN/8094zbMath1459.62090arXiv1903.08743OpenAlexW3013951715MaRDI QIDQ5147423

Hanbaek Lyu, Samuel J. Dittmer, Igor Pak

Publication date: 26 January 2021

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

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

zbMATH Keywords

strong law of large numberslimiting distributionrandom contingency tables

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Strong limit theorems (60F15) Algebraic properties of function spaces in general topology (54C40) Contingency tables (62H17)

Related Items (6)

Statistical enumeration of groups by double cosets ⋮ Bounds on Kronecker coefficients via contingency tables ⋮ Asymptotic properties of random contingency tables with uniform margin ⋮ On the number of contingency tables and the independence heuristic ⋮ Lower bounds for contingency tables via Lorentzian polynomials ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practical volume algorithm
• Matrices with prescribed row and column sums
• 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
• 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 labeled graphs with given degree sequences
• The Ehrhart polynomial of the Birkhoff polytope
• Algebraic algorithms for sampling from conditional distributions
• Asymptotic enumeration of integer matrices with large equal row and column sums
• Four questions on Birkhoff polytopes
• An approximation algorithm for counting contingency tables
• 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
• The cutoff phenomenon in finite Markov chains.
• The number of graphs and a random graph with a given degree sequence
• What Does a Random Contingency Table Look Like?
• ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE
• Contingency Table Analysis
• Statistical Analysis of Contingency Tables
• Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables

This page was built for publication: Phase transition in random contingency tables with non-uniform margins