The random bipartite nearest neighbor graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4<279::AID-RSA6>3.0.CO;2-J" /><279::AID-RSA6>3.0.CO;2-J 10.1002/(SICI)1098-2418(199910/12)15:3/4<279::AID-RSA6>3.0.CO;2-JzbMath0936.60005OpenAlexW1998984678MaRDI QIDQ4704794

Robert S. Weishaar, Boris G. Pittel

Publication date: 9 May 2000

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199910/12)15:3/4<279::aid-rsa6>3.0.co;2-j

zbMATH Keywords

bipartiterandom graphsmatchingslinear assignmentlimit probabilities

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Unnamed Item ⋮ Random nearest neighbor graphs: the translation invariant case ⋮ Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph ⋮ Asymptotic normality determined by high moments, and submap counts of random maps ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs

Cites Work

• On the Connectivity of Random k-th Nearest Neighbour Graphs

This page was built for publication: The random bipartite nearest neighbor graphs