-
Controlling a complex network to achieve a certain desired objective is an important task for various interacting systems. In many practical situations, it is expensive and unrealistic to control all nodes especially in a large-scale complex network. In order to reduce control cost, one turns to control a small part of nodes in the network, which is called pinning control. This research direction has been widely concerned and much representative progress has been achieved so far. However, to achieve an optimal performance, two key questions about the node-selection scheme remain open. One is how many nodes need controlling and the other is which nodes the controllers should be applied to. It has been revealed in our recent work that the effectiveness of node-selection scheme can be evaluated by the smallest eigenvalue
$ {\rm{\lambda }}_{1} $ of the grounded Laplacian matrix obtained by deleting the rows and columns corresponding to the pinned nodes from the Laplacian matrix of the network. As a further study of our previous work, we study node selection algorithm for optimizing pinning control in depth, based on the proposed index$ {\rm{\lambda }}_{1} $ and its spectral properties. As is well known, it is an NP-hard problem to obtain the maximum of$ {\rm{\lambda }}_{1} $ by numerical calculations when the number of pinned nodes is given. To solve this challenge problem, in this paper a filtering algorithm is proposed to find most important nodes, which results in an optimal$ {\rm{\lambda }}_{1} $ when the number of pinned nodes is given. The method can be applied to any type of undirected networks. Furthermore, in this paper we propose the concept of node-set importance in complex networks from the perspective of network control, which is different from the existing definitions about node importance of complex networks: The importance of a node set and the selected nodes in this paper depends on the number of pinned nodes; if the number of pinned nodes is different, the selected nodes will be different. The concept of node-set importance reflects the effect of nodes’ combination in a network. It is expected that the obtained results are helpful in guiding the optimal control problems in practical networks.[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] -
节点的度 128 122 103 98 87 86 75 63 60 58 53 51 51 49 47 43 42 节点编号 2 11 3 18 1 9 4 8 14 31 21 17 10 63 34 20 13 
DownLoad:
CSV
网络参数 l= 2 l= 3 l= 4 l= 5 l= 6 NW:N= 1000,P= 0.05 3.9 11.9 30.3 51.0 89.1 NW:N= 1000,P= 0.025 11.3 27.9 53.4 132.9 216.1 BA:N= 1000,q= 10 5.7 13.2 18.6 22.1 38.4 BA:N= 1000,q= 8 6.7 14.2 22.5 51.2 176.3 BA:N= 1000,q= 5 7.1 15.3 67.1 177.5 1000 BA:N= 1000,q= 3 10.2 55.7 1000.0 1000.0 1000.0 DownLoad:
CSV
网络参数 l= 2 l= 3 l= 4 l= 5 l= 6 NW:N= 1000,P= 0.05 5.1 33.3 216.1 1136.5 4245.8 NW:N= 1000,P= 0.025 18.2 215.6 1009.5 1.1 × 104 4.7 × 104 BA:N= 1000,q= 10 3.3 11.5 34.3 163.1 1801.6 BA:N= 1000,q= 8 6.3 16.3 83.8 233.5 2583.7 BA:N= 1000,q= 5 21.6 69.5 306.5 2203.8 2.4 × 104 BA:N= 1000,q= 3 25.3 307.3 4376.2 2.2 × 105 4.5 × 106 DownLoad:
CSV
受控
节点数度算法 BC算法 K-shell算法 ESI算法 本文算法 l= 2 (15, 46)
${\lambda _1} = 0.1001$(37, 2)
${\lambda _1} = 0.1376$(19, 30)
${\lambda _1} = 0.0828$(15, 38)
${\lambda _1} = 0.0995$(15, 18)
${\lambda _1} = 0.2549$l= 3 (15, 46, 38)
${\lambda _1} = 0.1053$(37, 2, 41)
${\lambda _1} = 0.2344$(19, 30, 46)
${\lambda _1} = 0.0935$(15, 38, 46)
${\lambda _1} = 0.1053$(15, 14, 46)
${\lambda _1} = 0.3664$l= 4 (15, 46, 38, 52)
${\lambda _1} = 0.1064$(37, 2, 41, 38)
${\lambda _1} = 0.2511$(19, 30, 46, 52)
${\lambda _1} = 0.0950$(15, 38, 46, 51)
${\lambda _1} = 0.1069$(62, 14, 46, 2)
${\lambda _1} = 0.4662$l= 5 (15, 46, 38, 52, 34)
${\lambda _1} = 0.1072$(37, 2, 41, 38, 8)
${\lambda _1} = 0.2710$(19, 30, 46, 52, 22)
${\lambda _1} = 0.0960$(15, 38, 46, 51, 39)
${\lambda _1} = 0.1078$(15, 38, 52, 18, 14)
${\lambda _1} = 0.5399$DownLoad:
CSV
受控
节点数度算法 BC算法 K-shell算法 ESI算法 本文算法 l= 2 (105, 333)
${\lambda _1} = 0.0881$(333, 105)
${\lambda _1} = 0.0881$(299, 389)
${\lambda _1} = 0.0383$(105, 42)
${\lambda _1} = 0.0879$(105, 23)
${\lambda _1} = 0.0894$l= 3 (105, 333, 16)
${\lambda _1} = 0.1169$(333, 105, 23)
${\lambda _1} = 0.1243$(299, 389, 424)
${\lambda _1} = 0.0392$(105, 42, 333)
${\lambda _1} = 0.1202$(105, 333, 23)
${\lambda _1} = 0.1243$l= 4 (105, 333, 16, 23)${\lambda _1} = 0.1518$ (333, 105, 23, 578)
${\lambda _1} = 0.1490$(299, 389, 424, 552)
${\lambda _1} = 0.0494$(105, 42, 333, 16)
${\lambda _1} = 0.1481$(105, 333, 23, 42)
${\lambda _1} = 0.1535$l= 5 (105, 333, 16, 23, 42)
${\lambda _1} = 0.1801$(333, 105, 23, 578, 76)
${\lambda _1} = 0.1774$(299, 389, 424, 552, 571)
${\lambda _1} = 0.0520$(105, 42, 333, 16, 76)
${\lambda _1} = 0.1770$(105, 333, 23, 42, 41)
${\lambda _1} = 0.1843$DownLoad:
CSV
-
[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25]
DownLoad:
Catalog
Metrics
- Abstract views:7927
- PDF Downloads:250
- Cited By:0