An alternative approach to determining average distance in a class of scale-free modular networks
arXiv:0911.3454 · doi:10.1088/1742-5468/2010/12/P12017
Abstract
Various real-life networks of current interest are simultaneously scale-free and modular. Here we study analytically the average distance in a class of deterministically growing scale-free modular networks. By virtue of the recursive relations derived from the self-similar structure of the networks, we compute rigorously this important quantity, obtaining an explicit closed-form solution, which recovers the previous result and is corroborated by extensive numerical calculations. The obtained exact expression shows that the average distance scales logarithmically with the number of nodes in the networks, indicating an existence of small-world behavior. We present that this small-world phenomenon comes from the peculiar architecture of the network family.
arXiv commentSubmitted for publicaction
References in corpus (29)
- 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
- Hierarchical Organization in Complex Networks
- Search in Power-Law Networks
- Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?
- Scale-Free Networks are Ultrasmall
- First-passage times in complex scale-invariant media
- Origins of fractality in the growth of complex networks
- Deterministic Scale-Free Networks
- Distance, dissimilarity index, and network community structure
- Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
- Random Walks on deterministic Scale-Free networks: Exact results
- Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
- Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
- Exact scaling properties of a hierarchical network model
- Network Quotients: Structural Skeletons of Complex Systems
- Trapping in scale-free networks with hierarchical organization of modularity
- Mean first-passage time for random walks on the T-graph
- Exactly solvable scale-free network model
- Average distance in a hierarchical scale-free network: an exact solution
- Degree-dependent intervertex separation in complex networks
- Constrained spin dynamics description of random walks on hierarchical scale-free networks
- Transition from fractal to non-fractal scalings in growing scale-free networks
- Contact graphs of disk packings as a model of spatial planar networks