Random Oxford graphs

Jonah Blasiak and Rick Durrett

Stochastic Processes and their Applications, 2005, vol. 115, issue 8, 1257-1278

Abstract: 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.

Date: 2005
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304-4149(05)00042-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:115:y:2005:i:8:p:1257-1278

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().