Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation

Simple item page
dc.creatorZhang, Zhongzhi
dc.creatorZhou, Shuigeng
dc.creatorFang, Lujun
dc.creatorGuan, Jihong
dc.creatorZhang, Yichao
dc.date2007-06-24
dc.date.accessioned2026-07-07T08:17:28Z
dc.date.available2026-07-07T08:17:28Z
dc.descriptionMany 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.
dc.description6 pages, 5 figures, accepted by EPL
dc.identifierhttps://arxiv.org/abs/0706.3490
dc.identifierhttp://arxiv.org/abs/0706.3490
dc.identifierEPL,79(2007)38007
dc.identifierdoi:10.1209/0295-5075/79/38007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134102
dc.subjectPhysics and Society
dc.titleMaximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
dc.typetext

Files

Collections

arXiv