Related papers: Random Trees, Levy Processes and Spatial Branching…
A continuous Markovian model for truncated Levy random walks is proposed. It generalizes the approach developed previously by Lubashevsky et al. Phys. Rev. E 79, 011110 (2009); 80, 031148 (2009), Eur. Phys. J. B 78, 207 (2010) allowing for…
Standard Schramm-Loewner evolution (SLE) is driven by a continuous Brownian motion which then produces a trace, a continuous fractal curve connecting the singular points of the motion. If jumps are added to the driving function, the trace…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…
Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton-Watson trees. For example, let $\mathcal{T}_1$ be the…
We study two types of stochastic processes, a mean-field spatial system of interacting Fisher-Wright diffusions with an inferior and an advantageous type with rare mutation (inferior to advantageous) and a (mean-field) spatial system of…
We study fine properties of L\'evy trees that are random compact metric spaces introduced by Le Gall and Le Jan in 1998 as the genealogy of continuous state branching processes. L\'evy trees are the scaling limits of Galton-Watson trees and…
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…
We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…
We study a universal object for the genealogy of a sample in populations with mutations: the critical birth-death process with Poissonian mutations, conditioned on its population size at a fixed time horizon. We show how this process arises…
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…
Branching Processes in a Random Environment (BPREs) $(Z_n:n\geq0)$ are a generalization of Galton Watson processes where in each generation the reproduction law is picked randomly in an i.i.d. manner. We determine here the upper large…
We consider the evolution of the genealogy of the population currently alive in a Feller branching diffusion model. In contrast to the approach via labeled trees in the continuum random tree world, the genealogies are modeled as equivalence…
In this manuscript, we continue with the systematic study of the speed of extinction of continuous state branching processes in L\'evy environments under more general branching mechanisms. Here, we deal with the weakly subcritical regime…
We present a new family of graphs with remarkable properties. They are obtained by connecting the points of a random walk when their distance is smaller than a given scale. Their degree (number of neighbors) does not depend on the graph's…
We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three…
We study a Monte Carlo algorithm for simulation of probability distributions based on stochastic step functions, and compare to the traditional Metropolis/Hastings method. Unlike the latter, the step function algorithm can produce an…
We show that given a log-concave offspring distribution, the corresponding sequence of Bienaym\'e-Galton-Watson trees conditioned to have $n\geq 1$ vertices admits a realization as a Markov process $(T_n)_{n\geq1}$ which adds a new…
Cheek and Johnston (Journal of Mathematical Biology, 2023) consider a continuous-time Bienaym\'e-Galton-Watson tree conditioned on being alive at time $T$. They study the reproduction events along the ancestral lineage of an individual…
Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…