Geodesic
Component evolution in random intersection graphs
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/935
Classification : 05C80
Mots-clés : clustering, giant component 
@article{10_37236_935,
     author = {Michael Behrisch},
     title = {Component evolution in random intersection graphs},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/935},
     zbl = {1114.05093},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/935/}
}
TY  - JOUR
AU  - Michael Behrisch
TI  - Component evolution in random intersection graphs
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/935/
DO  - 10.37236/935
ID  - 10_37236_935
ER  - 
%0 Journal Article
%A Michael Behrisch
%T Component evolution in random intersection graphs
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/935/
%R 10.37236/935
%F 10_37236_935
Michael Behrisch. Component evolution in random intersection graphs. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/935

Cité par Sources :