English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/18030
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Highly clustered scale-free networks

AutorKlemm, Konstantin ; Eguíluz, Víctor M.
Fecha de publicación21-feb-2002
EditorAmerican Physical Society
CitaciónPhysical Review E 65(3): 036123.1-036123.5 (2002)
ResumenWe 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 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 high-clustering scale-free networks indicate that memory effects could be crucial for a correct description of the dynamics of growing networks.
Descripción5 pages, 4 figures.-- PACS number(s): 89.75.Hc, 87.23.Ge, 89.65.2s
Versión del editorhttp://dx.doi.org/10.1103/PhysRevE.65.036123
Aparece en las colecciones: (IMEDEA) Artículos
(IFISC) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
hcsf.pdf79,9 kBAdobe PDFVista previa
Mostrar el registro completo

Artículos relacionados:

NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.