Complex networks modeled on the Sierpinski gasket
From MaRDI portal
Publication:1618661
DOI10.1016/J.PHYSA.2015.05.048zbMath1400.05225OpenAlexW1723649057MaRDI QIDQ1618661
Fei Gao, Shuhua Yin, Anbo Le, Li-Feng Xi
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2015.05.048
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Fractals (28A80)
Related Items (15)
A small-world and scale-free network generated by Sierpinski pentagon ⋮ Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk ⋮ FRACTAL NETWORKS MODELED BY SOME FRACTAL CARPET ⋮ The relations between network-operation and topological-property in a scale-free and small-world network with community structure ⋮ A family of small-world network models built by complete graph and iteration-function ⋮ Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks ⋮ An information dimension of weighted complex networks ⋮ Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures ⋮ On the packing measure of the Sierpinski gasket ⋮ SMALL-WORLD AND SCALE-FREE PROPERTIES OF THE n-DIMENSIONAL SIERPINSKI CUBE NETWORKS ⋮ FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON ⋮ SMALL-WORLD AND SCALE-FREE PROPERTIES OF FRACTAL NETWORKS MODELED ON n-DIMENSIONAL SIERPINSKI PYRAMID ⋮ Fractal networks with Sturmian structure ⋮ COMPLEX NETWORKS MODELED ON A KIND OF SIERPIŃSKI-LIKE CARPET ⋮ NODE-WEIGHTED AVERAGE DISTANCES OF NETWORKS MODELED ON THREE-DIMENSIONAL VICSEK FRACTAL
Cites Work
- Unnamed Item
- Unnamed Item
- Deterministic self-similar models of complex networks based on very symmetric graphs
- Contiguous search problem in Sierpiński graphs
- Complex networks: structure and dynamics
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The exact solution of the mean geodesic distance for Vicsek fractals
- A box-covering algorithm for fractal scaling in scale-free networks
- The Structure and Function of Complex Networks
- Collective dynamics of ‘small-world’ networks
- Fractality and the small-world effect in Sierpinski graphs
This page was built for publication: Complex networks modeled on the Sierpinski gasket