Geodesic
A note on the component structure in random intersection graphs with tunable clustering
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We study the component structure in random intersection graphs with tunable clustering, and show that the average degree works as a threshold for a phase transition for the size of the largest component. That is, if the expected degree is less than one, the size of the largest component is a.a.s. of logarithmic order, but if the average degree is greater than one, a.a.s. a single large component of linear order emerges, and the size of the second largest component is at most of logarithmic order.
DOI : 10.37236/885
Classification : 05C80
Mots-clés : component structure, random intersection graphs, tunable clustering, phase transition, largest component, logarithmic order 
@article{10_37236_885,
     author = {Andreas N. Lager\r{a}s and Mathias Lindholm},
     title = {A note on the component structure in random intersection graphs with tunable clustering},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/885},
     zbl = {1160.05335},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/885/}
}
TY  - JOUR
AU  - Andreas N. Lagerås
AU  - Mathias Lindholm
TI  - A note on the component structure in random intersection graphs with tunable clustering
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/885/
DO  - 10.37236/885
ID  - 10_37236_885
ER  - 
%0 Journal Article
%A Andreas N. Lagerås
%A Mathias Lindholm
%T A note on the component structure in random intersection graphs with tunable clustering
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/885/
%R 10.37236/885
%F 10_37236_885
Andreas N. Lagerås; Mathias Lindholm. A note on the component structure in random intersection graphs with tunable clustering. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/885

Cité par Sources :