Related papers: Hoppe trees, random recursive sets and their baryc…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
Consider a point particle moving through a Poisson distributed array of cubes all oriented along the axes - the random wind-tree model introduced in Ehrenfest-Ehrenfest (1912). We show that, in the joint Boltzmann-Grad and diffusive limit…
In the broadcasting problem on trees, a $\{-1,1\}$-message originating in an unknown node is passed along the tree with a certain error probability $q$. The goal is to estimate the original message without knowing the order in which the…
Random forests have become an established tool for classification and regression, in particular in high-dimensional settings and in the presence of complex predictor-response relationships. For bounded outcome variables restricted to the…
We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree. The term \textit{multiplexed} means that the model can be viewed as a nearest…
In this paper we tackle the problem of comparing distributions of random variables and defining a mean pattern between a sample of random events. Using barycenters of measures in the Wasserstein space, we propose an iterative version as an…
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…
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…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
We investigate a self-interacting random walk, whose dynamically evolving environment is a random tree built by the walker itself, as it walks around. At time $n=1,2,\dots$, right before stepping, the walker adds a random number (possibly…
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
Inspired by Stufler's recent probabilistic proof of Otter's asymptotic number of unlabeled trees, we revisit work of Palmer and Schwenk, and study unlabeled forests from a probabilistic point of view. We show that the number of trees in a…
We establish a strong law of large numbers and a central limit theorem in the Bures-Wasserstein space of covariance operators -- or equivalently centred Gaussian measures -- over a general separable Hilbert space. Specifically, we show that…
In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
We comment on old and new results related to the destruction of a random recursive tree (RRT), in which its edges are cut one after the other in a uniform random order. In particular, we study the number of steps needed to isolate or…
We consider fixed-point equations for probability distributions on isometry classes of measured metric spaces. The construction is required to be recursive and tree-like, but we allow loops for the geodesics between points in the support of…