A Cheeger Cut for Uniform Hypergraphs
Combinatorics
2021-06-08 v3 Spectral Theory
Abstract
The graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose edges have the same cardinality. In particular, it is shown that the second largest eigenvalue of the generalized normalized Laplacian is bounded both above and below by the generalized Cheeger constant, and the corresponding eigenfunctions can be used to approximate the Cheeger cut.
Keywords
Cite
@article{arxiv.2011.06816,
title = {A Cheeger Cut for Uniform Hypergraphs},
author = {Raffaella Mulas},
journal= {arXiv preprint arXiv:2011.06816},
year = {2021}
}