Exact solution of mean geodesic distance for Vicsek fractals

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.

arXiv comment4 pages, 3 figures

References in corpus (17)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Evolution of networks
• Characterization of complex networks: A survey of measurements
• Scale-Free Networks are Ultrasmall
• First-passage times in complex scale-invariant media
• Pseudofractal Scale-free Web
• Deterministic Scale-Free Networks
• Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
• Percolation in Hierarchical Scale-Free Nets
• Universal scaling of distances in complex networks
• Exact analytical solution of average path length for Apollonian networks
• Kleinberg Navigation in Fractal Small World Networks
• Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
• Degree-dependent intervertex separation in complex networks
• A geometric growth model interpolating between regular and small-world networks
• Vertex labeling and routing in expanded Apollonian networks

Cited by in corpus (9)

• Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices
• Trapping in dendrimers and regular hyperbranched polymers
• Laplacian spectra of recursive treelike small-world polymer networks: Analytical solutions and applications
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Mean first-passage time for random walks on the T-graph
• Average distance in a hierarchical scale-free network: an exact solution
• Closed Contour Fractal Dimension Estimation by the Fourier Transform
• The rigorous solution for the average distance of a Sierpinski network
• Root mean squares of distance and geodesic between two constituent particles within fractal aggregates prepared by BCCA, DLA, and GSAW procedures