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 (30)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Assortative mixing in networks
- Hierarchical organization of modularity in metabolic networks
- Evolution of networks
- Characterization of complex networks: A survey of measurements
- Self-similarity of complex networks
- Scale-Free Networks are Ultrasmall
- Efficient routing on complex networks
- Origins of fractality in the growth of complex networks
- Pseudofractal Scale-free Web
- Deterministic Scale-Free Networks
- Average path length in random networks
- Average path length in uncorrelated random networks with hidden variables
- A Geometric Fractal Growth Model for 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
- Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
- Metric structure of random networks
- Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
- Exact solution of mean geodesic distance for Vicsek fractals
- Universal scaling of distances in complex networks
- 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
- Degree-dependent intervertex separation in complex networks
- Vertex labeling and routing in expanded Apollonian networks