pith. sign in

arxiv: 1103.1396 · v1 · pith:HAP5HFGQnew · submitted 2011-03-07 · ⚛️ physics.soc-ph · cond-mat.stat-mech· cs.SI· physics.bio-ph· physics.comp-ph

Scale free networks by preferential depletion

classification ⚛️ physics.soc-ph cond-mat.stat-mechcs.SIphysics.bio-phphysics.comp-ph
keywords networkspreferentialdepletiondistributionexponentsagreementappliesapproach
0
0 comments X
read the original abstract

We show that not only preferential attachment but also preferential depletion leads to scale-free networks. The resulting degree distribution exponents is typically less than two (5/3) as opposed to the case of the growth models studied before where the exponents are larger. Our approach applies in particular to biological networks where in fact we find interesting agreement with experimental measurements. We investigate the most important properties characterizing these networks, as the cluster size distribution, the average shortest path and the clustering coefficient.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.