# A New Notion of Effective Resistance for Directed Graphs-Part II: Computing Resistances

arXiv: https://arxiv.org/abs/1310.5168 · HTML: https://mlsanity.com/paper/1310.5168/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Oct 2013.

## Built on by (most cited first, 3 of 3)

- [Resistance Distance and Linearized Optimal Transport on Graphs](https://mlsanity.com/paper/2404.15261/) (2024)
- [Optimal transport distances for directed, weighted graphs: a case study with cell-cell communication networks](https://mlsanity.com/paper/2309.07030/) (2023)
- [Generalized Inverses of Matrix Products: From Fundamental Subspaces to Randomized Decompositions](https://mlsanity.com/paper/2602.00386/) (2026)

## 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.