Title
Scale free networks by preferential depletion
Abstract
We show that not only preferential attachment but also preferential depletion leads to scale-free networks. In our model there is neither growth of new connections nor growth of new nodes. We start from a well connected network and implement a probabilistic purely depletion procedure. The resulting degree distribution exponent is typically less than two (5/3) as opposed to the case of the growth models studied before where the exponents are larger. We investigate the most important properties characterizing these networks, as the cluster size distribution, the average shortest path and the clustering coefficient. Copyright (C) EPLA, 2011
Year
DOI
Venue
2011
10.1209/0295-5075/95/16005
EPL
Keywords
DocType
Volume
shortest path,degree distribution,clustering coefficient,scale free network
Journal
95
Issue
ISSN
Citations 
SP1
0295-5075
1
PageRank 
References 
Authors
0.53
1
3
Name
Order
Citations
PageRank
Christian M. Schneider11428.29
Lucilla de Arcangelis211.20
Hans J. Herrmann318617.58