Related papers: The Brownian continuum random tree as the unique s…
We show that if an orientation-preserving homeomorphism of the plane has a topologically chain recurrent point, then it has a fixed point, generalizing the Brouwer plane translation theorem.
We consider the self-repelling Brownian polymer, introduced in [APP83], which is formally defined as the solution of a singular SDE. The singularity comes from the drift term, which is given by the negative gradient of the local time. We…
Continuity of local time for Brownian motion ranks among the most notable mathematical results in the theory of stochastic processes. This article addresses its implications from the point of view of applications. In particular an extension…
We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative…
The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…
The (standard) Brownian web is a collection of coalescing one- dimensional Brownian motions, starting from each point in space and time. It arises as the diffusive scaling limit of a collection of coalescing random walks. We show that it is…
A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the…
We show, under natural conditions, that uniform rooted trees with fixed degree sequence converge after renormalization toward inhomogeneous continuum random trees (ICRT). We also provide a sharp upper-bound for the tail of their heights. We…
The problem of characterization of Gibbs random fields is considered. Various Gibbsianness criteria are obtained using the earlier developed one-point framework which in particular allows to describe random fields by means of either…
We study a natural fragmentation process of the so-called stable tree introduced by Duquesne and Le Gall, which consists in removing the nodes of the tree according to a certain procedure that makes the fragmentation self-similar with…
We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of this model is that the hybridization rate of the lineages…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…
We give an example of a reflected diffferential equation which may have infinitely many solutions if the driving signal is rough enough (e.g. of infinite $p$-variation, for some $p>2$). For this equation, we identify a sharp condition on…
We show that critical parking trees conditioned to be fully parked converge in the scaling limits towards the Brownian growth-fragmentation tree, a self-similar Markov tree different from Aldous' Brownian tree recently introduced and…
We deduce stability and pathwise uniqueness for a McKean-Vlasov equation with random coefficients and a multidimensional Brownian motion as driver. Our analysis focuses on a non-Lipschitz drift coefficient and includes moment estimates for…
The value of a continuous character evolving on a phylogenetic tree is commonly modelled as the location of a particle moving under one-dimensional Brownian motion with constant rate. The Brownian motion model is best suited to characters…
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the…
We introduce a family of branch merging operations on continuum trees and show that Ford CRTs are distributionally invariant. This operation is new even in the special case of the Brownian CRT, which we explore in more detail. The…