IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v474y2024ics0096300324001747.html
   My bibliography  Save this article

On the minimum driver node set of k-uniform linear hypertree networks

Author

Listed:
  • Wei, Liang
  • Li, Faxu
  • Zhao, Haixing
  • Deng, Bo

Abstract

The exact controllability research framework of complex networks points out that the controllability of the network has a great relationship with the minimum number of driver nodes. It is generally believed that the smaller the minimum number of driver nodes and the lower the cost of external control of the whole network to achieve the ideal state, the better the controllability of networks. In this paper, the minimum driver node problem of a hypernetwork is transformed into the maximum multiplicative problem of the eigenvalue of its 2-section graph. The minimum driver node numbers of two types of typical k-uniform hypertree networks are described, and their bounds are also given. By designing an algorithm, the method of characterizing the driver node set is obtained, and it is found that the selection of the minimum driver nodes of the network tends to the nodes with low hyperdegree. In addition, the paper verifies the minimum driver node set and the theoretical analysis results of controllability by simulation analysis.

Suggested Citation

  • Wei, Liang & Li, Faxu & Zhao, Haixing & Deng, Bo, 2024. "On the minimum driver node set of k-uniform linear hypertree networks," Applied Mathematics and Computation, Elsevier, vol. 474(C).
    • Handle: RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001747
    DOI: 10.1016/j.amc.2024.128702
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324001747
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128702?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. 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.
    2. 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.
    3. Estrada, Ernesto & Rodríguez-Velázquez, Juan A., 2006. "Subgraph centrality and clustering in complex hyper-networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 581-594.
    4. Li, Pengfei & Mirchandani, Pitu & Zhou, Xuesong, 2015. "Solving simultaneous route guidance and traffic signal optimization problem using space-phase-time hypernetwork," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 103-130.
    5. Jian-Guo Liu & Guang-Yong Yang & Zhao-Long Hu, 2014. "A Knowledge Generation Model via the Hypernetwork," PLOS ONE, Public Library of Science, vol. 9(3), pages 1-8, March.
    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. 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.
    2. 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.
    3. Hu, Ying & Yu, Yang & Mardani, Abbas, 2021. "Selection of carbon emissions control industries in China: An approach based on complex networks control perspective," Technological Forecasting and Social Change, Elsevier, vol. 172(C).
    4. 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).
    5. 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.
    6. Li, Jian & Dueñas-Osorio, Leonardo & Chen, Changkun & Berryhill, Benjamin & Yazdani, Alireza, 2016. "Characterizing the topological and controllability features of U.S. power transmission networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 453(C), pages 84-98.
    7. 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.
    8. 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.
    9. 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.
    10. 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).
    11. 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.
    12. Yang, Qing-Lin & Wang, Li-Fu & Zhao, Guo-Tao & Guo, Ge, 2020. "A coarse graining algorithm based on m-order degree in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 558(C).
    13. 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.
    14. Rinaldi, Marco, 2018. "Controllability of transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 381-406.
    15. 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.
    16. Wang, Pei & Xu, Shuang, 2017. "Spectral coarse grained controllability of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 478(C), pages 168-176.
    17. Bo Zhang & Jianping Yuan & Jianfei Pan & Xiaoyu Wu & Jianjun Luo & Li Qiu, 2017. "Controllability and Leader-Based Feedback for Tracking the Synchronization of a Linear-Switched Reluctance Machine Network," Energies, MDPI, vol. 10(11), pages 1-18, October.
    18. Yuanyuan Ma & Lingxuan Li, 2018. "Crisis Spreading Model of the Shareholding Networks of Listed Companies and Their Main Holders and Their Controllability," Complexity, Hindawi, vol. 2018, pages 1-17, December.
    19. 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).
    20. Han, Fangyuan & Zio, Enrico, 2019. "A multi-perspective framework of analysis of critical infrastructures with respect to supply service, controllability and topology," International Journal of Critical Infrastructure Protection, Elsevier, vol. 24(C), pages 1-13.

    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:apmaco:v:474:y:2024:i:c:s0096300324001747. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.