Asymptotic enumeration of dense 0-1 matrices with specified line sums

DOI10.1016/j.jcta.2007.03.009zbMath1132.05005arXivmath/0606496OpenAlexW2034302725WikidataQ126265267 ScholiaQ126265267MaRDI QIDQ2469197

E. Rodney Canfield, Catherine Greenhill, Brendan D. McKay

Publication date: 4 February 2008

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

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

zbMATH Keywords

bipartite graphasymptotic enumerationrandom matrixsaddle-point method0-1 matrix

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items

Sandwiching biregular random graphs, Degree sequences of sufficiently dense random uniform hypergraphs, Exact sampling and counting for fixed-margin matrices, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), Friendly bisections of random graphs, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, Global eigenvalue fluctuations of random biregular bipartite graphs, Analysis of local search landscapes for \(k\)-SAT instances, Asymptotic enumeration of integer matrices with large equal row and column sums, Spatiotemporal Conditional Inference and Hypothesis Tests for Neural Ensemble Spiking Precision, Subgraphs of Dense Random Graphs with Specified Degrees, Characterizing optimal sampling of binary contingency tables via the configuration model, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, The number of graphs and a random graph with a given degree sequence, Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes, Random dense bipartite graphs and directed graphs with specified degrees, Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence, Majorization and the number of bipartite graphs for given vertex degrees, Matrices with prescribed row and column sums, Most binary matrices have no small defining set

Cites Work

• Unnamed Item
• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
• Asymptotic enumeration by degree sequence of graphs of high degree
• Asymptotic enumeration of tournaments with a given score sequence
• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
• Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
• Two-dimensional weight-constrained codes through enumeration bounds
• Probability Inequalities for Sums of Bounded Random Variables