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

We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…

We consider a one-dimensional dyadic branching Brownian motion on $\mathbb{R}$ with positive drift $\beta \in (0,1)$, branching rate $1/2$, reflected at $0$ and killed at a boundary $L > 0$. The killing boundary $L$ is chosen so that the…

Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…

In [arXiv:1906.10951 (forthcoming on Advances in Applied Probability),arXiv:2011.05933 (published on PLOS ONE)] the authors introduce, study and apply a new variant of the Eggenberger-Polya urn, called the "Rescaled" Polya urn, which, for a…

We derive a simple expression for the tail-asymptotics of an explosive birth process at a fixed observation time conditioned on non-explosion. Using the well-established exponential embedding, we apply this result to compute the tail…

As a generalization of random recursive trees and preferential attachment trees, we consider random recursive metric spaces. These spaces are constructed from random blocks, each a metric space equipped with a probability measure,…

We develop a general framework for extracting highly uniform bounds on local stability for stochastic processes in terms of information on fluctuations or crossings. This includes a large class of martingales: As a corollary of our main…

We construct an independent increments Gaussian process associated to a class of multicolor urn models. The construction uses random variables from the urn model which are different from the random variables for which central limit theorems…

We consider systems of stochastic fixed-point equations that arise in the asymptotic analysis of random recursive structures and algorithms such as Quicksort, generalized P\'olya urn processes and path lengths of random recursive trees and…

The Population-Based Incremental Learning (PBIL) algorithm uses a convex combination of the current model and the empirical model to construct the next model, which is then sampled to generate offspring. The Univariate Marginal Distribution…

We study multi-type Bienaym\'e-Galton-Watson processes with linear-fractional reproduction laws using various analytical tools like contour process, spinal representation, Perron-Frobenius theorem for countable matrices, renewal theory. For…

This paper studies the problem of estimating the order of arrival of the vertices in a random recursive tree. Specifically, we study two fundamental models: the uniform attachment model and the linear preferential attachment model. We…

We give bounds for (central) moments for balanced P\'olya urns under very general conditions. In some cases, these bounds imply that moment convergence holds in earlier known results on asymptotic distribution. The results overlap with…

We investigate the profile of random P\'olya trees of size $n$ when only nodes of degree $d$ are counted in each level. It is shown that, as in the case where all nodes contribute to the profile, the suitably normalized profile process…

An elementary proof is given for a theorem showing that certain birth-death chains show martingale-like behavior at large stopping times. This is a generalization of and new proof for a theorem from a earlier paper by the author.

In this work we are considering the behavior of the limit shape of Young diagrams associated to random permutations on the set $\{1,\dots,n\}$ under a particular class of multiplicative measures. Our method is based on generating functions…

In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…

Knowing how and when trends are formed is a frequently visited research goal. In our work, we focus on the progression of trends through (social) networks. We use a random graph (RG) model to mimic the progression of a trend through the…

Let the process Y(t) be a Skorohod integral process with respect to Brownian motion. We use a recent result by Tudor (2004), to prove that Y(t) can be represented as the limit of linear combinations of processes that are products of forward…

This work studies the variation in Kullback-Leibler divergence between random draws from some popular nonparametric processes and their baseline measure. In particular we focus on the Dirichlet process, the P\'olya tree and the frequentist…