Preferential network perturbation

We study network robustness to perturbation for a pair of non-directional networks, motivated by applications in cancer network modelling. The susceptibility of single networks to attack and failure has been well-studied, but a similar problem for a pair of networks with non-zero similarity has so far not been considered. In the current approach, we wish to maximise the perturbation of one network while minimising that of a second network, thus achieving a “preferential” perturbation. We focus on network pairs derived from a single underlying network which we call “correlated” networks, and use model networks to generate results and principles for general network topologies.

[1]  P. Cluzel,et al.  A natural class of robust networks , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Luciano da Fontoura Costa,et al.  Reinforcing the resilience of complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  M. Newman,et al.  Network theory and SARS: predicting outbreak diversity , 2004, Journal of Theoretical Biology.

[5]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[6]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[7]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  H. Milward,et al.  Dark Networks as Problems , 2003 .

[9]  Sergey N. Dorogovtsev,et al.  Principles of statistical mechanics of random networks , 2002, ArXiv.

[10]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[11]  Peder J. Johnson,et al.  Assessing Structural Knowledge. , 1991 .

[12]  B. Bollobás The evolution of random graphs , 1984 .

[13]  Ying-Cheng Lai,et al.  Complex networks: Dynamics and security , 2005 .

[14]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[15]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[16]  Adilson E Motter,et al.  Cascade-based attacks on complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  S. Havlin,et al.  Optimization of robustness of complex networks , 2004, cond-mat/0404331.

[18]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[19]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.