Effective Resistance in Simplicial Complexes as Bilinear Forms: Generalizations and Properties
In\'es Garc\'ia-Redondo, Claudia Landi, Sarah Percival, Anda Skeja, Bei Wang, and Ling Zhou

TL;DR
This paper introduces a basis-independent bilinear form generalizing effective resistance from graphs to simplicial complexes, unifying existing formulations and establishing higher-order properties like metrics and Foster's theorem analogues.
Contribution
It presents a novel algebraic bilinear form extending effective resistance to simplicial complexes, unifying prior matrix-based approaches and proving new properties.
Findings
Defines a basis-independent bilinear form for effective resistance
Establishes that effective resistance induces a pseudometric on chains
Generalizes Foster's theorem to simplicial complexes
Abstract
The concept of effective resistance, originally introduced in electrical circuit theory, has been extended to the setting of graphs by interpreting each edge as a resistor. In this context, the effective resistance between two vertices quantifies the total opposition to current flow when a unit current is injected at one vertex and extracted at the other. Beyond its physical interpretation, the effective resistance encodes rich structural and geometric information about the underlying graph: it defines a metric on the vertex set, relates to the topology of the graph through Foster's theorem, and determines the probability of an edge appearing in a random spanning tree. Generalizations of effective resistance to simplicial complexes have been proposed in several forms, often formulated as matrix products of standard operators associated with the complex. In this paper, we present a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Topological and Geometric Data Analysis · Graph Labeling and Dimension Problems
