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

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.

[1]  K. F. Riley,et al.  Mathematical Methods for Physics and Engineering , 1998 .

[2]  João Pedro Hespanha,et al.  Estimation From Relative Measurements: Electrical Analogy and Large Graphs , 2008, IEEE Transactions on Signal Processing.

[3]  K. F. Riley,et al.  Mathematical Methods for Physics and Engineering , 1998 .

[4]  Vaibhav Srivastava,et al.  Collective Decision-Making in Ideal Networks: The Speed-Accuracy Tradeoff , 2014, IEEE Transactions on Control of Network Systems.

[5]  Radha Poovendran,et al.  A submodular optimization framework for leader selection in linear multi-agent systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

[6]  Naomi Ehrich Leonard,et al.  Rearranging trees for robust consensus , 2011, IEEE Conference on Decision and Control and European Control Conference.

[7]  Naomi Ehrich Leonard,et al.  Node Classification in Networks of Stochastic Evidence Accumulators , 2012, ArXiv.

[8]  Fu Lin,et al.  Algorithms for leader selection in large dynamical networks: Noise-free leaders , 2011, IEEE Conference on Decision and Control and European Control Conference.

[9]  J. Hespanha,et al.  Estimation on graphs from relative measurements , 2007, IEEE Control Systems.

[10]  M. R. Spiegel.  Mathematical handbook of formulas and tables , 1968 .

[11]  E. Hansen.  A Table of Series and Products , 1977 .

[12]  Naomi Ehrich Leonard,et al.  Information Centrality and Ordering of Nodes for Accuracy in Noisy Decision-Making Networks , 2016, IEEE Transactions on Automatic Control.

[13]  Naomi Ehrich Leonard,et al.  Robustness of noisy consensus dynamics with directed communication , 2010, Proceedings of the 2010 American Control Conference.

[14]  P. Barooah,et al.  Graph Effective Resistance and Distributed Control: Spectral Properties and Applications , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[15]  Naomi Ehrich Leonard,et al.  Information centrality and optimal leader selection in noisy networks , 2013, 52nd IEEE Conference on Decision and Control.

[16]  Naomi Ehrich Leonard,et al.  A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties , 2013, IEEE Transactions on Automatic Control.

[17]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[18]  Bassam Bamieh,et al.  Leader selection for optimal network coherence , 2010, 49th IEEE Conference on Decision and Control (CDC).