Difference between revisions of "EECI09: Graph theory"

From Murray Wiki
Jump to navigationJump to search
 
Line 15: Line 15:


==  Additional Information ==
==  Additional Information ==
* [[EECI08: Information Flow and Consensus|2008 lecture page]]

Latest revision as of 00:21, 8 March 2009

Prev: Information patterns Course home Next: Distributed control

This lecture gives an introduction to some concepts and tools in graph theory. After giving the basic definitions of graphs and properties of graphs, we introduce the Laplacian of a matrix and discuss its properties and uses. Special emphasis is placed on the eigenvalues of the Laplacian, including the bounding of those eigenvalues using the Gershgorin disk theorem. The consensus problem is introduced as an example of the use of the basic concepts.

Lecture Materials

Further Reading

Additional Information