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

Identification of influential nodes based on temporal-aware modeling of multi-hop neighbor interactions for influence spread maximization

Author

Listed:
  • Ullah, Farman
  • Lee, Sungchang

Abstract

This paper presents the identification of highly influential nodes based on temporal-aware modeling of multi-hop neighbor interactions to maximize the spread of information in online social networks (OSNs). The objective is to choose a set of influential nodes that have higher temporal multi-hop interactions and more topological connections in large-scale OSNs to maximize information dissemination and minimize spreading time. An influence diffusion process that is solely based on topology is not able to capture the influence spreading efficiently. A temporal multi-hops social interaction based centrality is proposed to choose nodes of higher spreading ability considering the nodes’ neighbors and neighbors-of-neighbors temporal modeled interactions and topological connections. The temporal-aware interactions are modeled to find users who are more active recently. First, we model the influence between users considering the temporal interactions of the user and its neighbors. A subset of nodes with a higher influence value and more topological connections with direct neighbors is selected. Secondly, we select the Top-K higher influential spreader nodes from the subset of nodes considering the node neighbors and neighbors-of-neighbors temporal modeled social interactions and topological connections. Finally, the proposed algorithm is evaluated using the epidemic spreading models. The experimental results show that the algorithm is able to extract highly influential nodes that maximize the spread of information and minimize contagion time.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:486:y:2017:i:c:p:968-985
    DOI: 10.1016/j.physa.2017.05.089
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117306088
    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.2017.05.089?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. Jalili, Mahdi, 2013. "Social power and opinion formation in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(4), pages 959-966.
    3. Yan, Qiang & Wu, Lianren & Zheng, Lan, 2013. "Social network based microblog user behavior analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(7), pages 1712-1723.
    4. AskariSichani, Omid & Jalili, Mahdi, 2015. "Influence maximization of informed agents in social networks," Applied Mathematics and Computation, Elsevier, vol. 254(C), pages 229-239.
    5. Christel Kamp & Mathieu Moslonka-Lefebvre & Samuel Alizon, 2013. "Epidemic Spread on Weighted Networks," PLOS Computational Biology, Public Library of Science, vol. 9(12), pages 1-10, December.
    6. Gao, Shuai & Ma, Jun & Chen, Zhumin & Wang, Guanghui & Xing, Changming, 2014. "Ranking the spreading ability of nodes in complex networks based on local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 130-147.
    7. Mahendra Piraveenan & Mikhail Prokopenko & Liaquat Hossain, 2013. "Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks," PLOS ONE, Public Library of Science, vol. 8(1), pages 1-14, January.
    8. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    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. Jabari Lotf, Jalil & Abdollahi Azgomi, Mohammad & Ebrahimi Dishabi, Mohammad Reza, 2022. "An improved influence maximization method for social networks based on genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 586(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. Bian, Tian & Hu, Jiantao & Deng, Yong, 2017. "Identifying influential nodes in complex networks based on AHP," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 422-436.
    2. Xu, Yuxin & Gao, Fei, 2024. "A novel higher-order Deffuant–Weisbuch networks model incorporating the Susceptible Infected Recovered framework," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    3. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    4. 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).
    5. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    6. 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.
    7. Salavati, Chiman & Abdollahpouri, Alireza & Manbari, Zhaleh, 2018. "BridgeRank: A novel fast centrality measure based on local structure of the network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 635-653.
    8. Zhang, Ting & Zhang, Kun & Lv, Laishui & Bardou, Dalal, 2019. "Co-Ranking for nodes, layers and timestamps in multilayer temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 125(C), pages 88-96.
    9. Evangelos Ioannidis & Nikos Varsakelis & Ioannis Antoniou, 2020. "Promoters versus Adversaries of Change: Agent-Based Modeling of Organizational Conflict in Co-Evolving Networks," Mathematics, MDPI, vol. 8(12), pages 1-25, December.
    10. 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).
    11. 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.
    12. 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.
    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. Liu, Honglu & Tian, Zhihong & Huang, Anqiang & Yang, Zaili, 2018. "Analysis of vulnerabilities in maritime supply chains," Reliability Engineering and System Safety, Elsevier, vol. 169(C), pages 475-484.
    15. Ma, Tinghuai & Yue, Mingliang & Qu, Jingjing & Tian, Yuan & Al-Dhelaan, Abdullah & Al-Rodhaan, Mznah, 2018. "PSPLPA: Probability and similarity based parallel label propagation algorithm on spark," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 366-378.
    16. Han, Wenchen & Feng, Yuee & Qian, Xiaolan & Yang, Qihui & Huang, Changwei, 2020. "Clusters and the entropy in opinion dynamics on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 559(C).
    17. Xiaojian Ma & Yinghong Ma, 2019. "The Local Triangle Structure Centrality Method to Rank Nodes in Networks," Complexity, Hindawi, vol. 2019, pages 1-16, January.
    18. Lv, Zhiwei & Zhao, Nan & Xiong, Fei & Chen, Nan, 2019. "A novel measure of identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 488-497.
    19. Zhu, Canshi & Wang, Xiaoyang & Zhu, Lin, 2017. "A novel method of evaluating key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 96(C), pages 43-50.
    20. 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).

    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:486:y:2017:i:c:p:968-985. 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.