The efficiency analysis of several categories of pinning strategies of a complex network

In this paper, noticing the fact that the BC-based selective pinning strategy leads to a high computational cost with depending on the global connectivity information of a dynamical network, while the degree-based selective pinning strategy depends only on the local information of a network topology, to evaluate the pinning efficiency of different selective strategies with local and/or global network connectivity information, we have newly proposed a compromised selective pinning strategy which mixes the vertex information of BC and degree. With the effectiveness verifications of the protein-protein network in yeast and the U.S.A. airline routing map, we find that in a suitable mixing weight, the compromised selective pinning strategy achieves almost the same pinning efficiency as that of the BC-based pinning strategy, which however does not completely depend on the global connectivity information. These findings are very important to shed lights to the design of a new effective selective pinning strategy in the situations of real-time networking control systems.