Rich-Clubs in Preferential Attachment Networks

  • Yinon NahumEmail author
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 813)


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.


Preferential attachment Networks Rich club Founders 


  1. 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. 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. 3.
    Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5–34 (2004)MathSciNetCrossRefGoogle Scholar
  5. 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)zbMATHGoogle Scholar
  6. 6.
    Borgatti, S.P., Everett, M.G.: Models of core/periphery structures. Soc. Netw. 21(4), 375–395 (2000)CrossRefGoogle Scholar
  7. 7.
    Chung, F., Lu, L.: Complex Graphs and Networks. AMS, Providence (2006)Google Scholar
  8. 8.
    Colizza, V., Flammini, A., Serrano, M.A., Vespignani, A.: Detecting rich-club ordering in complex networks. Nat. Phys. 2(2), 110 (2006)CrossRefGoogle Scholar
  9. 9.
    Klemm, K., Eguiluz, V.M.: Growing scale-free networks with small-world behavior. Phys. Rev. E 65(5), 057102 (2002)CrossRefGoogle Scholar
  10. 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)CrossRefGoogle Scholar
  11. 11.
    Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)CrossRefGoogle Scholar
  12. 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)CrossRefGoogle Scholar
  13. 13.
    Price, DdS: A general theory of bibliometric and other cumulative advantage processes. J. Am. Soc. Inf. Sci. 27(5), 292–306 (1976)CrossRefGoogle Scholar
  14. 14.
    Wendel, J.G.: Note on the gamma function. Am. Math. Mon. 55(9), 563–564 (1948).
  15. 15.
    Zhou, S., Mondragón, R.J.: The rich-club phenomenon in the internet topology. IEEE Commun. Lett. 8(3), 180–182 (2004)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations