Scale-free networks by preferential depletion

2011/03/07 by C. M. Schneider, Christian M. Schneider, L. de Arcangelis +3 · 2 citations
Computer Science · Physics and Astronomy · #Agrégation #Cluster (spacecraft) #Cluster analysis #Complex Network Analysis Techniques #Degree distribution #Distribution (mathematics) #Interconnection Networks and Systems #Path (computing) #Theoretical and Computational Physics #cond-mat.stat-mech #cs.SI #physics.bio-ph #physics.comp-ph #physics.soc-ph

paper · pdf · doi:10.1209/0295-5075/95/16005

8 pages, 4 figures

arxiv created 2011/03/07 · openalex publication_date 2011/06/22 · arxiv updated 2015/05/27 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

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.

Citations

• Emergence of scaling in random networks
• CRITICAL PERIOD REGULATION
• Evolution of the social network of scientific collaborations
• On power-law relationships of the Internet topology

Cited by

• Fragmentation of random trees
• Topological phase transition in a network model with preferential attachment and node removal