Probabilistic Transforms for Combinatorial Urn Models

From MaRDI portal





An urn model can be described as a function mapping a set of balls to a set of urns. For two finite sets \(\mathcal D\) and \(\mathcal E\) of cardinality \(n\) and \(N\), respectively, we are concerned with counting the number of all possible functions \(f:{\mathcal D} \rightarrow {\mathcal E}\) that obey certain set of constrains. In this setting, the cardinality of the inverse image of \(i\) represents the occupancy of urn number \(i\). The urns may be both labeled or unlabeled. The number of ways to distribute the balls into urns is denoted by \(D(n, N)\). By specifying for each pair \((n, N)\) an equiprobable probability measure on the space of all the possible \(D(n,N)\) distributions, the urn occupancies become the random variables. Several probabilistic transforms of classical urn models are presented, for both the labeled and the unlabeled case. The transforms render the dependent random variables describing the urn occupancies into independent random variables with appropriate distributions. The approach used for constructing the transforms involves generating functions of combinatorial numbers characterizing the urn distributions.











This page was built for publication: Probabilistic Transforms for Combinatorial Urn Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4670358)