Trees and Markov convexity

Simple item page
dc.creatorLee, James R.
dc.creatorNaor, Assaf
dc.creatorPeres, Yuval
dc.date2007-06-04
dc.date.accessioned2026-07-07T08:04:08Z
dc.date.available2026-07-07T08:04:08Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0706.0545
dc.identifierhttp://arxiv.org/abs/0706.0545
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129840
dc.subjectMetric Geometry
dc.subjectFunctional Analysis
dc.titleTrees and Markov convexity
dc.typetext

Files

Collections

arXiv