A New Notion of Effective Resistance for Directed Graphs-Part II: Computing Resistances
Not on the map. Why?
Abstract (arXiv)
In Part I of this work we defined a generalization of the concept of effective resistance to directed graphs, and we explored some of the properties of this new definition. Here, we use the theory developed in Part I to compute effective resistances in some prototypical directed graphs. This exploration highlights cases where our notion of effective resistance for directed graphs behaves analogously to our experience from undirected graphs, as well as cases where it behaves in unexpected ways.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Oct 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 1.
3 papers.
- 2024Resistance Distance and Linearized Optimal Transport on Graphscited by 2
- 2023Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networkscited by 0
- 2026Generalized Inverses of Matrix Products: From Fundamental Subspaces to Randomized Decompositionscited by 0
- 2026Generalized Inverses of Matrix Products: From Fundamental Subspaces to Randomized Decompositions30 Jan 2026
- 2024Resistance Distance and Linearized Optimal Transport on Graphs23 Apr 2024
- 2023Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networks13 Sep 2023