Skip to main content
SpringerLink
Log in

EDGly: detection of influential nodes using game theory

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Identifying those nodes that play a critical role within a network is of great importance. Many applications such as gossip spreading, disease spreading, news dispersion, identifying prominent individuals in a social network, etc. may take advantage of this knowledge in a complex network. The basic concept is generally to identify the nodes with the highest criticality in a network. As a result, the centrality principle has been studied extensively and in great detail, focusing on creating a consistent and accurate location of nodes within a network in terms of their importance. Both single centrality measures and group centrality measures, although, have their certain drawbacks. Other solutions to this problem include the game-theoretic Shapley Value (SV) calculations measuring the effect of a collection of nodes in complex networks via dynamic network data propagation process. Our novel proposed algorithm aims to find the most significant communities in a graph with community structure and then employs the SV-based games to find the most influential node from each community. A Susceptible-Infected-Recovered (SIR) model has been employed to distinctly determine each powerful node's capacity to spread. The results of the SIR simulation have also been used to show the contrast between the spreading capacity of nodes found through our proposed algorithm and that of nodes found using SV-algorithm and centrality measures alone.

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

Similar content being viewed by others

References

  1. Aadithya KV, Ravindran B, Michalak TP, Jennings NR (2010) Efficient computation of the shapely value for centrality in networks. In: Saberi A (ed) Internet and Network Economics, WINE, Lecture Notes in Computer Science, vol 6484

  2. Al-Garadi MA, Varathan KD, Ravana SD (2017) Identification of influential spreaders in online social networks using interaction weighted k-core decomposition method. Phys A 468:278–288

    Article  Google Scholar 

  3. Amati G, Angelini S, Gambosi G, Rossi G, Vocca P (2019) Influential users in Twitter: detection and evolution analysis. Multimed Tools Appl 78:3395–3407

    Article  Google Scholar 

  4. Bhuiyan BA (2018) An overview of game theory and some applications. Philos Progress 59(1–2):111–128

    Article  Google Scholar 

  5. Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech. https://doi.org/10.1088/1742-5468/2008/10/P10008

    Article  MATH  Google Scholar 

  6. Bureau of Transportation Statistics. https://transtats.bts.gov/

  7. Chen W, Teng SH (2017) Interplay between social influence and network centrality: a comparative study on shapley centrality and single-node-influence centrality. In: WWW '17: Proceedings of the 26th international conference on World Wide Web, pp 967–976

  8. Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and Data mining, pp 57–66

  9. Freeman LC (1978–1979) Centraity in social networks conceptual clarification. Soc Netw 1(3):215–239

  10. Gao S, Ma J, Chen Z, Wang G, Xing C (2014) Ranking the spreading ability of nodes in complex networks based on local structure. Phys A 403:130–147

    Article  Google Scholar 

  11. Guo C, Chen X, Chen D, Gao H, Yang L, Ma J (2020) Influential nodes identification in complex networks via information entropy. Entropy 22:242

    Article  MathSciNet  Google Scholar 

  12. Huang L, Wang C, Chao H (2018) A harmonic motif modularity approach for multi-layer network community detection. In: IEEE International Conference on Data Mining (ICDM), pp 1043–1048

  13. Irfan MT, Ortiz LE (2011) A game theoretic approach to influence in networks. In: Proceedings of the twenty-fifth AAAI conference on artificial intelligence (AAAI’11), AAAI Press, pp 688–694

  14. Jiang L, Zhao X, Ge B, Xiao W, Ruan Y (2019) An efficient algorithm for mining a set of influential spreaders in complex networks. Phys A 516:58–65

    Article  Google Scholar 

  15. Li PZ, Cai YX, Wang CD, Liang MJ, Zheng YQ (2019) Higher-order brain network analysis for auditory disease. Neural Process Lett 49:1–19

    Article  Google Scholar 

  16. Li PZ, Huang L, Wang CD, Huang D, Lai JH (2018) Community detection using attribute homogenous motif. IEEE Access 6:47707–47716

    Article  Google Scholar 

  17. Li PZ, Huang L, Wang CD, Lai JH (2019) EdMot: An edge enhancement approach for motif-aware community detection. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining (KDD ’19), Association for Computer Machinery, New York, pp 479–487

  18. Liu F, Li M (2019) A game theory-based network spreading model: based on game experiments. Int J Mach Learn Cybern 10:1449–1457

    Article  Google Scholar 

  19. Liu HL, Ma C, Xiang BB, Tang M, Zhang HF (2018) Identifying multiple influential spreaders based on generalized closeness centrality. Phys A 492:2237–2248

    Article  Google Scholar 

  20. Ll Ma, Ma C, Zhang HF, Wang BH (2016) Identifying influential spreaders in complex networks based on gravity formula. Phys A 451:205–212

    Article  Google Scholar 

  21. Mao C, Xiao W (2018) A comprehensive algorithm for evaluating node influences in social networks based on preference analysis and random walk. Complexity 40:1–16

    Google Scholar 

  22. Michalak TP, Aadithya KV, Ravindran B, Jennings NR, Szczepanski PL (2013) Efficient computation of the shapley value for game-theoretic network centrality. J Artif Int Res 46(1):607–650

    MathSciNet  MATH  Google Scholar 

  23. Ni C, Sugimoto CR, Jiang J (2013) Degree, closeness, and betweenness: application of group centrality measurements to explore macro-disciplinary evolution diachronically

  24. Nie T, Guo Z, Zhao K, Lu ZM (2016) Using mapping entropy to identify node centrality in complex networks. Phys A 453(2016):290–297

    Article  Google Scholar 

  25. Opsahl T (2013) Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Soc Netw 35(2):159–167. https://doi.org/10.1016/j.socnet.2011.07.001

    Article  Google Scholar 

  26. Poulin V, Théberge F (2018) Ensemble clustering for graphs. arXiv:1809.05578

  27. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifiying communities in networks. PNAS 101(9):2658–2663

    Article  Google Scholar 

  28. Shetty J, Adibi J (2005) Discovering important nodes through graph entropy: the case of Enron email database. In: LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery, pp 74–81

  29. Stephenson K, Zelen M (1989) Rethinking centrality: methods and examples. Soc Netw 11(1):1–37

    Article  MathSciNet  Google Scholar 

  30. Tan CW, Yu PD, Zheng L, Lai CK, Zhang W, Fu HL (2016) Optimal detection of influential spreaders in online social networks. In: Proceeding of annual conference on information sciences and systems, pp 145–150

  31. Tarkowski MK, Michalak TP, Rahwan T, Wooldridge M (2017) Game-theoretic network centrality: a review. arXiv preprint arXiv:1801.00218

  32. Wei H, Pan Z, Hu G, Zhang L, Yang H, Li X, Zhou X (2018) Identifying influential nodes based on network representation learning in complex networks. PLoS ONE 13(7):e0200091

    Article  Google Scholar 

  33. Yadati N, Narayanam R (2011) Game theoretic models for social network analysis. In: Proceedings of the 20th international conference companion on World Wide Web–WWW’ 11, pp 291–292

  34. Yang Z, Algesheimer R, Tessone CJ (2016) A comparative analysis of community detection algorithms on artificial networks. Sci Rep 6:30750

    Article  Google Scholar 

  35. Zhan J, Gurung S, Parsa SPK (2017) Identification of top-k nodes in large networks using Katz centrality. J Big Data 4:16

    Article  Google Scholar 

  36. Zhang X, Zhu J, Wang Q, Zhao H (2013) Identifying influential nodes in complex network with community structures. Knowl-Based Syst 42:74–84

    Article  Google Scholar 

  37. Zhao L, Cui H, Qiu X, Wang X, Wang J (2013) SIR Rumour spreading model in the new media age. Phys A 392(4):995–1003

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Delhi Technological University, Delhi, India

    Minni Jain, Aman Jaswani, Ankita Mehra & Laqshay Mudgal

Authors
  1. Minni Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aman Jaswani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ankita Mehra
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Laqshay Mudgal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Minni Jain.

Additional information

Publisher's Note

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

Appendix

Appendix

figure b
figure c
figure d
figure e
figure f

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jain, M., Jaswani, A., Mehra, A. et al. EDGly: detection of influential nodes using game theory. Multimed Tools Appl 81, 1625–1647 (2022). https://doi.org/10.1007/s11042-021-11440-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-021-11440-8

Keywords

Search

Navigation