Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums

DOI10.1016/J.JCTA.2005.03.005zbMATH Open1083.05007OpenAlexW2117618537WikidataQ105583631 ScholiaQ105583631MaRDI QIDQ817603

Catherine Greenhill, Xiaoji Wang, Brendan D. McKay

Publication date: 16 March 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.03.005

zbMATH Keywords

bipartite graphsasymptotic enumeration0-1 matrices

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Asymptotic enumeration (05A16) Matrices of integers (15B36)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of matchings in random regular graphs and bipartite graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
• The asymptotic number of integer stochastic matrices
• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
• Uniform generation of random regular graphs of moderate degree
• Asymptotics and random matrices with row-sum and column sum-restrictions

Related Items (32)

Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees ⋮ Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices ⋮ Efficient importance sampling for binary contingency tables ⋮ Exact sampling and counting for fixed-margin matrices ⋮ Factorisation of the complete bipartite graph into spanning semiregular factors ⋮ Asymptotic enumeration of digraphs and bipartite graphs by degree sequence ⋮ Cooperation in partly observable networked markets ⋮ On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) ⋮ Factorisation of the complete graph into spanning regular factors ⋮ Ensemble nonequivalence in random graphs with modular structure ⋮ The maximal length of a chain in the Bruhat order for a class of binary matrices ⋮ Structure of eigenvectors of random regular digraphs ⋮ Subgraphs of Dense Random Graphs with Specified Degrees ⋮ Subgraphs of Randomk-Edge-Colouredk-Regular Graphs ⋮ Sampling hypergraphs with given degrees ⋮ Asymptotic enumeration of sparse uniform hypergraphs with given degrees ⋮ Asymptotic enumeration of dense 0-1 matrices with specified line sums ⋮ Characterizing optimal sampling of binary contingency tables via the configuration model ⋮ Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums ⋮ Antichains of \((0, 1)\)-matrices through inversions ⋮ Unnamed Item ⋮ On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries ⋮ ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS ⋮ Exchangeable pairs, switchings, and random regular graphs ⋮ Random dense bipartite graphs and directed graphs with specified degrees ⋮ Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications ⋮ Asymptotic enumeration of linear hypergraphs with given number of vertices and edges ⋮ On the number of linear multipartite hypergraphs with given size ⋮ Asymptotic enumeration of non-uniform linear hypergraphs ⋮ Matrices with prescribed row and column sums ⋮ The probability that a random multigraph is simple. II ⋮ Most binary matrices have no small defining set

This page was built for publication: Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums