No article text was recorded for this version.
effective resistance metric
Version 1 of 137 papers48 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Understanding Oversquashing in GNNs through the Lens of Effective Resistance
- Blog: Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues
- Blog: Fast Generation of Random Spanning Trees and the Effective Resistance Metric
- Blog: Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
- Blog: Current Flow Group Closeness Centrality for Complex Networks?
- Blog: Prediction on a Graph with a Perceptron
- Blog: Graph Clustering using Effective Resistance
- Blog: Relating Function Class Complexity and Cluster Structure in the Function Domain with Applications to Transduction
- Blog: HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering
- Blog: Cascading failures in power grids: analysis and algorithms
- Blog: A Resistance-Distance-Based Approach for Optimal Leader Selection in Noisy Consensus Networks
- Blog: Convergence of blanket times for sequences of random walks on critical random graphs
- Blog: PRIS at 2012 Microblog Track
- Blog: Persistent Homology for High-dimensional Data Based on Spectral Methods
- Blog: Variance and Covariance of Distributions on Graphs
- Blog: Cayley Graph Propagation
- Blog: The wired minimal spanning forest on the Poisson-weighted infinite tree
- Blog: Weakening Covert Networks by Minimizing Inverse Geodesic Length
- Blog: Graph-Theoretic Intrinsic Reward: Guiding RL with Effective Resistance
- Blog: Affinity-Aware Graph Networks
- Blog: Wiener Index, Kirchhoff Index in Graphs with Given Girth and Maximum Degree
- Blog: Information Flow Analysis of Interactome Networks
- Blog: Predicting the Labelling of a Graph via Minimum $p$-Seminorm Interpolation
- Blog: See the Tree Through the Lines: The Shazoo Algorithm
- Blog: Uncovering Latent Communication Patterns in Brain Networks via Adaptive Flow Routing
- Blog: Complexity of Optimally Defending and Attacking a Network
- Blog: Rethinking the Expressive Power of GNNs via Graph Biconnectivity
- Blog: Faster Spectral Sparsification in Dynamic Streams
- Blog: SURREAL: Subgraph Robust Representation Learning
- Blog: Maximizing the Number of Spanning Trees in a Connected Graph
- Blog: Accelerating flood warnings by 10 hours: the power of river network topology in AI-enhanced flood forecasting
- Blog: Fast Maximization of Current Flow Group Closeness Centrality
- Blog: Navigation on temporal networks
- Blog: Complex network-based classification of radiographic images for COVID-19 diagnosis
- Blog: Spectra, Hitting Times and Resistance Distances of<i>q</i>- Subdivision Graphs
- Blog: SAGMAN: Stability Analysis of Graph Neural Networks on the Manifolds
- Blog: Gender and collaboration patterns in a temporal scientific authorship network
History & citation
Current · Permanent link
- This direction split from Measuring Graph Connectivity with Effective Resistance (95% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_effective_resistance_metric_e71b2476,
title = {effective resistance metric},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/effective-resistance-metric/rdr_e71b2476ad094fbc8290aa88df2c21e7},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_effective_resistance_metric_e71b2476_v1,
title = {effective resistance metric},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/effective-resistance-metric/rdr_e71b2476ad094fbc8290aa88df2c21e7/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}