Scale-free and small-world properties of Sierpinski networks
From MaRDI portal
Publication:1620137
DOI10.1016/j.physa.2016.08.069zbMath1400.05226OpenAlexW2518373054MaRDI QIDQ1620137
Songjing Wang, Lihong Wang, Hui Xu, 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.2016.08.069
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Fractals (28A80)
Related Items (39)
FRACTAL NETWORKS MODELED BY SOME FRACTAL CARPET ⋮ Network coherence and eigentime identity on a family of weighted fractal networks ⋮ 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 ⋮ Average geodesic distance of skeleton networks of Sierpinski tetrahedron ⋮ An information dimension of weighted complex networks ⋮ NODE-WEIGHTED AVERAGE FERMAT DISTANCES OF FRACTAL TREE NETWORKS ⋮ Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk ⋮ The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network ⋮ Eigentime identities of fractal sailboat networks ⋮ Mean first-passage times for two biased walks on the weighted rose networks ⋮ Eigentime identities of potting networks ⋮ Average distances on substitution trees ⋮ SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS ⋮ CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS ⋮ AVERAGE DISTANCE OF SUBSTITUTION NETWORKS ⋮ SMALL-WORLD AND SCALE-FREE PROPERTIES OF THE n-DIMENSIONAL SIERPINSKI CUBE NETWORKS ⋮ AVERAGE DISTANCES OF A FAMILY OF NON-P.C.F. SELF-SIMILAR NETWORKS ⋮ THE SCALE-FREE AND SMALL-WORLD PROPERTIES OF COMPLEX NETWORKS ON SIERPINSKI-TYPE HEXAGON ⋮ FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON ⋮ AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS ⋮ The average trapping time on the weighted pseudofractal scale-free web ⋮ Average trapping time of weighted scale-free m-triangulation networks ⋮ Scale-free and small-world properties of hollow cube networks ⋮ Valency-based topological descriptors and structural property of the generalized Sierpiński networks ⋮ ASYMPTOTIC FORMULA ON AVERAGE PATH LENGTH OF A SPECIAL NETWORK BASED ON SIERPINSKI CARPET ⋮ EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS ⋮ EIGENTIME IDENTITIES OF FRACTAL FLOWER NETWORKS ⋮ TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS ⋮ SMALL-WORLD AND SCALE-FREE PROPERTIES OF FRACTAL NETWORKS MODELED ON n-DIMENSIONAL SIERPINSKI PYRAMID ⋮ AVERAGE DISTANCE OF SELF-SIMILAR FRACTAL TREES ⋮ Resistance distance in potting networks ⋮ Fractal networks with Sturmian structure ⋮ Random walks on Fibonacci treelike models ⋮ COMPLEX NETWORKS MODELED ON A KIND OF SIERPIŃSKI-LIKE CARPET ⋮ AVERAGE DISTANCES OF LINDSTRÖM SNOWFLAKE NETWORKS ⋮ SELF-SIMILAR TOUCHING NETWORKS — PART I ⋮ SELF-SIMILAR TOUCHING NETWORKS — PART II
Cites Work
- Emergence of Scaling in Random Networks
- Topological characterization of the Sierpiński curve
- The exact solution of the mean geodesic distance for Vicsek fractals
- A box-covering algorithm for fractal scaling in scale-free networks
- Collective dynamics of ‘small-world’ networks
- A SMALL-WORLD AND SCALE-FREE NETWORK GENERATED BY SIERPINSKI TETRAHEDRON
- Unnamed Item
- Unnamed Item
This page was built for publication: Scale-free and small-world properties of Sierpinski networks
