Skip to main content

Finding High-Degree Vertices with Inclusive Random Sampling

  • Conference paper
  • First Online:
Complex Networks & Their Applications IX (COMPLEX NETWORKS 2020 2020)

Abstract

The friendship paradox (FP) is the famous phenomenon that one’s friends typically have more friends than they themselves do. The FP has inspired novel approaches for sampling vertices at random from a network when the goal of the sampling is to find vertices of higher degree. The most famous of these methods involves selecting a vertex at random and then selecting one of its neighbors at random. Another possible method would be to select a random edge from the network and then select one of its endpoints at random, again predicated on the fact that high degree vertices will be overrepresented in the collection of edge endpoints. In this paper we propose a simple tweak to these methods where we consider the degrees of the two vertices involved in the selection process and choose the one with higher degree. We explore the different sampling methods theoretically and establish interesting asymptotic bounds on their performances as a way of highlighting their respective strengths. We also apply the methods experimentally to both synthetic graphs and real-world networks to determine the improvement inclusive sampling offers over exclusive sampling, which version of inclusive sampling is stronger, and what graph characteristics affect these results.

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

Access this chapter

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 EPUB and 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

Similar content being viewed by others

Notes

  1. 1.

    We will interchangeably use method abbreviations to refer to the method and the expected degree of a vertex it returns.

References

  1. Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Lett. Nat. 406, 378–382 (2000)

    Article  Google Scholar 

  2. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  3. Babak, F., Rabbat, M. G.: Degree Correlation in Scale-Free Graphs, arXiv:1308.5169 (2013)

  4. Bertotti, M.L., Modanese, G.: The Bass Diffusion Model on Finite Barabasi-Albert Networks, Phys. Soc. arXiv:1806.05959 (2018)

  5. Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S.: Breakdown of the internet under intentional attack. Phys. Rev. Lett. 86(16), 3682–3685 (2001)

    Article  Google Scholar 

  6. Cohen, R., Havlin, S., Ben-Avraham, D.: Efficient immunization strategies for computer networks and populations. Phys. Rev. Lett. 91(24), 247901 (2003)

    Article  Google Scholar 

  7. Christakis, N.A., Fowler, J.H.: Social network sensors for early detection of contagious outbreaks. PLoS ONE 5(9), e12948 (2010)

    Article  Google Scholar 

  8. Erdős, P., Rényi, A.: Publicationes Mathematicae 6(290) (1959)

    Google Scholar 

  9. Feld, S.: Why your friends have more friends than you do. Am. J. Soc. 96(6), 1464–1477 (1991)

    Article  Google Scholar 

  10. Kumar, V., Krackhardt, D., Feld, S.: Network Interventions Based on Inversity: Leveraging the Friendship Paradox in Unknown Network Structures (2018). https://vineetkumars.github.io/Papers/NetworkInversity.pdf

  11. Kunegis, J.: KONECT, The Koblenz Network Collection (2013). http://konect.cc/

  12. Momeni, N., Rabbat, M.G.: Effectiveness of Alter Sampling in Social Networks, https://arxiv.org/abs/1812.03096v2 (2018)

  13. Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89(20), 208701 (2002)

    Article  Google Scholar 

  14. Strogatz, S.: Friends You Can Count On, NY Times (2012). Accessed 17 Sep 2012. https://opinionator.blogs.nytimes.com/2012/09/17/friends-you-can-count-on/

  15. Van Mieghem, P., Wang, H., Ge, X., Tang, S., Kuipers, F.A.: Influence of assortativity and degree-preserving rewiring on the spectra of networks. Eur. Phys. J. B 76, 643–652 (2010)

    Article  Google Scholar 

  16. Xulvi-Brunet, R., Sokolov, I.M.: Reshuffling scale-free networks: from random to assortative. Phys. Rev. 70, 066102 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yitzchak Novick .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Novick, Y., BarNoy, A. (2021). Finding High-Degree Vertices with Inclusive Random Sampling. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds) Complex Networks & Their Applications IX. COMPLEX NETWORKS 2020 2020. Studies in Computational Intelligence, vol 943. Springer, Cham. https://doi.org/10.1007/978-3-030-65347-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-65347-7_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-65346-0

  • Online ISBN: 978-3-030-65347-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics