Asymptotic formula on average path length of a special network based on Sierpinski carpet
From MaRDI portal
Publication:4959956
Recommendations
- Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
- Asymptotic formula of average distances on fractal networks modeled by Sierpinski tetrahedron
- Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure
- Average geodesic distance of node-weighted Sierpinski networks
- Average geodesic distance on Sierpinski hexagon and Sierpinski hexagon networks
Cites work
- A class of self-similar fractals with overlap structure
- A small-world and scale-free network generated by Sierpinski pentagon
- A small-world and scale-free network generated by Sierpinski tetrahedron
- Analysis on fractals
- Assouad dimensions of Moran sets and Cantor-like sets
- Assouad-minimality of Moran sets under quasi-Lipschitz mappings
- Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
- Average geodesic distance of Sierpinski carpet
- Average geodesic distance of Sierpinski gasket and Sierpinski networks
- Bilipschitz embedding of self-similar sets
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- First-order network coherence and eigentime identity on the weighted Cayley networks
- Fractal structure on \(k\)-SAT
- Hausdorff measure of Cartesian product of the ternary Cantor set
- Local time of self-affine sets of Brownian motion type -- revisited
- Local time of self-affine sets of Brownian motion type and the jigsaw puzzle problem
- Projective lag synchronization of the general complex dynamical networks with distinct nodes
- SCALE-FREE AND SMALL-WORLD PROPERTIES OF VAF FRACTAL NETWORKS
- Scale-free and small-world properties of Sierpinski networks
- Self-similar subsets of the Cantor set
- The exact solution of the mean geodesic distance for Vicsek fractals
- The modified box dimension and average weighted receiving time of the weighted hierarchical graph
- Topological characterization of the Sierpiński curve
Cited in
(10)- Complex networks modeled on a kind of Sierpiński-like carpet
- ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS
- Mean first-passage times for two biased walks on the weighted rose networks
- Weighted average geodesic distance of Vicsek network in three-dimensional space
- A formula of average path length for unweighted networks
- Scale-free and small-world properties of a multiple-hub network with fractal structure
- Summing the shortest path lengths in a rectangular lattice via recursion
- Asymptotic formula of average distances on fractal networks modeled by Sierpinski tetrahedron
- Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure
- Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
This page was built for publication: Asymptotic formula on average path length of a special network based on Sierpinski carpet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959956)
