Related papers: Random stable looptrees
In the present paper we investigate the properties of the Hausdorff mapping $\mathcal{H}$, which takes each compact metric space to the space of its nonempty closed subspaces. It is shown that this mapping is nonexpanding (Lipschitz mapping…
By appropriate scaling of coupling constants a one-parameter family of ensembles of two-dimensional geometries is obtained, which interpolates between the ensembles of (generalized) causal dynamical triangulations and ordinary dynamical…
We first consider interval partitions whose complements are Lebesgue-null and introduce a complete metric that induces the same topology as the Hausdorff distance (between complements). This is done using correspondences between intervals.…
The equivariant Gromov--Hausdorff convergence of metric spaces is studied. Where all isometry groups under consideration are compact Lie, it is shown that an upper bound on the dimension of the group guarantees that the convergence is by…
With the algebraic trees, L\"ohr and Winter (2021) introduced a generalization of the notion of graph-theoretic trees to account for potentially uncountable structures. The tree structure is given by the map which assigns to each triple of…
We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…
We estimate harmonic scalings in the parameter space of a one-parameter family of critical circle maps. These estimates lead to the conclusion that the Hausdorff dimension of the complement of the frequency-locking set is less than $1$ but…
Loop-erased random walk, abbreviated LERW, is one of the most well-studied critical lattice models. It is the self-avoiding random walk one gets after erasing the loops from a simple random walk in order or alternatively by considering the…
For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…
The robust statistical description of dynamical systems under perturbations is a central problem in ergodic theory. In this paper, we investigate the statistical properties of skew-product maps driven by a subshift of finite type with…
We introduce a general technique for proving estimates for certain random planar maps which belong to the $\gamma$-Liouville quantum gravity (LQG) universality class for $\gamma \in (0,2)$. The family of random planar maps we consider are…
The scaling limit of planar loop-erased random walks is described by a stochastic Loewner evolution with parameter kappa=2. In this note SLE(2) in the upper half-plane H minus a simply-connected compact subset K of H is studied. As a main…
For any set $\Omega$ of non-negative integers such that $\{0,1\}\subseteq \Omega$ and $\{0,1\}\ne \Omega$, we consider a random $\Omega$-$k$-tree ${\sf G}_{n,k}$ that is uniformly selected from all connected $k$-trees of $(n+k)$ vertices…
The celebrated Steiner tree problem is the problem of finding a set $St$ of minimum one-dimensional Hausdorff measure $H$ (length) such that $St \cup \mathcal{A}$ is connected, where $\mathcal{A} \subset \mathbb{R}^d$ is a given compact…
We provide a complete description of anisotropic scaling limits of stationary linear random field on ${\mathbb {Z}}^3$ with long-range dependence and moving average coefficients decaying as $O(|t_i|^{-q_i})$ in the $i$th direction,…
These are the notes for a series of lectures given at the Clay Mathematical Institute Summer School in Buzios, July 11 - August 7, 2010. We review some of the recent aspects of scaling limits of random trees and planar maps, in particular…
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
We study random unrooted plane trees with $n$ vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of the weights has positive radius of convergence, then this…
We prove that uniform random quadrangulations of the sphere with $n$ faces, endowed with the usual graph distance and renormalized by $n^{-1/4}$, converge as $n\to\infty$ in distribution for the Gromov-Hausdorff topology to a limiting…