On the isoperimetric spectrum of graphs and its approximations

In this paper11This article is a revised version of Daneshgar and Hajiabolhassan (2008) [19] distributed on arXiv.org (1ʹst, Jan. 2008). nsider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the nth mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set of n disjoint subsets of the vertex set of the graph. We show that the second mean isoperimetric constant in this general setting, coincides with (the mean version of) the classical Cheeger constant of the graph, while for the rest of the spectrum we show that there is a fundamental difference between the nth isoperimetric constant and the number obtained by taking the minimum over all n-partitions. In this direction, we show that our definition is the correct one in the sense that it satisfies a Federer–Fleming-type theorem, and we also define and present examples for the concept of a supergeometric graph as a graph whose mean isoperimetric constants are attained on partitions at all levels. er, considering the NP-completeness of the isoperimetric problem on graphs, we address ourselves to the approximation problem where we prove general spectral inequalities that give rise to a general Cheeger-type inequality as well. On the other hand, we also consider some algorithmic aspects of the problem where we show connections to orthogonal representations of graphs and following J. Malik and J. Shi (2000) we study the close relationships to the well-known k-means algorithm and normalized cuts method.