Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
Publication:817603
DOI10.1016/J.JCTA.2005.03.005zbMATH Open1083.05007OpenAlexW2117618537WikidataQ105583631 ScholiaQ105583631MaRDI QIDQ817603FDOQ817603
Catherine Greenhill, Brendan D. McKay, Xiaoji Wang
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial probability (60C05) Matrices of integers (15B36) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- 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
- The number of matchings in random regular graphs and bipartite graphs
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- The asymptotic number of integer stochastic matrices
Cited In (33)
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
- Structure of eigenvectors of random regular digraphs
- Subgraphs of Dense Random Graphs with Specified Degrees
- Exact sampling and counting for fixed-margin matrices
- Antichains of \((0, 1)\)-matrices through inversions
- Asymptotic enumeration of integer matrices with large equal row and column sums
- 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
- Characterizing optimal sampling of binary contingency tables via the configuration model
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Exchangeable pairs, switchings, and random regular graphs
- Factorisation of the complete bipartite graph into spanning semiregular factors
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
- Asymptotic enumeration of sparse uniform hypergraphs with given degrees
- Subgraphs of Randomk-Edge-Colouredk-Regular Graphs
- Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
- Ensemble nonequivalence in random graphs with modular structure
- Title not available (Why is that?)
- Matrices with prescribed row and column sums
- On the number of linear multipartite hypergraphs with given size
- Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- Efficient importance sampling for binary contingency tables
- Most binary matrices have no small defining set
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS
- Factorisation of the complete graph into spanning regular factors
- Asymptotic enumeration of non-uniform linear hypergraphs
- Cooperation in partly observable networked markets
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- The probability that a random multigraph is simple. II
- Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
- Sampling hypergraphs with given degrees
This page was built for publication: Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817603)
