A Cheeger inequality for graphs based on a reflection principle
Spectral Theory
2020-07-15 v4 Classical Analysis and ODEs
Combinatorics
Abstract
Given a graph with a designated set of boundary vertices, we define a new notion of a Neumann Laplace operator on a graph using a reflection principle. We show that the first eigenvalue of this Neumann graph Laplacian satisfies a Cheeger inequality.
Keywords
Cite
@article{arxiv.1902.06633,
title = {A Cheeger inequality for graphs based on a reflection principle},
author = {Edward Gelernt and Diana Halikias and Charles Kenney and Nicholas F. Marshall},
journal= {arXiv preprint arXiv:1902.06633},
year = {2020}
}
Comments
11 pages, 4 figures