Growing Linear Consensus Networks Endowed by Spectral Systemic Performance Measures
Milad Siami, Nader Motee

TL;DR
This paper introduces a spectral systemic performance measure for designing noisy linear consensus networks, providing new algorithms and theoretical limits for optimizing network performance efficiently.
Contribution
It defines a new class of spectral performance measures and develops polynomial-time algorithms for network growth optimization based on these measures.
Findings
Several existing performance measures are shown to belong to the new class.
Two polynomial-time algorithms are proposed for network synthesis.
Theoretical limits on optimal performance are derived.
Abstract
We propose an axiomatic approach for design and performance analysis of noisy linear consensus networks by introducing a notion of systemic performance measure. This class of measures are spectral functions of Laplacian eigenvalues of the network that are monotone, convex, and orthogonally invariant with respect to the Laplacian matrix of the network. It is shown that several existing gold-standard and widely used performance measures in the literature belong to this new class of measures. We build upon this new notion and investigate a general form of combinatorial problem of growing a linear consensus network via minimizing a given systemic performance measure. Two efficient polynomial-time approximation algorithms are devised to tackle this network synthesis problem: a linearization-based method and a simple greedy algorithm based on rank-one updates. Several theoretical fundamental…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Distributed Control Multi-Agent Systems · Complex Network Analysis Techniques
