Optimizing algebraic connectivity by edge rewiring

DOI10.1016/J.AMC.2012.11.002MaRDI QIDQ2434853zbMATH OpenOpenAlexFDO

Authors Ali Sydney, Caterina Scoglio, Don M. Gruenbacher

Publication date 31 January 2014

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2012.11.002

zbMATH Keywords

algebraic connectivitycomplex networksoptimizationrewiringrobustness

Mathematics Subject Classification ID

Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Finding diverse ways to improve algebraic connectivity through multi-start optimization
• Optimizing network robustness by edge rewiring: a general framework
• Tabu search enhances network robustness under targeted attacks
• Multi-objective optimization to improve robustness in networks
• A new way to improve the robustness of complex communication networks by allocating redundancy links

Cited in

(23)

• A new method optimizing the subgraph centrality of large networks
• Heuristics for synthesizing robust networks with a diameter constraint
• Fast consensus seeking on networks with antagonistic interactions
• Optimizing network robustness by edge rewiring: a general framework
• Robustness on topology reconfiguration of complex networks: an entropic approach
• Improving connectivity of compromised digital networks via algebraic connectivity maximisation
• Enhancing robustness of interdependent network by adding connectivity and dependence links
• Optimally connected hybrid complex networks with windmill graphs backbone
• A maximum algebraic connectivity increment edge-based strategy for capacity enhancement in scale-free networks
• Multi-objective optimization to improve robustness in networks
• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• Finding diverse ways to improve algebraic connectivity through multi-start optimization
• Finite-time consensus for multi-agent systems with nonlinear dynamics under Euler digraph via pinning control
• Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems
• Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
• Hypergraph analysis based on a compatible tensor product structure
• Effects on the algebraic connectivity of weighted graphs under edge rotations
• The consensus performance of leader-follower multi-agent systems under reversing the directions of arcs
• Interaction topology optimization by adjustment of edge weights to improve the consensus convergence and prolong the sampling period for a multi-agent system
• The role of arc rotation on improving consensus convergence rate for a leader-follower multi-agent system
• The algebraic connectivity of unicyclic digraphs
• Two sufficient conditions for altering algebraic connectivity via edge addition in single-root digraphs
• Improving consensus convergence rate and increasing sample period for sampled-data consensus of multi-agent systems based on rewiring

This page was built for publication: Optimizing algebraic connectivity by edge rewiring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434853)