Volume 79, Number 3, August 2007
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||16 July 2007|
Maximal planar scale-free Sierpinski networks with small-world effect and power law strength-degree correlation
Department of Computer Science and Engineering, Fudan University - Shanghai 200433, China
2 Shanghai Key Lab of Intelligent Information Processing, Fudan University - Shanghai 200433, China
3 Department of Computer Science and Technology, Tongji University - 4800 Cao'an Road, Shanghai 201804, China
4 School of Material and Engineering, Shanghai University - Shanghai 200072, China
Accepted: 19 June 2007
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.
PACS: 89.75.Da – Systems obeying scaling laws / 05.45.Df – Fractals / 02.10.Ox – Combinatorics; graph theory
© Europhysics Letters Association, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.