Random Oxford graphs

DOI10.1016/J.SPA.2005.03.008zbMATH Open1067.05070arXivmath/0406138OpenAlexW2059061022MaRDI QIDQ2387449FDOQ2387449

Authors: Jonah Blasiak, Rick Durrett 

Publication date: 2 September 2005

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Abstract: Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We give asymptotic results for the number of such graphs and the number of $(i,j)$ trees they contain. We compute the thresholds for the emergence of a giant component and for the graph to be connected.

Full work available at URL: https://arxiv.org/abs/math/0406138

Recommendations

• scientific article; zbMATH DE number 18978
• scientific article; zbMATH DE number 1231233
• scientific article; zbMATH DE number 1540669
• Random Graphs
• scientific article; zbMATH DE number 3875330
• scientific article; zbMATH DE number 5610906
• scientific article; zbMATH DE number 3904630
• scientific article; zbMATH DE number 863475
• scientific article; zbMATH DE number 857026
• The random graph

zbMATH Keywords

giant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Cites Work

• Probability. Theory and examples.
• A critical point for random graphs with a given degree sequence
• Random graphs.
• The number of components in a random bipartite graph

Cited In (3)

• Random bipartite graphs
• The hyperbolic geometry of random transpositions
• Random structures

This page was built for publication: Random Oxford graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387449)