The shortest distance in random multi-type intersection graphs

Details The shortest distance in random multi-type intersection graphs The shortest distance in random multi-type intersection graphs

2010-01-29

arxiv.org/abs/1001.5357v1

Mathematics

Probability

32 pages

Scientific paper

Using an associated branching process as the basis of our approximation, we
show that typical inter-point distances in a multitype random intersection
graph have a defective distribution, which is well described by a mixture of
translated and scaled Gumbel distributions, the missing mass corresponding to
the event that the vertices are not in the same component of the graph.

Affiliated with

Also associated with

No associations

Rating

The shortest distance in random multi-type intersection 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 The shortest distance in random multi-type intersection graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The shortest distance in random multi-type intersection graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676545