Preferential attachment mechanism of complex network growth: "rich-gets-richer" or "fit-gets-richer"?

February 27, 2018 Β· Declared Dead Β· πŸ› Physical Review E

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Michael Golosovsky arXiv ID 1802.09786 Category physics.soc-ph Cross-listed cond-mat.stat-mech, cs.SI Citations 21 Venue Physical Review E Last Checked 3 months ago
Abstract
We analyze the growth models for complex networks including preferential attachment (A.-L. Barabasi and R. Albert, Science 286, 509 (1999)) and fitness model (Caldarelli et al., Phys. Rev. Lett. 89, 258702 (2002)) and demonstrate that, under very general conditions, these two models yield the same dynamic equation of network growth, $\frac{dK}{dt}=A(t)(K+K_{0})$, where $A(t)$ is the aging constant, $K$ is the node's degree, and $K_{0}$ is the initial attractivity. Basing on this result, we show that the fitness model provides an underlying microscopic basis for the preferential attachment mechanism. This approach yields long-sought explanation for the initial attractivity, an elusive parameter which was left unexplained within the framework of the preferential attachment model. We show that $K_{0}$ is mainly determined by the width of the fitness distribution. The measurements of $K_{0}$ in many complex networks usually yield the same $K_{0}\sim 1$. This empirical universality can be traced to frequently occurring lognormal fitness distribution with the width $Οƒ\approx 1$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted