加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本