Scale-free networks by preferential depletion (bibtex)
by Schneider CM, DE ARCANGELIS Lucilla, Herrmann HJ
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
Reference:
Scale-free networks by preferential depletion (Schneider CM, DE ARCANGELIS Lucilla, Herrmann HJ), In EUROPHYSICS LETTERS, volume 95, 2011. (Articolo in rivista)
Bibtex Entry:
@article{cri11b,
author = {Schneider CM, and DE ARCANGELIS Lucilla, and Herrmann HJ,},
title = {Scale-free networks by preferential depletion},
volume = {95},
note = {Articolo in rivista},
issn = {0295-5075},
journal = {EUROPHYSICS LETTERS},
doi = {10.1209/0295-5075/95/16005},
year = {2011},
wosId = {000291990600018},
scopusId = {2-s2.0-79960164620},
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}
}
Powered by bibtexbrowser