The robustness of assortativity (short paper)

Antonio Scala, Gregorio D'Agostino

Research output: Contribution to conferencePaper

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. © 2013 Springer-Verlag.
Original languageEnglish
DOIs
Publication statusPublished - 2013
Event6th International Workshop on Critical Information Infrastructures Security, CRITIS 2011 - , Switzerland
Duration: 1 Jan 2013 → …

Conference

Conference6th International Workshop on Critical Information Infrastructures Security, CRITIS 2011
CountrySwitzerland
Period1/1/13 → …

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Scala, A., & D'Agostino, G. (2013). The robustness of assortativity (short paper). Paper presented at 6th International Workshop on Critical Information Infrastructures Security, CRITIS 2011, Switzerland. https://doi.org/10.1007/978-3-642-41476-3_22