title: Correlations in complex networks under attack.
abstract: For any initially correlated network after any kind of attack where either nodes or edges are removed, we obtain general expressions for the degree-degree probability matrix and degree distribution. We show that the proposed analytical approach predicts the correct topological changes after the attack by comparing the evolution of the assortativity coefficient for different attack strategies and intensities in theory and simulations. We find that it is possible to turn an initially assortative network into a disassortative one, and vice versa, by fine-tuning removal of either nodes or edges. For an initially uncorrelated network, on the other hand, we discover that only a targeted edge-removal attack can induce such correlations.
authors.affiliation: Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, 721302 Kharagpur, India.
authors.forename: Animesh
authors.initials: A
authors.lastname: Srivastava
authors.forename: Bivas
authors.initials: B
authors.lastname: Mitra
authors.forename: Niloy
authors.initials: N
authors.lastname: Ganguly
authors.forename: Fernando
authors.initials: F
authors.lastname: Peruani
mesh_terms: D000465:Algorithms; D003195:Computer Communication Networks; D016494:Computer Security; D003198:Computer Simulation; D008962:Models, Theoretical; D013223:Statistics as Topic