Abstract
One of the ultimate goals of studying network dynamics and its properties is to control it. In the past 20 years, with the joint efforts of many scientists, the theory of controlling a whole network through a small set of nodes, which are called driver nodes (DN) has made great progress. However, the full control of networks may be neither feasible nor necessary in some real systems with huge size and high complexity, which motivate scientists to explore target control theory, i.e., the efficient control for a subset of nodes in a network through a small node set. And in a real network, there is another common situation, which is not each node can be easily accessed. Therefore, it is meaningful to explore the target control strategy under the condition that the driver nodes are constrained. In this paper, an effective method is proposed to make more DN be included in the constrained node set (CNs). We adopt the strategy of greedy algorithm to gradually constrain DN into CNs in the iterative process of target control. In each iteration, we will adjust the strategy of how to choose driver nodes according to some network properties. And a few experiments were presented to prove that the proposed method can make DN into CNs effectively in both Scale-free networks (SF) and Erdös-Rényi (ER) networks. Then, we explored the performance of this method in the case of local and random selection of target nodes, respectively. In addition, some factors that will affect the effects of this method were also explored in this paper. In the end, this method is proved valid through the verification of the real network data sets.
Highlights
IntroductionThrough nearly 20 years of unremitting efforts, great progress has been made in the understanding of network topology and its dynamical properties
The driver nodes (DN) can not totally be the nodes in constrained node set (CNs), so we define the following index to evaluate the performance of this algorithm: N
C means the number of the constrained nodes and N means the number of the total nodes
Summary
Through nearly 20 years of unremitting efforts, great progress has been made in the understanding of network topology and its dynamical properties. Link prediction [14, 25], community discovery [1, 22], structure and dynamics of network [4, 13] have received extensive attention. These research achievements create the knowledge foundation based on which the controllability issues of network can be investigated effectively. Among these issues, topological [30] and dynamical [6] properties of network are the two most important aspects, which can determine the number of the external inputs and the energy of control, etc. In this paper, we explore the control process in a complex network with linear dynamics
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
