Skip to main content
Log in

Trees and Markov Convexity

  • Published:
Geometric and Functional Analysis Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Assaf Naor.

Additional information

Received: September 2006, Revision: January 2007, Accepted: May 2007

The research of the first author was conducted while he was at U. C. Berkeley and the Institute for Advanced Study.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, J.R., Naor, A. & Peres, Y. Trees and Markov Convexity. GAFA Geom. funct. anal. 18, 1609–1659 (2009). https://doi.org/10.1007/s00039-008-0689-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00039-008-0689-0

Keywords and phrases:

AMS Mathematics Subject Classification:

Navigation