| | |
| | |
Stat |
Members: 3645 Articles: 2'501'711 Articles rated: 2609
19 April 2024 |
|
| | | |
|
Article overview
| |
|
Emergence of large cliques in random scale-free network | Ginestra Bianconi
; Matteo Marsili
; | Date: |
12 Oct 2005 | Abstract: | In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c>3 are present in random Erdos 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. Interesting 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 gamma in the interval (2,3). Moreover as long as gamma<3 scale-free networks have a maximal clique which diverges with the system size. | Source: | arXiv, cond-mat/0510306 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |