<p><<i>k</i>> is the average degree of a network, <i>n<sub>D</sub></i> is the size of a MDS, <i>λ<sub>D</sub></i> = <i>n<sub>D</sub></i>/<i>N</i>, <<i>k<sup>D</sup></i>> is the average degree of the MDS, is the average value of <<i>k<sup>D</sup></i>> for all of the obtained MDSs, and <<i>k<sup>D</sup></i><sub>min</sub>> and <i>D</i><sub>max</sub>> are the maximum and the minimum values <<i>k<sup>D</sup></i>> of all of the MDSs obtained by the preferential matching method under a different preferential matching number <i>m.</i></p><p>Overview of real networks and the statistical results of their MDSs.</p
<p>For each network, we show its type, name; number of nodes (<i>N</i>) and links (<i>L</i>); driver...
<p>Right column shows illustrations of prototypical networks: the (ring) lattice small-world, the cl...
<p><i>Note.</i><i>n</i> = number of nodes; <i>m</i> = number of edges; <i>n</i><sub><i>CC</i></sub> ...
<p><b>(a)</b> The size of the maximum matching <i>n</i><sub>max</sub> increases monotonically with t...
<p>The MDS with the highest average degree <<i>k<sup>D</sup><sub>max</sub>></i> was computed by usin...
<p><i>Note.</i><i>n</i> = number of nodes; <i>m</i> = number of edges; <i>n</i><sub><i>CC</i></sub> ...
<p>Nodes and Edges represent nodes’ number and edges’ number of network, respectively. ⟨<i>k</i>⟩ de...
<p>(a) The fraction <i>f<sub>hi-lo</sub></i> and the probability <i>p</i> have a clear linear relati...
Minimum driver node sets (MDSs) play an important role in studying the structural controllability of...
Minimum driver node sets (MDSs) play an important role in studying the structural controllability of...
<p>⟨<i>k</i>⟩ is the average degree of the network. We use the fast-greedy community detection algor...
<p> and are the number of nodes and links, and are the maximum of in-degree and out-degree of all...
<p>Size of networks studied in this paper, along with their average degree 〈<i>k</i>〉 and degree ass...
<p>Correlation of the size of MDSs with the clustering coefficient (A) and modularity (B) in SF netw...
<p>For each network, we show its name and reference; number of nodes () and edges (); mean degree ()...
<p>For each network, we show its type, name; number of nodes (<i>N</i>) and links (<i>L</i>); driver...
<p>Right column shows illustrations of prototypical networks: the (ring) lattice small-world, the cl...
<p><i>Note.</i><i>n</i> = number of nodes; <i>m</i> = number of edges; <i>n</i><sub><i>CC</i></sub> ...
<p><b>(a)</b> The size of the maximum matching <i>n</i><sub>max</sub> increases monotonically with t...
<p>The MDS with the highest average degree <<i>k<sup>D</sup><sub>max</sub>></i> was computed by usin...
<p><i>Note.</i><i>n</i> = number of nodes; <i>m</i> = number of edges; <i>n</i><sub><i>CC</i></sub> ...
<p>Nodes and Edges represent nodes’ number and edges’ number of network, respectively. ⟨<i>k</i>⟩ de...
<p>(a) The fraction <i>f<sub>hi-lo</sub></i> and the probability <i>p</i> have a clear linear relati...
Minimum driver node sets (MDSs) play an important role in studying the structural controllability of...
Minimum driver node sets (MDSs) play an important role in studying the structural controllability of...
<p>⟨<i>k</i>⟩ is the average degree of the network. We use the fast-greedy community detection algor...
<p> and are the number of nodes and links, and are the maximum of in-degree and out-degree of all...
<p>Size of networks studied in this paper, along with their average degree 〈<i>k</i>〉 and degree ass...
<p>Correlation of the size of MDSs with the clustering coefficient (A) and modularity (B) in SF netw...
<p>For each network, we show its name and reference; number of nodes () and edges (); mean degree ()...
<p>For each network, we show its type, name; number of nodes (<i>N</i>) and links (<i>L</i>); driver...
<p>Right column shows illustrations of prototypical networks: the (ring) lattice small-world, the cl...
<p><i>Note.</i><i>n</i> = number of nodes; <i>m</i> = number of edges; <i>n</i><sub><i>CC</i></sub> ...