Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3643
Articles: 2'487'895
Articles rated: 2609

28 March 2024
 
  » arxiv » cond-mat/0606088

 Article overview


Number of cliques in random scale-free network ensembles
Ginestra Bianconi ; Matteo Marsili ;
Rating Visitors: 4/5 (1 visitor)
Date 5 Jun 2006
Subject Statistical Mechanics; Physics and Society
AbstractIn this paper we calculate the average number of cliques in random scale-free networks. We consider first the hidden variable ensemble and subsequently the Molloy Reed ensemble. In both cases we find that cliques, i.e. fully connected subgraphs, appear also when the average degree is finite. This is in contrast to what happens in Erd"os and Renyi graphs in which diverging average degree is required to observe cliques of size $c>3$. Moreover we show that in random scale-free networks the clique number, i.e. the size of the largest clique present in the network diverges with the system size.
Source arXiv, cond-mat/0606088
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  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.






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica