Asymptotic enumeration of dense 0-1 matrices with specified line sums
From MaRDI portal
Publication:2469197
DOI10.1016/j.jcta.2007.03.009zbMath1132.05005arXivmath/0606496WikidataQ126265267 ScholiaQ126265267MaRDI QIDQ2469197
Brendan D. McKay, Catherine Greenhill, E. Rodney Canfield
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
Related Items
Characterizing optimal sampling of binary contingency tables via the configuration model, The number of graphs and a random graph with a given degree sequence, Exact sampling and counting for fixed-margin matrices, Analysis of local search landscapes for \(k\)-SAT instances, Matrices with prescribed 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, Asymptotic enumeration of integer matrices with large equal row and column sums, Subgraphs of Dense Random Graphs with Specified Degrees, Random dense bipartite graphs and directed graphs with specified degrees
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
