Description

In this third talk we will discuss properties related to edge expansion. In particular, we will define the Cheeger constant (which measures how easy it is to cut off a large piece of the graph) and state the Cheeger inequalities. We also will define and discuss discrepancy for undirected and directed graphs. We also state the Perron-Frobenius Theorem which is a useful tool in spectral graph theory, particularly for directed graphs.

Links and resources

Tags