p-distortion and p-spectral gap of finite regular graphs

Abstract

We give a lower bound for the p-distortion cp(X) of finite graphs X, depending on the first eigenvalue λ1(p)(X) of the p-Laplacian and the maximal displacement of permutations of vertices. For a k-regular vertex-transitive graph it takes the form cp(X)p≥ diam(X)pλ1(p)(X)/2p-1k. This bound is optimal for expander families and, for p=2, it gives the exact value for cycles and hypercubes. As a new application we give a non-trivial lower bound for the 2-distortion of a family of Cayley graphs of SLn(q) (q fixed, n≥ 2) with respect to a standard two-element generating set.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…