Efficient identification of link importance in dynamic networks

DOI10.1016/j.jfranklin.2014.11.011zbMath1395.93179OpenAlexW2053253499MaRDI QIDQ1660587

Yoonsoo Kim

Publication date: 16 August 2018

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2014.11.011

zbMATH Keywords

dynamic networksefficient identificationlink importance

Mathematics Subject Classification ID

Applications of graph theory (05C90) Sensitivity (robustness) (93B35) Control/observation systems governed by partial differential equations (93C20) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (3)

Merging relative sensing networks: a stability margin perspective ⋮ Sensitivity-based link addition for robust linear dynamical networks ⋮ Partitioning of relative sensing networks: a stability margin perspective

Uses Software

• SeDuMi
• YALMIP
• SeDuMi Interface

Cites Work

• Structural controllability of multi-agent networks: robustness against simultaneous failures
• Decentralized control of vehicle formations
• Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
• Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks
• Augmented Lagrangian Approach to Design of Structured Optimal State Feedback Gains
• Graph Weight Allocation to Meet Laplacian Spectral Constraints
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Efficient identification of link importance in dynamic networks