Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
From MaRDI portal
Publication:953898
Abstract: Let svec = (s_1,...,s_m) and vec = (t_1,...,t_n) be vectors of nonnegative integer-valued functions of m,n with equal sum S = sum_{i=1}^m s_i = sum_{j=1}^n t_j. Let M(svec, vec) be the number of m*n matrices with nonnegative integer entries such that the i-th row has row sum s_i and the j-th column has column sum t_j for all i,j. Such matrices occur in many different settings, an important example being the contingency tables (also called frequency tables) important in statistics. Define s=max_i s_i and t=max_j t_j. Previous work has established the asymptotic value of M(svec, vec) as m,n oinfty with s and t bounded (various authors independently, 1971-1974), and when svec, vec are constant vectors with m/n,n/m,s/n >= c/log n for sufficiently large (Canfield and McKay, 2007). In this paper we extend the sparse range to the case st=o(S^(2/3)). The proof in part follows a previous asymptotic enumeration of 0-1 matrices under the same conditions (Greenhill, McKay and Wang, 2006). We also generalise the enumeration to matrices over any subset of the nonnegative integers that includes 0 and 1.
Recommendations
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Asymptotic enumeration of integer matrices with large equal row and column sums
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- Asymptotic enumeration of binary matrices with bounded row and column sums
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of lonesum matrices
- scientific article; zbMATH DE number 969973
Cites work
- scientific article; zbMATH DE number 3878944 (Why is no real title available?)
- scientific article; zbMATH DE number 3435482 (Why is no real title available?)
- scientific article; zbMATH DE number 795108 (Why is no real title available?)
- scientific article; zbMATH DE number 5239164 (Why is no real title available?)
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Combinatorics and commutative algebra
- Improved bounds for sampling contingency tables
- Paths in graphs
- Sampling contingency tables
- Testing for independence in a two-way table: New interpretations of the chi-square statistic
- The asymptotic number of integer stochastic matrices
Cited in
(22)- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
- ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS
- Matrices with prescribed row and column sums
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Asymptotic enumeration of integer matrices with large equal row and column sums
- What does a random contingency table look like?
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- On the number of contingency tables and the independence heuristic
- Regularity in weighted graphs a symmetric function approach
- Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
- Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons
- Chains and antichains in the Bruhat order for classes of \((0,1)\)-matrices
- An approximation algorithm for counting contingency tables
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- Lower bounds for contingency tables via Lorentzian polynomials
- scientific article; zbMATH DE number 969973 (Why is no real title available?)
- scientific article; zbMATH DE number 3999936 (Why is no real title available?)
- Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
- Exchangeable pairs, switchings, and random regular graphs
- Phase transition in random contingency tables with non-uniform margins
- Random sampling of contingency tables via probabilistic divide-and-conquer
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
This page was built for publication: Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953898)
