Related papers: A new characterization of endogeny
We call a random point measure infinitely ramified if for every $n\in \mathbb N$, it has the same distribution as the $n$-th generation of some branching random walk. On the other hand, branching L\'evy processes model the evolution of a…
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)$,…
R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar, binary trees with $2n+1$ vertices. We obtain a…
A novel Markovian network evolution model is introduced and analysed by means of information theory. It will be proved that the model, called Network Evolution Chain, is a stationary and ergodic stochastic process. Therefore, the Asymptotic…
A Multinomial Processing Tree (MPT) is a directed tree with a probability associated with each arc. Here we consider an additional parameter associated with each arc, a measure such as the time required to select the arc. MPTs are often…
We consider the Brownian tree introduced by Aldous and the associated Q-process which consists in an infinite spine on which are grafted independent Brownian trees. We present a reversal procedure on these trees that consists in looking at…
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…
Phylogenetics uses alignments of molecular sequence data to learn about evolutionary trees. Substitutions in sequences are modelled through a continuous-time Markov process, characterised by an instantaneous rate matrix, which standard…
A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.
We consider a general class of branching processes in discrete time, where particles have types belonging to a Polish space and reproduce independently according to their type. If the process is critical and the mean distribution of types…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
Reaction networks are a general framework widely used in modeling diverse phenomena in different science disciplines. The dynamical process of a reaction network endowed with mass-action kinetics is a mass-action system as an ODE defined by…
The continuum random tree is the scaling limit of the uniform spanning tree on the complete graph with $N$ vertices. The Aldous-Broder chain on a graph $G=(V,E)$ is a discrete-time stochastic process with values in the space of rooted trees…
In frozen percolation, i.i.d. uniformly distributed activation times are assigned to the edges of a graph. At its assigned time, an edge opens provided neither of its endvertices is part of an infinite open cluster; in the opposite case, it…
We propose a framework to study tipping points in reaction-diffusion equations (RDEs) in one spatial dimension, where the reaction term decays in space (asymptotically homogeneous) and varies linearly with time (nonautonomous) due to an…
We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…
Markov decision processes (MDPs) describe sequential decision-making processes; MDP policies return for every state in that process an advised action. Classical algorithms can efficiently compute policies that are optimal with respect to,…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…
A multi-type branching process is defined as a random tree with labeled vertices, where each vertex produces offspring independently according to the same multivariate probability distribution. We demonstrate that in realizations of the…