Rank-dependent deactivation in network evolution
classification
⚛️ physics.soc-ph
keywords
networkdeactivationdegreeevolutionrank-dependentclusteringcoefficientcorrelation
read the original abstract
A rank-dependent deactivation mechanism is introduced to network evolution. The growth dynamics of the network is based on a finite memory of individuals, which is implemented by deactivating one site at each time step. The model shows striking features of a wide range of real-world networks: power-law degree distribution, high clustering coefficient, and disassortative degree correlation.
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.