Abstract
Complex networks are ubiquitous in real word and represent a key model for both human made and natural systems. An important characteristics that distinguishes technological networks from biological networks is the assortativity, i.e. the correlation among the degrees of connected nodes. We apply spectral analysis to investigate how assortativity influences the robustness of a network with respect to failure propagations or epidemic spreading. We find a no free lunch situation: while disassortative networks are more robust since they have a higher failure threshold, in assortative networks there is more time for intervention before total breakdown.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Caldarelli, G.: Scale free networks. Oxford University Press, Oxford (2007)
Buchanan, M., Caldarelli, G., De Los Rios, P., Rao, F., Vendruscolo, M. (eds.): Networks in cell biology. Cambridge University Press, Cambridge (2010)
Caldarelli, G., Vespignani, A. (eds.): Large scale structure and dynamics of complex networks. World Scientific, Singapore (2007)
Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89(20), 208701 (2002)
Newman, M.E.J.: Mixing patterns in networks. Phys. Rev. E 67(2), 026126 (2003)
Maslov, S., Sneppen, K.: Specificity and Stability in Topology of Protein Networks. Science 296(5569), 910–913 (2002)
Zhou, S., Mondragón, R.J.: Structural constraints in complex networks. New Journal of Physics 9(6), 173 (2007)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–511 (1999)
Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, vol. 92. American Mathematical Society (February 1997)
Wang, Y., Chakrabarti, D., Wang, C., Faloutsos, C.: Epidemic spreading in real networks: An eigenvalue viewpoint. In: SRDS, pp. 25–34 (2003)
Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., Faloutsos, C.: Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur. 10, 1:1–1:26 (2008)
Eguíluz, V.M., Klemm, K.: Epidemic threshold in structured scale-free networks. Phys. Rev. Lett. 89(10), 108701 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scala, A., D’Agostino, G. (2013). The Robustness of Assortativity. In: Bologna, S., Hämmerli, B., Gritzalis, D., Wolthusen, S. (eds) Critical Information Infrastructure Security. CRITIS 2011. Lecture Notes in Computer Science, vol 6983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41476-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-41476-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41475-6
Online ISBN: 978-3-642-41476-3
eBook Packages: Computer ScienceComputer Science (R0)