51 research outputs found
Trees and Markov convexity
We show that an infinite weighted tree admits a bi-Lipschitz embedding into
Hilbert space if and only if it does not contain arbitrarily large complete
binary trees with uniformly bounded distortion. We also introduce a new metric
invariant called Markov convexity, and show how it can be used to compute the
Euclidean distortion of any metric tree up to universal factors
Diameters, distortion and eigenvalues
We study the relation between the diameter, the first positive eigenvalue of
the discrete -Laplacian and the -distortion of a finite graph. We
prove an inequality relating these three quantities and apply it to families of
Cayley and Schreier graphs. We also show that the -distortion of Pascal
graphs, approximating the Sierpinski gasket, is bounded, which allows to obtain
estimates for the convergence to zero of the spectral gap as an application of
the main result.Comment: Final version, to appear in the European Journal of Combinatoric
- …