Skip to main content
Log in

Random networks with given rich-club coefficient

  • Regular Article
  • Published:
The European Physical Journal B Aims and scope Submit manuscript

Abstract

In complex networks it is common to model a network or generate a surrogate network based on the conservation of the number of connections of individual nodes. In this paper we analyse the ensemble of random networks that are defined by the conservation of the rich-club coefficient, which measures the density of connections among a group of nodes. We also present a method to generate such surrogate networks for a given network. We show that by choosing a suitable local linking term, the random networks not only preserve the rich-club coefficient but also closely approximate the degree distribution and the mixing pattern of real networks. Our work provides a different and complementary perspective to the network randomisation problem.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B.F.J. Manly, Randomization, Bootstrap and Monte Carlo Methods in Biology, 2nd edn. (Chapman & Hall, 1997)

  2. M. Molloy, B. Reed, Comb. Probab. Comput. 7, 225 (1998)

    Article  MathSciNet  Google Scholar 

  3. S. Maslov, K. Sneppen, Science 296, 910 (2002)

    Article  ADS  Google Scholar 

  4. S. Zhou, R.J. Mondragón, IEEE Commun. Lett. 8, 180 (2004)

    Article  Google Scholar 

  5. R. Albert, A.-L. Barabási, Rev. Mod. Phys. 74, 49 (2002)

    Article  ADS  Google Scholar 

  6. S.N. Dogorovstev, Lectures on Complex Networks (Oxford University Press, 2010)

  7. N. Masuda, N. Konno, Social Netw. 28, 297 (2006)

    Article  Google Scholar 

  8. S. Zhou, R.J. Mondragón, IEEE Electr. Lett. 2, 151 (2004)

    Article  Google Scholar 

  9. V. Colizza, A. Flammini, M.A. Serrano, A. Vespignani, Nat. Phys. 2, 110 (2006)

    Article  Google Scholar 

  10. J.J. McAuley, T.S. Caetano, L. da F. Costa. Appl. Phys. Lett. 91, (2007)

  11. X.-K. Xu, J. Zhang, M. Small, Phys. Rev. E 82, 046117 (2010)

    Article  ADS  Google Scholar 

  12. S. Zhou, R.J. Mondragón, New J. Phys. 9, 173 (2007)

    Article  ADS  Google Scholar 

  13. M.E.J. Newman, Proc. Natl. Acad. Sci. USA 98, 404 (2001)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  14. V. Colizza, A. Flammini, A. Maritan, A. Vespignani, Physica A 352, 1 (2005)

    Article  ADS  Google Scholar 

  15. P. Mahadevan, D. Krioukov, M. Fomenkov, B. Huffaker, X. Dimitropoulos, K.C. Claffy, A. Vahdat, Comput. Commun. Rev. 36, (2006)

  16. D.J. Watts, S.H. Strogatz, Nature 440, 409 (1998)

    Google Scholar 

  17. A. Jamakovic, P. Mahadevan, A. Vahdat, M. Boguña, D. Krioukov, How small are building blocks of complex networks, CoRR (abs/0908.1143) (2009)

  18. J.F. Nagle, J. Math. Phys. 7, 1588 (1966)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  19. Y. Guo, C. Chen, S. Zhou, Electr. Lett. 43 (2007)

  20. R.J. Mondragón, Phil. Trans. R. Soc. A 366, 1931 (2008)

    Article  ADS  MATH  Google Scholar 

  21. C. Chen Y. Guo, S. Zhou, Fingerprint for network topologies, in Proceedings of the First International Conference in Complex Sciences, China, 2009, edited by J. Zhou (Lecture Notes of the Institute for Computer Sciences, Springer, 2009), Vol. 5, pp. 1666–1667

  22. R. Pastor-Satorras, A. Vázquez, A. Vespignani, Phys. Rev. Lett. 87, 258701 (2001)

    Article  ADS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. J. Mondragón.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mondragón, R.J., Zhou, S. Random networks with given rich-club coefficient. Eur. Phys. J. B 85, 328 (2012). https://doi.org/10.1140/epjb/e2012-21026-3

Download citation

  • Received:

  • Revised:

  • Published:

  • DOI: https://doi.org/10.1140/epjb/e2012-21026-3

Keywords

Navigation