Central Limit Theorems for Multicolor Urns with Dominated Colors
classification
🧮 math.PR
math.STstat.TH
keywords
colorsballscentraldominatedlimitsometheoremsapplications
read the original abstract
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 statistical applications are discussed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.