Optimizing Leader Influence in Networks Through Selection of Direct Followers

DOI10.1109/TAC.2018.2850287zbMath1482.91166arXiv1806.07070OpenAlexW2963830476WikidataQ129610499 ScholiaQ129610499MaRDI QIDQ4629892

Van Sy Mai, Eyad H. Abed

Publication date: 28 March 2019

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (2)

Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models ⋮ A first hitting time approach to finding effective spreaders in a network

This page was built for publication: Optimizing Leader Influence in Networks Through Selection of Direct Followers