Abstract
The graphical notion of effective resistance has found wide-ranging applications in many areas of pure mathematics, applied mathematics and control theory. By the nature of its construction, effective resistance can only be computed in undirected graphs and yet in several areas of its application, directed graphs arise as naturally (or more naturally) than undirected ones. In Part I of this work, we propose a generalization of effective resistance to directed graphs that preserves its control-theoretic properties in relation to consensus-type dynamics. We proceed to analyze the dependence of our algebraic definition on the structural properties of the graph and the relationship between our construction and a graphical distance. The results make possible the calculation of effective resistance between any two nodes in any directed graph and provide a solid foundation for the application of effective resistance to problems involving directed graphs.
| Original language | English (US) |
|---|---|
| Article number | 7276998 |
| Pages (from-to) | 1727-1736 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 61 |
| Issue number | 7 |
| DOIs | |
| State | Published - Jul 2016 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering
Keywords
- Graph theory
- directed graphs
- effective resistance
- networked control systems
- networks