Limits...
Structural controllability of complex networks based on preferential matching.

Zhang X, Lv T, Yang X, Zhang B - PLoS ONE (2014)

Bottom Line: Therefore, past research has not been sufficient to arrive at a convincing conclusion.Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method.Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network.

View Article: PubMed Central - PubMed

Affiliation: College of Information Science and Engineering, Northeastern University, Shenyang, China.

ABSTRACT
Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching can be composed of high- and medium-degree nodes. Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method. Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network.

Show MeSH
Illustration of the preferential matching algorithm process.We rank all of the nodes in descending order by degree, and the driver nodes are nodes v3 and v4 that are the last two of the sequence.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4222963&req=5

pone-0112039-g001: Illustration of the preferential matching algorithm process.We rank all of the nodes in descending order by degree, and the driver nodes are nodes v3 and v4 that are the last two of the sequence.

Mentions: An example of the proposed method is shown in Figure 1.


Structural controllability of complex networks based on preferential matching.

Zhang X, Lv T, Yang X, Zhang B - PLoS ONE (2014)

Illustration of the preferential matching algorithm process.We rank all of the nodes in descending order by degree, and the driver nodes are nodes v3 and v4 that are the last two of the sequence.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4222963&req=5

pone-0112039-g001: Illustration of the preferential matching algorithm process.We rank all of the nodes in descending order by degree, and the driver nodes are nodes v3 and v4 that are the last two of the sequence.
Mentions: An example of the proposed method is shown in Figure 1.

Bottom Line: Therefore, past research has not been sufficient to arrive at a convincing conclusion.Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method.Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network.

View Article: PubMed Central - PubMed

Affiliation: College of Information Science and Engineering, Northeastern University, Shenyang, China.

ABSTRACT
Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching can be composed of high- and medium-degree nodes. Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method. Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network.

Show MeSH