{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:25:51Z","timestamp":1777494351875,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T00:00:00Z","timestamp":1723161600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T00:00:00Z","timestamp":1723161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Complex networks are made up of vertices and edges. The latter connect the vertices. There are several ways to measure the importance of the vertices, e.g., by counting the number of edges that start or end at each vertex, or by using the subgraph centrality of the vertices. It is more difficult to assess the importance of the edges. One approach is to consider the line graph associated with the given network and determine the importance of the vertices of the line graph, but this is fairly complicated except for small networks. This paper compares two approaches to estimate the importance of edges of medium-sized to large networks. One approach computes partial derivatives of the total communicability of the weights of the edges, where a partial derivative of large magnitude indicates that the corresponding edge may be important. Our second approach computes the Perron sensitivity of the edges. A high sensitivity signals that the edge may be important. The performance of these methods and some computational aspects are discussed. Applications of interest include to determine whether a network can be replaced by a network with fewer edges with about the same communicability.<\/jats:p>","DOI":"10.1007\/s11075-024-01881-1","type":"journal-article","created":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T07:02:18Z","timestamp":1723186938000},"page":"377-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Edge importance in complex networks"],"prefix":"10.1007","volume":"99","author":[{"given":"Silvia","family":"Noschese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lothar","family":"Reichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,9]]},"reference":[{"key":"1881_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/15M1034131","volume":"37","author":"F Arrigo","year":"2016","unstructured":"Arrigo, F., Benzi, M.: Edge modification criteria for enhancing the communicability of digraphs. SIAM J. Matrix Anal. Appl. 37, 443\u2013468 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1881_CR2","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1137\/21M1407276","volume":"42","author":"F Arrigo","year":"2021","unstructured":"Arrigo, F., Durastante, F.: Mittag-Leffler functions and their applications in network science. SIAM J. Matrix Anal. Appl. 42, 1581\u20131601 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1881_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/comnet\/cnt007","volume":"1","author":"M Benzi","year":"2013","unstructured":"Benzi, M., Klymko, C.: Total communicability as a centrality measure. J. Complex Netw. 1, 124\u2013149 (2013)","journal-title":"J. Complex Netw."},{"key":"1881_CR4","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.apnum.2021.10.005","volume":"172","author":"O De la Cruz Cabrera","year":"2022","unstructured":"De la Cruz Cabrera, O., Jin, J., Noschese, S., Reichel, L.: Communication in complex networks. Appl. Numer. Math. 172, 186\u2013205 (2022)","journal-title":"Appl. Numer. Math."},{"key":"1881_CR5","doi-asserted-by":"crossref","unstructured":"De la Cruz Cabrera, O., Jin, J., Reichel, L.: Sparse approximation of complex networks. Appl. Numer. Math. in press. (2024)","DOI":"10.1016\/j.apnum.2024.01.002"},{"key":"1881_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.cam.2019.01.015","volume":"355","author":"O De la Cruz Cabrera","year":"2019","unstructured":"De la Cruz Cabrera, O., Matar, M., Reichel, L.: Analysis of directed networks via the matrix exponential. J. Comput. Appl. Math. 355, 182\u2013192 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"1881_CR7","doi-asserted-by":"crossref","unstructured":"De la Cruz Cabrera, O., Matar, M., Reichel, L.: Edge importance in a network via line graphs and the matrix exponential. Numer. Algorithms 83, 807\u2013832 (2020)","DOI":"10.1007\/s11075-019-00704-y"},{"key":"1881_CR8","doi-asserted-by":"crossref","unstructured":"De la Cruz Cabrera, O., Matar, M., Reichel, L.: Centrality measures for node-weighted networks via line graphs and the matrix exponential. Numer. Algorithms 88, 583\u2013614 (2021)","DOI":"10.1007\/s11075-020-01050-0"},{"key":"1881_CR9","unstructured":"Dynamic Connectome Lab - Data Sets. https:\/\/sites.google.com\/view\/dynamicconnectomelab (2024)"},{"key":"1881_CR10","doi-asserted-by":"crossref","unstructured":"El-Halouy, S., Noschese, S., Reichel, L.: Perron communicability and sensitivity of multilayer networks. Numer. Algorithms 92, 597\u2013617 (2023)","DOI":"10.1007\/s11075-022-01418-4"},{"key":"1881_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199591756.001.0001","volume-title":"The Structure of Complex Networks: Theory and Applications","author":"E Estrada","year":"2011","unstructured":"Estrada, E.: The Structure of Complex Networks: Theory and Applications. Oxford University Press, Oxford (2011)"},{"key":"1881_CR12","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1137\/090761070","volume":"52","author":"E Estrada","year":"2010","unstructured":"Estrada, E., Higham, D.J.: Network properties revealed through matrix functions. SIAM Rev. 52, 696\u2013714 (2010)","journal-title":"SIAM Rev."},{"key":"1881_CR13","doi-asserted-by":"crossref","unstructured":"Estrada, E., Rodriguez-Velazquez, J.A.: Subgraph centrality in complex networks. Phys. Rev. E 71, Art. 056103 (2005)","DOI":"10.1103\/PhysRevE.71.056103"},{"key":"1881_CR14","doi-asserted-by":"publisher","first-page":"A2046","DOI":"10.1137\/130911123","volume":"35","author":"C Fenu","year":"2013","unstructured":"Fenu, C., Martin, D., Reichel, L., Rodriguez, G.: Network analysis via partial spectral factorization and Gauss quadrature. SIAM J. Sci. Comput. 35, A2046\u2013A2068 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"1881_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717778","volume-title":"Functions of Matrices: Theory and Computation","author":"NJ Higham","year":"2008","unstructured":"Higham, N.J.: Functions of Matrices: Theory and Computation. SIAM, Philadelphia (2008)"},{"key":"1881_CR16","doi-asserted-by":"crossref","unstructured":"Kandolf, P., Koskela, A., Relton, S.D., Schweitzer, M.: Computing low-rank approximations of the Fr\u00e9chet derivative of a matrix function using Krylov subspace methods. Numer. Linear Algebra Appl. 28, Art. 2401 (2021)","DOI":"10.1002\/nla.2401"},{"key":"1881_CR17","doi-asserted-by":"crossref","unstructured":"Massei, S., Tudisco, F.: Optimizing network robustness via Krylov subspaces. arXiv:2303.04971 (2024)","DOI":"10.1051\/m2an\/2023102"},{"key":"1881_CR18","doi-asserted-by":"crossref","unstructured":"Milanese, A., Sun, J., Nishikawa, T.: Approximating spectral impact of structural perturbations in large networks. Phys. Rev. E 81, Art. 046112 (2010)","DOI":"10.1103\/PhysRevE.81.046112"},{"key":"1881_CR19","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"1881_CR20","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.cam.2005.01.032","volume":"185","author":"S Noschese","year":"2006","unstructured":"Noschese, S., Pasquini, L.: Eigenvalue condition numbers: Zero-structured versus traditional. J. Comput. Appl. Math. 185, 174\u2013189 (2006)","journal-title":"J. Comput. Appl. Math."},{"key":"1881_CR21","doi-asserted-by":"crossref","unstructured":"Noschese, S., Reichel, L.: Estimating and increasing the structural robustness of a network. Numer. Linear Algebra Appl. 29, Art. e2418 (2022)","DOI":"10.1002\/nla.2418"},{"key":"1881_CR22","doi-asserted-by":"crossref","unstructured":"Noschese, S., Reichel, L.: Network analysis with the aid of the path length matrix. Numer. Algorithms 95, 451\u2013470 (2024)","DOI":"10.1007\/s11075-023-01577-y"},{"key":"1881_CR23","doi-asserted-by":"crossref","unstructured":"Ruhe, A.: The two-sided Arnoldi algorithm for nonsymmetric eigenvalue problems. In Matrix Pencils, K\u00e5gstr\u00f6m, B., Ruhe, A. (eds.) Lecture Notes in Mathematics #973, Springer, Berlin, pp. 104\u2013120 (1983)","DOI":"10.1007\/BFb0062097"},{"key":"1881_CR24","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.cam.2015.04.001","volume":"291","author":"P Ruiz","year":"2016","unstructured":"Ruiz, P., Sastre, J., Ib\u00e1\u00f1ez, J., Defez, E.: High performance computing of the matrix exponential. J. Comput. Appl. Math. 291, 370\u2013379 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"1881_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical Methods for Large Eigenvalue Problems","author":"Y Saad","year":"2011","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems, revised SIAM, Philadelphis (2011)","edition":"revised"},{"key":"1881_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)","edition":"2"},{"key":"1881_CR27","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1137\/23M1556708","volume":"44","author":"M Schweitzer","year":"2023","unstructured":"Schweitzer, M.: Sensitivity of matrix function based network communicability measures: Computational methods and a priori bounds. SIAM J. Matrix Anal. Appl. 44, 1321\u20131348 (2023)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1881_CR28","unstructured":"SuiteSparse Matrix Collection. https:\/\/sparse.tamu.edu (2024)"},{"key":"1881_CR29","first-page":"243","volume":"30","author":"JH Wilkinson","year":"1986","unstructured":"Wilkinson, J.H.: Sensitivity of eigenvalues II. Util. Math. 30, 243\u2013286 (1986)","journal-title":"Util. Math."},{"key":"1881_CR30","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1553\/etna_vol58s538","volume":"58","author":"S Xu","year":"2023","unstructured":"Xu, S., Xue, F.: Inexact rational Krylov subspace methods for approximating the action of functions of matrices. Electron. Trans. Numer. Anal. 58, 538\u2013567 (2023)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"1881_CR31","doi-asserted-by":"crossref","unstructured":"Zwaan, I.N., Hochstenbach, M.E.: Krylov\u2013Schur\u2013type restarts for the two-sided Arnoldi method. SIAM J. Matrix Anal. Appl. 38, 297\u2013321 (2017)","DOI":"10.1137\/16M1078987"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01881-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01881-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01881-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T07:40:29Z","timestamp":1744616429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01881-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,9]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1881"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01881-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,9]]},"assertion":[{"value":"5 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical standard"}}]}}