Random walk on sphere packings and Delaunay triangulations in arbitrary dimension

Abstract We prove that random walks on a family of tilings of ‐dimensional Euclidean space, with a canonical choice of conductances, converge to Brownian motion modulo time parameterization. This class of tilings includes Delaunay triangulations (the dual of Voronoi tessellations) and sphere packings. Our regularity assumptions are deterministic and mild. For example, our results apply to Delaunay triangulations with vertices sampled from a ‐dimensional Gaussian multiplicative chaos measure. As part of our proof, we establish the uniform convergence of certain finite‐volume schemes for the Laplace equation, with quantitative bounds on the rate of convergence. In the special case of two dimensions, we give a new, short proof of the main result of Gurel‐Gurevich et al. [Adv. Math. 374 (2020), no. 53, 107379].

Authors

Institutions

Publication Details

Journal
Proceedings of the London Mathematical Society
Published
2025-09-01
DOI
https://doi.org/10.1112/plms.70084
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Random walk on sphere packings and Delaunay triangulations in arbitrary dimension

Ewain Gwynne, Ahmed Bou‐Rabee
Proceedings of the London Mathematical Society
Computational Geometry and Mesh Generation
article

Random walk on sphere packings and Delaunay triangulations in arbitrary dimension

Ewain Gwynne, Ahmed Bou‐Rabee
article en

Abstract

Abstract We prove that random walks on a family of tilings of ‐dimensional Euclidean space, with a canonical choice of conductances, converge to Brownian motion modulo time parameterization. This class of tilings includes Delaunay triangulations (the dual of Voronoi tessellations) and sphere packings. Our regularity assumptions are deterministic and mild. For example, our results apply to Delaunay triangulations with vertices sampled from a ‐dimensional Gaussian multiplicative chaos measure. As part of our proof, we establish the uniform convergence of certain finite‐volume schemes for the Laplace equation, with quantitative bounds on the rate of convergence. In the special case of two dimensions, we give a new, short proof of the main result of Gurel‐Gurevich et al. [Adv. Math. 374 (2020), no. 53, 107379].

Proceedings of the London Mathematical SocietyVol. 131(3)
University of Chicago (US), University of Pennsylvania (US)
National Science Foundation
Openalex Percentile: Top 57%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.