Related papers: On P\'olya-Young urn models and growth processes

We consider the following Markovian dynamic on point processes: at constant rate and with equal probability, either the rightmost atom of the current configuration is removed, or a new atom is added at a random distance from the rightmost…

We establish some scaling limits for a model of planar aggregation. The model is described by the composition of a sequence of independent and identically distributed random conformal maps, each corresponding to the addition of one…

We consider a renewal process that is conditioned on the number of events in a fixed time horizon. We prove that a centered and scaled version of this process converges to a Brownian bridge, as the number of events grows large, which relies…

We establish the scaling limit of a class of boundary random walks to the full spectrum of Brownian-type processes on the half-line. By solving the associated martingale problem and employing weak convergence techniques, we prove that under…

We consider the general question of estimating decay of correlations for non-uniformly expanding maps, for classes of observables which are much larger than the usual class of Holder continuous functions. Our results give new estimates for…

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…

Interacting urns with exponential reinforcement were introduced and studied in Launay (2011). As its parameter $\rho$ tends to $\iy$, this reinforcement mechanism converges to the "generalized" reinforcement, in which the probability of…

We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…

We study survival among two competing types in two settings: a planar growth model related to two-neighbour bootstrap percolation, and a system of urns with graph-based interactions. In the planar growth model, uncoloured sites are given a…

We give a central limit theorem, which has applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced generalized Polya urns.

We define the notions of disjoint unions and products for generalised P\'olya urns, proving that this turns the set of isomorphism classes of urns into a commutative semiring. The set of square matrices up to similarity by a permutation…

Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…

From genomes and ecosystems to bureaucracies and cities, the growth of complex systems occurs by adding new types of functions and expanding existing ones. We present a simple generative model that generalizes the Yule-Simon process by…

We consider a time-dependent version of a P\'olya urn containing black and white balls. At each time $n$ a ball is drawn from the urn at random and replaced in the urn along with $\sigma_n$ additional balls of the same colour. The…

With the aim of considering models with persistent memory we propose a fractional nonlinear modification of the classical Yule model often studied in the context of macrovolution. Here the model is analyzed and interpreted in the framework…

A functional central limit theorem is established for weighted occupancy processes of the Karlin model. The weighted occupancy processes take the form of, with $D_{n,j}$ denoting the number of urns with $j$-balls after the first $n$…

We consider a random walk in an i.i.d. Cauchy-tailed conductances environment. We obtain a quenched functional CLT for the suitably rescaled random walk, and, as a key step in the arguments, we improve the local limit theorem for…

We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…

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…

We solve the $n$-marginal Skorokhod embedding problem for a continuous local martingale and a sequence of probability measures $\mu_1,...,\mu_n$ which are in convex order and satisfy an additional technical assumption. Our construction is…