arXiv · 0706.3490
Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
Abstract
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 deterministically growing networks called Sierpinski networks, which are induced by the famous Sierpinski fractals and constructed in a simple iterative way. We derive analytical expressions for degree distribution, strength distribution, clustering coefficient, and strength-degree correlation, which agree well with the characterizations of various real-life networks. Moreover, we show that the introduced Sierpinski networks are maximal planar graphs.
Explore related subjects
Keep this discovery
Zhongzhi Zhang, Shuigeng Zhou, Lujun Fang, Jihong Guan, Yichao Zhang. 2007-06-24. Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation. https://doi.org/10.1209/0295-5075/79/38007
Cite the original work for its findings. Save a collection to share your selection of sources.