Joint Centrality Distinguishes Optimal Leaders in Noisy Networks

DOI10.1109/TCNS.2015.2481138zbMath1370.93241arXiv1407.1569MaRDI QIDQ5358512

Naomi Ehrich Leonard, Katherine Fitch

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)

Related Items (6)

Leader selection in networks under switching topologies with antagonistic interactions ⋮ Centrality in time-delay consensus networks with structured uncertainties ⋮ 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 ⋮ Exponential consensus of discrete-time systems based on a novel Krasovskii-Lasalle theorem under directed switching networks ⋮ Distributed randomized algorithms for opinion formation, centrality computation and power systems estimation: a tutorial overview

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