Hostname: page-component-6766d58669-vgfm9 Total loading time: 0 Render date: 2026-05-21T10:42:03.045Z Has data issue: false hasContentIssue false

Hyperbolic Metric Spaces and Stochastic Embeddings

Published online by Cambridge University Press:  07 February 2025

Chris Gartland*
Affiliation:
Department of Mathematics, University of California San Diego, 9500 Gilman Dr. La Jolla, CA, 92093, USA

Abstract

Stochastic embeddings of finite metric spaces into graph-theoretic trees have proven to be a vital tool for constructing approximation algorithms in theoretical computer science. In the present work, we build out some of the basic theory of stochastic embeddings in the infinite setting with an aim toward applications to Lipschitz free space theory. We prove that proper metric spaces stochastically embedding into $\mathbb {R}$-trees have Lipschitz free spaces isomorphic to $L^1$-spaces. We then undergo a systematic study of stochastic embeddability of Gromov hyperbolic metric spaces into $\mathbb {R}$-trees by way of stochastic embeddability of their boundaries into ultrametric spaces. The following are obtained as our main results: (1) every snowflake of a compact, finite Nagata-dimensional metric space stochastically embeds into an ultrametric space and has Lipschitz free space isomorphic to $\ell ^1$, (2) the Lipschitz free space over hyperbolic n-space is isomorphic to the Lipschitz free space over Euclidean n-space and (3) every infinite, finitely generated hyperbolic group stochastically embeds into an $\mathbb {R}$-tree, has Lipschitz free space isomorphic to $\ell ^1$, and admits a proper, uniformly Lipschitz affine action on $\ell ^1$.

Information

Type
Analysis
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press