Skip to main content

Identifying Influential Spreaders by Graph Sampling

  • Conference paper
  • First Online:
Complex Networks & Their Applications V (COMPLEX NETWORKS 2016 2016)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 693))

Included in the following conference series:

Abstract

The complex nature of real world networks is a central subject in several disciplines, from Physics to computer science. The complex network dynamics of peers communication and information exchange are specified to a large degree by the most efficient spreaders - the entities that play a central role in various ways such as the viruses propagation, the diffusion of information, the viral marketing and network vulnerability to external attacks. In this paper, we deal with the problem of identifying the influential spreaders of a complex network when either the network is very large or else we have limited computational capabilities to compute global centrality measures. Our approach is based on graph sampling and specifically on Rank Degree, a newly published graph exploration sampling method. We conduct extensive experiments in five real world networks using four centrality metrics for the nodes spreading efficiency. We present strong evidence that our method is highly effective. By sampling 30% of the network and using at least two out of four centrality measures, we can identify more than 80% of the influential spreaders, while at the same time, preserving the original ranking to a large extent.

The original version of this chapter was revised. An erratum to this chapter can be found at 10.1007/978-3-319-50901-3_66

An erratum to this chapter can be found at http://dx.doi.org/10.1007/978-3-319-50901-3_66

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30(1), 107 – 117 (1998)

    Google Scholar 

  2. Chen, D., Lu, L., Shang, M.S., Zhang, Y.C., Zhou, T.: Identifying influential nodes in complex networks. Physica A: Statistical Mechanics and its Applications 391(4), 1777 – 1787 (2012)

    Google Scholar 

  3. Chen, D.B., Gao, H., Lu, L., Zhou, T.: Identifying influential nodes in large-scale directed networks: The role of clustering. PLoS ONE 8(10), 1–10 (2013)

    Google Scholar 

  4. Costenbader, E., Valente, T.W.: The stability of centrality measures when networks are sampled. Social Networks 25(4), 283–307 (2003)

    Google Scholar 

  5. Freeman, L.C.: Centrality in social networks conceptual clarification. Social Networks 1(3), 215 – 239 (1978)

    Google Scholar 

  6. Haveliwala, T.H.: Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE Trans. on Knowl. and Data Eng. 15(4), 784 – 796 (2003)

    Google Scholar 

  7. Kempe, D., Kleinberg, J., Tardos, E.: 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, pp. 137–146. ACM, New York, NY, USA (2003)

    Google Scholar 

  8. Kendall, M.G.: A new measure of rank correlation. Biometrika 30(1-2), 81–93 (1938)

    Google Scholar 

  9. Kitsak, M., Gallos, L.K., Havlin, S., Liljerosand, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nature Physics (2010)

    Google Scholar 

  10. Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, 2006, pp. 631–636 (2006)

    Google Scholar 

  11. Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, Illinois, USA, August 21-24, 2005, pp. 177–187 (2005)

    Google Scholar 

  12. Li, Q., Zhou, T., Lu, L., Chen, D.: Identifying influential spreaders by weighted LeaderRank. Physica A: Statistical Mechanics and its Applications 404, 47 – 55 (2014)

    Google Scholar 

  13. Linyuan, L., Zhang, Y.C., Yeung, C.H., Zhou, T.: Leaders in social networks, the delicious case. PLoS ONE 6(6), 1–9 (2011)

    Google Scholar 

  14. Ribeiro, B.F., Towsley, D.F.: Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM Internet Measurement Conference, IMC 2010, Melbourne, Australia - November 1-3, 2010, pp. 390–403 (2010)

    Google Scholar 

  15. Seidman, S.B.: Network structure and minimum degree. Social Networks 5(3), 269 – 287 (1983)

    Google Scholar 

  16. Shai, C., Shlomo, H., Scott, K., Yuval, S., Eran, S.: From the Cover: A model of Internet topology using k-shell decomposition. PNAS 104(27), 11,150–11,154 (2007)

    Google Scholar 

  17. Valente, T.W., Coronges, K., Lakon, C., Costenbader, E.: How correlated are network centrality measures? Connections (Toronto, Ont.) 28(1), 16–26 (2008)

    Google Scholar 

  18. Voudigari, E., Salamanos, N., Papageorgiou, T., Yannakoudakis, E.J.: Rank degree: An efficient algorithm for graph sampling. In: 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), August 18-21, 2016, San Francisco, CA, USA (2016)

    Google Scholar 

  19. Zeng, A., Zhang, C.J.: Ranking spreaders by decomposing complex networks. Physics Letters A 377(14), 1031 – 1035 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Nikos Salamanos , Elli Voudigari or Emmanuel J. Yannakoudakis .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Salamanos, N., Voudigari, E., Yannakoudakis, E.J. (2017). Identifying Influential Spreaders by Graph Sampling. In: Cherifi, H., Gaito, S., Quattrociocchi, W., Sala, A. (eds) Complex Networks & Their Applications V. COMPLEX NETWORKS 2016 2016. Studies in Computational Intelligence, vol 693. Springer, Cham. https://doi.org/10.1007/978-3-319-50901-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50901-3_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50900-6

  • Online ISBN: 978-3-319-50901-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics