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

Influence maximization in hypergraphs: A self-optimizing algorithm based on electrostatic field

Author

Listed:
  • Li, Shuyu
  • Li, Xiang

Abstract

Multi-individual interactions are ubiquitous in the real world, which are usually modeled by hypergraphs. Similar to low-order networks, there are special key nodes in high-order networks that are highly influential and play a crucial role in information dissemination. The objective of the influence maximization problem is to find an optimal set of nodes that maximizes the influence of the network, while maximizing influence in hypergraphs has been neglected so far, and how to explore higher-order interactions from multiple perspectives and exploit the features of higher-order structures are still open questions. To solve the above problems, a self-optimization algorithm based on electrostatic field is proposed. The network is innovatively viewed as an electrostatic field to uncover the interaction forces of the nodes in it. The improved localized Physarum polycephalum algorithm is used to assign values to the initial charges of the nodes. The effective distance among hyperedges and nodes is redefined. Furthermore, the self-optimizing update algorithm is designed to reduce the overlap of nodes’ influence ranges in the optimal set. Percolation, SIR, Top-k, and correlation experiments are conducted on eight real-world networks, and the superiority of our proposed algorithm in this paper is verified by comparing with six algorithms.

Suggested Citation

  • Li, Shuyu & Li, Xiang, 2023. "Influence maximization in hypergraphs: A self-optimizing algorithm based on electrostatic field," Chaos, Solitons & Fractals, Elsevier, vol. 174(C).
    • Handle: RePEc:eee:chsofr:v:174:y:2023:i:c:s0960077923007890
    DOI: 10.1016/j.chaos.2023.113888
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077923007890
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2023.113888?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. L. V. Gambuzza & F. Patti & L. Gallo & S. Lepri & M. Romance & R. Criado & M. Frasca & V. Latora & S. Boccaletti, 2021. "Stability of synchronization in simplicial complexes," Nature Communications, Nature, vol. 12(1), pages 1-13, December.
    2. Gideon Rosenthal & František Váša & Alessandra Griffa & Patric Hagmann & Enrico Amico & Joaquín Goñi & Galia Avidan & Olaf Sporns, 2018. "Mapping higher-order relations between brain structure and function with embedded vector representations of connectomes," Nature Communications, Nature, vol. 9(1), pages 1-12, December.
    3. Yuanzhao Zhang & Maxime Lucas & Federico Battiston, 2023. "Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes," Nature Communications, Nature, vol. 14(1), pages 1-8, December.
    4. Unai Alvarez-Rodriguez & Federico Battiston & Guilherme Ferraz Arruda & Yamir Moreno & Matjaž Perc & Vito Latora, 2021. "Evolutionary dynamics of higher-order interactions in social networks," Nature Human Behaviour, Nature, vol. 5(5), pages 586-595, May.
    5. Jian-Wei Wang & Li-Li Rong & Qiu-Hong Deng & Ji-Yong Zhang, 2010. "Evolving hypernetwork model," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 77(4), pages 493-498, October.
    6. Liu, Panfeng & Li, Longjie & Fang, Shiyu & Yao, Yukai, 2021. "Identifying influential nodes in social networks: A voting approach," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    7. Serrano, Daniel Hernández & Villarroel, Javier & Hernández-Serrano, Juan & Tocino, Ángel, 2023. "Stochastic simplicial contagion model," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    8. Tocchi, Daniela & Sys, Christa & Papola, Andrea & Tinessa, Fiore & Simonelli, Fulvio & Marzano, Vittorio, 2022. "Hypergraph-based centrality metrics for maritime container service networks: A worldwide application," Journal of Transport Geography, Elsevier, vol. 98(C).
    9. Wang, Yan & Li, Haozhan & Zhang, Ling & Zhao, Linlin & Li, Wanlan, 2022. "Identifying influential nodes in social networks: Centripetal centrality and seed exclusion approach," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    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. Li, Xueqi & Ghosh, Dibakar & Lei, Youming, 2023. "Chimera states in coupled pendulum with higher-order interaction," Chaos, Solitons & Fractals, Elsevier, vol. 170(C).
    2. Martina Contisciani & Federico Battiston & Caterina De Bacco, 2022. "Inference of hyperedges and overlapping communities in hypergraphs," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    3. Ramasamy, Mohanasubha & Devarajan, Subhasri & Kumarasamy, Suresh & Rajagopal, Karthikeyan, 2022. "Effect of higher-order interactions on synchronization of neuron models with electromagnetic induction," Applied Mathematics and Computation, Elsevier, vol. 434(C).
    4. Shang, Yilun, 2022. "Sombor index and degree-related properties of simplicial networks," Applied Mathematics and Computation, Elsevier, vol. 419(C).
    5. Contreras-Aso, Gonzalo & Criado, Regino & Vera de Salas, Guillermo & Yang, Jinling, 2023. "Detecting communities in higher-order networks by using their derivative graphs," Chaos, Solitons & Fractals, Elsevier, vol. 177(C).
    6. Zhang, Ziyu & Mei, Xuehui & Jiang, Haijun & Luo, Xupeng & Xia, Yang, 2023. "Dynamical analysis of Hyper-SIR rumor spreading model," Applied Mathematics and Computation, Elsevier, vol. 446(C).
    7. Yang, Pingle & Meng, Fanyuan & Zhao, Laijun & Zhou, Lixin, 2023. "AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
    8. Yuanzhao Zhang & Maxime Lucas & Federico Battiston, 2023. "Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes," Nature Communications, Nature, vol. 14(1), pages 1-8, December.
    9. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    10. Guo, H. & Jia, D. & Sendiña-Nadal, I. & Zhang, M. & Wang, Z. & Li, X. & Alfaro-Bittner, K. & Moreno, Y. & Boccaletti, S., 2021. "Evolutionary games on simplicial complexes," Chaos, Solitons & Fractals, Elsevier, vol. 150(C).
    11. Xu, Can & Zhai, Yun & Wu, Yonggang & Zheng, Zhigang & Guan, Shuguang, 2023. "Enhanced explosive synchronization in heterogeneous oscillator populations with higher-order interactions," Chaos, Solitons & Fractals, Elsevier, vol. 170(C).
    12. Guilherme Ferraz de Arruda & Giovanni Petri & Pablo Martin Rodriguez & Yamir Moreno, 2023. "Multistability, intermittency, and hybrid transitions in social contagion models on hypergraphs," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    13. Wang, Wei & Li, Wenyao & Lin, Tao & Wu, Tao & Pan, Liming & Liu, Yanbing, 2022. "Generalized k-core percolation on higher-order dependent networks," Applied Mathematics and Computation, Elsevier, vol. 420(C).
    14. Nie, Yanyi & Li, Wenyao & Pan, Liming & Lin, Tao & Wang, Wei, 2022. "Markovian approach to tackle competing pathogens in simplicial complex," Applied Mathematics and Computation, Elsevier, vol. 417(C).
    15. Li, WenYao & Xue, Xiaoyu & Pan, Liming & Lin, Tao & Wang, Wei, 2022. "Competing spreading dynamics in simplicial complex," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    16. Yang, Luhe & Zhang, Lianzhong & Yang, Duoxing, 2022. "Asymmetric micro-dynamics in spatial anonymous public goods game," Applied Mathematics and Computation, Elsevier, vol. 415(C).
    17. Suo, Qi & Guo, Jin-Li & Shen, Ai-Zhong, 2018. "Information spreading dynamics in hypernetworks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 495(C), pages 475-487.
    18. Yijun Liu & Xiaokun Jin & Yunrui Zhang, 2024. "Identifying risks in temporal supernetworks: an IO-SuperPageRank algorithm," Palgrave Communications, Palgrave Macmillan, vol. 11(1), pages 1-21, December.
    19. Nie, Yanyi & Zhong, Xiaoni & Lin, Tao & Wang, Wei, 2022. "Homophily in competing behavior spreading among the heterogeneous population with higher-order interactions," Applied Mathematics and Computation, Elsevier, vol. 432(C).
    20. You, Tao & Zhang, Hailun & Zhang, Ying & Li, Qing & Zhang, Peng & Yang, Mei, 2022. "The influence of experienced guider on cooperative behavior in the Prisoner’s dilemma game," Applied Mathematics and Computation, Elsevier, vol. 426(C).

    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:chsofr:v:174:y:2023:i:c:s0960077923007890. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.