Number of cliques in random scale-free network ensembles

Details Number of cliques in random scale-free network ensembles Number of cliques in random scale-free network ensembles

2006-06-05

arxiv.org/abs/cond-mat/0606088v1

Physics

Condensed Matter

Statistical Mechanics

(15 pages)

Scientific paper

10.1016/j.physd.2006.09.013

In 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.

Affiliated with

Also associated with

No associations

Rating

Number of cliques in random scale-free network ensembles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Number of cliques in random scale-free network ensembles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Number of cliques in random scale-free network ensembles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541822