Topology design for optimal network coherence

We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph to optimize the coherence of the resulting network. We show that network coherence is a submodular function of the network topology. As a consequence, a simple greedy algorithm is guaranteed to produce near optimal edge set selections. We also show that fast rank one updates of the Laplacian pseudoinverse using generalizations of the Sherman-Morrison formula and an accelerated variant of the greedy algorithm can speed up the algorithm by several orders of magnitude in practice. These allow our algorithms to scale to network sizes far beyond those that can be handled by convex relaxation heuristics.

[1]  M. Randic,et al.  Resistance distance , 1993 .

[2]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[3]  Bassam Bamieh,et al.  Network coherence in fractal graphs , 2011, IEEE Conference on Decision and Control and European Control Conference.

[4]  Michel Minoux,et al.  Accelerated greedy algorithms for maximizing submodular set functions , 1978 .

[5]  F. Spieksma,et al.  Effective graph resistance , 2011 .

[6]  Milad Siami,et al.  Fundamental Limits and Tradeoffs on Disturbance Propagation in Linear Dynamical Networks , 2014, IEEE Transactions on Automatic Control.

[7]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[8]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[9]  J. Meyer.  Generalized Inversion of Modified Matrices , 1973 .

[10]  Bassam Bamieh,et al.  Leader selection for optimal network coherence , 2010, 49th IEEE Conference on Decision and Control (CDC).

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

[12]  Bassam Bamieh,et al.  Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback , 2011, IEEE Transactions on Automatic Control.

[13]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[14]  John Lygeros,et al.  Optimal Sensor and Actuator Placement in Complex Dynamical Networks , 2013, ArXiv.

[15]  Andreas Krause,et al.  Submodular Function Maximization , 2014, Tractability.

[16]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..

[17]  Tyler H. Summers,et al.  Rigid Network Design Via Submodular Set Function Optimization , 2015, IEEE Transactions on Network Science and Engineering.

[18]  Fu Lin,et al.  Algorithms for Leader Selection in Stochastically Forced Consensus Networks , 2013, IEEE Transactions on Automatic Control.

[19]  Fu Lin,et al.  Algorithms for leader selection in large dynamical networks: Noise-free leaders , 2011, IEEE Conference on Decision and Control and European Control Conference.

[20]  Naomi Ehrich Leonard,et al.  Information centrality and optimal leader selection in noisy networks , 2013, 52nd IEEE Conference on Decision and Control.

[21]  Pushmeet Kohli,et al.  Tractability: Practical Approaches to Hard Problems , 2013 .

[22]  Bassam Bamieh,et al.  The price of synchrony: Resistive losses due to phase synchronization in power networks , 2012, 2013 American Control Conference.

[23]  Gene H. Golub,et al.  The differentiation of pseudo-inverses and non-linear least squares problems whose variables separate , 1972, Milestones in Matrix Computation.

[24]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[25]  Radha Poovendran,et al.  A Supermodular Optimization Framework for Leader Selection Under Link Noise in Linear Multi-Agent Systems , 2012, IEEE Transactions on Automatic Control.

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

[27]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[28]  John Lygeros,et al.  Submodularity of energy related controllability metrics , 2014, 53rd IEEE Conference on Decision and Control.

[29]  Fu Lin,et al.  Algorithms for leader selection in large dynamical networks: Noise-corrupted leaders , 2011, IEEE Conference on Decision and Control and European Control Conference.