Distance distribution in extreme modular networks

Eitan E. Asher, Hillel Sanhedrai, Nagendra K. Panduranga, Reuven Cohen, Shlomo Havlin

Research output: Contribution to journalArticlepeer-review


Modularity is a key organizing principle in real-world large-scale complex networks. Many real-world networks exhibit modular structures such as transportation infrastructures, communication networks, and social media. Having the knowledge of the shortest paths length distribution between random pairs of nodes in such networks is important for understanding many processes, including diffusion or flow. Here, we provide analytical methods which are in good agreement with simulations on large scale networks with an extreme modular structure. By extreme modular, we mean that two modules or communities may be connected by maximum one link. As a result of the modular structure of the network, we obtain a distribution showing many peaks that represent the number of modules a typical shortest path is passing through. We present theory and results for the case where interlinks are weighted, as well as cases in which the interlinks are spread randomly across nodes in the community or limited to a specific set of nodes.

Original languageEnglish
Article number022313
Number of pages13
JournalPhysical Review E
Issue number2
StatePublished - Feb 2020

All Science Journal Classification (ASJC) codes

  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Statistics and Probability


Dive into the research topics of 'Distance distribution in extreme modular networks'. Together they form a unique fingerprint.

Cite this