-distortion and -spectral gap of finite regular graphs
arXiv:1110.0909 · doi:10.1112/blms/bdt096
Abstract
We give a lower bound for the -distortion of finite graphs , depending on the first eigenvalue of the -Laplacian and the maximal displacement of permutations of vertices. For a -regular vertex-transitive graph it takes the form . This bound is optimal for expander families and, for , it gives the exact value for cycles and hypercubes. As a new application we give a non-trivial lower bound for the -distortion of a family of Cayley graphs of ( fixed, ) with respect to a standard two-element generating set.