2000 character limit reached
Analysis of some exactly solvable diminishing urn models
Published 9 Dec 2022 in math.CO and math.PR | (2212.05091v1)
Abstract: We study several exactly solvable Polya-Eggenberger urn models with a \emph{diminishing} character, namely, balls of a specified color, say $x$ are completely drawn after a finite number of draws. The main quantity of interest here is the number of balls left when balls of color $x$ are completely removed. We consider several diminishing urns studied previously in the literature such as the pills problem, the cannibal urns and the OK Corral problem, and derive exact and limiting distributions. Our approach is based on solving recurrences via generating functions and partial differential equations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.