Paper Info
Title
Component evolution in random intersection graphs
Abstract
We study the evolution of the order of the largest component in the random intersection graph model which reflects some clustering properties of real-world networks. We show that for appropriate choice of the parameters random intersection graphs differ from G(n,p) in that neither the so-called giant component, appearing when the expected vertex degree gets larger than one, has linear order nor is the second largest of logarithmic order. We also describe a test of our result on a protein similarity network.
Year
Venue
Keywords
2007
ELECTRONIC JOURNAL OF COMBINATORICS
giant component,linear order
Field
DocType
Volume
Discrete mathematics,Indifference graph,Combinatorics,Random graph,Chordal graph,Intersection graph,Giant component,Degree (graph theory),Cluster analysis,Mathematics,Intersection (Euclidean geometry)
Journal
14.0
Issue
ISSN
Citations 
1.0
1077-8926
12
PageRank 
References 
Authors
2.92
7
1
Name
Order
Citations
PageRank
Michael Behrisch1498.77