Random Oxford Graphs

Details Random Oxford Graphs Random Oxford Graphs

2004-06-08

arxiv.org/abs/math/0406138v1

Mathematics

Probability

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Random Oxford Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Oxford Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Oxford Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719357