One of the fundamental problems in pinning control of complex networks is selecting appropriate pinning nodes, such that the whole system is controlled. This is particularly useful for complex networks with huge numbers of nodes. Recent research has yielded several pinning node selection strategies, which may be efficient. However, selecting a set of pinning nodes and identifying the nodes that should be selected first remain challenging problems. In this paper, we present a network control strategy based on left Perron vector. For directed networks where nodes have the same in- and out-degrees, there has so far been no effective pinning node selection strategy, but our method can find suitable nodes. Likewise, our method also performs well for undirected networks where the nodes have the same degree. In addition, we can derive the minimum set of pinning nodes and the order in which they should be selected for given coupling strengths. Our proofs of these results depend on the properties of non-negative matrices and M-matrices. Several examples show that this strategy can effectively select appropriate pinning nodes, and that it can achieve better results for both directed and undirected networks.
complex network pinning control Perron root left Perron vector M-matrices
This is a preview of subscription content, log in to check access.
Sanchez E N, Rodriguez-Castellanos D I, Chen G, et al. Pinning control of complex network synchronization: A recurrent neural network approach. Int J Control Autom Syst, 2017, 15: 1405–1414CrossRefGoogle Scholar
Song Q, Liu F, Cao J, et al. M-matrix strategies for pinning-controlled leader-following consensus in multiagent systems with nonlinear dynamics. IEEE Trans Cybern, 2013, 43: 1688–1697CrossRefGoogle Scholar
Song Q, Cao J. On pinning synchronization of directed and undirected complex dynamical networks. IEEE Trans Circuits Syst I, 2010, 57: 672–680MathSciNetCrossRefGoogle Scholar