Eur. Phys. J. B 59, 99-107 (2007)
https://doi.org/10.1140/epjb/e2007-00264-6

Recursive weighted treelike networks

¹ Department of Computer Science and Engineering, Fudan University, Shanghai, 200433, P.R. China
² Shanghai Key Lab of Intelligent Information Processing, Fudan University, Shanghai, 200433, P.R. China
³ Department of Computer Science and Technology, Tongji University, 4800 Cao'an Road, Shanghai, 201804, P.R. China
⁴ School of Material and Engineering, Shanghai University, Shanghai, 200072, P.R. China

Corresponding authors: ^a zhangzz@fudan.edu.cn - ^b sgzhou@fudan.edu.cn

Received: 28 March 2007
Revised: 4 August 2007
Published online: 5 October 2007

Abstract

We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical results indicate that the resulting networks have power-law distributions of degree, strength, weight and betweenness, a scale-free behavior for degree correlations, logarithmic small average path length and diameter with network size. The obtained properties are in agreement with empirical data observed in many real-life networks, which shows that the presented model may provide valuable insight into the real systems.