Herding Positive, Complex Networks

The problem of controlling complex networks is of interest to disciplines ranging from biology to swarm robotics. However, controllability can be too strict a condition, failing to capture a range of desirable behaviors. Herdability, which describes the ability to drive a system to a specific set in the state space, was recently introduced as an alternative network control notion. This paper considers the application of herdability to the study of complex networks under the assumption that a positive system evolves on the network. The herdability of a class of networked systems is investigated and two problems related to ensuring system herdability are explored. The first is the input addition problem, which investigates which nodes in a network should receive inputs to ensure that the system is herdable. The second is a related problem of selecting the best single node from which to herd the network, in the case that a single node is guaranteed to make the system is herdable. In order to select the best herding node, a novel control energy based herdability centrality measure is introduced.

[1]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[2]  Albert-László Barabási,et al.  Control Principles of Complex Networks , 2015, ArXiv.

[3]  George J. Pappas,et al.  Minimal Actuator Placement With Bounds on Control Effort , 2014, IEEE Transactions on Control of Network Systems.

[4]  Thomas C. Schelling,et al.  Dynamic models of segregation , 1971 .

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

[6]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[7]  George J. Pappas,et al.  Minimal reachability problems , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[8]  B. Bassler,et al.  Quorum sensing in bacteria. , 2001, Annual review of microbiology.

[9]  Tore Opsahl,et al.  Clustering in weighted networks , 2009, Soc. Networks.

[10]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[11]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[12]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[13]  J. Coleman.  Introduction to Mathematical Sociology , 1965 .

[14]  Magnus Egerstedt,et al.  Herdable Systems Over Signed, Directed Graphs , 2018, 2018 Annual American Control Conference (ACC).

[15]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[16]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[17]  Ching-tai Lin.  Structural controllability , 1974 .

[18]  Martin Weißmann,et al.  Kapferer (1969): Norms and the Manipulation of Relationships in a Work Context , 2018, Schlüsselwerke der Netzwerkforschung.

[19]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[20]  M. Egerstedt,et al.  Controllability analysis of multi-agent systems using relaxed equitable partitions , 2010 .

[21]  Christian Commault,et al.  Generic properties and control of linear structured systems: a survey , 2003, Autom..

[22]  Dragoslav D. Šiljak,et al.  Decentralized control of complex systems , 2012 .

[23]  Éva Tardos,et al.  Algorithm design , 2005 .

[24]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[25]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[26]  Alexander Olshevsky,et al.  Minimal Controllability Problems , 2013, IEEE Transactions on Control of Network Systems.

[27]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Soummya Kar,et al.  A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems , 2013, IEEE Transactions on Automatic Control.

[29]  Alessandro Vespignani,et al.  Reaction–diffusion processes and metapopulation models in heterogeneous networks , 2007, cond-mat/0703129.

[30]  P. Killworth,et al.  Informant accuracy in social network data IV: a comparison of clique-level structure in behavioral and cognitive network data , 1979 .

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

[32]  Norman,et al.  Structural Models: An Introduction to the Theory of Directed Graphs. , 1966 .

[33]  Steven R. Asher,et al.  Friendship and Friendship Quality in Middle Childhood: Links with Peer Group Acceptance and Feelings of Loneliness and Social Dissatisfaction. , 1993 .

[34]  M. James,et al.  The generalised inverse , 1978, The Mathematical Gazette.

[35]  S. Rinaldi,et al.  Positive Linear Systems: Theory and Applications , 2000 .

[36]  Christian Commault,et al.  Input addition and leader selection for the controllability of graph-based systems , 2013, Autom..

[37]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[38]  Naomi Ehrich Leonard,et al.  Optimal leader selection for controllability and robustness in multi-agent networks , 2016, 2016 European Control Conference (ECC).

[39]  Michaell Taylor,et al.  Towards a Mathematical Theory of Influence and Attitude Change , 1968 .

[40]  Kenneth E. Boulding,et al.  Introduction to Mathematical Sociology. , 1966 .

[41]  Francesco Bullo,et al.  Controllability Metrics, Limitations and Algorithms for Complex Networks , 2013, IEEE Transactions on Control of Network Systems.

[42]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..