Related papers: Polya urns via the contraction method
We introduce a class of reinforcement models where, at each time step $t$, one first chooses a random subset $A_t$ of colours (independent of the past) from $n$ colours of balls, and then chooses a colour $i$ from this subset with…
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…
Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive…
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…
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…
We introduce a new model for contagion spread using a network of interacting finite memory two-color P\'{o}lya urns, which we refer to as the finite memory interacting P\'{o}lya contagion network. The urns interact in the sense that the…
The goal of these lectures is to review some mathematical aspects of random tree models used in evolutionary biology to model gene trees or species trees. We start with stochastic models of tree shapes (finite trees without edge lengths),…
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…
Let $G$ be a finite Abelian group of order $d$. We consider an urn in which, initially, there are labeled balls that generate the group $G$. Choosing two balls from the urn with replacement, observe their labels, and perform a group…
We introduce and discuss a special type of feedback interacting urn model with deterministic interaction. This is a generalisation of the very well known Eggenberger and Polya (1923) urn model. In our model, balls are added to a particular…
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…
We study a class of unbalanced constant-differentials P\'olya processes on white and blue balls. We show that the number of white balls, the number of blue balls, and the total number of balls, when appropriately scaled, all converge in…
We study P\'olya urns on hypergraphs and prove that, when the incidence matrix of the hypergraph is injective, there exists a point $v=v(H)$ such that the random process converges to $v$ almost surely. We also provide a partial result when…
The randomized play-the-winner (RPW) model is a generalized P\'olya Urn process with broad applications ranging from clinical trials to molecular evolution. We derive an exact expression for the variance of the RPW model by transforming the…
In this article we survey properties of mixed Poisson distributions and probabilistic aspects of the Stirling transform: given a non-negative random variable $X$ with moment sequence $(\mu_s)_{s\in\mathbb{N}}$ we determine a discrete random…
In this paper, we prove convergence and fluctuation results for measure-valued P\'olya processes (MVPPs, also known as P\'olya urns with infinitely-many colours). Our convergence results hold almost surely and in $L^2$, under assumptions…
This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…
We study fringe subtrees of random $ m $-ary search trees and of preferential attachment trees, by putting them in the context of generalised P\'olya urns. In particular we show that for the random $ m $-ary search trees with $ m\leq 26 $…
In order to bring contraction analysis into the very fruitful and topical fields of stochastic and Bayesian systems, we extend here the theory describes in \cite{Lohmiller98} to random differential equations. We propose new definitions of…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…