Highly clustered scale-free networks

Details Highly clustered scale-free networks Highly clustered scale-free networks

2001-07-30

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

Phys. Rev. E 65, 036123 (2002)

Physics

Condensed Matter

6 pages, 4 figures

Scientific paper

10.1103/PhysRevE.65.036123

We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative correlation between the age of a node and its link attachment rate. Notably, the degree distribution is conserved even though only the most recently grown part of the network is considered. This feature is relevant because real-world networks truncated in the same way exhibit a power-law distribution in the degree. As the network grows, the clustering reaches an asymptotic value larger than for regular lattices of the same average connectivity. These high-clustering scale-free networks indicate that memory effects could be crucial for a correct description of the dynamics of growing networks.

Affiliated with

Also associated with

No associations

Rating

Highly clustered scale-free networks 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 Highly clustered scale-free networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Highly clustered scale-free networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-447623