Energy-Transfer Edge Centrality and Its Role in Enhancing Network Controllability

The ability to modify the structure of network systems offers great opportunities to enhance their operation, improve their efficiency, and increase their resilience against failures and attacks. This paper focuses on the edge modification problem, i.e., improving network controllability by adding and/or re-weighting interconnections while keeping the actuation structure fixed. We consider a network system following linear dynamics and propose a novel edge centrality measure that captures the extent to which an edge facilitates energy exchange across the network through its defining nodes. We analyze the effectiveness of the proposed measure by characterizing its relationship with the gradient (with respect to edge weights) of trace, logdet and inverse of the trace inverse of the Gramian. We show that the optimal solution of the edge modification problem lies on the boundary of the feasible search space when the objective is the trace of the Gramian or the network has a diagonal controllability Gramian and the objective is either logdet or the inverse of the trace inverse of the Gramian. Finally, using the proposed edge centrality measure we design two network modification algorithms that restrict the search space to a smaller subset of all possible edges and numerically demonstrate their efficacy.

[1]  H. Weber,et al.  Analysis and optimization of certain qualities of controllability and observability for linear dynamical systems , 1972 .

[2]  Milad Siami,et al.  Centrality in Time-Delay Consensus Networks with Structured Uncertainties , 2019, Autom..

[3]  George J. Pappas,et al.  Network design for controllability metrics , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[4]  Basel Alomair,et al.  Submodularity in Dynamics and Control of Networked Systems , 2016 .

[5]  Bai Zhang,et al.  Network Biology in Medicine and Beyond , 2014, Circulation. Cardiovascular genetics.

[6]  Virginia Rutten,et al.  Efficient communication over complex dynamical networks: The role of matrix non-normality , 2020, Science Advances.

[7]  Christine Klymko,et al.  Centrality and Communicability Measures in Complex Networks: Analysis and Algorithms , 2014 .

[8]  Te-son Kuo,et al.  Trace bounds on the solution of the algebraic matrix Riccati and Lyapunov equation , 1986 .

[9]  John Lygeros,et al.  On Submodularity and Controllability in Complex Dynamical Networks , 2014, IEEE Transactions on Control of Network Systems.

[10]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[11]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[12]  Francesco Bullo,et al.  Controllability Metrics, Limitations and Algorithms for Complex Networks , 2013, IEEE Transactions on Control of Network Systems.

[13]  Shiyu Zhao,et al.  Networks with diagonal controllability Gramian: Analysis, graphical conditions, and design algorithms , 2019, Autom..

[14]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[15]  Satoru Iwata,et al.  Submodular function minimization , 2007, Math. Program..

[16]  Chinwendu Enyioha,et al.  Optimal Resource Allocation for Network Protection Against Spreading Processes , 2013, IEEE Transactions on Control of Network Systems.

[17]  Robert L. Wolpert,et al.  Statistical Inference , 2019, Encyclopedia of Social Network Analysis and Mining.

[18]  Hai Zhuge,et al.  Topological centrality and its e-Science applications , 2010, J. Assoc. Inf. Sci. Technol..

[19]  Ramkrishna Pasumarthy,et al.  Optimizing Average Controllability of Networked Systems , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[20]  Jie Ren,et al.  Controlling complex networks: How much energy is needed? , 2012, Physical review letters.

[21]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[22]  Jean D. Gibbons,et al.  Nonparametric Statistical Inference : Revised and Expanded , 2014 .

[23]  Milad Siami,et al.  Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds , 2018, IEEE Transactions on Automatic Control.

[24]  Mihailo R. Jovanovic,et al.  Edge addition in directed consensus networks , 2017, 2017 American Control Conference (ACC).

[25]  Claudio Altafini,et al.  Combining centrality measures for control energy reduction in network controllability problems , 2019, 2019 18th European Control Conference (ECC).

[26]  Chi-Tsong Chen,et al.  Linear System Theory and Design , 1995 .

[27]  Michele Benzi,et al.  Edge Modification Criteria for Enhancing the Communicability of Digraphs , 2015, SIAM J. Matrix Anal. Appl..

[28]  Milad Siami,et al.  Growing Linear Dynamical Networks Endowed by Spectral Systemic Performance Measures , 2018, IEEE Transactions on Automatic Control.

[29]  Shiyu Zhao,et al.  Discrete-Time Dynamical Networks with Diagonal Controllability Gramian , 2017 .

[30]  Giacomo Baggio,et al.  On the Role of Network Centrality in the Controllability of Complex Networks , 2015, IEEE Transactions on Control of Network Systems.

[31]  Jorge Cortes,et al.  Heterogeneity of central nodes explains the benefits of time-varying control scheduling in complex dynamical networks , 2019, J. Complex Networks.

[32]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[33]  H. Wolkowicz,et al.  Bounds for eigenvalues using traces , 1980 .

[34]  George J. Pappas,et al.  Minimal Edge Addition for Network Controllability , 2019, IEEE Transactions on Control of Network Systems.

[35]  Andreas Krause,et al.  Guarantees for Greedy Maximization of Non-submodular Functions with Applications , 2017, ICML.

[36]  Shapour Azarm,et al.  Optimal actuator placement for linear systems with limited number of actuators , 2017, 2017 American Control Conference (ACC).

[37]  Harold R. Parks,et al.  A Primer of Real Analytic Functions , 1992 .

[38]  Michele Benzi,et al.  Updating and Downdating Techniques for Optimizing Network Communicability , 2014, SIAM J. Sci. Comput..

[39]  Jonathan Currie,et al.  Opti: Lowering the Barrier Between Open Source Optimizers and the Industrial MATLAB User , 2012 .

[40]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[41]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[42]  W. Marsden.  I and J , 2012 .

[43]  Naomi Ehrich Leonard,et al.  Joint Centrality Distinguishes Optimal Leaders in Noisy Networks , 2014, IEEE Transactions on Control of Network Systems.

[44]  George J. Pappas,et al.  Minimal Actuator Placement With Bounds on Control Effort , 2014, IEEE Transactions on Control of Network Systems.

[45]  M. Kendall.  Statistical Methods for Research Workers , 1937, Nature.

[46]  Jorge Cortés Monforte.  Geometric, control and numerical aspects of nonholonomic systems , 2002 .

[47]  Jorge Cortés,et al.  Network Modification using a Novel Gramian-based Edge Centrality , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[48]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..