Efficient identification of link importance in dynamic networks

For a given network topology of linking dynamical systems, determining the least or the most important link(s) or edge(s) in dynamic networks is a complex combinatorial optimization problem. The purpose of solving this problem is to modify the given network topology, in the hope of using a less number of costly communication links while keeping or improving the network׳s performance. In this paper, this identification of link importance is approached via finding the least or the most sensitive edge(s) by analytically obtaining the sensitivity of each edge or numerically solving LMIs (linear matrix inequalities). The proposed schemes are applied to a consensus network, a vehicle network and random networks to support their merit.