SMALL-WORLD AND SCALE-FREE PROPERTIES OF THE n-DIMENSIONAL SIERPINSKI CUBE NETWORKS

Fractals ◽  
2020 ◽  
Vol 28 (01) ◽  
pp. 2050001
Author(s):  
CHENG ZENG ◽  
MENG ZHOU ◽  
YUMEI XUE

In this paper, we construct evolving networks from [Formula: see text]-dimensional Sierpinski cube. Using the self-similarity of Sierpinski cube, we show the evolving networks have scale-free and small-world properties.

Fractals ◽  
2017 ◽  
Vol 25 (06) ◽  
pp. 1750057 ◽  
Author(s):  
CHENG ZENG ◽  
MENG ZHOU

In this paper, we construct evolving networks based on the construction of the [Formula: see text]-dimensional Sierpinski pyramid by the self-similar structure. We show that such networks have scale-free and small-world effects.


Fractals ◽  
2020 ◽  
Vol 28 (03) ◽  
pp. 2050054
Author(s):  
KUN CHENG ◽  
DIRONG CHEN ◽  
YUMEI XUE ◽  
QIAN ZHANG

In this paper, a network is generated from a Sierpinski-type hexagon by applying the encoding method in fractal. The criterion of neighbor is established to quantify the relationships among the nodes in the network. Based on the self-similar structures, we verify the scale-free and small-world effects. The power-law exponent on degree distribution is derived to be [Formula: see text] and the average clustering coefficients are shown to be larger than [Formula: see text]. Moreover, we give the bounds of the average path length of our proposed network from the renewal theorem and self-similarity.


Fractals ◽  
2016 ◽  
Vol 24 (03) ◽  
pp. 1650033 ◽  
Author(s):  
HAO LI ◽  
JIAN HUANG ◽  
ANBO LE ◽  
QIN WANG ◽  
LIFENG XI

In this paper, we investigate the vertical-affiliation-free (VAF) evolving networks whose node set is the basic squares in the process of generating the Sierpinski carpet and edge exists between any two nodes if and only if the corresponding basic squares intersect just on their boundary. Although the VAF networks gets rid of the hierarchial organizations produced naturally by the self-similar structures of fractals, we still prove that they are scale-free and have the small-world effect.


2019 ◽  
Vol 33 (23) ◽  
pp. 1950266 ◽  
Author(s):  
Jin-Xuan Yang

Network structure will evolve over time, which will lead to changes in the spread of the epidemic. In this work, a network evolution model based on the principle of preferential attachment is proposed. The network will evolve into a scale-free network with a power-law exponent between 2 and 3 by our model, where the exponent is determined by the evolution parameters. We analyze the epidemic spreading process as the network evolves from a small-world one to a scale-free one, including the changes in epidemic threshold over time. The condition of epidemic threshold to increase is given with the evolution processes. The simulated results of real-world networks and synthetic networks show that as the network evolves at a low evolution rate, it is more conducive to preventing epidemic spreading.


Fractals ◽  
2016 ◽  
Vol 24 (01) ◽  
pp. 1650001 ◽  
Author(s):  
JIN CHEN ◽  
FEI GAO ◽  
ANBO LE ◽  
LIFENG XI ◽  
SHUHUA YIN

The Sierpinski tetrahedron is used to construct evolving networks, whose vertexes are all solid regular tetrahedra in the construction of the Sierpinski tetrahedron up to the stage [Formula: see text] and any two vertexes are neighbors if and only if the corresponding tetrahedra are in contact with each other on boundary. We show that such networks have the small-world and scale-free effects, but are not fractal scaling.


2009 ◽  
Vol 20 (11) ◽  
pp. 1719-1735 ◽  
Author(s):  
GUANGHUI WEN ◽  
ZHISHENG DUAN

In this paper, we present a local-world evolving model to characterize weighted networks. By introducing the extended links to mimic the weak interactions between the nodes in different local-worlds, the model yields scale-free behavior as well as the small-world property, as confirmed in many real networks. With the increase of the local information, the generated network undergoes a transition from assortative to disassortative, meanwhile the small-world property is preserved. It indicates that the small-world property is a universal characteristic in our model. The numerical simulation results are in good agreement with the analytical expressions.


2007 ◽  
Vol 10 (02) ◽  
pp. 117-141 ◽  
Author(s):  
JINQING FANG ◽  
QIAO BI ◽  
YONG LI ◽  
XIN-BIAO LU ◽  
QIANG LIU

The current interest in complex networks is a part of a broader movement towards research on complex systems. Motivation of this work raises the two challenging questions: (i) Are real networks fundamentally random preferential attached without any deterministic attachment for both un-weighted and weighted networks? (ii) Is there a coherent physical idea and model for unifying the study of the formation mechanism of complex networks? To answer these questions, we propose a harmonious unifying hybrid preferential model (HUHPM) to a certain class of complex networks, which is controlled by a hybrid ratio, d/r, and study their behavior both numerically and analytically. As typical examples, we apply the concepts and method of the HUHPM to un-weighted scale-free networks proposed by Barabasi and Albert (BA), weighted evolving networks proposed by Barras, Bartholomew and Vespignani (BBV), and the traffic driven evolution (TDE) networks proposed by Wang et al., to get the so-called HUHPM-BA, HUHPM-BBV and HUHPM-TDE networks. All the findings of topological properties in the above three typical HUHPM networks give certain universal meaningful results which reveal some essential hybrid mechanisms for the formation of nontrivial scale-free and small-world networks.


Fractals ◽  
2019 ◽  
Vol 27 (07) ◽  
pp. 1950120
Author(s):  
JUAN DENG ◽  
QIN WANG

This paper concerns the average distances of evolving networks modeled by Sierpinski tetrahedron. We express the limit of average distances on reorganized networks as an integral of geodesic distance on Sierpinski tetrahedron. Based on the self-similarity and renewal theorem, we obtain the asymptotic formula on the average distance of our evolving networks.


Fractals ◽  
2020 ◽  
Vol 28 (05) ◽  
pp. 2050087
Author(s):  
CHENG ZENG ◽  
YUMEI XUE ◽  
MENG ZHOU

In this paper, the evolving networks are created from a series of Sierpinski-type polygon by applying the encoding method in fractal and symbolic dynamical system. Based on the self-similar structures of our networks, we study the cumulative degree distribution, the clustering coefficient and the standardized average path length. The power-law exponent of the cumulative degree distribution is deduced to be [Formula: see text] and the average clustering coefficients have a uniform lower bound [Formula: see text]. Moreover, we find the asymptotic formula of the average path length of our proposed networks. These results show the scale-free and the small-world effects of these networks.


Sign in / Sign up

Export Citation Format

Share Document