Volume 74, Number 4, May 2006
|Page(s)||740 - 746|
|Section||Interdisciplinary physics and related areas of science and technology|
|Published online||14 April 2006|
Emergence of large cliques in random scale-free networks
The Abdus Salam International Center for Theoretical Physics Strada Costiera 11, 34014 Trieste, Italy
Accepted: 21 March 2006
In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size are present in random Erdös and Renyi graphs only in the limit of diverging average connectivity. Starting from the finding that real scale-free graphs have large cliques, we study the clique number in uncorrelated scale-free networks finding both upper and lower bounds. Interestingly, we find that in scale-free networks large cliques appear also when the average degree is finite, i.e. even for networks with power law degree distribution exponents . Moreover, as long as , scale-free networks have a maximal clique which diverges with the system size.
PACS: 89.75.Hc – Networks and genealogical trees / 89.75.Fb – Structures and organization in complex systems / 89.75.Da – Systems obeying scaling laws
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.