Distance distribution in extreme modular networks

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

פרסום מחקרי: פרסום בכתב עתמאמרביקורת עמיתים

תקציר

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.

שפה מקוריתאנגלית
מספר המאמר022313
כתב עתPhysical Review E
כרך101
מספר גיליון2
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - פבר׳ 2020

ASJC Scopus subject areas

  • ???subjectarea.asjc.3100.3104???
  • ???subjectarea.asjc.3100.3109???
  • ???subjectarea.asjc.2600.2613???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Distance distribution in extreme modular networks'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי