IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v683y2026ics0378437125008556.html

Optimizing influence spread in multilayer networks: A layer-weighted budget allocation and community-based local dominance approach

Author

Listed:
  • Tang, Jianxin
  • Liu, Lijun
  • Li, Chenshuo
  • Wang, Xin
  • Wang, Ping

Abstract

The influence maximization problem in multilayer social networks entails selecting seed nodes from each layer under a budget constraint to optimize the overall influence spread. However, the insufficient considerations of topological heterogeneity and cross-layer propagation synergy in existing methods result in imbalanced resource allocation and unsatisfying influence spread easily. To address such challenges, a cross-layer independent cascade model is designed to capture both intra-layer and inter-layer diffusion dynamics. Furthermore, a layer-weighted budget allocation and community-aware local dominance (LWCD) approach is proposed to address the issues of topological heterogeneity and optimal resource allocation in cross-layer propagation. It involves a three-stage process: a layer-weighted assignment method is introduced, where k-core centrality and jaccard overlap are used to quantify the importance of each layer; based on the computed layer weights, the infomap method is applied for community detection, and the budget is allocated proportionally to community sizes; finally, high-potential seed nodes within each community are identified using a local degree metric that captures node influence. Extensive experiments on synthetic and real-world multilayer networks confirm the effectiveness and stability of the proposed LWCD. Compared with state-of-the-art algorithms, LWCD achieves an average improvement of 60.68% in eight networks in terms of influence spread. The complete source code has been made publicly accessible at https://github.com/xiaogoudaidai/LWCDalgorithm to facilitate reproducibility and further research.

Suggested Citation

  • Tang, Jianxin & Liu, Lijun & Li, Chenshuo & Wang, Xin & Wang, Ping, 2026. "Optimizing influence spread in multilayer networks: A layer-weighted budget allocation and community-based local dominance approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 683(C).
  • Handle: RePEc:eee:phsmap:v:683:y:2026:i:c:s0378437125008556
    DOI: 10.1016/j.physa.2025.131203
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437125008556
    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.2025.131203?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Ai, Jun & He, Tao & Su, Zhan & Shang, Lihui, 2022. "Identifying influential nodes in complex networks based on spreading probability," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    2. Lei, Mingli & Liu, Lirong & Ramirez-Arellano, Aldo & Zhao, Jie & Cheong, Kang Hao, 2025. "Influential node detection in multilayer networks via fuzzy weighted information," Chaos, Solitons & Fractals, Elsevier, vol. 191(C).
    3. Tavasoli, Ali & Shakeri, Heman & Ardjmand, Ehsan & Young, William A., 2021. "Incentive rate determination in viral marketing," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1169-1187.
    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. Wang, Peng & Ling, Guang & Zhao, Pei & Pan, Wenqiu & Ge, Ming-Feng, 2024. "Identification of important nodes in multi-layer hypergraphs based on fuzzy gravity model and node centrality distribution characteristics," Chaos, Solitons & Fractals, Elsevier, vol. 188(C).
    2. Zheng, Ru & Guo, Yaoqi & Moreno, Yamir, 2026. "A new algorithm for identifying influential nodes in multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 202(P2).
    3. Wu, Yali & Dong, Ang & Ren, Yuanguang & Jiang, Qiaoyong, 2023. "Identify influential nodes in complex networks: A k-orders entropy-based method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P1).
    4. Ningning Lang & Lin Wang & Quanbo Zha, 2022. "Targeted Allocation of Marketing Resource in Networks Based on Opinion Dynamics," Mathematics, MDPI, vol. 10(3), pages 1-21, January.
    5. Ma, Jinlong & Hu, Jiahao, 2025. "A novel algorithm for identifying key propagation nodes in complex networks based on Neighborhood Gravitational Structural Centrality," Chaos, Solitons & Fractals, Elsevier, vol. 200(P3).
    6. Meng, Bo & Rezaeipanah, Amin, 2025. "Development of a multidimensional centrality metric for ranking nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 191(C).
    7. Jie-Hao Shao & E. Zhang & Yi Xiang & Ran-Zhe Jing, 2024. "Efficient combinations of dual incentives on social networks to achieve viral spread," Electronic Commerce Research, Springer, vol. 24(4), pages 2381-2404, December.
    8. Xiao, Yunjiang & Li, Yang & Liu, Weidong & Wang, Zhiyuan & Chen, Jun & Wang, Wei, 2025. "Resilience assessment of High-speed railway networks from the spatio-temporal perspective: A case study in Jiangsu Province, China," Reliability Engineering and System Safety, Elsevier, vol. 259(C).
    9. Wang, Longyun & Mou, Jianhong & Dai, Bitao & Tan, Suoyi & Cai, Mengsi & Chen, Huan & Jin, Zhen & Sun, Guiquan & Lu, Xin, 2024. "Influential nodes identification based on hierarchical structure," Chaos, Solitons & Fractals, Elsevier, vol. 186(C).
    10. He, Yongming & Jin, Yufeng & Cao, Jian & Sui, Shengchun & Wang, Jiahe & Ran, Bin, 2025. "Identification of key nodes in urban bus-metro network: A NK-shell algorithm based neighborhood KS," Reliability Engineering and System Safety, Elsevier, vol. 264(PB).
    11. Wang, Yan & Zhang, Ling & Yang, Junwen & Yan, Ming & Li, Haozhan, 2024. "Multi-factor information matrix: A directed weighted method to identify influential nodes in social networks," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    12. Guo, Haoming & Wang, Shuangling & Yan, Xuefeng & Zhang, Kecheng, 2024. "Node importance evaluation method of complex network based on the fusion gravity model," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
    13. Gu, Wei & Heese, H. Sebastian & Kemahlıoğlu-Ziya, Eda & Ziya, Serhan, 2024. "Pricing for services with cross-segment externalities, capacity constraints, and competition," European Journal of Operational Research, Elsevier, vol. 313(2), pages 801-813.
    14. Tavasoli, Ali & Fazli, Mehrdad & Ardjmand, Ehsan & Young, William A. & Shakeri, Heman, 2023. "Competitive pricing under local network effects," European Journal of Operational Research, Elsevier, vol. 311(2), pages 545-566.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:phsmap:v:683:y:2026:i:c:s0378437125008556. 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.