Updating and downdating techniques for optimizing network communicability

SIAM Journal on Scientific Computing

Volumn 38, Issue 1, 2016, Pages B25-B49

  Arrigo, Francesca ^a   Benzi, Michele ^b  

^a UNIVERSITY OF INSUBRIA   (Italy)

^b EMORY UNIVERSITY   (United States)

Author keywords

Edge centrality; Eigenvector centrality; Free energy; Natural connectivity; Network analysis; Subgraph centrality; Total communicability

Indexed keywords

ADJACENCY MATRIX; DOWNDATING; EDGE CENTRALITY; EIGENVECTOR CENTRALITIES; EXPONENTIALS; NATURAL CONNECTIVITY; SPARSE NETWORK; SUBGRAPH CENTRALITY; SUBGRAPHS; TOTAL COMMUNICABILITY;

FREE ENERGY;

EID: 84960114672     PISSN: 10648275     EISSN: 10957197     Source Type: Journal    
DOI: 10.1137/140991923     Document Type: Article

References (44)

1. M. AFANASJEW, M. EIERMANN, O. G. ERNST, AND S. GÜTTEL, Implementation of a restarted Krylov subspace method for the evaluation of matrix functions, Linear Algebra Appl., 429 (2008), pp. 2293-2314.
2. H. AVRON AND S. TOLEDO, Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix, J. ACM, 58 (2011), Art. 8.
3. A.-L. BARABÁSI, Linked: The New Science of Networks, Perseus, Cambridge, MA, 2002.
4. A. L. BARABÁSI AND R. ALBERT, Emergence of scaling in random networks, Science, 286 (1999), pp. 509-512.
5. M. BENZI AND P. BOITO, Quadrature rule-based bounds for functions of adjacency matrices, Linear Algebra Appl., 433 (2010), pp. 637-652.
6. M. BENZI AND G. H. GOLUB, Bounds for the entries of matrix functions with application to preconditioning, BIT, 39 (1999), pp. 417-438.
7. M. BENZI AND C. KLYMKO, Total communicability as a centrality measure, J. Complex Networks, 1 (2013), pp. 124-149.
8. M. BENZI AND C. KLYMKO, On the limiting behavior of parameter-dependent network centrality measures, SIAM J. Matrix Anal. Appl., 36 (2015), pp. 686-706.
9. M. W. BERRY, T. P. CHARTIER, K. R. HUTSON, AND A. N. LANGVILLE, Identifying influential edges in a directed network: Big events, upsets and non-transitivity, J. Complex Networks, 2 (2013), pp. 87-109.
10. A. BEYGELZIMER, G. GRINSTEIN, R. LINSKER, AND I. RISH, Improving network robustness by edge modification, Phys. A, 357 (2005), pp. 593-612.
11. U. BRANDES AND T. ERLEBACH, EDS., Network Analysis: Methodological Foundations, Lecture Notes in Comput. Sci. 3418, Springer, New York, 2005.
12. H. CHAN, L. AKOGLU, AND H. TONG, Make it or break it: Manipulating robustness in large networks, in Proceedings of the 2014 SIAM International Conference on Data Mining, SIAM, Philadelphia, pp. 325-333.
13. R. COHEN AND S. HAVLIN, Complex Networks: Structure, Robustness and Function, Cambridge University Press, Cambridge, UK, 2010.
14. J. J. CROFTS AND D. J. HIGHAM, A weighted communicability measure applied to complex brain networks, J. R. Soc. Interface, 6 (2009), pp. 411-414.
15. T. DAVIS AND Y. HU, The University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/research/sparse/matrices/.
16. E. ESTRADA, Characterization of 3D molecular structure, Chem. Phys. Lett., 319 (2000), 713-718.
17. E. ESTRADA, Spectral scaling and good expansion properties in complex networks, Europhys. Lett., 73 (2006), pp. 649-655.
18. E. ESTRADA, The Structure of Complex Networks. Theory and Applications, Oxford University Press, Oxford, UK, 2012.
19. E. ESTRADA AND N. HATANO, Statistical-mechanical approach to subgraph centrality in complex networks, Chem. Phys. Lett., 439 (2007), pp. 247-251.
20. E. ESTRADA AND N. HATANO, Communicability in complex networks, Phys. Rev. E, 77 (2008), 036111.
21. E. ESTRADA, N. HATANO, AND M. BENZI, The physics of communicability in complex networks, Phys. Rep., 514 (2012), pp. 89-119.
22. E. ESTRADA AND J. A. RODRÍGUEZ-VELÁZQUEZ, Subgraph centrality in complex networks, Phys. Rev. E, 71 (2005), 056103.
23. C. FENU, D. MARTIN, L. REICHEL, AND G. RODRIGUEZ, Network analysis via partial spectral factorization and Gauss quadrature, SIAM J. Sci. Comput., 35 (2013), pp. A2046-A2068.
24. H. FRANK AND I. FRISCH, Analysis and design of survivable networks, IEEE Trans. Comm. Tech., 18 (1970), pp. 501-519.
25. G. H. GOLUB AND G. MEURANT, Matrices, Moments and Quadrature with Applications, Princeton University Press, Princeton, NJ, 2010.
26. S. GÜTTEL, funm-kryl: A Restart Code for the Evaluation of Matrix Functions, http://guettel.com/funm-kryl/.
27. N. J. HIGHAM, Function of Matrices. Theory and Computation, SIAM, Philadelphia, 2008.
28. S. HOORY, N. LINIAL, AND A. WIGDERSON, Expander graphs and their applications, Bull. Amer. Math. Soc., 43 (2006), pp. 439-561.
29. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, 2nd ed., Cambridge University Press, Cambridge, UK, 2013.
30. L. KATZ, A new status index derived from sociometric data analysis, Psychometrika, 18 (1953), pp. 39-43.
31. V. H. P. LOUZADA, F. DAOLIO, H. J. HERRMANN, AND M. TOMASSINI, Smart rewiring for network robustness, J. Complex Networks, 1 (2013), pp. 150-159.
32. G. MEURANT, MMQ Toolbox for MATLAB, http://gerard.meurant.pagesperso-orange.fr/.
33. C. D. MEYER, Matrix Analysis and Applied Linear Algebra, SIAM, Philadelphia, 2000.
34. M. E. J. NEWMAN, Networks. An Introduction, Oxford University Press, Oxford, UK, 2010.
35. A. PINAR, J. MEZA, V. DONDE, AND B. LESIEUTRE, Optimization strategies for the vulnerability analysis of the electric power grid, SIAM J. Optim., 20 (2010), pp. 1786-1810.
36. D. PUDER, Expansion of Random Graphs: New Proofs, New Results, preprint, arXiv:1212.5216v2, 2013.
37. B. SHARGEL, H. SAYAMA, I. R. EPSTEIN, AND Y. BAR-YAM, Optimization of robustness and connectivity in complex networks, Phys. Rev. Lett., 90 (2003), 068701.
38. A. TAYLOR AND D. J. HIGHAM, CONTEST: Toolbox Files and Documentation, http://www.mathstat.strath.ac.uk/research/groups/numerical analysis/contest/toolbox.
39. A. TAYLOR AND D. J. HIGHAM, CONTEST: A controllable test matrix toolbox for MATLAB, ACM Trans. Math. Softw., 35 (2009), Art. 26.
40. H. TONG, B. A. PRAKASH, T. ELIASSI-RAD, M. FALOUTSOS, AND C. FALOUTSOS, GELLING, AND MELTING, large graphs by edge manipulation, in Proceedings of the 21st ACM International Conference on Information and Knowledge Management, ACM, New York, 2012, pp. 245-254.
41. P. VAN MIEGHEM, D. STEVANOVIĆ, F. KUIPERS, C. LI, R. VAN DE BOVENKAMP, D. LIU, AND H. WANG, Decreasing the spectral radius of a graph by link removals, Phys. Rev. E, 84 (2011), 016101.
42. D. J. WATTS AND S. H. STROGATZ, Collective dynamics of 'small-world' networks, Nature, 393 (1998), pp. 440-442.
43. J. WU, M. BARAHONA, Y. TAN, AND H. DENG, Natural connectivity of complex networks, Chinese Phys. Lett., 27 (2010), 078902.
44. J. WU, M. BARAHONA, Y. TAN, AND H. DENG, Robustness of random graphs based on graph spectra, Chaos, 22 (2012), 043101.