Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums

DOI10.1016/j.aam.2008.01.002zbMath1193.05020arXiv0707.0340OpenAlexW2964165395MaRDI QIDQ953898

Catherine Greenhill, Brendan D. McKay

Publication date: 6 November 2008

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

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

zbMATH Keywords

asymptotic enumerationswitchingscontingency tablesnon-negative integer matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Asymptotic enumeration (05A16) Contingency tables (62H17)

Related Items

Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\), On the number of contingency tables and the independence heuristic, Asymptotic enumeration of integer matrices with large equal row and column sums, Lower bounds for contingency tables via Lorentzian polynomials, The maximal length of a chain in the Bruhat order for a class of binary matrices, Regularity in Weighted Graphs: A Symmetric Function Approach, Phase transition in random contingency tables with non-uniform margins, ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS, ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS, Exchangeable pairs, switchings, and random regular graphs, What Does a Random Contingency Table Look Like?, An approximation algorithm for counting contingency tables, Asymptotic enumeration of linear hypergraphs with given number of vertices and edges, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs, 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

• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• The asymptotic number of integer stochastic matrices
• Sampling contingency tables
• Paths in graphs
• Improved bounds for sampling contingency tables
• Combinatorics and commutative algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item