Related papers: Central limit theorems for a hypergeometric random…
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some…
We consider an urn model with multiple drawing and random time-dependent addition matrix. The model is very general with respect to previous literature: the number of sampled balls at each time-step is random, the addition matrix has…
We complete the study of the model introduced in [11]. It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the…
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.
Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…
We take a unified approach to central limit theorems for a class of irreducible urn models with constant replacement matrix. Depending on the eigenvalue, we consider appropriate linear combinations of the number of balls of different…
The generalized P\`olya urn (GPU) models and their variants have been investigated in several disciplines. However, typical assumptions made with respect to the GPU do not include urn models with diagonal replacement matrix, which arise in…
We prove a Central Limit Theorem for the sequence of random compositions of a two-color randomly reinforced urn. As a consequence, we are able to show that the distribution of the urn limit composition has no point masses.
This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…
Consider a finite undirected graph and place an urn with balls of two colours at each vertex. At every discrete time step, for each urn, a fixed number of balls are drawn from that same urn with probability $p$, and from a randomly chosen…
An urn contains black and red balls. Let $Z_n$ be the proportion of black balls at time $n$ and $0\leq L<U\leq 1$ random barriers. At each time $n$, a ball $b_n$ is drawn. If $b_n$ is black and $Z_{n-1}<U$, then $b_n$ is replaced together…
In this paper, we consider a multi-drawing urn model with random addition. At each discrete time step, we draw a sample of m balls. According to the composition of the drawn colors, we return the balls together with a random number of balls…
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 study an urn process containing red and blue balls and two different strategies to reinforce the urn. Namely, a generalized P\'olya-type strategy versus an i.i.d. one. At each step, one of the two reinforcement strategies is chosen by…
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 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…
An urn contains a known number of balls of two different colors. We describe the random variable counting the smallest number of draws needed in order to observe at least $\,c\,$ of both colors when sampling without replacement for a…
The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball…
We prove a central limit theorem for a sequence of random variables whose means are ambiguous and vary in an unstructured way. Their joint distribution is described by a set of measures. The limit is (not the normal distribution and is)…
This paper explores the distribution of indistinguishable balls into distinct urns with varying capacity constraints, a foundational issue in combinatorial mathematics with applications across various disciplines. We present a comprehensive…