Related papers: The radial spanning tree in hyperbolic space

We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ${\mathbb{R}}^d$. The connectivity function is shown to decay superexponentially, and we…

In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to…

We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…

We show that the range of a long Brownian bridge in the hyperbolic space converges after suitable renormalisation to the Brownian continuum random tree. This result is a relatively elementary consequence of $\bullet$ A theorem by Bougerol…

In this paper two Poisson structures on the moduli space of hyperbolic surfaces with conical points are compared: the Weil-Petersson one and the \eta coming from the representation variety. We show that they are multiple of each other, if…

Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…

The main results in this paper concern large and moderate deviations for the radial component of a $n$-dimensional hyperbolic Brownian motion (for $n\geq 2$) on the Poincar\'{e} half-space. We also investigate the asymptotic behavior of the…

We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…

We show that the diameter of a uniformly drawn spanning tree of a connected graph on $n$ vertices which satisfies certain high-dimensionality conditions typically grows like $\Theta(\sqrt{n})$. In particular this result applies to…

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology: a random number, called its fitness, is assigned to each vertex of a graph, then a path in the graph is accessible if fitnesses are strictly…

Let (X,d) be a tree (T) of hyperbolic metric spaces satisfying the quasi-isometrically embedded condition. Let $v$ be a vertex of $T$. Let $({X_v},d_v)$ denote the hyperbolic metric space corresponding to $v$. Then $i : X_v \rightarrow X$…

We show that a geodesic metric space is hyperbolic in the sense of Gromov if and only if intersections of balls have bounded eccentricity. In particular, $\R$-trees are characterized among geodesic metric spaces by the property that the…

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

This paper deals with the intersection point process of a stationary and isotropic Poisson hyperplane process in $\mathbb{R}^d$ of intensity $t>0$, where only hyperplanes that intersect a centred ball of radius $R>0$ are considered. Taking…

The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…

Hyperbolic structures are obtained by tiling a hyperbolic surface with negative Gaussian curvature. These structures generally exhibit two percolation transitions: a system-wide connection can be established at a certain occupation…

At each point of a Poisson point process of intensity $\lambda$ in the hyperbolic place, center a ball of bounded random radius. Consider the probability $P_r$ that from a fixed point, there is some direction in which one can reach distance…

It is well known that one can map certain properties of random matrices, fermionic gases, and zeros of the Riemann zeta function to a unique point process on the real line. Here we analytically provide exact generalizations of such a point…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…