{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:30:22Z","timestamp":1787337022817,"version":"build-2736575974"},"reference-count":48,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 2217058"],"award-info":[{"award-number":["CCF 2217058"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 2112665"],"award-info":[{"award-number":["CCF 2112665"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 2310411"],"award-info":[{"award-number":["CCF 2310411"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 2012266"],"award-info":[{"award-number":["DMS 2012266"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["1RF1MH125317"],"award-info":[{"award-number":["1RF1MH125317"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Simula Research Laboratory"},{"name":"Halicioglu Data Science Institute"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>We investigate the concept of effective resistance in connection graphs, expanding its traditional application from undirected graphs. We propose a robust definition of effective resistance in connection graphs by focusing on the duality of Dirichlet-type and Poisson-type problems on connection graphs. Additionally, we delve into random walks, taking into account both node transitions and vector rotations. This approach introduces novel concepts of effective conductance and resistance matrices for connection graphs, capturing mean rotation matrices corresponding to random walk transitions. Thereby, it provides new theoretical insights for network analysis and optimization.<\/jats:p>","DOI":"10.1137\/23m1595400","type":"journal-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T15:28:52Z","timestamp":1724081332000},"page":"1541-1572","source":"Crossref","is-referenced-by-count":7,"title":["Random Walks, Conductance, and Resistance for the Connection Graph Laplacian"],"prefix":"10.1137","volume":"45","author":[{"given":"Alexander","family":"Cloninger","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of California San Diego, La Jolla, CA 92093 USA."},{"name":"Hal\u0131c\u0131o\u011flu Data Science Institute, University of California San Diego, La Jolla, CA 92093 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5287-3626","authenticated-orcid":true,"given":"Gal","family":"Mishne","sequence":"additional","affiliation":[{"name":"Hal\u0131c\u0131o\u011flu Data Science Institute, University of California San Diego, La Jolla, CA 92093 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Oslandsbotn","sequence":"additional","affiliation":[{"name":"Department of Informatics, University of Oslo, Oslo, Norway."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4746-3075","authenticated-orcid":true,"given":"Sawyer J.","family":"Robertson","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California San Diego, La Jolla, CA 92093 USA."},{"name":"Hal\u0131c\u0131o\u011flu Data Science Institute, University of California San Diego, La Jolla, CA 92093 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengchao","family":"Wan","sequence":"additional","affiliation":[{"name":"Hal\u0131c\u0131o\u011flu Data Science Institute, University of California San Diego, La Jolla, CA 92093 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7950-4348","authenticated-orcid":true,"given":"Yusu","family":"Wang","sequence":"additional","affiliation":[{"name":"Hal\u0131c\u0131o\u011flu Data Science Institute, University of California San Diego, La Jolla, CA 92093 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2024,8,19]]},"reference":[{"key":"ref1","unstructured":"V. L. Alev, N. Anari, L. C. Lau, and S. Oveis Gharan, Graph clustering using effective resistance, in Proceedings of the 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 2018."},{"key":"ref2","unstructured":"A. Arnaiz-Rodr\u00edguez, A. Begga, F. Escolano, and N. M. Oliver, DiffWire: Inductive graph rewiring via the Lov\u00e1sz bound, in Proceedings of the 1st Learning on Graphs Conference, 2022, https:\/\/openreview.net\/forum?id=IXvfIex0mX6f."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/120875338"},{"key":"ref4","series-title":"Proc. Mach. Learn. Res. 196","first-page":"28","volume-title":"Proceedings of the Topological, Algebraic and Geometric Learning Workshops","author":"Barbero F.","year":"2022"},{"key":"ref5","series-title":"CMS Books Math. Ouvrages Math. SMC 15","volume-title":"Generalized Inverses: Theory and Applications","author":"Ben-Israel A.","year":"2003"},{"key":"ref6","unstructured":"M. Black, Z. Wan, A. Nayyeri, and Y. Wang, Understanding oversquashing in GNNs through the lens of effective resistance, in Proceedings of the 40th International Conference on Machine Learning, 2023."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2013.05.003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1037\/h0046049"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2846801"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"A. K. Chandra, P. Raghavan, W. L. Ruzzo, and R. Smolensky, The electrical resistance of a graph captures its commute and cover times, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 574\u2013586.","DOI":"10.1145\/73007.73062"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/19M1247632"},{"key":"ref12","series-title":"CBMS Reg. Conf. Ser. Math. 92","volume-title":"Spectral Graph Theory","author":"Chung F.","year":"1997"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3094"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.800005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2016.11.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1969-0255573-1"},{"key":"ref17","unstructured":"F. Di Giovanni, L. Giusti, F. Barbero, G. Luise, P. Lio, and M. Bronstein, On over-squashing in message passing neural networks: The impact of width, depth, and topology, in Proceedings of the 40th International Conference on Machine Learning, 2023."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440222"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/p1031"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2017.01.004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.95.022302"},{"key":"ref22","doi-asserted-by":"crossref","unstructured":"S. Fiorini, S. Coniglio, M. Ciavotta, and E. Messina, SigMaNet: One Laplacian to rule them all, in Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, https:\/\/doi.org\/10.1609\/aaai.v37i6.25919.","DOI":"10.1609\/aaai.v37i6.25919"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2020.586664"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213016400029"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90006-5"},{"key":"ref26","author":"G\u00fclen A. B.","year":"2023","journal-title":"Intl. Sympos. Comput. Geom. (SoCG)"},{"key":"ref27","doi-asserted-by":"crossref","unstructured":"J. Ham, D. D. Lee, S. Mika, and B. Sch\u00f6lkopf, A kernel view of the dimensionality reduction of manifolds, in Proceedings of the 21st International Conference on Machine Learning, 2004, 47.","DOI":"10.1145\/1015330.1015417"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1142\/13120"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2140\/pmp.2021.2.419"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOP596"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2014.01.056"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.862884"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-10018-9_28"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/16M1056353"},{"key":"ref35","first-page":"1","volume-title":"Combinatorics, Paul Erd\u0151s is Eighty","volume":"2","author":"Lov\u00e1sz L.","year":"1993"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/21M1435471"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.7153\/oam-2020-14-46"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11118-021-09901-8"},{"key":"ref39","author":"Schild A.","year":"2019","journal-title":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019)"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.02.001"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21395"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2019.2929180"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/22M1480823"},{"key":"ref45","doi-asserted-by":"crossref","unstructured":"S. Tauch, W. Liu, and R. Pears, Measuring cascade effects in interdependent networks by using effective graph resistance, in Proceedings of the\u00a0IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2015, pp. 683\u2013688, https:\/\/doi.org\/10.1109\/INFCOMW.2015.7179465.","DOI":"10.1109\/INFCOMW.2015.7179465"},{"key":"ref46","doi-asserted-by":"crossref","unstructured":"X. Wang, Y. Ko\u00e7, R. E. Kooij, and P. Van Mieghem, A network approach for power grid robustness against cascading failures, in Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling (RNDM), 2015, pp. 208\u2013214, https:\/\/doi.org\/10.1109\/RNDM.2015.7325231.","DOI":"10.1109\/RNDM.2015.7325231"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.04.018"},{"key":"ref48","unstructured":"X. Zhang, Y. He, N. Brugnone, M. Perlmutter, and M. Hirn, MagNet: A neural network for directed graphs, in Proceedings of the 35th Conference on Neural Information Processing Systems, M. Ranzato, A. Beygelzimer, Y. Dauphin, P. Liang, and J. W. Vaughan, eds. 2021."}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/23M1595400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:41:20Z","timestamp":1787334080000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1595400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,19]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1137\/23M1595400"],"URL":"https:\/\/doi.org\/10.1137\/23m1595400","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,19]]}}}