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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.