In this work, we introduce a class of balanced urn schemes with infinitely many colors
indexed by Z^d, where the replacement schemes are given by the transition matrices …

We consider triangular P\'olya urns and show under very weak conditions a general strong
limit theorem of the form $ X_ {ni}/a_ {ni}\to\mathcal {X} _i $ as, where $ X_ {ni} $ is the …

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 …

In this work we generalize Polya urn schemes with possibly infinitely many colors and
extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of …

We consider the generalization of the Pólya urn scheme with possibly infinitely many colors,
as introduced in [37],[4],[5], and [6]. For countably many colors, we prove almost sure …

The goal of this research is to analyze multicolor affine urn structures that evolve through
multiple drawings at each sampling stage. The jump from one to multiple balls per sample …

We consider a variant of the randomly reinforced urn where more balls can be
simultaneously drawn out and balls of different colors can be simultaneously added. More …

We consider an urn model, whose replacement matrix has all entries nonnegative and is
balanced, that is, has constant row sums. We obtain the rates of the counts of balls …

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 …

Consider an urn model whose replacement matrix is triangular, has all nonnegative entries,
and the row sums are all equal to 1. We obtain strong laws for the counts of balls …