arXiv (All)
open access
On the $\ell^2$ distortion of random triangulations
For each $n \in \mathbf{N}$, let $T_n$ be a uniformly random (rooted, Type I) triangulation of the sphere with $n$ vertices, viewed as a metric space equipped with its graph distance. We show that for every $δ>0$, with probability tending to $1$ as $n \to \infty$, every embedding of $T_n$ into a sep
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Manifold limit for the training of shallow graph convolutional neural networks#1115505
- Revisiting Toeplitz and Hankel random matrices via $*$-convergence of circulant-type matrices#1014702
- Rate of convergence for non-Hermitian random matrices and their products#779237
- Gamma approximation and Poisson--Gaussian invariance principle on Poisson chaos#822535
- A law of thin processes with neighbour-count thinning#1061367
Record · ID 1154405
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive