Strong laws for balanced triangular urns
Abstract
Consider an urn model whose replacement matrix is triangular, has all entries nonnegative and the row sums are all equal to one. We obtain the strong laws for the counts of balls corresponding to each color. The scalings for these laws depend on the diagonal elements of a rearranged replacement matrix. We use the strong laws obtained to study further behavior of certain three color urn models.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.