[39] This convergence result is easy to obtain if A is diago- nalizable. For non-diagonalizable cases, see Ref. [14] for details. [25] L. M. Pecora and T. L. Carroll, Phys. Rev. Lett. 80 , 2109 [24] M. Fiedler, in Combinatorics and Graph Theory (PWN- Polish Scientific Publishers, 1989), vol. 25 of Banach Center Publications , pp. 57–70. [23] N. Alon and V. D. Milman, J. Combin. Theory Ser. B 38 , 73 (1985). [22] S. Hoory, N. Linial, and A. Wigderson, Bull. Amer. Math. Soc. 43 , 439 (2006). [21] E. Estrada, Phys. Rev. E 75 , 016103 (2007). [38] As particular case, taking b$_{ij}$ = $_{−}$a$_{ij}$ amounts to delet- ing the edge ( i, j ). On the other hand, if a$_{ij}$ = 0, then adding b$_{ij}$ means introducing a directed connection with a certain weight. [37] The vector Bv is considered to be available from the first order approximation. Alternatively, one could proceed by computing u $^{T}$B at the first order and then Bv : the in- crease in the computational cost is, in general, the same. [20] R. Guimera, L. Danon, A. Diaz-Guilera, F. Giralt, and A. Arenas, Phys. Rev. E 68 , 065103(R) (2003), the data is available at the webpage of Dr. Arenas, http://deim.urv.cat/ ~ aarenas/data/xarxes/email.zip . [36] Here the formula is presented for undirected networks for convenience, and the argument holds similarly in general cases. [35] Details on the power method are reported in Section IV. Here, the assumption is that v and v + Δ v are close to being parallel, and hence a single iteration of the power method is satisfactory. The spectral gap of A + ϵC is not critical for this approximation. [19] D. Bu, Y. Zhao, L. Cai, H. Xue, X. Zhu, H. Lu, J. Zhang, S. Sun, L. Ling, N. Zhang, et al., Nucleic Acids Res. 31 , 2443 (2003), the data can be downloaded from the University of Florida sparse matrix collection, at http://www.cise.ufl.edu/research/sparse/matrices . [34] This name is chosen to reflect the fact that the underlying measure is the spectral radius and that we consider not only removal but also addition of links. [33] A. Hagberg and D. A. Schult, Chaos 18 , 037105 (2008). [32] J. Sun, T. Nishikawa, and D. ben Avraham, Phys. Rev. E 78 , 026104 (2008). [31] A. Hagberg, P. J. Swart, and D. A. Schult, Phys. Rev. E 74 , 056116 (2006). [30] A. E. Motter, N. Gulbahce, E. Almaas, and A.-L. Barabasi, Mol. Syst. Biol. 4 , 168 (2008). [29] T. Nishikawa and A. E. Motter, Phys. Rev. E 73 , 065106(R) (2006). [28] T. Nishikawa and A. E. Motter, Physica D 224 , 77 (2006). [18] B. Bollobas, Modern Graph Theory (Springer, New York, 1998). [17] MATLAB User’s Guide (The MathWorks Inc., 2006). [16] J. Demmel, Applied numerical linear algebra (SIAM, Philadelphia, 1997). [15] G. Golub and C. Van Loan, Matrix computations (Johns Hopkins Univ Pr, 1996), 3rd ed. [14] J. H. Wilkinson, The Algebraic Eigenvalue Problem (Ox- ford University Press, Oxford, UK, 1965). [13] P. Lancaster and M. Tismenetsky, The Theory of Matri- ces with Applications (Academic Press, 1985), 2nd ed. [12] J. Sun, J. P. Bagrow, E. M. Bollt, and J. D. Skufca, Phys. Rev. E 79 , 036116 (2009). [11] J. G. Restrepo, E. Ott, and B. R. Hunt, Phys. Rev. Lett. 97 , 094102 (2006). [10] J. G. Restrepo, E. Ott, and B. R. Hunt, Phys. Rev. Lett. 96 , 254103 (2006). [9] C. R. MacCluer, SIAM Rev. 42 , 487 (2000). [8] A. N. Langville and C. D. Meyer, SIAM Rev. 47 , 135 (2005). [27] E. Ott and A. Pomerance, Phys. Rev. E 79 , 056111 (pages 6) (2009). [26] J. Sun, E. M. Bollt, and T. Nishikawa, Europhys. Lett. 85 , 60011 (2009). (1998). 9