Loading [MathJax]/extensions/MathMenu.js
Graph Effective Resistance and Distributed Control: Spectral Properties and Applications | IEEE Conference Publication | IEEE Xplore

Graph Effective Resistance and Distributed Control: Spectral Properties and Applications


Abstract:

We introduce the concept of matrix-valued effective resistance for undirected matrix-weighted graphs. Effective resistances are defined to be the square blocks that appea...Show More

Abstract:

We introduce the concept of matrix-valued effective resistance for undirected matrix-weighted graphs. Effective resistances are defined to be the square blocks that appear in the diagonal of the inverse of the matrix-weighted Dirichlet graph Laplacian matrix. However, they can also be obtained from a "generalized" electrical network that is constructed from the graph, and for which currents, voltages and resistances take matrix values. Effective resistances play an important role in several problems related to distributed control and estimation. They appear in least-squares estimation problems in which one attempts to reconstruct global information from relative noisy measurements; as well as in motion control problems in which agents attempt to control their positions towards a desired formation, based on noisy local measurements. We show that in either of these problems, the effective resistances have a direct physical interpretation. We also show that effective resistances provide bounds on the spectrum of the graph Laplacian matrix and the Dirichlet graph Laplacian. These bounds can be used to characterize the stability and convergence rate of several distributed algorithms that appeared in the literature
Date of Conference: 13-15 December 2006
Date Added to IEEE Xplore: 07 May 2007
Print ISBN:1-4244-0171-2
Print ISSN: 0191-2216
Conference Location: San Diego, CA, USA
References is not available for this document.

I. Introduction

This paper considers undirected graphs with a weight associated with each one of its edges. The edge-weights are symmetric positive definite matrices. For such graphs we introduce the concept of “effective resistances.” The effective resistance of a node is defined to be a square matrix block that appears in the diagonal of the inverse of the matrix-weighted Dirichlet graph Laplacian matrix (cf. Section II). The terminology “effective resistance” is motivated by the fact that these matrices also define a linear map from currents to voltages in a generalized electrical network that can be constructed from the undirected matrix-weighted graph. However, the voltages, currents, and resistances in this generalized electrical network take matrix values [1].

Select All
1.
P. Barooah and J. P. Hespanha. Optimal estimation from relative measurements: Electrical analogy and error bounds. Tech. rep., Center for Control, Dyn.-Systems and Comp., Univ. of California, Santa Barbara, 2006.
2.
P. G. Doyle and J. L. Snell. Random Walks and Electric Networks. Math. Assoc, of America, 1984.
3.
A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, et al. The electrical resistance of a graph captures its commute and cover times. In Proc. of the Twenty First 21st Annual ACM Symposium on Theory of Computing, pp. 574-586. 1989.
4.
R. Karp, J. Elson, D. Estrin and S. Shenker. Optimal and global time synchronization in sensornets. Tech. rep., Center for Embedded Networked Sensing, Univ. of California, Los Angeles, 2003.
5.
P. Barooah and J. P. Hespanha. Estimation from relative measurements: Error bounds from electrical analogy. In Proc. of the 2nd Int. Conf. on Intelligent Sensing and Information Processing. 2005.
6.
A. Giridhar and P. R. Kumar. Distributed time synchronization in wireless networks: Algorithms and analysis (I). In 45th IEEE Conference on Decison and Control. 2006.
7.
P. Barooah and J. P. Hespanha. Distributed estimation from relative measurements in sensor networks. In Proc. of the 3nd Int. Conf. on Intelligent Sensing and Information Processing. 2005.
8.
A. J. Fax and R. M. Murray. Information flow and cooperative control of vehicle formations. IEEE Trans. on Automat. Contr., vol. 49, no. 9: 1465-1476, 2004.
9.
S. K. Yadlapalli, S. Darbha and K. R. Rajagopal. Information flow and its relation to the stability of the motion of vehicles in a rigid formation. In Proc. of the 2005 Amer. Contr. Conf, pp. 1853-1858. 2005.
10.
F. R. K. Chung. Spectral Graph Theory. No. 92 in Regional Conference Series in Mathematics. American Mathematical Society, Providence, R.I., 1997.
11.
C. Godsil and G. Royle. Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, 2001.
12.
R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press., Cambridge, 1993.
13.
R. Olfati-Saber, A. J. Fax and R. M. Murray. Consensus and cooperation in networked multi-agent systems. Proc. of IEEE, 2006. Submitted for publication.
14.
J. M. Mendel. Lessons in Digital Estimation Theory. Prentice Hall, New Jersey, 1987.
15.
P. Barooah and J. P. Hespanha. Error amplication and disturbance propagation in vehicle strings with decentralized linear control. In Proc. of the 44th Conf. on Decision and Contr.. 2005.
Contact IEEE to Subscribe

References

References is not available for this document.