2007/06/24 by Zhongzhi Zhang, Shuigeng Zhou, Lujun Fang +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Graph theory and applications #Interconnection Networks and Systems #physics.soc-ph
paper · pdf · doi:10.1209/0295-5075/79/38007
published as EPL,79(2007)38007 · 6 pages, 5 figures, accepted by EPL
arxiv created 2007/06/24 · openalex publication_date 2007/07/16 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/30
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.