Edge controllability of signed networks
The edge controllability of signed networks, where the dynamics taking place on edges and the interaction type over each edge can be cooperative or antagonistic is studied in this manuscript using graph-theoretic perspective. Then the lower and upper bounds for the dimension of edge controllable subspace are discussed, respectively.The relationship between edge controllability and vertex controllability(edge dynamics is equivalent to that of the vertex dynamics when the communication graph is structurally unbalanced) is analyzed which is very appreciable. Furthermore, the edge structural controllability of signed networks is investigated, and a graph-theoretic necessary and sufficient condition for edge structural controllability is presented. Finally, the traffic flow control of urban traffic networks is presented as the applications of our theoretical results. I found this paper is very interesting and will be useful to the readers for the future work.
scientific article; zbMATH DE number 7630430
scientific article