A degree-based strategy for constrained pinning control of complex networks
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 1533-1539 |
| Journal / Publication | International Journal of Bifurcation and Chaos |
| Volume | 20 |
| Issue number | 5 |
| Publication status | Published - May 2010 |
Link(s)
Abstract
In this paper, a modified degree-based strategy is proposed for pinning control of complex networks under constrained control capacity. Limited by the total control strength, the pinning strategy design problem is reconsidered as a constrained optimization problem. To provide a fast and effective solution, a decrease-and-conquer approach has been designed to assign the best control strengths to the pinned highest-degree nodes. Simulation results have demonstrated that the obtained strategy provides an outperformed control effect on various kinds of complex networks, as compared with strategies derived from degree, betweenness or closeness using evenly-distributed control strength. © 2010 World Scientific Publishing Company.
Research Area(s)
- Complex networks, degree-based strategy, pinning control
Citation Format(s)
A degree-based strategy for constrained pinning control of complex networks. / Tang, Wallace K. S.; Ng, Ka-Ho; Jia, Qiang.
In: International Journal of Bifurcation and Chaos, Vol. 20, No. 5, 05.2010, p. 1533-1539.
In: International Journal of Bifurcation and Chaos, Vol. 20, No. 5, 05.2010, p. 1533-1539.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
