A Cheeger inequality for the lower spectral gap
Abstract
Let be a Cayley graph, or a Cayley sum graph, or a twisted Cayley graph, or a twisted Cayley sum graph, or a vertex-transitive graph. Denote the degree of by d, its edge Cheeger constant by h, and its vertex Cheeger constant by h. Assume that is undirected, non-bipartite. We prove that the edge bipartiteness constant of is (h/d), the vertex bipartiteness constant of is (h), and the smallest eigenvalue of the normalized adjacency operator of is -1 + (h2/d2). This answers in the affirmative a question of Moorman, Ralli and Tetali on the lower spectral gap of Cayley sum graphs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.