Volume 95, Number 1, July 2011
|Number of page(s)||5|
|Section||Condensed Matter: Structural, Mechanical and Thermal Properties|
|Published online||22 June 2011|
Scale-free networks by preferential depletion
Computational Physics, IfB, ETH Zurich - Schafmattstrasse 6, 8093 Zurich, Switzerland
2 Department of Information Engineering and CNISM, Second University of Naples - 81031 Aversa (CE), Italy, EU
3 Departamento de Física, Universidade Federal do Ceará - 60451-970 Fortaleza, Ceará, Brazil
Accepted: 20 May 2011
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.
PACS: 64.60.aq – Networks / 89.75.Da – Systems obeying scaling laws / 89.75.Fb – Structures and organization in complex systems
© EPLA, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.