[1] Aleksander Madry, Damian Straszak, and Jakub Tarnawski. Fast generation of random spanning trees and the effective resistance metric. In Symposium on Discrete Algorithms, 2014.
[2] Karel Devriendt. Effective resistance is more than distance: Laplacians, simplices and the schur complement. In Linear Algebra and its Applications, 2022.
[3] Huan Li and Zhongzhi Zhang. Kirchhoff index as a measure of edge centrality in weighted networks: Nearly linear time algorithms. In Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2018.
[4] Douglas Klein and Milan Randic. Resistance distance. In Journal of Mathematical Chemistry, 1993.
[5] Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances. In SIAM Journal of Computing, 2009.
[6] Yin Tat Lee and He Sun. Constructing linear-sized spectral sparsification in almost-linear time. In SIAM Journal of Computing, 2015.
[7] David Durfee, Yu Gao, Gramoz Goranci, and Richard Peng. Fully dynamic spectral vertex sparsifiers and applications. In Symposium on Theory of Computing, 2019.
[8] Rakshith S Srinivasa, Cao Xiao, Lucas Glass, and Jimeng Sun Justin Romberg. Fast graph attention networks using effective resistance based graph sparsification. In arXiv preprint arXiv:2006.08796, 2020.
[9] Tasweer Ahmad, Lianwen Jin, Luojun Lin, and GuoZhi Tang. Skeleton-based action recognition using sparse spatio-temporal gcn with edge effective resistance. In Neurocomputing, 2021.
[10] Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, and Shang-Hua Teng. Efficient sampling for gaussian graphical models via spectral sparsification. In Proceedings of the Conference on Learning Theory, 2015.
[11] Daniele Calandriello, Alessandro Lazaric, Ioannis Koutis, and Michal Valko. Improved large-scale graph learning through ridge spectral sparsification. In International Conference on Machine Learning, 2018.
[12] Alexander Mercier, Samuel Scarpino, and Christopher Moore. Effective resistance against pandemics: Mobility network sparsification for high-fidelity epidemic simulations. In PLOS Computational Biology, 2022.
[13] Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In Symposium on Theory of Computing, 2010.
[14] Aleksander Madry. Navigating central path with electrical flows: from flows to matchings, and back. In Symposium on Foundations of Computer Science, 2013.
[15] Aleksander Madry. Computing maximum flow with augmenting electrical flows. In Computing Maximum Flow with Augmenting Electrical Flows, 2016.
[16] Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P Liu, Richard Peng, and Aaron Sidford. Faster maxflow via improved dynamic spectral vertex sparsifiers. In Symposium on Theory of Computing, 2022.
[17] Jan Van Den Brand, Yang P Liu Yin Tat Lee, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. Minimum cost flows, mdps, and  $\ell_1$ -regression in nearly linear time for dense instances. In Symposium on Theory of Computing, 2021.
[18] Yin Tat Lee and Aaron Sidford. Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow. In Symposium on Foundations of Computer Science, 2014.