{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T05:04:43Z","timestamp":1763960683312,"version":"3.45.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T00:00:00Z","timestamp":1751673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T00:00:00Z","timestamp":1751673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Italian Ministry of University and Research","award":["PRIN Project 20227PCCKZ \u201cLow Rank Structures and Numerical Methods in Matrix and Tensor Computations and their Applications\u201d"],"award-info":[{"award-number":["PRIN Project 20227PCCKZ \u201cLow Rank Structures and Numerical Methods in Matrix and Tensor Computations and their Applications\u201d"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11075-025-02155-0","type":"journal-article","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T06:09:58Z","timestamp":1751695798000},"page":"1867-1891","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Role extraction by matrix equations and generalized random walks"],"prefix":"10.1007","volume":"100","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7682-0660","authenticated-orcid":false,"given":"Dario","family":"Fasino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,5]]},"reference":[{"issue":"2","key":"2155_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1140\/epjb\/e2007-00340-y","volume":"60","author":"J Reichardt","year":"2007","unstructured":"Reichardt, J., White, D.R.: Role models for complex networks. Eur. Phys. J. B. 60(2), 217\u2013224 (2007). https:\/\/doi.org\/10.1140\/epjb\/e2007-00340-y","journal-title":"Eur. Phys. J. B."},{"key":"2155_CR2","volume-title":"Structural Analysis in the Social Sciences","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Structural Analysis in the Social Sciences. Cambridge University Press, Cambridge, UK (1994)"},{"issue":"2","key":"2155_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: First steps. Soc. Netw. 5(2), 109\u2013137 (1983). https:\/\/doi.org\/10.1016\/0378-8733(83)90021-7","journal-title":"Soc. Netw."},{"issue":"9","key":"2155_CR4","first-page":"1082","volume":"56","author":"MA Porter","year":"2009","unstructured":"Porter, M.A., Onnela, J.-P., Mucha, P.J.: Communities in networks. Notices Amer. Math. Soc. 56(9), 1082\u20131097 (2009)","journal-title":"Notices Amer. Math. Soc."},{"issue":"14","key":"2155_CR5","doi-asserted-by":"publisher","first-page":"2849","DOI":"10.1016\/j.physa.2010.03.006","volume":"389","author":"Y Pan","year":"2010","unstructured":"Pan, Y., Li, D.-H., Liu, J.-G., Liang, J.-Z.: Detecting community structure in complex networks via node similarity. Phys. A 389(14), 2849\u20132857 (2010). https:\/\/doi.org\/10.1016\/j.physa.2010.03.006","journal-title":"Phys. A"},{"issue":"4","key":"2155_CR6","doi-asserted-by":"publisher","first-page":"046105","DOI":"10.1103\/PhysRevE.72.046105","volume":"72","author":"E Estrada","year":"2005","unstructured":"Estrada, E., Rodr\u00edguez-Vel\u00e1zquez, J.A.: Spectral measures of bipartivity in complex networks. Phys. Rev. E. 72(4), 046105\u2013046106 (2005)","journal-title":"Phys. Rev. E."},{"key":"2155_CR7","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.laa.2017.12.001","volume":"542","author":"D Fasino","year":"2018","unstructured":"Fasino, D., Tudisco, F.: A modularity based spectral method for simultaneous community and anti-community detection. Linear Algebra Appl. 542, 605\u2013623 (2018)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"2155_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1093\/comnet\/cnt016","volume":"1","author":"P Csermely","year":"2013","unstructured":"Csermely, P., London, A., Wu, L.-Y., Uzzi, B.: Structure and dynamics of core\/periphery networks. J. Complex Netw. 1(2), 93\u2013123 (2013). https:\/\/doi.org\/10.1093\/comnet\/cnt016","journal-title":"J. Complex Netw."},{"issue":"1","key":"2155_CR9","doi-asserted-by":"publisher","first-page":"94","DOI":"10.3390\/sym12010094","volume":"12","author":"D Fasino","year":"2020","unstructured":"Fasino, D., Rinaldi, F.: A fast and exact greedy algorithm for the core-periphery problem. Symmetry 12(1), 94 (2020)","journal-title":"Symmetry"},{"issue":"2","key":"2155_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/18M1183558","volume":"1","author":"F Tudisco","year":"2019","unstructured":"Tudisco, F., Higham, D.J.: A nonlinear spectral method for core-periphery detection in networks. SIAM J. Math. Data Sci. 1(2), 269\u2013292 (2019). https:\/\/doi.org\/10.1137\/18M1183558","journal-title":"SIAM J. Math. Data Sci."},{"key":"2155_CR11","unstructured":"Nadel, S.F.: The Theory of Social Structure. Cohen & West, London, UK (1957). https:\/\/books.google.it\/books?id=kPvPuqkONzIC"},{"key":"2155_CR12","unstructured":"Hanneman, R.A., Riddle, M.: Introduction to Social Network Methods. University of California, Riverside, CA (2005). https:\/\/faculty.ucr.edu\/~hanneman\/nettext\/"},{"key":"2155_CR13","volume-title":"Analyzing Social Networks","author":"SP Borgatti","year":"2024","unstructured":"Borgatti, S.P., Everett, M.G., Johnson, J.C., Agneessens, F.: Analyzing Social Networks. SAGE Publications, London (2024)"},{"key":"2155_CR14","doi-asserted-by":"publisher","unstructured":"Beguerisse-D\u00ed\u00adaz, M., Vangelov, B., Barahona, M.: Finding role communities in directed networks using role-based similarity, Markov stability and the relaxed minimum spanning tree. In: 2013 IEEE Global Conference on Signal and Information Processing, pp. 937\u2013940 (2013). https:\/\/doi.org\/10.1109\/GlobalSIP.2013.6737046","DOI":"10.1109\/GlobalSIP.2013.6737046"},{"key":"2155_CR15","unstructured":"Browet, A., Van\u00a0Dooren, P.: Low-rank similarity measure for role model extraction. In: Proceedings of the 21st International Symposium on Mathematical Theory of Networks and Systems, MTNS 2014, pp. 1412\u20131418 (2014)"},{"issue":"2","key":"2155_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2155_CR17","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), 10008 (2008). https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"2155_CR18","unstructured":"Browet, A.: Algorithms for community and role detection in networks. PhD thesis, Catholic University of Louvain, Louvain-la-Neuve, Belgium (2014). https:\/\/hdl.handle.net\/2078.1\/151926"},{"key":"2155_CR19","unstructured":"Marchand, M.S.: Low-rank Riemannian optimization approach to the role extraction problem. PhD thesis, Florida State University, USA (2017). http:\/\/purl.flvc.org\/fsu\/fd\/FSU_FALL2017_Marchand_fsu_0071E_14046"},{"issue":"2","key":"2155_CR20","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1137\/20M1358785","volume":"3","author":"M Marchand","year":"2021","unstructured":"Marchand, M., Gallivan, K., Huang, W., Van Dooren, P.: Analysis of the neighborhood pattern similarity measure for the role extraction problem. SIAM J. Math. Data Sci. 3(2), 736\u2013757 (2021). https:\/\/doi.org\/10.1137\/20M1358785","journal-title":"SIAM J. Math. Data Sci."},{"issue":"5","key":"2155_CR21","doi-asserted-by":"publisher","first-page":"054301","DOI":"10.1103\/physreve.106.054301","volume":"106","author":"G Barbarino","year":"2022","unstructured":"Barbarino, G., Noferini, V., Van Dooren, P.: Role extraction for digraphs via neighborhood pattern similarity. Phys. Rev. E 106(5), 054301\u201311 (2022). https:\/\/doi.org\/10.1103\/physreve.106.054301","journal-title":"Phys. Rev. E"},{"key":"2155_CR22","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)"},{"key":"2155_CR23","volume-title":"Topics in Matrix Analysis","author":"RA Horn","year":"1994","unstructured":"Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1994)"},{"key":"2155_CR24","doi-asserted-by":"publisher","unstructured":"Meyer, C.: Matrix Analysis and Applied Linear Algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2000). https:\/\/doi.org\/10.1137\/1.9780898719512","DOI":"10.1137\/1.9780898719512"},{"issue":"4","key":"2155_CR25","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0036144502415960","volume":"46","author":"VD Blondel","year":"2004","unstructured":"Blondel, V.D., Gajardo, A., Heymans, M., Senellart, P., Van Dooren, P.: A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Rev. 46(4), 647\u2013666 (2004). https:\/\/doi.org\/10.1137\/S0036144502415960","journal-title":"SIAM Rev."},{"key":"2155_CR26","doi-asserted-by":"publisher","unstructured":"Leicht, E.A., Holme, P., Newman, M.E.J.: Vertex similarity in networks. Phys. Rev. E Stat. Nonlin. Soft Matter Phys. 73(2) (2006). https:\/\/doi.org\/10.1103\/PhysRevE.73.026120","DOI":"10.1103\/PhysRevE.73.026120"},{"key":"2155_CR27","unstructured":"Cason, T.P.: Role extraction in networks. PhD thesis, Catholic University of Louvain, Louvain-la-Neuve, Belgium (2012). https:\/\/hdl.handle.net\/2078.1\/114511"},{"key":"2155_CR28","doi-asserted-by":"publisher","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201902). KDD \u201902, pp. 538\u2013543. Association for Computing Machinery, New York, NY, USA (2002). https:\/\/doi.org\/10.1145\/775047.775126","DOI":"10.1145\/775047.775126"},{"issue":"4","key":"2155_CR29","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)","journal-title":"SIAM Rev."},{"issue":"3","key":"2155_CR30","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2004","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Math. 1(3), 335\u2013380 (2004)","journal-title":"Internet Math."},{"key":"2155_CR31","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2034282","volume":"14","author":"MH McAndrew","year":"1963","unstructured":"McAndrew, M.H.: On the product of directed graphs. Proc. Amer. Math. Soc. 14, 600\u2013606 (1963). https:\/\/doi.org\/10.2307\/2034282","journal-title":"Proc. Amer. Math. Soc."},{"key":"2155_CR32","doi-asserted-by":"publisher","unstructured":"Seneta, E.: Nonnegative Matrices and Markov Chains. Springer Series in Statistics, p. 279. Springer, New York (1981). https:\/\/doi.org\/10.1007\/0-387-32792-4","DOI":"10.1007\/0-387-32792-4"},{"key":"2155_CR33","doi-asserted-by":"publisher","first-page":"016107","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer, B., Newman, M.E.J.: Stochastic blockmodels and community structure in networks. Phys. Rev. E. 83, 016107 (2011). https:\/\/doi.org\/10.1103\/PhysRevE.83.016107","journal-title":"Phys. Rev. E."},{"key":"2155_CR34","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1515\/spma-2018-0010","volume":"6","author":"D Fasino","year":"2018","unstructured":"Fasino, D., Tudisco, F.: The expected adjacency and modularity matrices in the degree-corrected stochastic block model. Spec. Matrices. 6, 110\u2013121 (2018)","journal-title":"Spec. Matrices."},{"issue":"1","key":"2155_CR35","doi-asserted-by":"publisher","first-page":"1400005","DOI":"10.1126\/sciadv.1400005","volume":"1","author":"A Clauset","year":"2015","unstructured":"Clauset, A., Arbesman, S., Larremore, D.B.: Systematic inequality and hierarchy in faculty hiring networks. Sci. Adv. 1(1), 1400005 (2015). https:\/\/doi.org\/10.1126\/sciadv.1400005","journal-title":"Sci. Adv."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02155-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02155-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02155-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T05:00:00Z","timestamp":1763960400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02155-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,5]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2155"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02155-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2025,7,5]]},"assertion":[{"value":"17 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2025","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}