Optimizing network robustness by edge rewiring: a general framework

DOI10.1007/s10618-015-0447-5zbMath1409.05190OpenAlexW2341112116MaRDI QIDQ1741288

Leman Akoglu, Hau Chan

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-015-0447-5

zbMATH Keywords

optimization algorithmsgraph spectrumattack toleranceedge rewiringgraph robustnessrobustnesss measures

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Node and network resistance to bribery in multi-agent systems ⋮ Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating ⋮ Optimally connected hybrid complex networks with windmill graphs backbone ⋮ Robustness on topology reconfiguration of complex networks: an entropic approach ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic ⋮ ``Melting of complex networks. A mathematical model of complex networks resilience to external stress ⋮ EdgeRewire ⋮ Multi-objective Optimization to Improve Robustness in Networks

Uses Software

• OddBall

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective graph resistance
• Influence of assortativity and degree-preserving rewiring on the spectra of networks
• Spectra of graphs
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Network robustness to targeted attacks. The interplay of expansibility and degree distribution
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• The electrical resistance of a graph captures its commute and cover times
• The number of nets of the regular convex polytopes in dimension \(\leq 4\)
• Optimizing algebraic connectivity by edge rewiring
• Maximum algebraic connectivity augmentation is NP-hard
• Minimizing Effective Resistance of a Graph

This page was built for publication: Optimizing network robustness by edge rewiring: a general framework