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

This work is concerned with forest and cumulant type expansions of general random variables on a filtered probability spaces. We establish a "broken exponential martingale" expansion that generalizes and unifies the exponentiation result of…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

Banderier, Marchal, and Wallner considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. In this work, we prove a conjecture of Fuchs and Yu concerning the…

In this work we discuss two urn models with general weight sequences $(A,B)$ associated to them, $A=(\alpha_n)_{n\in\N}$ and $B=(\beta_m)_{m\in\N}$, generalizing two well known P\'olya-Eggenberger urn models, namely the so-called sampling…

We introduce a general two colour interacting urn model on a finite directed graph, where each urn at a node, reinforces all the urns in its out-neighbours according to a fixed, non-negative and balanced reinforcement matrix. We show that…

Inside the discipline of graph theory exists an extension known as the hypergraph. This generalization of graphs includes vertices along with hyperedges consisting of collections of two or more vertices. One well-studied application of this…

In this paper, we study Bessel processes of dimension $\delta\equiv2(1-\mu)$, with $0<\delta<2$, and some related martingales and random times. Our approach is based on martingale techniques and the general theory of stochastic processes…

This paper extends classical probabilistic results to the broader class of demimartingales and demisubmartingales. We establish variants of Doob's-type optional sampling theorem under minimal structural conditions on stopping times, relying…

Consider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn…

We investigate a class of Young diagrams growing via the addition of unit cells and satisfying the constraint that the height difference between adjacent columns $\geq r$. In the long time limit, appropriately re-scaled Young diagrams…

Inferring the ancestral state at the root of a phylogenetic tree from states observed at the leaves is a problem arising in evolutionary biology. The simplest technique -- majority rule -- estimates the root state by the most frequently…

The purpose of this work is to establish a central limit theorem that can be applied to a particular form of Markov chains, including the number of descents in a random permutation of $\mathfrak{S}_n$, two-type generalized P{\'o}lya urns,…

Branching processes $(Z_n)_{n \ge 0}$ in a varying environment generalize the Galton-Watson process, in that they allow time-dependence of the offspring distribution. Our main results concern general criteria for a.s. extinction,…

We describe a universality class of the transitions of a generalized P\'{o}lya urn by studying the asymptotic behavior of the normalized correlation function $C(t)$ using finite-size scaling analysis. $X(1),X(2),\cdots$ are the successive…

Tree-child networks are an important class of phylogenetic network used to model reticulate evolutionary processes. These networks have attracted increasing attention from researchers with interests in both combinatorics and algorithms. A…

Early investigation of P\'{o}lya urns considered drawing balls one at a time. In the last two decades, several authors considered multiple drawing in each step, but mostly for schemes on two colors. In this manuscript, we consider multiple…

We are interested in the cycles obtained by slicing at all heights random Boltzmann triangulations with a simple boundary. We establish a functional invariance principle for the lengths of these cycles, appropriately rescaled, as the size…

We survey recent results on determinantal processes, random growth, random tilings and their relation to random matrix theory.

We develop a martingale approximation framework yielding quantitative maximal large deviations estimates for invertible dynamical systems. From suitable decay of correlations, we deduce these estimates and, as an application, we obtain…

We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an "unbiased" way that a structure of size n gives rise to n…