Related papers: Conditioned Brownian trees
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
Trees in Brownian excursions have been studied since the late 1980s. Forests in excursions of Brownian motion above its past minimum are a natural extension of this notion. In this paper we study a forest-valued Markov process which…
We introduce a class of Markov coalescent processes on the continuous $d$-dimensional torus, in the most general setting of simultaneous multiple mergers, called the Brownian spatial coalescent. It is axiomatically defined through a…
We consider a one dimensional random-walk-like process, whose steps are centered Gaussians with variances which are determined according to the sequence of arrivals of a Poisson process on the line. This process is decorated by independent…
We introduce a resetting Brownian bridge as a simple model to study search processes where the total search time $t_f$ is finite and the searcher returns to its starting point at $t_f$. This is simply a Brownian motion with a Poissonian…
We consider the process of $n$ Brownian excursions conditioned to be nonintersecting. We show the distribution functions for the top curve and the bottom curve are equal to Fredholm determinants whose kernel we give explicitly. In the…
We provide a new construction of the Brownian disks, which have been defined by Bettinelli and Miermont as scaling limits of quadrangulations with a boundary when the boundary size tends to infinity. Our method is very similar to the…
We consider a conditioned Galton-Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length. We give two proofs of this result, one probabilistic and…
In the present paper, we are going to show that outside a slim set in the sense of Malliavin (or quasi-surely), the signature path (which consists of iterated path integrals in every degree) of Brownian motion is non-self-intersecting. This…
We propose a novel stochastic method to generate Brownian paths conditioned to start at an initial point and end at a given final point during a fixed time $t_{f}$ under a given potential $U(x)$. These paths are sampled with a probability…
We consider the genealogy tree for a critical branching process conditioned on non-extinction. We enumerate vertices in each generation of the tree so that for each two generations one can define a monotone map describing the…
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…
We use Dirichlet form methods to construct and analyze a reversible Markov process, the stationary distribution of which is the Brownian continuum random tree. This process is inspired by the subtree prune and regraft (SPR) Markov chains…
We present a new method to sample conditioned trajectories of a system evolving under Langevin dynamics, based on Brownian bridges. The trajectories are conditioned to end at a certain point (or in a certain region) in space. The bridge…
Fractional Brownian motion is a Gaussian process x(t) with zero mean and two-time correlations <x(t)x(s)> ~ t^{2H} + s^{2H} - |t-s|^{2H}, where H, with 0<H<1 is called the Hurst exponent. For H = 1/2, x(t) is a Brownian motion, while for H…
Let $n$ particles move in standard Brownian motion in one dimension, with the process terminating if two particles collide. This is a specific case of Brownian motion constrained to stay inside a Weyl chamber; the Weyl group for this…
We study the diameter of L{\'e}vy trees that are random compact metric spaces obtained as the scaling limits of Galton-Watson trees. L{\'e}vy trees have been introduced by Le Gall and Le Jan (1998) and they generalise Aldous' Continuum…
We prove an invariance principle for the bridge of a random walk conditioned to stay positive, when the random walk is in the domain of attraction of a stable law, both in the discrete and in the absolutely continuous setting. This includes…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…