Two modified Dorogovtsev-Mendes （DM） models of aging networks based on the dynamics of connecting nearest-neighbors are introduced. One edge of the new site is connected to the old site with probability - kt^-α as ...Two modified Dorogovtsev-Mendes （DM） models of aging networks based on the dynamics of connecting nearest-neighbors are introduced. One edge of the new site is connected to the old site with probability - kt^-α as in the DM＇s model, where the degree and age of the old site are k and t, respectively. We consider two cases, i.e. the other edges of the new site attaching to the nearest-neighbors of the old site with uniform and degree connectivity probability, respectively. The network structure changes with an increase of aging exponent α It is found that the networks can produce scale-free degree distributions with small-world properties. And the different connectivity probabilities lead to the different properties of the networks.展开更多
基金The project supported by National Natural Science Foundation of China under Grant No.10675060the Doctoral Foundation of Ministry of Education of China under Grant No.2002055009
文摘Two modified Dorogovtsev-Mendes （DM） models of aging networks based on the dynamics of connecting nearest-neighbors are introduced. One edge of the new site is connected to the old site with probability - kt^-α as in the DM＇s model, where the degree and age of the old site are k and t, respectively. We consider two cases, i.e. the other edges of the new site attaching to the nearest-neighbors of the old site with uniform and degree connectivity probability, respectively. The network structure changes with an increase of aging exponent α It is found that the networks can produce scale-free degree distributions with small-world properties. And the different connectivity probabilities lead to the different properties of the networks.
