A New Notion of Effective Resistance for Directed Graphs—Part II: Computing Resistances
Authors:
- 24 September 2015
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 61 (7) , 1737-1752
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.Keywords
All Related Versions
Funding Information
- AFOSR (FA9550-07-1-0-0528)
- ONR (N00014-09-1-1074, N00014-14-1-0635)
- ARO (W911NG-11-1-0385, W911NF-14-1-0431)
- Natural Sciences and Engineering Research Council (NSERC) of Canada
This publication has 14 references indexed in Scilit:
- Information Centrality and Ordering of Nodes for Accuracy in Noisy Decision-Making NetworksIEEE Transactions on Automatic Control, 2015
- Collective Decision-Making in Ideal Networks: The Speed-Accuracy TradeoffIEEE Transactions on Control of Network Systems, 2014
- Information centrality and optimal leader selection in noisy networks2013
- Rearranging trees for robust consensus2011
- A submodular optimization framework for leader selection in linear multi-agent systems2011
- Algorithms for leader selection in large dynamical networks: Noise-free leaders2011
- Estimation From Relative Measurements: Electrical Analogy and Large GraphsIEEE Transactions on Signal Processing, 2008
- Graph Effective Resistance and Distributed Control: Spectral Properties and Applications2006
- Mathematical Methods for Physics and Engineering2006
- Matrix Analysis1985