# Difference between revisions of "EECI08: Information Flow and Consensus"

From Murray Wiki

Jump to navigationJump to searchLine 2: | Line 2: | ||

{{righttoc}} | {{righttoc}} | ||

+ | 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 ==== | ==== Lecture Materials ==== |

## Revision as of 00:38, 29 March 2008

Prev: Packet-Based Control | 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

- Lecture slides: An Introduction to Graph Theory