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

From MaRDI portal
Revision as of 05:12, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5642578

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

Patrick E. O'Neil

Publication date: 1969

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

Full work available at URL: https://doi.org/10.1090/s0002-9904-1969-12393-1




Related Items

The number of matchings in random regular graphs and bipartite graphsProperties of atypical graphs from negative complexitiesChains and Antichains in the Bruhat Order for Classes of (0, 1)-MatricesThe enumeration of arrays and a generalization related to contingency tablesAsymptotic enumeration of digraphs and bipartite graphs by degree sequenceMatchings in random regular bipartite digraphsSpectrum of permanent's values and its extremal magnitudes in \(\Lambda_n^3\) and \(\Lambda_n(\alpha,\beta,\gamma)\)\(H\)-colouring bipartite graphsTopological network entanglement as order parameter for the emergence of geometryOn the enumeration of rectangular (0, 1)-matricesCombinatorial quantum gravity: geometry from random bitsAsymptotic enumeration of 0-1 matrices with equal row sums and equal column sumsProbabilistic analysis of combinatorial algorithms: A bibliography with selected annotationsCharacterizing optimal sampling of binary contingency tables via the configuration modelOn the number of matrices and a random matrix with prescribed row and column sums and 0-1 entriesThe asymptotic number of non-negative integer matrices with given row and column sumsRandom permutations on a set with a binary relationWhat Does a Random Contingency Table Look Like?The weaking of taxonomic inferences by homological errorsCombinatorial analysis. (Matrix problems, choice theory)Book Embeddings of Regular GraphsAsymptotic enumeration of sparse 0--1 matrices with irregular row and column sums



Cites Work