$L^p$ Expander Graphs
Combinatorics
2022-02-25 v3
Abstract
We discuss how graph expansion is related to the behavior of -functions on the covering tree. We show that the non-trivial eigenvalues of the adjacency operator on aa -regular graph are bounded by - the -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 for every . We generalize the result to operators on edges and to bipartite graphs. The work is based on a combinatorial interpretation of representation-theoretic ideas.
Cite
@article{arxiv.1609.04433,
title = {$L^p$ Expander Graphs},
author = {Amitay Kamber},
journal= {arXiv preprint arXiv:1609.04433},
year = {2022}
}
Comments
29 pages. Final version. To appear in Israel Journal of Mathematics