Structural robustness and transport efficiency of complex networks with degree correlation

2012/09/21 by Toshihiro Tanizawa, Tanizawa, Toshihiro
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Computer and information sciences #FOS: Physical sciences #Opinion Dynamics and Social Influence #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI) #Theoretical and Computational Physics #cs.SI #physics.soc-ph

paper · pdf · doi:10.48550/arxiv.1209.4897

15 pages, 5 figures

arxiv created 2012/09/21 · openalex publication_date 2012/09/21 · arxiv updated 2012/09/25 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

We examine two properties of complex networks, the robustness against targeted node removal (attack) and the transport efficiency in terms of degree correlation in node connection by numerical evaluation of exact analytic expressions. We find that, while the assortative correlation enhances the structural robustness against attack, the disassortative correlation significantly improves the transport efficiency of the network under consideration. This finding might shed light on the reason why some networks in the real world prefer assortative correlation and others prefer disassortative one.

Related

• Degree-correlation, robustness, and vulnerability in finite scale-free\n networks
• On the influence of topological characteristics on robustness of complex networks
• On degree-degree correlations in multilayer networks
• Structural dependence of robustness and load tolerance in scale-free networks
• Structural robustness of networks with degree-degree correlations between second-nearest neighbors