{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:41:10Z","timestamp":1767141670179,"version":"build-2238731810"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100023561","name":"Ministerio de Universidades","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100023561","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We propose a novel stochastic algorithm that randomly samples entire rows and columns of the matrix as a way to approximate an arbitrary matrix function using the power series expansion. This contrasts with existing Monte Carlo methods, which only work with one entry at a time, resulting in a significantly better convergence rate than the original approach. To assess the applicability of our method, we compute the subgraph centrality and total communicability of several large networks. In all benchmarks analyzed so far, the performance of our method was significantly superior to the competition, being able to scale up to 64 CPU cores with remarkable efficiency.<\/jats:p>","DOI":"10.1007\/s10915-024-02500-w","type":"journal-article","created":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T07:01:38Z","timestamp":1711954898000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks"],"prefix":"10.1007","volume":"99","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0096-9983","authenticated-orcid":false,"given":"Nicolas L.","family":"Guidotti","sequence":"first","affiliation":[]},{"given":"Juan A.","family":"Acebr\u00f3n","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Monteiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,1]]},"reference":[{"key":"2500_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.06.059","volume":"362","author":"J Acebr\u00f3n","year":"2019","unstructured":"Acebr\u00f3n, J.: A Monte Carlo method for computing the action of a matrix exponential on a vector. Appl. Math. Comput. 362, 124545 (2019). https:\/\/doi.org\/10.1016\/j.amc.2019.06.059","journal-title":"Appl. Math. Comput."},{"issue":"12","key":"2500_CR2","doi-asserted-by":"publisher","first-page":"3495","DOI":"10.1016\/j.camwa.2020.02.013","volume":"79","author":"JA Acebr\u00f3n","year":"2020","unstructured":"Acebr\u00f3n, J.A., Herrero, J.R., Monteiro, J.: A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method. Comput. Math. Appl. 79(12), 3495\u20133515 (2020). https:\/\/doi.org\/10.1016\/j.camwa.2020.02.013","journal-title":"Comput. Math. Appl."},{"issue":"10","key":"2500_CR3","doi-asserted-by":"publisher","first-page":"2293","DOI":"10.1016\/j.laa.2008.06.029","volume":"429","author":"M Afanasjew","year":"2008","unstructured":"Afanasjew, M., Eiermann, M., Ernst, O.G., G\u00fcttel, S.: Implementation of a restarted Krylov subspace method for the evaluation of matrix functions. Linear Algebra Appl. 429(10), 2293\u20132314 (2008). https:\/\/doi.org\/10.1016\/j.laa.2008.06.029","journal-title":"Linear Algebra Appl."},{"issue":"6794","key":"2500_CR4","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378\u2013382 (2000). https:\/\/doi.org\/10.1038\/35019019","journal-title":"Nature"},{"issue":"3","key":"2500_CR5","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/09074721X","volume":"31","author":"AH Al-Mohy","year":"2010","unstructured":"Al-Mohy, A.H., Higham, N.J.: A new scaling and squaring algorithm for the matrix exponential. SIAM J. Matrix Anal. Appl. 31(3), 970\u2013989 (2010). https:\/\/doi.org\/10.1137\/09074721X","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2500_CR6","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/100788860","volume":"33","author":"AH Al-Mohy","year":"2011","unstructured":"Al-Mohy, A.H., Higham, N.J.: Computing the action of the matrix exponential, with an application to exponential integrators. SIAM J. Sci. Comput. 33(2), 488\u2013511 (2011). https:\/\/doi.org\/10.1137\/100788860","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"2500_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1137\/S0895479899358194","volume":"23","author":"PR Amestoy","year":"2001","unstructured":"Amestoy, P.R., Duff, I.S., L\u2019Excellent, J.Y., Koster, J.: A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23(1), 15\u201341 (2001). https:\/\/doi.org\/10.1137\/S0895479899358194","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2500_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3242094","volume":"45","author":"PR Amestoy","year":"2019","unstructured":"Amestoy, P.R., Buttari, A., L\u2019Excellent, J.Y., Mary, T.: Performance and scalability of the block low-rank multifrontal factorization on multicore architectures. ACM Trans. Math. Softw. 45(1), 1\u201326 (2019). https:\/\/doi.org\/10.1145\/3242094","journal-title":"ACM Trans. Math. Softw."},{"issue":"13","key":"2500_CR9","doi-asserted-by":"publisher","first-page":"7891","DOI":"10.3390\/su14137891","volume":"14","author":"JT Aparicio","year":"2022","unstructured":"Aparicio, J.T., Arsenio, E., Santos, F.C., Henriques, R.: LINES: multimodal transportation resilience analysis. Sustainability 14(13), 7891 (2022). https:\/\/doi.org\/10.3390\/su14137891","journal-title":"Sustainability"},{"issue":"1","key":"2500_CR10","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(1), 443\u2013468 (2016). https:\/\/doi.org\/10.1137\/15M1034131","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"2500_CR11","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1137\/21M1407276","volume":"42","author":"F Arrigo","year":"2021","unstructured":"Arrigo, F., Durastante, F.: Mittag\u2013Leffler functions and their applications in network science. SIAM J. Matrix Anal. Appl. 42(4), 1581\u20131601 (2021). https:\/\/doi.org\/10.1137\/21M1407276","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"2500_CR12","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1137\/S0895479897317806","volume":"20","author":"Z Bai","year":"1999","unstructured":"Bai, Z., Day, D., Ye, Q.: ABLE: an adaptive block Lanczos method for non-Hermitian eigenvalue problems. SIAM J. Matrix Anal. Appl. 20(4), 1060\u20131082 (1999). https:\/\/doi.org\/10.1137\/S0895479897317806","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2500_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00296-0_5","volume-title":"Noise Reduction in Speech Processing. Springer Topics in Signal Processing","author":"J Benesty","year":"2009","unstructured":"Benesty, J., Chen, J., Huang, Y., Cohen, I.: Pearson correlation coefficient. In: Cohen, I., Huang, Y., Chen, J., Benesty, J. (eds.) Noise Reduction in Speech Processing. Springer Topics in Signal Processing, pp. 1\u20134. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-00296-0_5"},{"issue":"3","key":"2500_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.laa.2010.03.035","volume":"433","author":"M Benzi","year":"2010","unstructured":"Benzi, M., Boito, P.: Quadrature rule-based bounds for functions of adjacency matrices. Linear Algebra Appl. 433(3), 637\u2013652 (2010). https:\/\/doi.org\/10.1016\/j.laa.2010.03.035","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"2500_CR15","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(2), 124\u2013149 (2013). https:\/\/doi.org\/10.1093\/comnet\/cnt007","journal-title":"J. Complex Netw."},{"issue":"2","key":"2500_CR16","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1137\/130950550","volume":"36","author":"M Benzi","year":"2015","unstructured":"Benzi, M., Klymko, C.: On the limiting behavior of parameter-dependent network centrality measures. SIAM J. Matrix Anal. Appl. 36(2), 686\u2013706 (2015). https:\/\/doi.org\/10.1137\/130950550","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"2500_CR17","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1016\/j.laa.2012.10.022","volume":"438","author":"M Benzi","year":"2013","unstructured":"Benzi, M., Estrada, E., Klymko, C.: Ranking hubs and authorities using matrix functions. Linear Algebra Appl. 438(5), 2447\u20132474 (2013). https:\/\/doi.org\/10.1016\/j.laa.2012.10.022","journal-title":"Linear Algebra Appl."},{"key":"2500_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2088","author":"M Benzi","year":"2017","unstructured":"Benzi, M., Evans, T.M., Hamilton, S.P., Lupo Pasini, M., Slattery, S.R.: Analysis of Monte Carlo accelerated iterative methods for sparse linear systems. Numer. Linear Algebra Appl. (2017). https:\/\/doi.org\/10.1002\/nla.2088","journal-title":"Numer. Linear Algebra Appl."},{"key":"2500_CR19","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 595\u2013601. ACM Press, Manhattan (2004)","DOI":"10.1145\/988672.988752"},{"issue":"8","key":"2500_CR20","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1002\/spe.587","volume":"34","author":"P Boldi","year":"2004","unstructured":"Boldi, P., Codenotti, B., Santini, M., Vigna, S.: UbiCrawler: a scalable fully distributed web crawler. Softw. Pract. Exp. 34(8), 711\u2013726 (2004)","journal-title":"Softw. Pract. Exp."},{"key":"2500_CR21","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1145\/1963405.1963488","volume-title":"Proceedings of the 20th International Conference on World Wide Web","author":"P Boldi","year":"2011","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Srinivasan, S., Ramamritham, K., Kumar, A., Ravindra, M.P., Bertino, E., Kumar, R. (eds.) Proceedings of the 20th International Conference on World Wide Web, pp. 587\u2013596. ACM Press, Hyderabad (2011)"},{"issue":"1","key":"2500_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. J Math Sociol 2(1), 113\u2013120 (1972). https:\/\/doi.org\/10.1080\/0022250X.1972.9989806","journal-title":"J Math Sociol"},{"issue":"5","key":"2500_CR23","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170\u20131182 (1987). https:\/\/doi.org\/10.1086\/228631","journal-title":"Am. J. Sociol."},{"issue":"9","key":"2500_CR24","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein\u2013protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443\u20132450 (2003)","journal-title":"Nucleic Acids Res."},{"key":"2500_CR25","doi-asserted-by":"crossref","unstructured":"Cortinovis, A., Kressner, D., Nakatsukasa, Y.: Speeding up Krylov subspace methods for computing f(A)b via randomization (2023)","DOI":"10.1137\/22M1543458"},{"issue":"2","key":"2500_CR26","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/S0895479802410815","volume":"25","author":"PI Davies","year":"2003","unstructured":"Davies, P.I., Higham, N.J.: A Schur\u2013Parlett algorithm for computing matrix functions. SIAM J. Matrix Anal. Appl. 25(2), 464\u2013485 (2003). https:\/\/doi.org\/10.1137\/S0895479802410815","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2500_CR27","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.laa.2007.06.020","volume":"427","author":"JA de la Pe\u00f1a","year":"2007","unstructured":"de la Pe\u00f1a, J.A., Gutman, I., Rada, J.: Estimating the Estrada index. Linear Algebra Appl. 427(1), 70\u201376 (2007). https:\/\/doi.org\/10.1016\/j.laa.2007.06.020","journal-title":"Linear Algebra Appl."},{"key":"2500_CR28","volume-title":"Monte Carlo Methods for Applied Scientists","author":"I Dimov","year":"2008","unstructured":"Dimov, I.: Monte Carlo Methods for Applied Scientists. World Scientific, Singapore (2008)"},{"issue":"1\u20133","key":"2500_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0378-4754(00)00243-3","volume":"55","author":"I Dimov","year":"2001","unstructured":"Dimov, I., Alexandrov, V., Karaivanova, A.: Parallel resolvent Monte Carlo algorithms for linear algebra problems. Math. Comput. Simul. 55(1\u20133), 25\u201335 (2001). https:\/\/doi.org\/10.1016\/S0378-4754(00)00243-3","journal-title":"Math. Comput. Simul."},{"issue":"15","key":"2500_CR30","doi-asserted-by":"publisher","first-page":"4494","DOI":"10.1016\/j.apm.2014.12.018","volume":"39","author":"I Dimov","year":"2015","unstructured":"Dimov, I., Maire, S., Sellier, J.M.: A new Walk on Equations Monte Carlo method for solving systems of linear algebraic equations. Appl. Math. Model. 39(15), 4494\u20134510 (2015). https:\/\/doi.org\/10.1016\/j.apm.2014.12.018","journal-title":"Appl. Math. Model."},{"key":"2500_CR31","doi-asserted-by":"publisher","unstructured":"Drineas, P., Kannan, R.: Fast Monte-Carlo algorithms for approximate matrix multiplication. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 452\u2013459 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959921","DOI":"10.1109\/SFCS.2001.959921"},{"issue":"1","key":"2500_CR32","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539704442684","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices I: approximating matrix multiplication. SIAM J. Comput. 36(1), 132\u2013157 (2006). https:\/\/doi.org\/10.1137\/S0097539704442684","journal-title":"SIAM J. Comput."},{"issue":"6","key":"2500_CR33","doi-asserted-by":"publisher","first-page":"2481","DOI":"10.1137\/050633846","volume":"44","author":"M Eiermann","year":"2006","unstructured":"Eiermann, M., Ernst, O.G.: A restarted Krylov subspace method for the evaluation of matrix functions. SIAM J. Numer. Anal. 44(6), 2481\u20132504 (2006). https:\/\/doi.org\/10.1137\/050633846","journal-title":"SIAM J. Numer. Anal."},{"issue":"5\u20136","key":"2500_CR34","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1016\/S0009-2614(00)00158-5","volume":"319","author":"E Estrada","year":"2000","unstructured":"Estrada, E.: Characterization of 3D molecular structure. Chem. Phys. Lett. 319(5\u20136), 713\u2013718 (2000). https:\/\/doi.org\/10.1016\/S0009-2614(00)00158-5","journal-title":"Chem. Phys. Lett."},{"issue":"1","key":"2500_CR35","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/pmic.200500209","volume":"6","author":"E Estrada","year":"2006","unstructured":"Estrada, E.: Virtual identification of essential proteins within the protein interaction network of yeast. PROTEOMICS 6(1), 35\u201340 (2006). https:\/\/doi.org\/10.1002\/pmic.200500209","journal-title":"PROTEOMICS"},{"key":"2500_CR36","volume-title":"The Structure of Complex Networks: Theory and Applications","author":"E Estrada","year":"2012","unstructured":"Estrada, E.: The Structure of Complex Networks: Theory and Applications. Oxford University Press, Oxford (2012)"},{"issue":"1","key":"2500_CR37","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cplett.2007.03.098","volume":"439","author":"E Estrada","year":"2007","unstructured":"Estrada, E., Hatano, N.: Statistical-mechanical approach to subgraph centrality in complex networks. Chem. Phys. Lett. 439(1), 247\u2013251 (2007). https:\/\/doi.org\/10.1016\/j.cplett.2007.03.098","journal-title":"Chem. Phys. Lett."},{"issue":"4","key":"2500_CR38","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(4), 696\u2013714 (2010). https:\/\/doi.org\/10.1137\/090761070","journal-title":"SIAM Rev."},{"issue":"5","key":"2500_CR39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.056103","volume":"71","author":"E Estrada","year":"2005","unstructured":"Estrada, E., Rodr\u00edguez-Vel\u00e1zquez, J.A.: Subgraph centrality in complex networks. Phys. Rev. E 71(5), 056103 (2005). https:\/\/doi.org\/10.1103\/PhysRevE.71.056103","journal-title":"Phys. Rev. E"},{"key":"2500_CR40","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.physa.2005.12.002","volume":"364","author":"E Estrada","year":"2006","unstructured":"Estrada, E., Rodr\u00edguez-Vel\u00e1zquez, J.A.: Subgraph centrality and clustering in complex hyper-networks. Phys. A Stat. Mech. Appl. 364, 581\u2013594 (2006). https:\/\/doi.org\/10.1016\/j.physa.2005.12.002","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"3","key":"2500_CR41","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.physrep.2012.01.006","volume":"514","author":"E Estrada","year":"2012","unstructured":"Estrada, E., Hatano, N., Benzi, M.: The physics of communicability in complex networks. Phys. Rep. 514(3), 89\u2013119 (2012). https:\/\/doi.org\/10.1016\/j.physrep.2012.01.006","journal-title":"Phys. Rep."},{"issue":"4","key":"2500_CR42","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1137\/120886261","volume":"34","author":"C Fenu","year":"2013","unstructured":"Fenu, C., Martin, D., Reichel, L., Rodriguez, G.: Block Gauss and anti-Gauss quadrature with application to networks. SIAM J. Matrix Anal. Appl. 34(4), 1655\u20131684 (2013). https:\/\/doi.org\/10.1137\/120886261","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"31","key":"2500_CR43","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2307\/2002508","volume":"4","author":"GE Forsythe","year":"1950","unstructured":"Forsythe, G.E., Leibler, R.A.: Matrix inversion by a Monte Carlo method. Math. Tables Other Aids Comput 4(31), 127\u2013129 (1950). https:\/\/doi.org\/10.2307\/2002508","journal-title":"Math. Tables Other Aids Comput"},{"issue":"3","key":"2500_CR44","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215\u2013239 (1978). https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Soc. Netw."},{"issue":"3","key":"2500_CR45","first-page":"749","volume":"7","author":"S Gershgorin","year":"1931","unstructured":"Gershgorin, S.: Uber die abgrenzung der eigenwerte einer matrix. Izvest. Akad. Nauk SSSR Serija Mat. 7(3), 749\u2013754 (1931)","journal-title":"Izvest. Akad. Nauk SSSR Serija Mat."},{"key":"2500_CR46","doi-asserted-by":"publisher","DOI":"10.1515\/9781400833887","volume-title":"Matrices. Moments and Quadrature with Applications","author":"GH Golub","year":"2009","unstructured":"Golub, G.H., Meurant, G.: Matrices. Moments and Quadrature with Applications. Princeton University Press, Princeton (2009)"},{"key":"2500_CR47","unstructured":"Graph500. https:\/\/graph500.org\/"},{"key":"2500_CR48","doi-asserted-by":"publisher","unstructured":"Guidotti, N.L., Acebr\u00f3n, J., Monteiro, J.: A stochastic method for solving time-fractional differential equations (2023). https:\/\/doi.org\/10.48550\/arXiv.2303.15458","DOI":"10.48550\/arXiv.2303.15458"},{"key":"2500_CR49","doi-asserted-by":"crossref","unstructured":"G\u00fcttel, S., Schweitzer, M.: Randomized sketching for Krylov approximations of large-scale matrix functions. SIAM J. Matrix Anal. Appl. 44(3), 1073\u20131095 (2023). https:\/\/doi.org\/10.1137\/22M1518062","DOI":"10.1137\/22M1518062"},{"key":"2500_CR50","unstructured":"G\u00fcttel, S.: Funm_kryl toolbox for MATLAB. http:\/\/www.guettel.com\/funm_kryl\/"},{"issue":"1","key":"2500_CR51","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1002\/gamm.201310002","volume":"36","author":"S G\u00fcttel","year":"2013","unstructured":"G\u00fcttel, S.: Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection. GAMM-Mitteilungen 36(1), 8\u201331 (2013). https:\/\/doi.org\/10.1002\/gamm.201310002","journal-title":"GAMM-Mitteilungen"},{"issue":"3","key":"2500_CR52","doi-asserted-by":"publisher","DOI":"10.1002\/gamm.202000019","volume":"43","author":"S G\u00fcttel","year":"2020","unstructured":"G\u00fcttel, S., Kressner, D., Lund, K.: Limited-memory polynomial methods for large-scale matrix functions. GAMM-Mitteilungen 43(3), e202000019 (2020). https:\/\/doi.org\/10.1002\/gamm.202000019","journal-title":"GAMM-Mitteilungen"},{"issue":"4","key":"2500_CR53","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1137\/04061101X","volume":"26","author":"NJ Higham","year":"2005","unstructured":"Higham, N.J.: The scaling and squaring method for the matrix exponential revisited. SIAM J. Matrix Anal. Appl. 26(4), 1179\u20131193 (2005). https:\/\/doi.org\/10.1137\/04061101X","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2500_CR54","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717778","volume-title":"Functions of Matrices. Other Titles in Applied Mathematics","author":"NJ Higham","year":"2008","unstructured":"Higham, N.J.: Functions of Matrices. Other Titles in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia (2008). https:\/\/doi.org\/10.1137\/1.9780898717778"},{"issue":"4","key":"2500_CR55","doi-asserted-by":"publisher","first-page":"377","DOI":"10.2307\/2785990","volume":"28","author":"CH Hubbell","year":"1965","unstructured":"Hubbell, C.H.: An input\u2013output approach to clique identification. Sociometry 28(4), 377\u2013399 (1965). https:\/\/doi.org\/10.2307\/2785990","journal-title":"Sociometry"},{"key":"2500_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55682-1","volume-title":"Probability Essentials. Universitext","author":"J Jacod","year":"2004","unstructured":"Jacod, J., Protter, P.: Probability Essentials. Universitext. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/978-3-642-55682-1"},{"issue":"6833","key":"2500_CR57","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S.P., Barab\u00e1si, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41\u201342 (2001). https:\/\/doi.org\/10.1038\/35075138","journal-title":"Nature"},{"issue":"4","key":"2500_CR58","doi-asserted-by":"publisher","first-page":"2107","DOI":"10.1137\/130904867","volume":"51","author":"H Ji","year":"2013","unstructured":"Ji, H., Mascagni, M., Li, Y.: Convergence analysis of Markov Chain Monte Carlo Linear solvers using Ulam\u2013Von Neumann algorithm. SIAM J. Numer. Anal. 51(4), 2107\u20132122 (2013)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"2500_CR59","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ecolmodel.2007.02.032","volume":"205","author":"F Jord\u00e1n","year":"2007","unstructured":"Jord\u00e1n, F., Benedek, Z., Podani, J.: Quantifying positional importance in food webs: A comparison of centrality indices. Ecol. Model. 205(1), 270\u2013275 (2007). https:\/\/doi.org\/10.1016\/j.ecolmodel.2007.02.032","journal-title":"Ecol. Model."},{"issue":"1","key":"2500_CR60","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953). https:\/\/doi.org\/10.1007\/BF02289026","journal-title":"Psychometrika"},{"key":"2500_CR61","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"2500_CR62","doi-asserted-by":"publisher","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (2008). https:\/\/doi.org\/10.48550\/arXiv.0810.1355","DOI":"10.48550\/arXiv.0810.1355"},{"key":"2500_CR63","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11, 985\u20131042 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"2500_CR64","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0962492920000021","volume":"29","author":"PG Martinsson","year":"2020","unstructured":"Martinsson, P.G., Tropp, J.A.: Randomized numerical linear algebra: foundations and algorithms. Acta Numer. 29, 403\u2013572 (2020). https:\/\/doi.org\/10.1017\/S0962492920000021","journal-title":"Acta Numer."},{"key":"2500_CR65","doi-asserted-by":"publisher","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29\u201342. ACM, San Diego California USA (2007). https:\/\/doi.org\/10.1145\/1298306.1298311","DOI":"10.1145\/1298306.1298311"},{"key":"2500_CR66","doi-asserted-by":"publisher","unstructured":"Murray, R., Demmel, J., Mahoney, M.W., Erichson, N.B., Melnichenko, M., Malik, O.A., Grigori, L., Luszczek, P., Derezi\u0144ski, M., Lopes, M.E., Liang, T., Luo, H., Dongarra, J.: Randomized Numerical Linear Algebra: A Perspective on the Field With an Eye to Software (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.11474","DOI":"10.48550\/arXiv.2302.11474"},{"key":"2500_CR67","doi-asserted-by":"publisher","unstructured":"Nakatsukasa, Y., Tropp, J.A.: Fast & Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems (2022). https:\/\/doi.org\/10.48550\/arXiv.2111.00113","DOI":"10.48550\/arXiv.2111.00113"},{"key":"2500_CR68","unstructured":"Newman, M.: Network data. http:\/\/www-personal.umich.edu\/~mejn\/netdata\/ (2013)"},{"issue":"2","key":"2500_CR69","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003). https:\/\/doi.org\/10.1137\/S003614450342480","journal-title":"SIAM Rev."},{"key":"2500_CR70","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2018","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2018)"},{"key":"2500_CR71","unstructured":"O\u2019Neill, M.E.: PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation. Tech. Rep. HMC-CS-2014-0905, Harvey Mudd College, Claremont, CA (2014)"},{"key":"2500_CR72","doi-asserted-by":"publisher","unstructured":"Rozemberczki, B., Sarkar, R.: Twitch Gamers: A Dataset for Evaluating Proximity Preserving and Structural Role-based Node Embeddings (2021). https:\/\/doi.org\/10.48550\/arXiv.2101.03091","DOI":"10.48550\/arXiv.2101.03091"},{"key":"2500_CR73","unstructured":"Vladimir, B., Mrvar, A.: Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/default.htm (2006)"},{"key":"2500_CR74","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-06486-4_7","volume-title":"High-Performance Computing on the Intel\u00ae Xeon Phi\u2122: How to Fully Exploit MIC Architectures","author":"E Wang","year":"2014","unstructured":"Wang, E., Zhang, Q., Shen, B., Zhang, G., Lu, X., Wu, Q., Wang, Y.: Intel Math Kernel Library. In: Wang, E., Zhang, Q., Shen, B., Zhang, G., Lu, X., Wu, Q., Wang, Y. (eds.) High-Performance Computing on the Intel\u00ae Xeon Phi\u2122: How to Fully Exploit MIC Architectures, pp. 167\u2013188. Springer, Cham (2014)"},{"issue":"6684","key":"2500_CR75","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998). https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"key":"2500_CR76","doi-asserted-by":"publisher","unstructured":"Yang, J., Leskovec, J.: Patterns of temporal variation in online media. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, WSDM \u201911, pp. 177\u2013186. Association for Computing Machinery, New York, NY, USA (2011). https:\/\/doi.org\/10.1145\/1935826.1935863","DOI":"10.1145\/1935826.1935863"}],"updated-by":[{"DOI":"10.1007\/s10915-024-02740-w","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000}}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02500-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02500-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02500-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T04:05:40Z","timestamp":1732766740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02500-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,1]]},"references-count":76,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["2500"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02500-w","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,1]]},"assertion":[{"value":"28 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2024","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Funding note has been updated","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":8,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":9,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":10,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10915-024-02740-w","URL":"https:\/\/doi.org\/10.1007\/s10915-024-02740-w","order":11,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"41"}}