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

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.

[1]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 2005, computational complexity.

[2]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[3]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

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

[5]  L. Shapiro.  An Electrical Lemma , 1987 .

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

[7]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

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

[9]  Naomi Ehrich Leonard,et al.  A New Notion of Effective Resistance for Directed Graphs—Part II: Computing Resistances , 2013, IEEE Transactions on Automatic Control.

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

[11]  José Luis Palacios.  Resistance distance in graphs and random walks , 2001 .

[12]  P. Tetali.  Random walks and the effective resistance of networks , 1991 .

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

[14]  Douglas J. Klein,et al.  Molecular cyclicity and centricity of polycyclic graphs. I. Cyclicity based on resistance distances or reciprocal distances , 1994 .

[15]  Florian Dörfler,et al.  Kron Reduction of Graphs With Applications to Electrical Networks , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[16]  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.

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

[18]  Bojan Mohar,et al.  The Quasi-Wiener and the Kirchhoff Indices Coincide , 1996, J. Chem. Inf. Comput. Sci..

[19]  Fernando Paganini,et al.  A Course in Robust Control Theory , 2000 .

[20]  István Lukovits,et al.  Resistance distance in regular graphs , 1999 .

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

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

[23]  M. Randic,et al.  Resistance distance , 1993 .

[24]  István Lukovits,et al.  Extensions of the Wiener Number , 1996, J. Chem. Inf. Comput. Sci..

[25]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[26]  P. Chebotarev,et al.  On of the Spectra of Nonsymmetric Laplacian Matrices , 2004, math/0508176.

[27]  Naomi Ehrich Leonard,et al.  Robustness of aggregation in networked dynamical systems , 2009, 2009 Second International Conference on Robot Communication and Coordination.

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

[29]  I. Gutman,et al.  Resistance distance and Laplacian spectrum , 2003 .

[30]  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.

[31]  D. Klein,et al.  Graph Cyclicity, Excess Conductance, and Resistance Deficit , 2001 .

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

[33]  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.

[34]  Francesco Bullo,et al.  Synchronization of Power Networks: Network Reduction and Effective Resistance , 2010 .