$L^p$ Expander Graphs

TL;DR

This paper explores the relationship between graph expansion properties and the behavior of $L^{p}$-functions on covering trees, providing bounds on eigenvalues and generalizations to various graph types using representation theory.

Contribution

It establishes a novel connection between eigenvalue bounds and $L^{p}$-norms on covering trees, extending to edge operators and bipartite graphs with a combinatorial approach.

Findings

Eigenvalues bounded by $q^{1/p}+q^{(p-1)/p}$ for regular graphs.

Properly averaged lifts of functions lie in $L^{p+ ext{epsilon}}$ spaces.

Generalization to edge operators and bipartite graphs.

Abstract

We discuss how graph expansion is related to the behavior of $L^{p}$-functions on the covering tree. We show that the non-trivial eigenvalues of the adjacency operator on aa $(q+1)$-regular graph are bounded by $q^{1/p}+q^{(p-1)/p}$ - the $L^{p}$-norm of the operator on the covering tree - if and only if properly averaged lifts of functions from the graph to the tree lie in $L^{p+\epsilon}$ for every $\epsilon>0$. We generalize the result to operators on edges and to bipartite graphs. The work is based on a combinatorial interpretation of representation-theoretic ideas.