Random Oxford graphs
Publication
, Journal Article
Blasiak, J; Durrett, R
Published in: Stochastic Processes and their Applications
August 1, 2005
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G1(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. © 2005 Elsevier B.V. All rights reserved.
Duke Scholars
Published In
Stochastic Processes and their Applications
DOI
ISSN
0304-4149
Publication Date
August 1, 2005
Volume
115
Issue
8
Start / End Page
1257 / 1278
Related Subject Headings
- Statistics & Probability
- 1502 Banking, Finance and Investment
- 0104 Statistics
- 0102 Applied Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Blasiak, J., & Durrett, R. (2005). Random Oxford graphs. Stochastic Processes and Their Applications, 115(8), 1257–1278. https://doi.org/10.1016/j.spa.2005.03.008
Blasiak, J., and R. Durrett. “Random Oxford graphs.” Stochastic Processes and Their Applications 115, no. 8 (August 1, 2005): 1257–78. https://doi.org/10.1016/j.spa.2005.03.008.
Blasiak J, Durrett R. Random Oxford graphs. Stochastic Processes and their Applications. 2005 Aug 1;115(8):1257–78.
Blasiak, J., and R. Durrett. “Random Oxford graphs.” Stochastic Processes and Their Applications, vol. 115, no. 8, Aug. 2005, pp. 1257–78. Scopus, doi:10.1016/j.spa.2005.03.008.
Blasiak J, Durrett R. Random Oxford graphs. Stochastic Processes and their Applications. 2005 Aug 1;115(8):1257–1278.
Published In
Stochastic Processes and their Applications
DOI
ISSN
0304-4149
Publication Date
August 1, 2005
Volume
115
Issue
8
Start / End Page
1257 / 1278
Related Subject Headings
- Statistics & Probability
- 1502 Banking, Finance and Investment
- 0104 Statistics
- 0102 Applied Mathematics