Related papers: The Brownian continuum random tree as the unique s…

We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the convex minorants of a Brownian motion with parabolic drift…

We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…

The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…

This paper is concerned with the mathematical analysis of the inverse random source problem for the time fractional diffusion equation, where the source is assumed to be driven by a fractional Brownian motion. Given the random source, the…

We construct a binomial tree model fitting all moments to the approximated geometric Brownian motion. Our construction generalizes the classical Cox-Ross-Rubinstein, the Jarrow-Rudd, and the Tian binomial tree models. The new binomial model…

Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees…

In this paper, we introduce an extension of a Brownian bridge with a random length by including uncertainty also in the pinning level of the bridge. The main result of this work is that unlike for deterministic pinning point, the bridge…

We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the…

The Aldous diffusion is a conjectured Markov process on the space of real trees that is the continuum analogue of discrete Markov chains on binary trees. We construct this conjectured process via a consistent system of stationary evolutions…

We show that the unique solution to a semilinear stochastic differential equation with almost periodic coefficients driven by a fractional Brownian motion is almost periodic in a sense related to random dynamical systems. This type of…

The cactus of a pointed graph is a discrete tree associated with this graph. Similarly, with every pointed geodesic metric space $E$, one can associate an $\R$-tree called the continuous cactus of $E$. We prove under general assumptions…

We present a new approach to Davie's theorem on the uniqueness of solutions to the equation $dX_t = b(t, X_t)\,dt + dW_t$ for almost all Brownian paths. A generalization of this result and a discussion of some close problems are given.

For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure. The proof is based on the martingale central limit theorem…

The generalized grey Brownian motion is a time continuous self-similar with stationary increments stochastic process whose one dimensional distributions are the fundamental solutions of a stretched time fractional differential equation.…

Consider the Aldous Markov chain on the space of rooted binary trees with $n$ labeled leaves in which at each transition a uniform random leaf is deleted and reattached to a uniform random edge. Now, fix $1\le k < n$ and project the leaf…

Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…

We consider a pruning of the inhomogeneous continuum random trees, as well as the cut trees that encode the genealogies of the fragmentations that come with the pruning. We propose a new approach to the reconstruction problem, which has…

In this note we introduce and solve a soft classification version of the famous Bayesian sequential testing problem for a Brownian motion's drift. We establish that the value function is the unique non-trivial solution to a free boundary…

Consider a Markov chain on the space of rooted real binary trees that randomly removes leaves and reinserts them on a random edge and suitably rescales the lengths of edges. This chain was introduced by David Aldous who conjectured a…

Consider the Aldous--Pitman fragmentation process [Ann Probab, 26(4):1703--1726, 1998] of a Brownian continuum random tree ${\cal T}^{\mathrm{br}}$. The associated cut tree cut$({\cal T}^{\mathrm{br}})$, introduced by Bertoin and Miermont…