On the isoperimetric spectrum of graphs and its approximations

@article{Daneshgar2010OnTI,
  title={On the isoperimetric spectrum of graphs and its approximations},
  author={Amir Daneshgar and Hossein Hajiabolhassan and Ramin Javadi},
  journal={J. Comb. Theory, Ser. B},
  year={2010},
  volume={100},
  pages={390-412}
}
In this paper we consider 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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 50 references

Laplacian Eigenvectors of Graphs

  • T. Bıyıkoğlu, J. Leydold, P. Stadler
  • Perron-Frobenius and Faber-Krahn type theorems…
  • 2007
Highly Influential
5 Excerpts

On eigenfunctions of Markov processes on trees

  • L. Miclo
  • Probab. Theory Relat. Fields, 142
  • 2008
2 Excerpts

Graph homomorphisms and nodal domains

  • A. Daneshgar, H. Hajiabolhassan
  • Linear Algebra and Its Applications, 418
  • 2006
1 Excerpt

Mathematical aspects of mixing times in Markov chains

  • R. Montenegro, P. Tetali
  • Found. Trends Theor. Comput. Sci. 1
  • 2006
2 Excerpts

Similar Papers

Loading similar papers…