SearcharxivSearch

arXiv · 2012.03467

Hyperbolic Radial Spanning Tree

Abstract

We define and analyze an extension to the $d$-dimensional hyperbolic space of the Radial Spanning Tree (RST) introduced by Baccelli and Bordenave in the two-dimensional Euclidean space (2007). In particular, we will focus on the description of the infinite branches of the tree. The properties of the two-dimensional Euclidean RST are extended to the hyperbolic case in every dimension: almost surely, every infinite branch admits an asymptotic direction and each asymptotic direction is reached by at least one infinite branch. Moreover, the branch converging to any deterministic asymptotic direction is unique almost surely. To obtain results for any dimension, a completely new approach is considered here. \tvc{Our strategy mainly involves the two following ingredients, that rely on the hyperbolic Directed Spanning Forest (DSF) introduced and studied in Flammant (2019).} First, the hyperbolic metric allows us to obtain fine control of the branches' fluctuations in the hyperbolic DSF without using planarity arguments. Then, we couple the hyperbolic RST with the hyperbolic DSF and conclude.

Explore related subjects

Keep this discovery

BibTeXRIS

David Coupier, Lucas Flammant, Viet Chi Tran. 2020-12-07. Hyperbolic Radial Spanning Tree. https://arxiv.org/abs/2012.03467

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR