The rigorous solution for the average distance of a Sierpinski network
arXiv:0810.5172 · doi:10.1088/1742-5468/2009/02/P02034
Abstract
The closed-form solution for the average distance of a deterministic network--Sierpinski network--is found. This important quantity is calculated exactly with the help of recursion relations, which are based on the self-similar network structure and enable one to derive the precise formula analytically. The obtained rigorous solution confirms our previous numerical result, which shows that the average distance grows logarithmically with the number of network nodes. The result is at variance with that derived from random networks.
Definitive version (9 pages, 6 figures) published in J. Stat. Mech
References in corpus (9)
- Efficient routing on complex networks
- Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
- Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
- Exact solution of mean geodesic distance for Vicsek fractals
- Emergence of Symmetry in Complex Networks
- Hierarchical, Regular Small-World Networks
- Network Quotients: Structural Skeletons of Complex Systems
- Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
- Fractal scale-free networks resistant to disease spread