Emergence of large cliques in random scale-free network

Details Emergence of large cliques in random scale-free network Emergence of large cliques in random scale-free network

2005-10-12

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

Physics

Condensed Matter

Disordered Systems and Neural Networks

(4 pages, 1 figure)

Scientific paper

10.1209/epl/i2005-10574-3

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.

Affiliated with

Also associated with

No associations

Rating

Emergence of large cliques in random scale-free network 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 Emergence of large cliques in random scale-free network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Emergence of large cliques in random scale-free network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-686593