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.05009MaRDI QIDQ1211987
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05A99: Enumerative combinatorics
Related Items
Almost all regular graphs are hamiltonian, On the enumeration of rectangular (0, 1)-matrices, ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS, Induced subgraphs in sparse random graphs with given degree sequences, Expansion of random graphs: new proofs, new results, Automorphisms of random graphs with specified vertices, Matrices with prescribed row and column sums, Brunn--Minkowski inequalities for contingency tables and integer flows, 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, The asymptotic number of labeled graphs with given degree sequences, Combinatorial analysis. (Matrix problems, choice theory), Asymptotic enumeration of integer matrices with large equal row and column sums, Exact tests for the Rasch model via sequential importance sampling, An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums, Ensemble nonequivalence in random graphs with modular structure, Random dense bipartite graphs and directed graphs with specified degrees, An approximation algorithm for counting contingency tables, Control landscapes for observable preparation with open quantum systems
Cites Work
