Random Oxford Graphs
| dc.creator | Blasiak, Jonah | |
| dc.creator | Durrett, Rick | |
| dc.date | 2004-06-08 | |
| dc.date.accessioned | 2026-07-07T05:08:59Z | |
| dc.date.available | 2026-07-07T05:08:59Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0406138 | |
| dc.identifier | http://arxiv.org/abs/math/0406138 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71475 | |
| dc.subject | Probability | |
| dc.subject | 60 | |
| dc.title | Random Oxford Graphs | |
| dc.type | text |