Skip to main content
SpringerLink
Log in
Book cover

International Conference on Complex Networks and their Applications

COMPLEX NETWORKS 2018: Complex Networks and Their Applications VII pp 67–79Cite as

Rich-Clubs in Preferential Attachment Networks

  • Conference paper
  • First Online:

  • 2491 Accesses

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

Abstract

Consider the general random preferential attachment model G(p) for network evolution that allows both node and edge arrivals. Starting with an arbitrary nonempty graph \(G_0\), at each time step, either with probability \(p>0\) a new node arrives and connects to an existing node, or with probability \(1-p\) a new edge is added between two existing nodes. In both cases, the existing nodes are chosen at random with probability proportional to their degree. Letting the \(\delta \) - fraction rich club of the network be the smallest set of nodes which, collectively, hold a \(\delta \) fraction of the total degree in the network, we show that its size is concentrated around \(f_p\left( \delta \right) \cdot n_t\), where \(n_t\) is the number of nodes in the network, and \(f_p\) is a convex continuous piecewise-linear function. This answers the open question of whether or not the \(\delta \) - fraction rich club constitutes a constant fraction of the number of nodes in the network. We provide a full description of \(f_p\). Finally, we compare this with the size of the \(\delta \) - founders of the network defined as the smallest set of the first nodes to enter the network which, collectively, hold a \(\delta \) fraction of the total degree in the network.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   219.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

Learn about institutional subscriptions

Notes

  1. 1.

    Note that x and \(\mathbf {x'}\) are real-valued vectors and not random variables.

References

  1. Avin, C., Lotker, Z., Nahum, Y., Peleg, D.: Core size and densification in preferential attachment networks. In: Automata, Languages, and Programming, pp. 492–503. Springer, Berlin (2015)

    Google Scholar 

  2. Avin, C., Lotker, Z., Nahum, Y., Peleg, D.: Improved degree bounds and full spectrum power laws in preferential attachment networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 45–53. ACM, New York (2017)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5–34 (2004)

    Article  MathSciNet  Google Scholar 

  5. Bollobás, B., Riordan, O.M.: Mathematical results on scale-free random graphs. Handbook of Graphs and Networks: From the Genome to the Internet, pp. 1–34. Wiley, New York (2003)

    MATH  Google Scholar 

  6. Borgatti, S.P., Everett, M.G.: Models of core/periphery structures. Soc. Netw. 21(4), 375–395 (2000)

    Article  Google Scholar 

  7. Chung, F., Lu, L.: Complex Graphs and Networks. AMS, Providence (2006)

    Google Scholar 

  8. Colizza, V., Flammini, A., Serrano, M.A., Vespignani, A.: Detecting rich-club ordering in complex networks. Nat. Phys. 2(2), 110 (2006)

    Article  Google Scholar 

  9. Klemm, K., Eguiluz, V.M.: Growing scale-free networks with small-world behavior. Phys. Rev. E 65(5), 057102 (2002)

    Article  Google Scholar 

  10. McAuley, J.J., da Fontoura Costa, L., Caetano, T.S.: Rich-club phenomenon across complex network hierarchies. Appl. Phys. Lett. 91(8), 084,103 (2007)

    Article  Google Scholar 

  11. Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)

    Book  Google Scholar 

  12. Opsahl, T., Colizza, V., Panzarasa, P., Ramasco, J.J.: Prominence and control: the weighted rich-club effect. Phys. Rev. Lett. 101(16), 168,702 (2008)

    Article  Google Scholar 

  13. Price, DdS: A general theory of bibliometric and other cumulative advantage processes. J. Am. Soc. Inf. Sci. 27(5), 292–306 (1976)

    Article  Google Scholar 

  14. Wendel, J.G.: Note on the gamma function. Am. Math. Mon. 55(9), 563–564 (1948). http://www.jstor.org/stable/2304460

  15. Zhou, S., Mondragón, R.J.: The rich-club phenomenon in the internet topology. IEEE Commun. Lett. 8(3), 180–182 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Weizmann Institute of Science, Rehovot, Israel

    Yinon Nahum

Authors
  1. Yinon Nahum
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yinon Nahum .

Editor information

Editors and Affiliations

  1. Nokia Bell Labs, Cambridge, UK

    Luca Maria Aiello

  2. IUT Lumière, University of Lyon, Bron Cedex, France

    Chantal Cherifi

  3. LE2I UMR CNRS 6306 9, University of Burgundy, Dijon Cedex, France

    Hocine Cherifi

  4. Mathematical Institute, University of Oxford, Oxford, UK

    Renaud Lambiotte

  5. Department of Computer Science and Technology, The Computer Laboratory, University of Cambridge, Cambridge, UK

    Pietro Lió

  6. Center for Complex Networks and Systems Research, School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN, USA

    Luis M. Rocha

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nahum, Y. (2019). Rich-Clubs in Preferential Attachment Networks. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 813. Springer, Cham. https://doi.org/10.1007/978-3-030-05414-4_6

Download citation

Publish with us

Policies and ethics

Search

Navigation