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

A probability-driven structure-aware algorithm for influence maximization under independent cascade model

Author

Listed:
  • Gong, Yudong
  • Liu, Sanyang
  • Bai, Yiguang

Abstract

Influence maximization (IM) is the problem of finding a set of nodes that can achieve the maximal influence spreads into the network, which faces two significant but intractable issues in latest studies: (i) Curse of scales: with the increase of the network scale, traditional methods cost extensive times in guaranteeing accuracy, which re-evaluate influence spread of every node in network, leading to significant computational overhead; (ii) Generalization issue: with more and more studies on various networks and propagation parameters, it is difficult to find a universally appropriate algorithm that performs well in each topology. In this paper, we propose a novel probability-driven structure-aware (PDSA) algorithm, which begins by cutting/updating network according to the edge activation probability parameters of the IC model, and then uses a graph traversal algorithm (e.g., breadth first search algorithm) to evaluate the influence spread scores of each node. Meanwhile, we adopt a kind of centrality-based independent cascade (CIC) model to approximate a more realistic propagation scenario. Through extensive experiments with six real-world/synthetic networks and six CIC/IC models, we demonstrate that PDSA achieves great performance over state-of-the-art algorithms in terms of effect and efficiency. Even facing various complex topologies and propagation parameters, PDSA exhibits excellent robustness in solving IM problems.

Suggested Citation

  • Gong, Yudong & Liu, Sanyang & Bai, Yiguang, 2021. "A probability-driven structure-aware algorithm for influence maximization under independent cascade model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).
  • Handle: RePEc:eee:phsmap:v:583:y:2021:i:c:s0378437121005914
    DOI: 10.1016/j.physa.2021.126318
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437121005914
    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.2021.126318?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. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    2. Shang, Jiaxing & Wu, Hongchun & Zhou, Shangbo & Zhong, Jiang & Feng, Yong & Qiang, Baohua, 2018. "IMPC: Influence maximization based on multi-neighbor potential in community networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1085-1103.
    3. Yuan, Jinliang & Zhang, Ruisheng & Tang, Jianxin & Hu, Rongjing & Wang, Zepeng & Li, Huan, 2019. "Efficient and effective influence maximization in large-scale social networks via two frameworks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 526(C).
    4. Aming Li & Lei Zhou & Qi Su & Sean P. Cornelius & Yang-Yu Liu & Long Wang & Simon A. Levin, 2020. "Evolution of cooperation on temporal networks," Nature Communications, Nature, vol. 11(1), pages 1-9, December.
    5. Linyuan Lü & Tao Zhou & Qian-Ming Zhang & H. Eugene Stanley, 2016. "The H-index of a network node and its relation to degree and coreness," Nature Communications, Nature, vol. 7(1), pages 1-7, April.
    6. AskariSichani, Omid & Jalili, Mahdi, 2015. "Influence maximization of informed agents in social networks," Applied Mathematics and Computation, Elsevier, vol. 254(C), pages 229-239.
    7. He, Qiang & Wang, Xingwei & Lei, Zhencheng & Huang, Min & Cai, Yuliang & Ma, Lianbo, 2019. "TIFIM: A Two-stage Iterative Framework for Influence Maximization in Social Networks," Applied Mathematics and Computation, Elsevier, vol. 354(C), pages 338-352.
    8. Robert M. Bond & Christopher J. Fariss & Jason J. Jones & Adam D. I. Kramer & Cameron Marlow & Jaime E. Settle & James H. Fowler, 2012. "A 61-million-person experiment in social influence and political mobilization," Nature, Nature, vol. 489(7415), pages 295-298, September.
    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. Dong, Chen & Xu, Guiqiong & Meng, Lei & Yang, Pingle, 2022. "CPR-TOPSIS: A novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 603(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. 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).
    2. Mahyar, Hamidreza & Hasheminezhad, Rouzbeh & Ghalebi K., Elahe & Nazemian, Ali & Grosu, Radu & Movaghar, Ali & Rabiee, Hamid R., 2018. "Compressive sensing of high betweenness centrality nodes in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 166-184.
    3. Yu, Senbin & Gao, Liang & Xu, Lida & Gao, Zi-You, 2019. "Identifying influential spreaders based on indirect spreading in neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 418-425.
    4. Zareie, Ahmad & Sheikhahmadi, Amir, 2019. "EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 141-155.
    5. Xu, Shuang & Wang, Pei, 2017. "Identifying important nodes by adaptive LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 654-664.
    6. Zhu, Weihua & Liu, Kai & Wang, Ming & Yan, Xiaoyong, 2018. "Enhancing robustness of metro networks using strategic defense," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 1081-1091.
    7. Yu, Hui & Cao, Xi & Liu, Zun & Li, Yongjun, 2017. "Identifying key nodes based on improved structural holes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 318-327.
    8. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Zareie, Ahmad, 2017. "Identification of influential users by neighbors in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 517-534.
    9. Zhong, Lin-Feng & Shang, Ming-Sheng & Chen, Xiao-Long & Cai, Shi-Ming, 2018. "Identifying the influential nodes via eigen-centrality from the differences and similarities of structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 77-82.
    10. Bao, Zhong-Kui & Ma, Chuang & Xiang, Bing-Bing & Zhang, Hai-Feng, 2017. "Identification of influential nodes in complex networks: Method from spreading probability viewpoint," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 468(C), pages 391-397.
    11. Liu, Qiang & Zhu, Yu-Xiao & Jia, Yan & Deng, Lu & Zhou, Bin & Zhu, Jun-Xing & Zou, Peng, 2018. "Leveraging local h-index to identify and rank influential spreaders in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 379-391.
    12. Liu, Min & Ma, Yue & Cao, Zhulou & Qi, Xingqin, 2018. "ECP-Rank: A novel vital node identifying mechanism combining PageRank with link prediction index," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1183-1191.
    13. Zareie, Ahmad & Sheikhahmadi, Amir & Fatemi, Adel, 2017. "Influential nodes ranking in complex networks: An entropy-based approach," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 485-494.
    14. Zhai, Li & Yan, Xiangbin & Zhang, Guojing, 2018. "Bi-directional h-index: A new measure of node centrality in weighted and directed networks," Journal of Informetrics, Elsevier, vol. 12(1), pages 299-314.
    15. Zhang, Xiaohong & Li, Zhiying & Qian, Kai & Ren, Jianji & Luo, Junwei, 2020. "Influential node identification in a constrained greedy way," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    16. Zhong, Lin-Feng & Liu, Quan-Hui & Wang, Wei & Cai, Shi-Min, 2018. "Comprehensive influence of local and global characteristics on identifying the influential nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 511(C), pages 78-84.
    17. 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).
    18. Dongling Yu & Zuguo Yu, 2022. "HWVoteRank: A Network-Based Voting Approach for Identifying Coding and Non-Coding Cancer Drivers," Mathematics, MDPI, vol. 10(5), pages 1-13, March.
    19. Kumar, Sanjay & Panda, B.S., 2020. "Identifying influential nodes in Social Networks: Neighborhood Coreness based voting approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    20. Ullah, Farman & Lee, Sungchang, 2017. "Identification of influential nodes based on temporal-aware modeling of multi-hop neighbor interactions for influence spread maximization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 968-985.

    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:583:y:2021:i:c:s0378437121005914. 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.