The asymptotic number of non-negative integer matrices with given row and column sums

From MaRDI portal
Revision as of 06:28, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1211987

DOI10.1016/0012-365X(74)90118-6zbMath0293.05009WikidataQ127673602 ScholiaQ127673602MaRDI QIDQ1211987

Edward A. Bender

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)




Related Items (26)

Spectral gap in random bipartite biregular graphs and applicationsAlmost all regular graphs are hamiltonianBrunn--Minkowski inequalities for contingency tables and integer flowsOn 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 sequenceAn extension of the Erdős-Ko-Rado theorem to uniform set partitionsAsymptotic enumeration of integer matrices with large equal row and column sumsEnsemble nonequivalence in random graphs with modular structureInduced subgraphs in sparse random graphs with given degree sequencesOn the enumeration of rectangular (0, 1)-matricesControl landscapes for observable preparation with open quantum systemsExpansion of random graphs: new proofs, new resultsASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONSOn the number of matrices and a random matrix with prescribed row and column sums and 0-1 entriesEnumeration and simulation methods for 0-1 matrices with given marginalsExact tests for the Rasch model via sequential importance samplingUnnamed ItemRandom dense bipartite graphs and directed graphs with specified degreesAn approximation algorithm for counting contingency tablesThe asymptotic number of labeled graphs with given degree sequencesAutomorphisms of random graphs with specified verticesMatrices with prescribed row and column sumsFrozen (Δ + 1)-colourings of bounded degree graphsAn asymptotic formula for the number of non-negative integer matrices with prescribed row and column sumsCombinatorial analysis. (Matrix problems, choice theory)Random sampling of contingency tables via probabilistic divide-and-conquer




Cites Work




This page was built for publication: The asymptotic number of non-negative integer matrices with given row and column sums