Asymptotics and random matrices with row-sum and column sum-restrictions

DOI10.1090/S0002-9904-1969-12393-1zbMath0234.05009WikidataQ105870749 ScholiaQ105870749MaRDI QIDQ5642578

Patrick E. O'Neil

Publication date: 1969

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

15B52: Random matrices (algebraic aspects)

Related Items

On the enumeration of rectangular (0, 1)-matrices, What Does a Random Contingency Table Look Like?, The enumeration of arrays and a generalization related to contingency tables, Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums, Properties of atypical graphs from negative complexities, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, The number of matchings in random regular graphs and bipartite graphs, Matchings in random regular bipartite digraphs, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, The asymptotic number of non-negative integer matrices with given row and column sums, Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums, Combinatorial analysis. (Matrix problems, choice theory), Random permutations on a set with a binary relation, The weaking of taxonomic inferences by homological errors

Cites Work

• The Asymptotic Series For a Certain Class Of Permutation Problems
• The Asymptotic Number of Latin Rectangles
• Unnamed Item
• Unnamed Item