The asymptotic number of non-negative integer matrices with given row and column sums
From MaRDI portal
Publication:1211987
DOI10.1016/0012-365X(74)90118-6zbMath0293.05009WikidataQ127673602 ScholiaQ127673602MaRDI QIDQ1211987
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumerative combinatorics (05A99)
Related Items
Spectral gap in random bipartite biregular graphs and applications, Almost all regular graphs are hamiltonian, Brunn--Minkowski inequalities for contingency tables and integer flows, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, An extension of the Erdős-Ko-Rado theorem to uniform set partitions, Asymptotic enumeration of integer matrices with large equal row and column sums, Ensemble nonequivalence in random graphs with modular structure, Induced subgraphs in sparse random graphs with given degree sequences, On the enumeration of rectangular (0, 1)-matrices, Control landscapes for observable preparation with open quantum systems, Expansion of random graphs: new proofs, new results, ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, Enumeration and simulation methods for 0-1 matrices with given marginals, Exact tests for the Rasch model via sequential importance sampling, Unnamed Item, Random dense bipartite graphs and directed graphs with specified degrees, An approximation algorithm for counting contingency tables, The asymptotic number of labeled graphs with given degree sequences, Automorphisms of random graphs with specified vertices, Matrices with prescribed row and column sums, Frozen (Δ + 1)-colourings of bounded degree graphs, An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums, Combinatorial analysis. (Matrix problems, choice theory), Random sampling of contingency tables via probabilistic divide-and-conquer
Cites Work
