Related papers: Random recursive triangulations of the disk via fr…

We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…

We investigate a new notion of regularity for tensor triangulated categories, called residual regularity. We show that residual regularity descends and ascends via finite separable extensions and we classify all finite groups whose derived…

In this paper we propose a model of random compositions of cylinder maps, which in the simplified form is as follows: let $(\theta,r)\in \mathbb T\times \mathbb R=\mathbb A$ and \[ f_{\pm 1}:…

Given a self-similar set $\Lambda$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $\Lambda$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a…

Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…

A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…

We prove that a uniform, rooted unordered binary tree with $n$ vertices has the Brownian continuum random tree as its scaling limit for the Gromov-Hausdorff topology. The limit is thus, up to a constant factor, the same as that of uniform…

We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…

We introduce a natural way to construct a random subset of a homogeneous Cantor set $C$ in $[0,1]$ via random labelings of an infinite $M$-ary tree, where $M\geq 2$. The Cantor set $C$ is the attractor of an equicontractive iterated…

We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…

We prove that random triangulations of types I, II, and III with a simple boundary under the critical Boltzmann weight converge in the scaling limit to the Brownian disk. The proof uses a bijection due to Poulalhon and Schaeffer between…

The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…

We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…

We consider linear mappings on the $d$-dimensional torus, defined by $T(x) = Ax \pmod 1$, where $A$ is an invertible $d \times d$ integer matrix, with no eigenvalues on the unit circle. In the case $d = 2$ and $\det A = \pm 1$, we give a…

In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…

We completely describe in terms of Hausdorff measures the size of the set of points of the circle that are covered infinitely often by a sequence of random arcs with given lengths. We also show that this set is a set with large…

Generalising a construction of Falconer, we consider classes of $G_\delta$-subsets of $\mathbb{R}^d$ with the property that sets belonging to the class have large Hausdorff dimension and the class is closed under countable intersections. We…

We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…

A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…