Preferential attachment scale-free growth model with random fitness
classification
❄️ cond-mat.stat-mech
keywords
attachmentfitnessgrowthmodelnetworkpreferentialaroundbarycenter
read the original abstract
We introduce a network growth model in which the preferential attachment probability includes the fitness vertex and the Euclidean distance between nodes. We grow a planar network around its barycenter. Each new site is fixed in space by obeying a power law distribution.
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.