IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v470y2017icp217-227.html
   My bibliography  Save this article

Optimizing controllability of edge dynamics in complex networks by perturbing network structure

Author

Listed:
  • Pang, Shaopeng
  • Hao, Fei

Abstract

Using the minimum input signals to drive the dynamics in complex networks toward some desired state is a fundamental issue in the field of network controllability. For a complex network with the dynamical process defined on its edges, the controllability of this network is optimal if it can be fully controlled by applying one input signal to an arbitrary non-isolated vertex of it. In this paper, the adding-edge strategy and turning-edge strategy are proposed to optimize the controllability by minimum structural perturbations. Simulations and analyses indicate that the minimum number of adding-edges required for the optimal controllability is equal to the minimum number of turning-edges, and networks with positively correlated in- and out-degrees are easier to achieve optimal controllability. Furthermore, both the strategies have the capacity to reveal the relationship between certain structural properties of a complex network and its controllability of edge dynamics.

Suggested Citation

  • Pang, Shaopeng & Hao, Fei, 2017. "Optimizing controllability of edge dynamics in complex networks by perturbing network structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 470(C), pages 217-227.
  • Handle: RePEc:eee:phsmap:v:470:y:2017:i:c:p:217-227
    DOI: 10.1016/j.physa.2016.12.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116309724
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2016.12.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. M. Catanzaro & R. Pastor-Satorras, 2005. "Analytic solution of a static scale-free network model," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 44(2), pages 241-248, March.
    2. Gergely Palla & Imre Derényi & Illés Farkas & Tamás Vicsek, 2005. "Uncovering the overlapping community structure of complex networks in nature and society," Nature, Nature, vol. 435(7043), pages 814-818, June.
    3. Yang-Yu Liu & Jean-Jacques Slotine & Albert-László Barabási, 2011. "Controllability of complex networks," Nature, Nature, vol. 473(7346), pages 167-173, May.
    4. Zhengzhong Yuan & Chen Zhao & Zengru Di & Wen-Xu Wang & Ying-Cheng Lai, 2013. "Exact controllability of complex networks," Nature Communications, Nature, vol. 4(1), pages 1-9, December.
    5. Caldarelli, Guido, 2007. "Scale-Free Networks: Complex Webs in Nature and Technology," OUP Catalogue, Oxford University Press, number 9780199211517.
    6. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    7. Baruch Barzel & Yang-Yu Liu & Albert-László Barabási, 2015. "Constructing minimal models for complex system dynamics," Nature Communications, Nature, vol. 6(1), pages 1-8, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guo, Tianjiao & Tu, Lilan & Guo, Yifei & Hu, Jia & Su, Qingqing, 2023. "Control-capacity analysis and optimized construction for controlled interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 616(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ding, Jie & Wen, Changyun & Li, Guoqi, 2017. "Key node selection in minimum-cost control of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 251-261.
    2. Li, Xin-Feng & Lu, Zhe-Ming, 2016. "Optimizing the controllability of arbitrary networks with genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 422-433.
    3. Duan, Dongli & Bai, Xue & Rong, Yisheng & Hou, Gege & Hang, Jiale, 2022. "Controlling of nonlinear dynamical networks based on decoupling and re-coupling method," Chaos, Solitons & Fractals, Elsevier, vol. 163(C).
    4. Sun, Peng Gang & Ma, Xiaoke & Chi, Juan, 2017. "Dominating complex networks by identifying minimum skeletons," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 182-191.
    5. Aming Li & Yang-Yu Liu, 2020. "Controlling Network Dynamics," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 22(07n08), pages 1-19, February.
    6. Andreas Koulouris & Ioannis Katerelos & Theodore Tsekeris, 2013. "Multi-Equilibria Regulation Agent-Based Model of Opinion Dynamics in Social Networks," Interdisciplinary Description of Complex Systems - scientific journal, Croatian Interdisciplinary Society Provider Homepage: http://indecs.eu, vol. 11(1), pages 51-70.
    7. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    8. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.
    9. Tao Jia & Robert F Spivey & Boleslaw Szymanski & Gyorgy Korniss, 2015. "An Analysis of the Matching Hypothesis in Networks," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-12, June.
    10. Badie, Reza & Aleahmad, Abolfazl & Asadpour, Masoud & Rahgozar, Maseud, 2013. "An efficient agent-based algorithm for overlapping community detection using nodes’ closeness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5231-5247.
    11. Pang, Shao-Peng & Hao, Fei, 2018. "Effect of interaction strength on robustness of controlling edge dynamics in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 246-257.
    12. Li, Sheng & Liu, Wenwen & Wu, Ruizi & Li, Junli, 2023. "An adaptive attack model to network controllability," Reliability Engineering and System Safety, Elsevier, vol. 235(C).
    13. Li, Jian & Dueñas-Osorio, Leonardo & Chen, Changkun & Shi, Congling, 2016. "Connectivity reliability and topological controllability of infrastructure networks: A comparative assessment," Reliability Engineering and System Safety, Elsevier, vol. 156(C), pages 24-33.
    14. Li, Meizhu & Zhang, Qi & Deng, Yong, 2018. "Evidential identification of influential nodes in network of networks," Chaos, Solitons & Fractals, Elsevier, vol. 117(C), pages 283-296.
    15. Liu, Suling & Xu, Qiong & Chen, Aimin & Wang, Pei, 2020. "Structural controllability of dynamic transcriptional regulatory networks for Saccharomyces cerevisiae," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    16. Nie, Sen & Wang, Xuwen & Wang, Binghong, 2015. "Effect of degree correlation on exact controllability of multiplex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 98-102.
    17. Guo, Xue & Li, Weibo & Zhang, Hu & Tian, Tianhai, 2022. "Multi-likelihood methods for developing relationship networks using stock market data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 585(C).
    18. Chao, Xiangrui & Ran, Qin & Chen, Jia & Li, Tie & Qian, Qian & Ergu, Daji, 2022. "Regulatory technology (Reg-Tech) in financial stability supervision: Taxonomy, key methods, applications and future directions," International Review of Financial Analysis, Elsevier, vol. 80(C).
    19. Weiwei Zhang & Jinde Cao & Dingyuan Chen & Ahmed Alsaedi, 2019. "Out Lag Synchronization of Fractional Order Delayed Complex Networks with Coupling Delay via Pinning Control," Complexity, Hindawi, vol. 2019, pages 1-7, August.
    20. Ding, Jin & Lu, Yong-Zai & Chu, Jian, 2013. "Studies on controllability of directed networks with extremal optimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(24), pages 6603-6615.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:470:y:2017:i:c:p:217-227. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.