Joint Centrality Distinguishes Optimal Leaders in Noisy Networks

DOI10.1109/TCNS.2015.2481138MaRDI QIDQ5358512zbMATH OpenFDO

Authors Katherine Fitch, Naomi Ehrich Leonard

Publication date 21 September 2017

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.1569

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hierarchical games (including Stackelberg games) (91A65) Design techniques (robust design, computer-aided design, etc.) (93B51) Stochastic systems in control theory (general) (93E03)

Abstract: We study the performance of a network of agents tasked with tracking an external unknown signal in the presence of stochastic disturbances and under the condition that only a limited subset of agents, known as leaders, can measure the signal directly. We investigate the optimal leader selection problem for a prescribed maximum number of leaders, where the optimal leader set minimizes total system error defined as steady-state variance about the external signal. In contrast to previously established greedy algorithms for optimal leader selection, our results rely on an expression of total system error in terms of properties of the underlying network graph. We demonstrate that the performance of any given set of leaders depends on their influence as determined by a new graph measure of centrality of a set. We define the $joint;centrality$ of a set of nodes in a network graph such that a leader set with maximal joint centrality is an optimal leader set. In the case of a single leader, we prove that the optimal leader is the node with maximal information centrality. In the case of multiple leaders, we show that the nodes in the optimal leader set balance high information centrality with a coverage of the graph. For special cases of graphs, we solve explicitly for optimal leader sets. We illustrate with examples.

Recommendations

• Choosing a leader on a complex network
• A Resistance-Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks
• Optimizing Leader Influence in Networks Through Selection of Direct Followers
• Information Centrality and Ordering of Nodes for Accuracy in Noisy Decision-Making Networks
• Leader selection in networks under switching topologies with antagonistic interactions

Cited in

(9)

• Exponential consensus of discrete-time systems based on a novel Krasovskii-Lasalle theorem under directed switching networks
• Leader selection in networks under switching topologies with antagonistic interactions
• Centrality in time-delay consensus networks with structured uncertainties
• Distributed randomized algorithms for opinion formation, centrality computation and power systems estimation: a tutorial overview
• Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
• Reduced-order model predictive control of a fish schooling model
• Retracted: State estimation of Takagi-Sugeno fuzzy system in networked control system with stochastic time delays under unknown attacks
• Real-time sensor selection for time-varying networks with guaranteed performance
• Diagonal of pseudoinverse of graph Laplacian: fast estimation and exact results

This page was built for publication: Joint Centrality Distinguishes Optimal Leaders in Noisy Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358512)