Related papers: Asymptotics in randomized urn models
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…
This paper studies inference in randomized controlled trials with multiple treatments, where treatment status is determined according to a "matched tuples" design. Here, by a matched tuples design, we mean an experimental design where units…
We introduce and analyze a random tree model associated to Hoppe's urn. The tree is built successively by adding nodes to the existing tree when starting with the single root node. In each step a node is added to the tree as a child of an…
The stochastic models investigated in this paper describe the evolution of a set of $F_N$ identical balls scattered into $N$ urns connected by an underlying symmetrical graph with constant degree $h_N$. After some random amount of time {\em…
The purpose of this paper is twofold. First, we present a conjecture to the effect that the ranks of the syzygy modules of a smooth projective variety become normally distributed as the positivity of the embedding line bundle grows. Then,…
We introduce a class of stochastic processes with reinforcement consisting of a sequence of random partitions $\{\mathcal{P}_t\}_{t \ge 1}$, where $\mathcal{P}_t$ is a partition of $\{1,2,\dots, Rt\}$. At each time~$t$,~$R$ numbers are…
This is a research endeavor in two parts. We study a class of balanced urn schemes on balls of two colours (say white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn, and ball addition rules are applied. We…
We collect, survey and develop methods of (one-dimensional) stochastic approximation in a framework that seems suitable to handle fairly broad generalizations of Polya urns. To show the applicability of the results we determine the limiting…
An urn model of Diaconis and some generalizations are discussed. A convergence theorem is proved that implies for Diaconis' model that the empirical distribution of balls in the urn converges with probability one to the uniform…
Consider throwing $n$ balls at random into $m$ urns, each ball landing in urn $i$ with probability $p_i$. Let $S$ be the resulting number of singletons, i.e., urns containing just one ball. We give an error bound for the Kolmogorov distance…
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…
A classical P\'olya urn scheme is a Markov process whose evolution is encoded by a replacement matrix $(R_{i,j})_{1\leq i,j\leq d}$. At every discrete time-step, we draw a ball uniformly at random, denote its colour $c$, and replace it in…
The asymptotic behaviour of a generalised P\'olya--Eggenberger urn is well--known to depend on the spectrum of its replacement matrix: If its dominant eigenvalue $r$ is simple and no other eigenvalue is `large' in the sense that its real…
We study a multiple-urn version of the Ehrenfest model. In this setting, we denote the n urns by Urn 1 to Urn n, where n>=2. Initially, M balls are randomly placed in the n urns. At each subsequent step, a ball is selected and put into the…
We consider a mean-field dynamical urn model, defined by rules which give the rate at which a ball is drawn from an urn and put in another one, chosen amongst an assembly. At equilibrium, this model possesses a fluid and a condensed phase,…
It is common to conduct causal inference in matched observational studies by proceeding as though treatment assignments within matched sets are assigned uniformly at random and using this distribution as the basis for inference. This…
We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations,…
Though widely used in applications, reinforced random walk on graphs have never been the subject of a valid statistical inference. We develop in this paper a statistical framework for a general two-colored urn model. The probability to draw…
Consider an election where N seats are distributed among parties with proportions p_1,...,p_m of the votes. We study, for the common divisor and quota methods, the asymptotic distribution, and in particular the mean, of the seat excess of a…
This paper develops an analytic theory for the study of some Polya urns with random rules. The idea is to extend the isomorphism theorem in Flajolet et al. (2006), which connects deterministic balanced urns to a differential system for the…