dorsal/arxiv
View SchemaThe Radial Spanning Tree is straight in all dimensions
| Authors | Tom Garcia-Sanchez |
|---|---|
| Categories | |
| ArXiv ID | 2601.08667vv1 |
| URL | https://arxiv.org/abs/2601.08667 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
The Radial Spanning Tree (RST) in dimension $d\geq2$ is a random geometric graph constructed on a homogeneous Poisson point process $\mathcal N$ in $\mathbb R^d$ augmented by the origin, with edges connecting each $x\in\mathcal N$ to the nearest point $y\in\mathcal N\cup\{0\}$ that lies closer to $0$ than $x$, with respect to the Euclidean distance. By construction, it forms almost surely a tree rooted at $0$. The RST was introduced in 2007 by Baccelli and Bordenave, who investigated straightness, a deterministic property introduced by Howard and Newman in 2001, to derive information about the asymptotic directions of infinite branches. They proved that the RST is almost surely straight in dimension $2$, which directly implies that all infinite branches are asymptotically directed, every possibility is attained, and directions reached by multiple infinite branches form a dense subset. However, their approach relies crucially on planarity, preventing any straightforward extension to higher dimensions. In this paper, we close this gap by proving that the RST is almost surely \emph{straight} in any dimension, thereby obtaining the same consequences for the behavior of infinite branches. Our approach resolves the key barriers in the study of the RST, notably those posed by the complex dependency structure combined with the radial nature of the model, and especially beyond the planar setting. It relies on tools developed for the analysis of the Directed Spanning Forest, a closely related model, including recent progress by the author in 2025. Specifically, a key contribution of this work is the construction of a suitable renewal-type decomposition of RST paths. Leveraging this decomposition together with classical concentration inequalities, we show that RST paths cannot deviate far from straight lines and derive straightness.
{
"annotation_id": "9ce14aab-4a0c-42b2-a4a7-fbf8dec63412",
"date_created": "2026-02-17T05:53:15.291000Z",
"date_modified": "2026-02-17T05:53:15.291000Z",
"file_hash": "23d21a70bd50d658390508afe16f39b8bd13dbc04658cd7de6f1b8c553bf2778",
"private": false,
"record": {
"abstract": "The Radial Spanning Tree (RST) in dimension $d\\geq2$ is a random geometric graph constructed on a homogeneous Poisson point process $\\mathcal N$ in $\\mathbb R^d$ augmented by the origin, with edges connecting each $x\\in\\mathcal N$ to the nearest point $y\\in\\mathcal N\\cup\\{0\\}$ that lies closer to $0$ than $x$, with respect to the Euclidean distance. By construction, it forms almost surely a tree rooted at $0$. The RST was introduced in 2007 by Baccelli and Bordenave, who investigated straightness, a deterministic property introduced by Howard and Newman in 2001, to derive information about the asymptotic directions of infinite branches. They proved that the RST is almost surely straight in dimension $2$, which directly implies that all infinite branches are asymptotically directed, every possibility is attained, and directions reached by multiple infinite branches form a dense subset. However, their approach relies crucially on planarity, preventing any straightforward extension to higher dimensions. In this paper, we close this gap by proving that the RST is almost surely \\emph{straight} in any dimension, thereby obtaining the same consequences for the behavior of infinite branches. Our approach resolves the key barriers in the study of the RST, notably those posed by the complex dependency structure combined with the radial nature of the model, and especially beyond the planar setting. It relies on tools developed for the analysis of the Directed Spanning Forest, a closely related model, including recent progress by the author in 2025. Specifically, a key contribution of this work is the construction of a suitable renewal-type decomposition of RST paths. Leveraging this decomposition together with classical concentration inequalities, we show that RST paths cannot deviate far from straight lines and derive straightness.",
"arxiv_id": "2601.08667",
"authors": [
"Tom Garcia-Sanchez"
],
"categories": [
"math.PR"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "The Radial Spanning Tree is straight in all dimensions",
"url": "https://arxiv.org/abs/2601.08667",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "384bbf77-3970-414e-b4ee-d8ae829e5f42",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}