Display options
Share it on

Sci Rep. 2015 Dec 02;5:17459. doi: 10.1038/srep17459.

Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains.

Scientific reports

Ming-Yang Zhou, Zhao Zhuo, Hao Liao, Zhong-Qian Fu, Shi-Min Cai

Affiliations

  1. Guangdong Province Key Laboratory of Popular High Performance Computers, College of Computer Science and Software Engineering, Shenzhen University, Nanhai Avenue 3688, Shenzhen 518060, P. R. China.
  2. Department of Electronic Science and Technology, University of Science and Technology of China, Hefei 230027, P. R. China.
  3. Physics Department, University of Fribourg, Chemin du Musée 3, 1700 Fribourg Switzerland.
  4. Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, P. R. China.

PMID: 26626045 PMCID: PMC4667188 DOI: 10.1038/srep17459

Abstract

Controlling complex networks is of paramount importance in science and engineering. Despite recent efforts to improve controllability and synchronous strength, little attention has been paid to the speed of pinning synchronizability (rate of convergence in pinning control) and the corresponding pinning node selection. To address this issue, we propose a hypothesis to restrict the control cost, then build a linear matrix inequality related to the speed of pinning controllability. By solving the inequality, we obtain both the speed of pinning controllability and optimal control strength (feedback gains in pinning control) for all nodes. Interestingly, some low-degree nodes are able to achieve large feedback gains, which suggests that they have high influence on controlling system. In addition, when choosing nodes with high feedback gains as pinning nodes, the controlling speed of real systems is remarkably enhanced compared to that of traditional large-degree and large-betweenness selections. Thus, the proposed approach provides a novel way to investigate the speed of pinning controllability and can evoke other effective heuristic pinning node selections for large-scale systems.

References

  1. PLoS One. 2012;7(9):e44459 - PubMed
  2. Phys Rev Lett. 2011 Dec 2;107(23):238701 - PubMed
  3. Phys Rev E Stat Nonlin Soft Matter Phys. 2006 Feb;73(2 Pt 2):026111 - PubMed
  4. Nature. 2005 Jan 27;433(7024):392-5 - PubMed
  5. Phys Rev Lett. 2012 May 18;108(20):208701 - PubMed
  6. Phys Rev E Stat Nonlin Soft Matter Phys. 2015 Jan;91(1):012803 - PubMed
  7. Phys Rev Lett. 2005 Jun 3;94(21):218701 - PubMed
  8. Science. 1999 Oct 15;286(5439):509-12 - PubMed
  9. Phys Rev Lett. 2007 Oct 12;99(15):154301 - PubMed
  10. Science. 2002 Aug 30;297(5586):1551-5 - PubMed
  11. Chaos. 2008 Sep;18(3):037103 - PubMed
  12. Hypertension. 1990 Dec;16(6):725-30 - PubMed
  13. Phys Rev Lett. 2012 May 25;108(21):218703 - PubMed
  14. PLoS One. 2012;7(7):e41375 - PubMed
  15. Sci Rep. 2013;3:2759 - PubMed
  16. Phys Rev E Stat Nonlin Soft Matter Phys. 2012 Feb;85(2 Pt 2):026115 - PubMed
  17. IEEE Trans Neural Netw Learn Syst. 2013 Jul;24(7):1009-22 - PubMed
  18. Sci Rep. 2013;3:2354 - PubMed
  19. Nat Commun. 2013;4:2447 - PubMed
  20. PLoS One. 2012;7(6):e38398 - PubMed
  21. Nature. 2011 May 12;473(7346):167-73 - PubMed
  22. Phys Rev E Stat Nonlin Soft Matter Phys. 2014 Mar;89(3):032801 - PubMed
  23. Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Feb;67(2 Pt 2):026112 - PubMed
  24. Phys Rev E Stat Nonlin Soft Matter Phys. 2006 Apr;73(4 Pt 2):046108 - PubMed
  25. Nature. 2012 Sep 27;489(7417):507-8 - PubMed
  26. Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Apr;75(4 Pt 2):046103 - PubMed
  27. Nature. 1998 Jun 4;393(6684):440-2 - PubMed
  28. Bioinformatics. 2005 Mar15;21(6):827-8 - PubMed

Publication Types

Grant support