Pinning Control of Complex Networks Based on Node In-Out Degree and Neighbor Nodes

In order to solve the selection problem of pinning nodes in directed and weighted networks, a new pinning control algorithm called DN (node in-out degree and neighbor nodes) is proposed. Firstly, based on the general dynamic model, the synchronicity of the complex network is analyzed, and the conditions for the complex network to achieve synchronization are obtained. Secondly, the pinning control algorithm of nodes is given, and the ranking of pinning nodes in the network is obtained through this algorithm. The conditions under which synchronization is achieved through a complex network determine which nodes in the network should be pinned. Finally, an experimental simulation is carried out on a directed weighted network. By comparing the node pinning control strategy based on the adjacency information entropy, it is concluded that under the same coupling strength, in order to achieve synchronization of the network, the number of nodes pinned by this algorithm is less.