{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:22:28Z","timestamp":1780410148812,"version":"3.54.1"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100014440","name":"Espa\u00f1a Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ins.2026.123679","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T07:29:52Z","timestamp":1779780592000},"page":"123679","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Graph\/Network reduction based on communicability vertex similarity. A heuristic approach"],"prefix":"10.1016","volume":"754","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9865-1615","authenticated-orcid":false,"given":"Darian H.","family":"Grass-Boada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2529-3337","authenticated-orcid":false,"given":"Rodrigo","family":"de la Nuez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3066-7418","authenticated-orcid":false,"given":"Ernesto","family":"Estrada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ins.2026.123679_bib0005","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0010","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.82.011107","article-title":"Statistically consistent coarse-grained simulations for critical phenomena in complex networks","volume":"82","author":"Chen","year":"2010","journal-title":"Phys. Rev. E\u2014Stat. Nonlinear Soft Matter Phys."},{"issue":"4","key":"10.1016\/j.ins.2026.123679_bib0015","doi-asserted-by":"crossref","DOI":"10.1063\/1.3005782","article-title":"Synchronization-based scalability of complex clustered networks","volume":"18","author":"Ma","year":"2008","journal-title":"Chaos Interdiscip. J. Nonlinear Sci."},{"key":"10.1016\/j.ins.2026.123679_bib0020","series-title":"Mathematical Foundations for Data Analysis","first-page":"237","article-title":"Graph-structured data","author":"Phillips","year":"2021"},{"issue":"9","key":"10.1016\/j.ins.2026.123679_bib0025","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1038\/s41583-023-00718-5","article-title":"Brain network communication: concepts, models and applications","volume":"24","author":"Seguin","year":"2023","journal-title":"Nat. Rev. Neurosci."},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0030","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1038\/s43586-024-00294-7","article-title":"Graph neural networks","volume":"4","author":"Corso","year":"2024","journal-title":"Nat. Rev. Methods Primers"},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0035","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","article-title":"A comprehensive survey on graph neural networks","volume":"32","author":"Wu","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"9","key":"10.1016\/j.ins.2026.123679_bib0040","doi-asserted-by":"crossref","first-page":"2673","DOI":"10.1111\/ejn.13392","article-title":"Graph coarse-graining reveals differences in the module-level structure of functional brain networks","volume":"44","author":"Kujala","year":"2016","journal-title":"Eur. J. Neurosci."},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0045","doi-asserted-by":"crossref","first-page":"17","DOI":"10.3390\/brainsci15010017","article-title":"Graph neural networks in brain connectivity studies: methods, challenges, and future directions","volume":"15","author":"Mohammadi","year":"2024","journal-title":"Brain Sci."},{"key":"10.1016\/j.ins.2026.123679_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.neunet.2024.106931","article-title":"Graph batch coarsening framework for scalable graph neural networks","volume":"183","author":"Zhang","year":"2025","journal-title":"Neural Netw."},{"key":"10.1016\/j.ins.2026.123679_bib0055","series-title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"8058","article-title":"A comprehensive survey on graph reduction: sparsification, coarsening, and condensation","author":"Hashemi","year":"2024"},{"issue":"4","key":"10.1016\/j.ins.2026.123679_bib0060","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TNSE.2018.2871348","article-title":"Large-scale network reduction towards scale-free structure","volume":"6","author":"Martin","year":"2018","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"7024","key":"10.1016\/j.ins.2026.123679_bib0065","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1038\/nature03248","article-title":"Self-similarity of complex networks","volume":"433","author":"Song","year":"2005","journal-title":"Nature"},{"issue":"3","key":"10.1016\/j.ins.2026.123679_bib0070","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.99.038701","article-title":"Spectral coarse graining of complex networks","volume":"99","author":"Gfeller","year":"2007","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"10.1016\/j.ins.2026.123679_bib0075","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1038\/nphys560","article-title":"Reaction\u2013diffusion processes and metapopulation models in heterogeneous networks","volume":"3","author":"Colizza","year":"2007","journal-title":"Nat. Phys."},{"key":"10.1016\/j.ins.2026.123679_bib0080","article-title":"Large scale networks fingerprinting and visualization using the k-core decomposition","volume":"18","author":"Alvarez-Hamelin","year":"2005","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"8","key":"10.1016\/j.ins.2026.123679_bib0085","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/2492007.2492029","article-title":"Spectral sparsification of graphs: theory and algorithms","volume":"56","author":"Batson","year":"2013","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ins.2026.123679_bib0090","series-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","first-page":"47","article-title":"Approximating st minimum cuts in \u00d5 (n 2) time","author":"Bencz\u00far","year":"1996"},{"issue":"4","key":"10.1016\/j.ins.2026.123679_bib0095","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1137\/08074489X","article-title":"Spectral sparsification of graphs","volume":"40","author":"Spielman","year":"2011","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.ins.2026.123679_bib0100","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1137\/130949117","article-title":"Twice-ramanujan sparsifiers","volume":"56","author":"Batson","year":"2014","journal-title":"SIAM Rev."},{"issue":"118","key":"10.1016\/j.ins.2026.123679_bib0105","first-page":"1","article-title":"A unified framework for optimization-based graph coarsening","volume":"24","author":"Kumar","year":"2023","journal-title":"J. Mach. Learn. Res."},{"issue":"116","key":"10.1016\/j.ins.2026.123679_bib0110","first-page":"1","article-title":"Graph reduction with spectral and cut guarantees","volume":"20","author":"Loukas","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.ins.2026.123679_bib0115","series-title":"METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices","author":"Karypis","year":"1997"},{"key":"10.1016\/j.ins.2026.123679_bib0120","series-title":"International Conference on Machine Learning","first-page":"3237","article-title":"Spectrally approximating large graphs with smaller graphs","author":"Loukas","year":"2018"},{"key":"10.1016\/j.ins.2026.123679_bib0125","series-title":"Handbook of Graph Theory","author":"Gross","year":"2003"},{"issue":"4","key":"10.1016\/j.ins.2026.123679_bib0130","first-page":"623","article-title":"On similar points of a graph","volume":"15","author":"Harary","year":"1966","journal-title":"J. Math. Mech."},{"issue":"2","key":"10.1016\/j.ins.2026.123679_bib0135","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0095-8956(82)90030-2","article-title":"Constructing graphs with pairs of pseudo-similar vertices","volume":"32","author":"Godsil","year":"1982","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/j.ins.2026.123679_bib0140","first-page":"77","article-title":"Pseudosimilarity in graphs-a survey","volume":"46","author":"Lauri","year":"1997","journal-title":"Ars Comb."},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0145","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s40314-023-02571-9","article-title":"Communicability cosine distance: similarity and symmetry in graphs\/networks","volume":"43","author":"Estrada","year":"2024","journal-title":"Comput. Appl. Math."},{"issue":"7028","key":"10.1016\/j.ins.2026.123679_bib0150","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1038\/nature03288","article-title":"Functional cartography of complex metabolic networks","volume":"433","author":"Guimera","year":"2005","journal-title":"Nature"},{"key":"10.1016\/j.ins.2026.123679_bib0155","author":"Jin"},{"key":"10.1016\/j.ins.2026.123679_bib0160","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2017.07.007","article-title":"Random walks and diffusion on networks","volume":"716","author":"Masuda","year":"2017","journal-title":"Phys. Rep."},{"issue":"2","key":"10.1016\/j.ins.2026.123679_bib0165","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslov. Math. J."},{"issue":"3","key":"10.1016\/j.ins.2026.123679_bib0170","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.physrep.2008.09.002","article-title":"Synchronization in complex networks","volume":"469","author":"Arenas","year":"2008","journal-title":"Phys. Rep."},{"key":"10.1016\/j.ins.2026.123679_bib0175","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.arcontrol.2017.09.002","article-title":"On the dynamics of deterministic epidemic propagation over networks","volume":"44","author":"Mei","year":"2017","journal-title":"Annu. Rev. Control"},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0180","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1146\/annurev.genet.38.072902.092831","article-title":"Duplication and divergence: the evolution of new genes and old ideas","volume":"38","author":"Taylor","year":"2004","journal-title":"Annu. Rev. Genet."},{"issue":"6042","key":"10.1016\/j.ins.2026.123679_bib0185","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1126\/science.1203877","article-title":"Evidence for network evolution in an arabidopsis interactome map","volume":"333","author":"Consortium","year":"2011","journal-title":"Science"},{"issue":"3","key":"10.1016\/j.ins.2026.123679_bib0190","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.77.036111","article-title":"Communicability in complex networks","volume":"77","author":"Estrada","year":"2008","journal-title":"Phys. Rev. E\u2014Stat. Nonlinear Soft Matter Phys."},{"issue":"5","key":"10.1016\/j.ins.2026.123679_bib0195","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.71.056103","article-title":"Subgraph centrality in complex networks","volume":"71","author":"Estrada","year":"2005","journal-title":"Phys. Rev. E\u2014Stat. Nonlinear Soft Matter Phys."},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0200","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/S00361445024180","article-title":"Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later","volume":"45","author":"Moler","year":"2003","journal-title":"SIAM Rev."},{"key":"10.1016\/j.ins.2026.123679_bib0205","series-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"1296","article-title":"Fast influence-based coarsening for large networks","author":"Purohit","year":"2014"},{"issue":"4","key":"10.1016\/j.ins.2026.123679_bib0210","doi-asserted-by":"crossref","first-page":"B499","DOI":"10.1137\/110843563","article-title":"Lean algebraic multigrid (LAMG): fast graph laplacian linear solver","volume":"34","author":"Livne","year":"2012","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0215","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1137\/100791142","article-title":"Relaxation-based coarsening and multiscale graph organization","volume":"9","author":"Ron","year":"2011","journal-title":"Multiscale Model. Simul."},{"issue":"1","key":"10.1016\/j.ins.2026.123679_bib0220","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/TCSI.2012.2215780","article-title":"Kron reduction of graphs with applications to electrical networks","volume":"60","author":"Dorfler","year":"2012","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"3","key":"10.1016\/j.ins.2026.123679_bib0225","doi-asserted-by":"crossref","first-page":"259","DOI":"10.2307\/2412323","article-title":"A new statistical approach to geographic variation analysis","volume":"18","author":"Gabriel","year":"1969","journal-title":"Syst. Zool."},{"issue":"3\u20135","key":"10.1016\/j.ins.2026.123679_bib0230","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"issue":"6","key":"10.1016\/j.ins.2026.123679_bib0235","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.90.062805","article-title":"Community detection in networks: structural communities versus ground truth","volume":"90","author":"Hric","year":"2014","journal-title":"Phys. Rev. E"},{"issue":"23","key":"10.1016\/j.ins.2026.123679_bib0240","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"Newman","year":"2006","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"10.1016\/j.ins.2026.123679_bib0245","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1137\/S0895479895281484","article-title":"Deflation techniques for an implicitly restarted arnoldi iteration","volume":"17","author":"Lehoucq","year":"1996","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"10.1016\/j.ins.2026.123679_bib0250","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1209\/epl\/i2005-10441-3","article-title":"Spectral scaling and good expansion properties in complex networks","volume":"73","author":"Estrada","year":"2006","journal-title":"Europhys. Lett."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526006109?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526006109?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:38:34Z","timestamp":1780407514000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526006109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":50,"alternative-id":["S0020025526006109"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123679","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Graph\/Network reduction based on communicability vertex similarity. A heuristic approach","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123679","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"123679"}}