Skip to main content

Thank you for visiting You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Taming complexity

The science of networks is experiencing a boom. But despite the necessary multidisciplinary approach to tackle the theory of complexity, scientists remain largely compartmentalized in their separate disciplines. Can they find a common voice?

This is a preview of subscription content, access via your institution

Relevant articles

Open Access articles citing this article.

Access options

Buy article

Get time limited or full article access on ReadCube.


All prices are NET prices.

Figure 1: Connected.



  1. Erdős, P. & Rényi, A. Publ. Math. Debrecen 6, 290–291 (1959).

    MathSciNet  Google Scholar 

  2. Albert, R., Jeong, H. & Barabási, A.-L. Nature 401, 130–131 (1999).

    Article  ADS  Google Scholar 

  3. Barabási, A.-L. & Albert, R. Science 286, 509–512 (1999).

    Article  ADS  MathSciNet  Google Scholar 

  4. Watts, D. J. & Strogatz, S. H. Nature 393, 440–442 (1998).

    Article  ADS  Google Scholar 

  5. Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N. & Barabasi, A.-L. Nature 407, 651–654 (2000).

    Article  ADS  Google Scholar 

  6. Wagner, A. & Fell, D. Proc. R. Soc. Lond. B 268, 1803–1810 (2001).

    Article  Google Scholar 

  7. Pastor-Satorras, R. & Vespignani, A. Phys. Rev. Lett. 86, 3200–3203 (2001).

    Article  ADS  Google Scholar 

  8. Albert, R., Jeong, H. & Barabási, A.-L. Nature 406, 378–382 (2000).

    Article  ADS  Google Scholar 

  9. Amaral, L. A. N., Scala, A., Barthelemy, M. & Stanley, H. E. Proc. Natl Acad. Sci. 97, 11149–11152 (2001).

    Article  ADS  Google Scholar 

  10. Bollobás, B. Random Graphs (Cambridge Univ. Press, 2001).

    Book  Google Scholar 

  11. Faloutsos, M., Faloutsos, P. & Faloutsos, C. Comput. Commun. Rev. 29, 251–262 (1999).

    Article  Google Scholar 

  12. Ebel, H., Mielsch, L. I. & Bornholdt, S. Phys. Rev. E 66, 035103 (2002).

    Article  ADS  Google Scholar 

  13. Cohen, R., Reez, K., Ben-Avraham, D. & Havlin, S. Phys. Rev. Lett. 85, 4626–4628 (2000).

    Article  ADS  Google Scholar 

  14. Eubank, S. et al. Nature 429, 180–184 (2004).

    Article  ADS  Google Scholar 

  15. Girvan, M. & Newman, M. E. J. Proc. Natl Acad. Sci. 99, 7821–7826 (2002).

    Article  ADS  Google Scholar 

  16. Palla, G., Derenyi, I., Farkas, I. & Vicsek, T. Nature 435, 814–818 (2005).

    Article  ADS  Google Scholar 

  17. Milo, R. et al. Science 298, 824–827 (2002).

    Article  ADS  Google Scholar 

  18. Dorogovtsev, S. N. & Mendes, J. F. F. Advances in Physics 51, 1079–1187 (2002).

    Article  ADS  Google Scholar 

  19. Krapivsky, P. L., Redner, S. & Leyvraz, F. Phys. Rev. Lett. 85, 4629–4632 (2000).

    Article  ADS  Google Scholar 

  20. Caldarelli, G., Capocci, A., De Los Rios, P. & Munoz, M. A. Phys. Rev. Lett. 89, 258702 (2002).

    Article  ADS  Google Scholar 

  21. Bianconi, G. & Barabási, A.-L. Phys. Rev. Lett. 86, 5632–5635 (2001).

    Article  ADS  Google Scholar 

  22. Network Science (National Research Council, National Academy Press, Washington DC, 2005).

Download references

Author information

Authors and Affiliations


Rights and permissions

Reprints and Permissions

About this article

Cite this article

Barabási, AL. Taming complexity. Nature Phys 1, 68–70 (2005).

Download citation

  • Issue Date:

  • DOI:

This article is cited by


Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing