Preferential attachment network model with aging and initial attractiveness |
| |
Authors: | Xiao-Long Peng |
| |
Affiliation: | Complex Systems Research Center, Shanxi University, Taiyuan 030006, Shanxi, ChinaShanxi Center for Applied Mathematics, Shanxi University, Taiyuan 030006, Shanxi, ChinaShanxi Key Laboratory of Mathematical Techniques and Big Data Analysis on Disease Control and Prevention, Shanxi University, Taiyuan 030006, Shanxi, China |
| |
Abstract: | In this paper, we generalize the growing network model with preferential attachment for new links to simultaneously include aging and initial attractiveness of nodes. The network evolves with the addition of a new node per unit time, and each new node has m new links that with probability Πi are connected to nodes i already present in the network. In our model, the preferential attachment probability Πi is proportional not only to ki + A, the sum of the old node i's degree ki and its initial attractiveness A, but also to the aging factor ${tau }_{i}^{-alpha }$, where τi is the age of the old node i. That is, ${{rm{Pi }}}_{i}propto ({k}_{i}+A){tau }_{i}^{-alpha }$. Based on the continuum approximation, we present a mean-field analysis that predicts the degree dynamics of the network structure. We show that depending on the aging parameter α two different network topologies can emerge. For α < 1, the network exhibits scaling behavior with a power-law degree distribution P(k) ∝ k−γ for large k where the scaling exponent γ increases with the aging parameter α and is linearly correlated with the ratio A/m. Moreover, the average degree k(ti, t) at time t for any node i that is added into the network at time ti scales as $k({t}_{i},t)propto {t}_{i}^{-beta }$ where 1/β is a linear function of A/m. For α > 1, such scaling behavior disappears and the degree distribution is exponential. |
| |
Keywords: | complex network model aging preferential attachment power-law behavior |
|
| 点击此处可从《理论物理通讯》浏览原始摘要信息 |
|
点击此处可从《理论物理通讯》下载全文 |
|