An alternative approach to determining average distance in a class of scale-free modular networks

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.

Submitted for publicaction

References in corpus (11)

• First-passage times in complex scale-invariant media
• 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
• 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
• Average distance in a hierarchical scale-free network: an exact solution
• 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

Cited by in corpus (3)

• Exact calculations of first-passage quantities on recursive networks
• Random walks in modular scale-free networks with multiple traps
• Random walks in unweighted and weighted modular scale-free networks with a perfect trap