584 citations · 2.6k across the 83 of their papers we have counts for
8 papers · 1 filter
Degree and component size distributions in generalized uniform recursive tree
Zhongzhi Zhang, Shuigeng Zhou, Shanghong Zhao +2
We propose a generalized model for uniform recursive tree (URT) by introducing an imperfect growth process, which may generate disconnected components (clusters). The model undergo…
Evolving small-world scale-free networks consist of cliques
Zhongzhi Zhang, Shuigeng Zhou, Lichao Chen
We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numer…
A Synthetical Weights' Dynamic Mechanism for Weighted Networks
Lujun Fang, Zhongzhi Zhang, Shuigeng Zhou +1
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.…
Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
Zhongzhi Zhang, Shuigeng Zhou, Lujun Fang +2
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…
Exact analytical solution of average path length for Apollonian networks
Zhongzhi Zhang, Lichao Chen, Shuigeng Zhou +3
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 sol…
Recursive weighted treelike networks
Zhongzhi Zhang, Shuigeng Zhou, Lichao Chen +3
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, whi…
Effects of accelerating growth on the evolution of weighted complex networks
Zhongzhi Zhang, Lujun Fang, Shuigeng Zhou +1
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…
A geometric growth model interpolating between regular and small-world networks
Zhongzhi Zhang, Shuigeng Zhou, Zhiyong Wang +1
We propose a geometric growth model which interpolates between one-dimensional linear graphs and small-world networks. The model undergoes a transition from large to small worlds.…