Cut ratios and Laplacian eigenvalues

Abstract

We introduce local cut ratios as a sampling scheme for the cut ratio of a vertex subset in a graph. We prove a bound for the sampling error, as well as a two-sided estimate for the local cut ratio, in terms of Laplacian eigenvalues. We derive an inequality for the vertex cut ratio in terms of the (edge) cut ratio.