Skip to main content
SpringerLink
Log in

Multi-hop analysis method for rich-club phenomenon of influence maximization in social networks

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

When studying the Influence Maximization (IM) problem in social networks, it is found that the initial seed nodes selected by some heuristic algorithms have the characteristics of aggregation. This situation is called the rich club phenomenon of seed sets. Once the seed node is over-aggregated, it will limit the spread of influence. Therefore, analyzing the rich-club phenomenon is necessary for solving the IM problem. The paper proposes the rich club coefficient and reactivation rate to quantitatively analyze this phenomenon. The analysis mainly focuses on the relationship between the hop distance and the propagation probability. In addition, the relationship between the rich club phenomenon and the IM problem is also an aspect of concern. When dealing with the main aspects, a key problem needs to be solved, which is that the optimal range of hop is different under different propagation probabilities. To solve this problem, the Multi Hop Remove (MHR) algorithm is proposed, which is based on the independent cascade model. By the MHR algorithm, the hop range is determined under different propagation probabilities. According to our experimental results, the more serious the rich club phenomenon accumulates, the smaller the influence spread. To reduce the obstruction of this phenomenon, the multi-hop selection of seed nodes is a superior solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Domingos P, Richardson M (2001) Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '01). Association for Computing Machinery, New York, NY, USA, 57–66

  2. Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '02). Association for Computing Machinery, New York, NY, USA, 61–70

  3. Tardos E, Kempe D, Kleinberg J (2003) Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '03). Association for Computing Machinery, New York, NY, USA, 137–146

  4. Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '09). Association for Computing Machinery, New York, NY, USA, 199–208

  5. Leskovec J (2005) The dynamics of viral marketing. ACM Trans. Web 1, 1 (May 2007), 5–es

  6. Cha M, Mislove A, Krishna P (2009) A measurement-driven analysis of information propagation in the flickr social network. In Proceedings of the 18th international conference on World wide web (WWW '09). Association for Computing Machinery, New York, NY, USA, 721–730

  7. Goel S, Watts DJ, Goldstein DG. (2012). The structure of online diffusion networks. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC '12). Association for Computing Machinery, New York, NY, USA, 623–638

  8. Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):10

    Article  Google Scholar 

  9. Vespignani A (2005) Evolution and structure of the internet: a statistical physics approach. Cambridge Univeristy Press, Cambridge

  10. AraI, S, Muchnik, L, Arun S (2009) Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks. Proceedings of the National Academy of Sciences 106(51):21544–21549

  11. Wasserman S, Faust KD (1994) Social network analysis: methods and applications (Structural Analysis in the social sciences). Cambridge University Press, Cambridge

  12. Zhou S, Mondragon RJ (2004) The rich-club phenomenon in the internet topology. IEEE Commun Lett 8(3):180–182

    Article  Google Scholar 

  13. Aghaee Z, Beni HA, Kianian S, Vahidipour M (2020) A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem in Social Networks. In 2020 6th International Conference on Web Research (ICWR) (pp. 119–125). IEEE

  14. Zhang Z, Hou R, & Yang J (2020) Detection of Social Network Spam Based on Improved Extreme Learning Machine. IEEE Access 8:112003–112014

  15. Zheng C, Han Q, & Wang H (2015) How do paid posters’ comments affect your purchase intention. Nankai Business Review 18:89–97

  16. Beni HA, & Bouyer A (2020) TI-SC: top-k influential nodes selection based on community detection and scoring criteria in social networks. Journal of Ambient Intelligence and Humanized Computing, 1–20

  17. Watts DJ (2002) A simple model of global cascades on random networks. Proc Natl Acad Sci USA 99(9):5766–5771

    Article  MathSciNet  Google Scholar 

  18. Tong G, Wu W, Tang S, Du DZ (2016) Adaptive influence maximization in dynamic social networks. IEEE/ACM Transactions on Networking 25(1):112–125

  19. Tang Y, Shi Y, & Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In Proceedings of the 2015 ACM SIGMOD international conference on management of data (pp. 1539–1554)

  20. Nguyen DL, Nguyen TH, Do TH, Yoo M (2017)Probability-based multi-hop diffusion method for influence maximization in social networks. Wirel Pers Commun 93(4):903–916

    Article  Google Scholar 

  21. Chen W, Wang C, & Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 1029–1038)

  22. Sb A, Mj A, Dkp B (2019) Combim: a community-based solution approach for the budgeted influence maximization problem - sciencedirect. Expert Syst Appl 125:1–13

    Article  Google Scholar 

  23. He Q, Wang X, Lei Z, Huang M, Cai Y, Ma L (2019) Tifim: a two-stage iterative framework for influence maximization in social networks. Appl Math Comput 354:338–352

    MathSciNet  MATH  Google Scholar 

  24. Li W, Li Z, Luvembe AM, & Yang C (2021) Influence maximization algorithm based on Gaussian propagation model. Information Sciences 568:386-402

  25. Ma L, Liu Y (2019) Maximizing three-hop influence spread in social networks using discrete comprehensive learning artificial bee colony optimizer. Appl Soft Comput 83:105606

    Article  Google Scholar 

  26. Li W, Fan Y, Mo J, Liu W, Wang C, Xin M et al (2020)Three-hop velocity attenuation propagation model for influence maximization in social networks. World Wide Web 23(2):1261–1273

    Article  Google Scholar 

  27. Engelhardt F, & Güneş M (2019) Modeling delay of haptic data in CSMA-based wireless multi-hop networks: A probabilistic approach. In 2019 IEEE 30th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops) (pp. 1–6). IEEE

  28. Assari YE, Fallah SA, Aasri JE, Arioua M, Oualkadi AE (2020)Energy-efficient multi-hop routing with unequal clustering approach for wireless sensor networks. Int J Comput Netw Commun Secur 12(3):57–75

    Google Scholar 

  29. Adineh M, & Nouri-Baygi M (2018) Maximum degree based heuristics for influence maximization. In 2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) (pp. 256–261). IEEE

  30. Fanian F, Rafsanjani MK (2020) A new fuzzy multi-hop clustering protocol with automatic rule tuning for wireless sensor networks. Appl Soft Comput 89:106115

    Article  Google Scholar 

  31. Rashid SA, Audah L, Hamdi MM, Alani S (2020) Prediction based efficient multi-hop clustering approach with adaptive relay node selection for vanet. J Commun 15(4):332–344

    Article  Google Scholar 

  32. Qi C, Zhang J, Jia H, Mao Q, Song H (2021) Deep face clustering using residual graph convolutional network. Knowl-Based Syst 211:106561

    Article  Google Scholar 

  33. Adineh M, & Nouri-Baygi M (2019) High Quality Degree Based Heuristics for the Influence Maximization Problem. arXiv preprint arXiv:1904.12164

  34. Colizza V, Flammini A, Serrano MA, & Vespignani A (2006) Detecting rich-club ordering in complex networks. Nature physics 2(2):110–115

  35. Masuda N, Konno N (2012)Vip-club phenomenon: emergence of elites and masterminds in social networks. Soc Networks 28(4):297–309

    Article  Google Scholar 

  36. He R, Zhao J, & Xu K (2012)Rich-Club Connectivity in Large-Scale Complex Networks. In 2012 Second International Conference on Cloud and Green Computing (pp. 730–735). IEEE

  37. Dong Y, Tang J, Chawla NV, Lou T, Yang Y, & Wang B (2015) Inferring social status and rich club effects in enterprise communication networks. PloS one 10(3):e0119446

  38. Aghaee Z, & Kianian S (2020) Influence maximization algorithm based on reducing search space in the social networks. SN Applied Sciences 2(12):1–14

  39. Schirmer MD, Ktena SI, Nardin MJ, Donahue KL, Rost NS (2019)Rich-club organization: an important determinant of functional outcome after acute ischemic stroke. Front Neurol 10:956

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China [Grant No. 71772107] and Shandong Nature Science Foundation of China [Grant No. ZR2020MF044]. Moreover, the author thanks every reviewer who provided valuable comments and feedback. Similarly, we thank the researchers Xiangbo Tian, Jianyi Zhang, Yuying Liu who guided the writing of the paper. Finally, the author would like to thank Qiang Shi, the researcher who collected the data for the experiment.

Author information

Authors and Affiliations

  1. College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, 266590, China

    Xiuliang Duan, Liqing Qiu & Chengai Sun

  2. College of Mechanical and Electronic Engineering, Shandong University of Science and Technology, 266590, Qingdao, China

    Qiang Shi

Authors
  1. Xiuliang Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liqing Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chengai Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qiang Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liqing Qiu.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Duan, X., Qiu, L., Sun, C. et al. Multi-hop analysis method for rich-club phenomenon of influence maximization in social networks. Appl Intell 52, 8721–8734 (2022). https://doi.org/10.1007/s10489-021-02818-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02818-0

Keywords

Search

Navigation