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

DOI10.1109/TAC.2015.2481839MaRDI QIDQ2980479zbMATH OpenOpenAlexFDO

Authors George Forrest Young, L. Scardovi, Naomi Ehrich Leonard

Publication date 3 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.5168

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35)

Abstract: 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.

Cited in

(5)

• On resistance distance of Markov chain and its sum rules
• Effective Resistance Preserving Directed Graph Symmetrization
• A metric on directed graphs and Markov chains based on hitting probabilities
• Resistance distance in connected balanced digraphs
• Resistance distances in directed graphs: definitions, properties, and applications

This page was built for publication: A New Notion of Effective Resistance for Directed Graphs—Part II: Computing Resistances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980479)