Ali Kemal Sinop

Institute for Advanced Study; Member, School of Mathematics

October 1, 2013

A common way for lower bounding the expansion of a graph is by looking the second smallest eigenvalue of its Laplacian matrix. Also known as the easy direction of Cheeger's inequality, this bound becomes too weak when the expansion is