English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/15314
Share/Impact:
Statistics
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:

Title

Growing scale-free networks with small-world behavior

AuthorsKlemm, Konstantin ; Eguíluz, Víctor M.
Keywords[PACS] Networks and genealogical trees
[PACS] Dynamics of social systems
[PACS] Social and economic systems
Issue Date8-May-2002
PublisherAmerican Physical Society
CitationPhysical Review E 65(5): 057102 (2002)
AbstractIn the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small-world effect. While the average shortest path length increases logarithmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive analytical expressions for the clustering coefficient in two limiting cases: random [C~(ln N)2/N] and highly clustered (C = 5/6) scale-free networks.
Description4 pages, 4 figures.-- PACS nrs.: 89.75.Hc, 87.23.Ge, 89.65.-s.-- ArXiv pre-print available at: http://arxiv.org/abs/cond-mat/0107607
More info available at: http://www.nbi.dk/CATS/
Publisher version (URL)http://dx.doi.org/10.1103/PhysRevE.65.057102
URIhttp://hdl.handle.net/10261/15314
DOI10.1103/PhysRevE.65.057102
ISSN1539-3755
Appears in Collections:(IFISC) Artículos
Files in This Item:
File Description SizeFormat 
sw.pdf61,83 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.