Searcharxiv⌕ Search

arXiv subjects

Alexis Metz-Donnadieu

Publications and source records attributed to Alexis Metz-Donnadieu.

3 recordsLinked to original sources

Probabilistic counting of labelled trees with prescribed vertical edge profile

The vertical edge profile of a labelled plane tree $t$ is the collection of integers counting the number of oriented edges from label $i$ to label $j$ for every possible pairs of labels $(i, j)$. In a previous work by the second author, it was shown that a process constructed from the vertical edge profile forms a Markov chain for a wide class of models of random labelled plane trees where edge label increments are constrained to lie in $\{-1, 0, 1\}$. The purpose of this paper is twofold. First, we continue the study of Markov properties of the vertical edge profile. In particular, we derive general formulas for the transition kernel and the initial distribution of a class of Markov chains related to the vertical edge profile. Second, we apply these results to the probabilistic enumeration of trees with a prescribed vertical edge profile. These applications yield a unified probabilistic derivation of several enumeration formulas. In particular, we recover some results established Bousquet-Mélou and Chapuy for binary trees and Cayley trees. These enumeration formulas admit a remarkable factorized form, already noted in previous works. The probabilistic methods developed here explain this phenomenon by showing that these factorizations arise naturally from the Markov structure underlying the vertical edge profile.

math.PR↗

Markov properties for the vertical edge profile in random labelled trees

We study a broad class of random labelled trees in which integer-valued labels evolve along the edges according to increments in $\{-1, 0, 1\}$. These models include e.g. branching random walks, embedded complete and incomplete binary trees, random Cayley and plane trees with uniform displacements along edges. Motivated by recent work suggesting a Markovian structure in the vertical profile of such trees, we introduce the vertical edge profile, which counts both oriented edges connecting label $k-1$ to label $k$ and oriented edges connecting label $k$ to label $k-1$. We show that the vertical edge profile forms a time-homogeneous Markov chain for a wide class of models, and this remains true (provided we enrich this process by the total mass of the tree below each label) if we condition on the total size of the tree. We give explicit transition kernels in the case of labelled incomplete binary trees, which are closely related to known enumeration formulas. To establish these results, we study a decomposition of labelled trees into excursions above and below fixed label levels, yielding a forest structure with tractable probabilistic laws. We further explain briefly how these findings connect to the theory of super-Brownian motion and the Integrated Super-Brownian Excursion (ISE). In a companion paper, we show that the vertical edge profile converges, after rescaling,to the local time and its derivative of Brownian motion indexed by the Brownian tree.

math.PR↗

Drilling holes in the Brownian disk: The Brownian annulus

We give a new construction of the Brownian annulus based on removing a hull centered at the distinguished point in the free Brownian disk. We use this construction to prove that the Brownian annulus is the scaling limit of Boltzmann triangulations with two boundaries. We also prove that the space obtained by removing hulls centered at the two distinguished points of the Brownian sphere is a Brownian annulus. Our proofs rely on a detailed analysis of the peeling by layers algorithm for Boltzmann triangulations with a boundary.

math.PR↗