A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties

DOI10.1109/TAC.2015.2481978zbMath1359.93131arXiv1310.5163OpenAlexW1818569528MaRDI QIDQ2980478

Luca Scardovi, Naomi Ehrich Leonard, George Forrest Young

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

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

Kron Reduction and Effective Resistance of Directed Graphs ⋮ Metric and ultrametric inequalities for directed graphs ⋮ Hitting time quasi-metric and its forest representation ⋮ On resistance distance of Markov chain and its sum rules ⋮ Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey ⋮ Pseudoinverses of Signed Laplacian Matrices ⋮ Resistance distance in connected balanced digraphs ⋮ Effective Resistance Preserving Directed Graph Symmetrization ⋮ Hubs-biased resistance distances on graphs and networks ⋮ Corrigendum to: ``On eigenvalues of Laplacian matrix for a class of directed signed graphs ⋮ Modulus on graphs as a generalization of standard graph theoretic quantities ⋮ A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities

This page was built for publication: A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties