Scale-free and small-world properties of Sierpinski networks
From MaRDI portal
Publication:1620137
DOI10.1016/J.PHYSA.2016.08.069zbMATH Open1400.05226OpenAlexW2518373054MaRDI QIDQ1620137FDOQ1620137
Authors: Songjing Wang, Hui Xu, Lihong Wang, Lifeng 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
Recommendations
- Complex networks modeled on a kind of Sierpiński-like carpet
- Small-world and scale-free properties of fractal networks modeled on \(n\)-dimensional Sierpinski pyramid
- Sierpinski networks with scale-free topology and small-world effect
- Complex networks modeled on the Sierpinski gasket
- A small-world and scale-free network generated by Sierpinski tetrahedron
Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80)
Cites Work
- Emergence of Scaling in Random Networks
- Collective dynamics of `small-world' networks
- Analysis on fractals
- Topological characterization of the Sierpiński curve
- A box-covering algorithm for fractal scaling in scale-free networks
- Establishment and structure properties of a scale-free Koch network
- The exact solution of the mean geodesic distance for Vicsek fractals
- A small-world and scale-free network generated by Sierpinski tetrahedron
Cited In (52)
- An information dimension of weighted complex networks
- Complex networks modeled on a kind of Sierpiński-like carpet
- Mean first-passage times for two biased walks on the weighted rose networks
- Incompatibility networks as models of scale-free small-world graphs
- Average trapping time of weighted scale-free \(m\)-triangulation networks
- Resistance distance in potting networks
- A small-world and scale-free network generated by Sierpinski pentagon
- Characteristic polynomial of adjacency or Laplacian matrix for weighted treelike networks
- Self-similar touching networks. II
- A small-world and scale-free network generated by Sierpinski tetrahedron
- EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
- AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS
- Scale-free and small-world properties of hollow cube networks
- FRACTAL NETWORKS ON SIERPINSKI-TYPE POLYGON
- Network coherence and eigentime identity on a family of weighted fractal networks
- Asymptotic formula on average path length of a special network based on Sierpinski carpet
- Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
- Sierpinski networks with scale-free topology and small-world effect
- Eigentime identities of potting networks
- The average trapping time on the weighted pseudofractal scale-free web
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
- Average distance of self-similar fractal trees
- Average distance of substitution networks
- Average geodesic distance of skeleton networks of Sierpinski tetrahedron
- The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
- AVERAGE DISTANCES OF LINDSTRÖM SNOWFLAKE NETWORKS
- Average distances on substitution trees
- SMALL-WORLD AND SCALE-FREE PROPERTIES OF THE n-DIMENSIONAL SIERPINSKI CUBE NETWORKS
- An analysis of the transition zone between the various scaling regimes in the small-world model
- Complex networks modeled on the Sierpinski gasket
- FRACTAL NETWORKS MODELED BY SOME FRACTAL CARPET
- Average distances of a family of non-p.c.f. self-similar networks
- Fractality and the small-world effect in Sierpiński graphs
- SCALE-FREE AND SMALL-WORLD PROPERTIES OF VAF FRACTAL NETWORKS
- Small-world and scale-free properties of fractal networks modeled on \(n\)-dimensional Sierpinski pyramid
- Construction and property of SA-mixed network models
- Fractal networks with Sturmian structure
- The relations between network-operation and topological-property in a scale-free and small-world network with community structure
- Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
- Eigentime identities of fractal sailboat networks
- On models of fractal networks
- Valency-based topological descriptors and structural property of the generalized Sierpiński networks
- Title not available (Why is that?)
- Random walks on Fibonacci treelike models
- Fractality and the small-world effect in Sierpinski graphs
- The scale-free and small-world properties of complex networks on Sierpinski-type hexagon
- EIGENTIME IDENTITIES OF FRACTAL FLOWER NETWORKS
- Self-similar touching networks. I
- Node-weighted average Fermat distances of fractal tree networks
- A family of small-world network models built by complete graph and iteration-function
- Research on the deterministic complex network model based on the Sierpinski network
- Scaling properties of first return time on weighted transfractals \((1, 3)\)-flowers
This page was built for publication: Scale-free and small-world properties of Sierpinski networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1620137)
