The exact solution of the mean geodesic distance for Vicsek fractals
From MaRDI portal
Publication:3548669
DOI10.1088/1751-8113/41/48/485102zbMATH Open1156.28003arXiv0803.3386OpenAlexW3104213302MaRDI QIDQ3548669FDOQ3548669
Authors: Zhongzhi Zhang, Shuigeng Zhou, Lichao Chen, Ming Yin, Jihong Guan 
Publication date: 16 December 2008
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Abstract: The Vicsek fractals are one of the most interesting classes of fractals and the study of their structural properties is important. In this paper, the exact formula for the mean geodesic distance of Vicsek fractals is found. The quantity is computed precisely through the recurrence relations derived from the self-similar structure of the fractals considered. The obtained exact solution exhibits that the mean geodesic distance approximately increases as an exponential function of the number of nodes, with the exponent equal to the reciprocal of the fractal dimension. The closed-form solution is confirmed by extensive numerical calculations.
Full work available at URL: https://arxiv.org/abs/0803.3386
Recommendations
- Estimate the shortest paths on fractal \(m\)-gons
- Weighted average geodesic distance of Vicsek network in three-dimensional space
- Average distance of self-similar fractal trees
- NODE-WEIGHTED AVERAGE DISTANCES OF NETWORKS MODELED ON THREE-DIMENSIONAL VICSEK FRACTAL
- Mean geodesic distance of the level-\(n\) Sierpinski gasket
Cited In (29)
- Complex networks modeled on a kind of Sierpiński-like carpet
- Average Fermat distances of two-colored substitution networks
- Expanded Koch networks: structure and trapping time of random walks
- ECCENTRIC DISTANCE SUM OF SUBSTITUTION TREE NETWORKS
- The intrinsic metric on the box fractal
- A small-world and scale-free network generated by Sierpinski pentagon
- Scale-free and small-world properties of Sierpinski networks
- Self-similar touching networks. II
- AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS
- Scale-free and small-world properties of hollow cube networks
- Estimate the shortest paths on fractal \(m\)-gons
- Asymptotic formula on average path length of a special network based on Sierpinski carpet
- Asymptotic formula of average distances on fractal networks modeled by Sierpinski tetrahedron
- Average distance of self-similar fractal trees
- Asymptotic formula of eccentric distance sum for Vicsek network
- Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
- Average geodesic distance of skeleton networks of Sierpinski tetrahedron
- Fractality of evolving self-similar networks
- AVERAGE FERMAT DISTANCES ON VICSEK NETWORKS
- ECCENTRIC STEINER DISTANCE SUM OF VICSEK NETWORKS
- 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
- MEAN STEINER DISTANCE OF VICSEK NETWORKS
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Small-world and scale-free properties of fractal networks modeled on \(n\)-dimensional Sierpinski pyramid
- Analyses of some structural properties on a class of hierarchical scale-free networks
- A deterministic pseudo-fractal networks with time-delay
- Self-similar touching networks. I
This page was built for publication: The exact solution of the mean geodesic distance for Vicsek fractals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548669)
