Journal article icon

Journal article

Clique percolation

Abstract:

Derenyi, Palla and Vicsek introduced the following dependent percolation model, in the context of finding communities in networks. Starting with a random graph $G$ generated by some rule, form an auxiliary graph $G'$ whose vertices are the $k$-cliques of $G$, in which two vertices are joined if the corresponding cliques share $k-1$ vertices. They considered in particular the case where $G=G(n,p)$, and found heuristically the threshold for a giant component to appear in $G'$. Here we give a ri...

Expand abstract
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1002/rsa.20270

Authors


Bollobas, B More by this author
Riordan, O More by this author
Journal:
Random Structures and Algorithms 35 (2009), 294--322
Volume:
35
Issue:
3
Pages:
294-322
Publication date:
2008-04-05
DOI:
EISSN:
1098-2418
ISSN:
1042-9832
URN:
uuid:5a511bd4-9229-45a0-951e-947c6cd4639a
Source identifiers:
3635
Local pid:
pubs:3635
Language:
English
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP