The rigorous solution for the average distance of a Sierpinski network (2008)
Zhang, Zhongzhi, Chen, Lichao, Fang, Lujun, Zhou, Shuigeng, Zhang, Yichao, Guan, Jihong
The closed-form solution for the average distance of a deterministic network --the Sierpinski network-- is found. This important quantity is calculated exactly with the help of recursion relations,...
A Synthetical Weights' Dynamic Mechanism for Weighted Networks (2007)
Fang, Lujun, Zhang, Zhongzhi, Zhou, Shuigeng, Guan, Jihong
We propose a synthetical weights' dynamic mechanism for weighted networks which takes into account the influences of strengths of nodes, weights of links and incoming new vertices. Strength/Weight...
Zhang, Zhongzhi, Zhou, Shuigeng, Fang, Lujun, Guan, Jihong, Zhang, Yichao
Many real networks share three generic properties: they are scale-free, display a small-world effect, and show a power-law strength-degree correlation. In this paper, we propose a type of...
Exact analytical solution of average path length for Apollonian networks (2007)
Zhang, Zhongzhi, Chen, Lichao, Zhou, Shuigeng, Fang, Lujun, Guan, Jihong, Zou, Tao
The exact formula for the average path length of Apollonian networks is found. With the help of recursion relations derived from the self-similar structure, we obtain the exact solution of average...
Recursive weighted treelike networks (2007)
Zhang, Zhongzhi, Zhou, Shuigeng, Chen, Lichao, Guan, Jihong, Fang, Lujun, Zhang, Yichao
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...
Effects of accelerating growth on the evolution of weighted complex networks (2007)
Zhang, Zhongzhi, Fang, Lujun, Zhou, Shuigeng, Guan, Jihong
Many real systems possess accelerating statistics where the total number of edges grows faster than the network size. In this paper, we propose a simple weighted network model with accelerating...