A note on loglog distances in a power law random intersection graph

Details A note on loglog distances in a power law random intersection graph A note on loglog distances in a power law random intersection graph

2009-11-26

arxiv.org/abs/0911.5127v1

Mathematics

Probability

LaTex, 14 pages

Scientific paper

We consider the typical distance between vertices of the giant component of a
random intersection graph having a power law (asymptotic) vertex degree
distribution with infinite second moment. Given two vertices from the giant
component we construct O(log log n) upper bound (in probability) for the length
of the shortest path connecting them.

Affiliated with

Also associated with

No associations

Rating

A note on loglog distances in a power law random intersection graph 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 A note on loglog distances in a power law random intersection graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on loglog distances in a power law random intersection graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116975