arXiv:0911.5127 Abstract | arXiv Analytics

arXiv:0911.5127 [math.PR]Abstract References Reviews Resources

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

Published 2009-11-26Version 1

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.

Comments: LaTex, 14 pages

Categories: math.PR, math.CO

Subjects: 05C80, 05C82

Keywords: power law random intersection graph, loglog distances, giant component, vertex degree distribution, infinite second moment

Related articles: Most relevant | Search more

arXiv:1908.08827 [math.PR] (Published 2019-08-23)

A note on the vertex degree distribution of random intersection graphs

Mindaugas Bloznelis

arXiv:2311.07701 [math.PR] (Published 2023-11-13)

The process of fluctuations of the giant component of an Erdős-Rényi graph

Nathanaël Enriquez, Gabriel Faraud, Sophie Lemaire

arXiv:math/0610459 [math.PR] (Published 2006-10-15, updated 2016-07-31)