%0 Journal Article %1 Klemm2002 %A Klemm, Konstantin %A Eguíluz, Víctor M. %D 2002 %I American Physical Society %J Physical Review E %K clustering graphs networks preferential-attachment scale-free %N 3 %P 036123 %R 10.1103/PhysRevE.65.036123 %T Highly clustered scale-free networks %V 65 %X 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. As the network grows, the clustering reaches an asymptotic value larger than that for regular lattices of the same average connectivity and similar to the one observed in the networks of movie actors, coauthorship in science, and word synonyms. These highly clustered scale-free networks indicate that memory effects are crucial for a correct description of the dynamics of growing networks.

@article{Klemm2002, abstract = {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. As the network grows, the clustering reaches an asymptotic value larger than that for regular lattices of the same average connectivity and similar to the one observed in the networks of movie actors, coauthorship in science, and word synonyms. These highly clustered scale-free networks indicate that memory effects are crucial for a correct description of the dynamics of growing networks.}, added-at = {2011-06-09T18:30:28.000+0200}, author = {Klemm, Konstantin and Eguíluz, Víctor M.}, biburl = {https://www.bibsonomy.org/bibtex/21e675365c261d51090ec47722ce87c2f/rincedd}, doi = {10.1103/PhysRevE.65.036123}, interhash = {d4ad2498ce85fcfd609b18c5e3832e25}, intrahash = {1e675365c261d51090ec47722ce87c2f}, journal = {Physical Review E}, keywords = {clustering graphs networks preferential-attachment scale-free}, number = 3, pages = 036123, publisher = {American Physical Society}, timestamp = {2011-06-09T18:30:28.000+0200}, title = {Highly clustered scale-free networks}, volume = 65, year = 2002 }