IDEAS home Printed from https://ideas.repec.org/a/wly/jnlamp/v2018y2018i1n2586536.html

Quantitative Controllability Index of Complex Networks

Author

Listed:
  • Lifu Wang
  • Yali Zhang
  • Jingxiao Han
  • Zhi Kong

Abstract

In this paper, the controllability issue of complex network is discussed. A new quantitative index using knowledge of control centrality and condition number is constructed to measure the controllability of given networks. For complex networks with different controllable subspace dimensions, their controllability is mainly determined by the control centrality factor. For the complex networks that have the equal controllable subspace dimension, their different controllability is mostly determined by the condition number of subnetworks’ controllability matrix. Then the effect of this index is analyzed based on simulations on various types of network topologies, such as ER random network, WS small‐world network, and BA scale‐free network. The results show that the presented index could reflect the holistic controllability of complex networks. Such an endeavour could help us better understand the relationship between controllability and network topology.

Suggested Citation

  • Lifu Wang & Yali Zhang & Jingxiao Han & Zhi Kong, 2018. "Quantitative Controllability Index of Complex Networks," Advances in Mathematical Physics, John Wiley & Sons, vol. 2018(1).
    • Handle: RePEc:wly:jnlamp:v:2018:y:2018:i:1:n:2586536
    DOI: 10.1155/2018/2586536
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2018/2586536
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/2586536?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
    ---><---

    References listed on IDEAS

    as
    1. David Liben‐Nowell & Jon Kleinberg, 2007. "The link‐prediction problem for social networks," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 58(7), pages 1019-1031, May.
    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. H. Jeong & B. Tombor & R. Albert & Z. N. Oltvai & A.-L. Barabási, 2000. "The large-scale organization of metabolic networks," Nature, Nature, vol. 407(6804), pages 651-654, October.
    4. Yandong Xiao & Songyang Lao & Lvlin Hou & Michael Small & Liang Bai, 2015. "Effects of Edge Directions on the Structural Controllability of Complex Networks," PLOS ONE, Public Library of Science, vol. 10(8), pages 1-15, August.
    5. Máté Nagy & Zsuzsa Ákos & Dora Biro & Tamás Vicsek, 2010. "Hierarchical group dynamics in pigeon flocks," Nature, Nature, vol. 464(7290), pages 890-893, April.
    6. Yang-Yu Liu & Jean-Jacques Slotine & Albert-László Barabási, 2012. "Control Centrality and Hierarchical Structure in Complex Networks," PLOS ONE, Public Library of Science, vol. 7(9), pages 1-7, September.
    Full references (including those not matched with items on IDEAS)

    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. Jorge Peña & Yannick Rochat, 2012. "Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games," PLOS ONE, Public Library of Science, vol. 7(9), pages 1-13, September.
    2. Tamás Nepusz & Tamás Vicsek, 2013. "Hierarchical Self-Organization of Non-Cooperating Individuals," PLOS ONE, Public Library of Science, vol. 8(12), pages 1-9, December.
    3. Selen Onel & Abe Zeid & Sagar Kamarthi, 2011. "The structure and analysis of nanotechnology co-author and citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 89(1), pages 119-138, October.
    4. 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.
    5. 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.
    6. Fei Tan & Yongxiang Xia & Boyao Zhu, 2014. "Link Prediction in Complex Networks: A Mutual Information Perspective," PLOS ONE, Public Library of Science, vol. 9(9), pages 1-8, September.
    7. Šubelj, Lovro & Bajec, Marko, 2014. "Group detection in complex networks: An algorithm and comparison of the state of the art," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 397(C), pages 144-156.
    8. Daniel Straulino & Mattie Landman & Neave O'Clery, 2020. "A bi-directional approach to comparing the modular structure of networks," Papers 2010.06568, arXiv.org.
    9. Chungmok Lee & Minh Pham & Myong K. Jeong & Dohyun Kim & Dennis K. J. Lin & Wanpracha Art Chavalitwongse, 2015. "A Network Structural Approach to the Link Prediction Problem," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 249-267, May.
    10. 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.
    11. Li Jiang & Luca Giuggioli & Andrea Perna & Ramón Escobedo & Valentin Lecheval & Clément Sire & Zhangang Han & Guy Theraulaz, 2017. "Identifying influential neighbors in animal flocking," PLOS Computational Biology, Public Library of Science, vol. 13(11), pages 1-32, November.
    12. Jin Wang & Bo Huang & Xuefeng Xia & Zhirong Sun, 2006. "Funneled Landscape Leads to Robustness of Cell Networks: Yeast Cell Cycle," PLOS Computational Biology, Public Library of Science, vol. 2(11), pages 1-10, November.
    13. Yifei Zhou & Shaoyong Li & Yaping Liu, 2020. "Graph-based Method for App Usage Prediction with Attributed Heterogeneous Network Embedding," Future Internet, MDPI, vol. 12(3), pages 1-16, March.
    14. Shang, Jiaxing & Liu, Lianchen & Li, Xin & Xie, Feng & Wu, Cheng, 2016. "Targeted revision: A learning-based approach for incremental community detection in dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 70-85.
    15. Jiang, Lincheng & Zhao, Xiang & Ge, Bin & Xiao, Weidong & Ruan, Yirun, 2019. "An efficient algorithm for mining a set of influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 58-65.
    16. repec:plo:pone00:0112606 is not listed on IDEAS
    17. Ying Song & Zhiwen Zheng & Yunmei Shi & Bo Wang, 2023. "GLOD: The Local Greedy Expansion Method for Overlapping Community Detection in Dynamic Provenance Networks," Mathematics, MDPI, vol. 11(15), pages 1-16, July.
    18. Xie, Wei & Xuan, Chenrui & Lee, Eric Wai Ming & Jiang, Nan & Li, Tao, 2025. "Quantifying emergent leadership within pedestrian crowd under laboratory conditions," Chaos, Solitons & Fractals, Elsevier, vol. 199(P3).
    19. Zhang, Zhiwei & Wang, Zhenyu, 2015. "Mining overlapping and hierarchical communities in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 421(C), pages 25-33.
    20. Aslam, Faheem & Aziz, Saqib & Nguyen, Duc Khuong & Mughal, Khurrum S. & Khan, Maaz, 2020. "On the efficiency of foreign exchange markets in times of the COVID-19 pandemic," Technological Forecasting and Social Change, Elsevier, vol. 161(C).
    21. Masa Tsuchiya & Vincent Piras & Alessandro Giuliani & Masaru Tomita & Kumar Selvarajoo, 2010. "Collective Dynamics of Specific Gene Ensembles Crucial for Neutrophil Differentiation: The Existence of Genome Vehicles Revealed," PLOS ONE, Public Library of Science, vol. 5(8), pages 1-10, August.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnlamp:v:2018:y:2018:i:1:n:2586536. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/3197 .

    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.