Skip to main content

RAn (Robustness Analyser)

  • Conference paper
Book cover Unifying Themes in Complex Systems IV
  • 1345 Accesses

Abstract

In this paper, we present RAn, a simple and user friendly software tool for analysing topological robusntess of random graphs. The underlying model and the methodology are briefly described, then RAn’s potential as a research and design tool is illustrated through a basic practical example.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Albert R., H. Jeong, and A.-L. Barabasi (1999), “Diameter of the World-Wide Web”, Nature 401, pages 130–131.

    Article  ADS  Google Scholar 

  • Albert R., H. Jeong, and A.-L. Barabasi (2000), “Error and attack tolerance of complex networks”, Nature 406, pages 376–382.

    Article  ADS  Google Scholar 

  • Barabasi A.-L., R. Albert and H. Jeong (1999), “Mean-field theory for scale-free random networks”. Physica A 272, pages 173–187.

    Article  ADS  Google Scholar 

  • Callaway D.S., M.E.J. Newman, S. H. Strogatz, and D.J. Watts, “Network Robustness and Fragility: Percolation on Random Graphs” (2000), Phys. Rev. Letters 85, pages 5468–5471.

    Article  ADS  Google Scholar 

  • Cohen R., K. Erez, D. ben-Avraham and S. Havlin (2000), “Resilience of the Internet to random breakdowns”, Phys. Rev. Letters 85, pages 4626–4628.

    Article  ADS  Google Scholar 

  • Faloutsos M., P. Faloutsos, and C. Faloutsos (1999), “On Power-Law Relationships of the Internet Topology”, ACM SIGCOMM’ 99, Comput. Commun. Rev. 29, pages 251–263.

    Article  Google Scholar 

  • Tadic B. (2001), “Dynamics of directed graphs: the world-wide Web”, Physica A 293, pages 273–284.

    Article  MATH  ADS  Google Scholar 

  • Saffre F. and R. Ghanea-Hercock (2001), “Robustness in Complex Network: a simplified model”, International Conference on Dynamical Networks in Complex Systems.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 NECSI Cambridge, Massachusetts

About this paper

Cite this paper

Saffre, F. (2008). RAn (Robustness Analyser). In: Minai, A.A., Bar-Yam, Y. (eds) Unifying Themes in Complex Systems IV. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73849-7_2

Download citation

Publish with us

Policies and ethics