Journal article
Random Oxford graphs
Stochastic processes and their applications, v 115(8), pp 1257-1278
01 Aug 2005
Featured in Collection : UN Sustainable Development Goals @ Drexel
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.
Metrics
Details
- Title
- Random Oxford graphs
- Creators
- Jonah Blasiak - Princeton UniversityRick Durrett - Cornell University
- Publication Details
- Stochastic processes and their applications, v 115(8), pp 1257-1278
- Publisher
- Elsevier
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Mathematics
- Web of Science ID
- WOS:000230617300001
- Scopus ID
- 2-s2.0-21244470790
- Other Identifier
- 991021862388204721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Statistics & Probability