2019-10-20T19:50:09Z
https://digital.csic.es/dspace-oai/request
oai:digital.csic.es:10261/15314
2018-09-17T11:39:31Z
com_10261_2855
com_10261_4
col_10261_2857
Klemm, Konstantin
Eguíluz, Víctor M.
2009-07-24T11:21:55Z
2009-07-24T11:21:55Z
2002-05-08
Physical Review E 65(5): 057102 (2002)
1539-3755
http://hdl.handle.net/10261/15314
10.1103/PhysRevE.65.057102
In 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.
eng
openAccess
[PACS] Networks and genealogical trees
[PACS] Dynamics of social systems
[PACS] Social and economic systems
Growing scale-free networks with small-world behavior
artículo