Normalized Laplacian eigenvalues of hypergraphs
arXiv:2303.13145
Abstract
In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are related to the normalized Laplacian eigenvalues for uniform hypergraphs.
an error is corrected