Probabilistic Transforms for Combinatorial Urn Models
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.
- Randomized urn models revisited using stochastic approximation
- Urn models for Markov exchangeability
- Stochastic LU factorizations, Darboux transformations and urn models
- Uniform asymptotic estimates of transition probabilities on combs
- Probabilistic models of combinatorial schemes
- Gaussian approximation theorems for urn models and their applications
- Decomposable statistics in inverse urn problems
- Asymptotics in randomized urn models
- An extended urn model with application to approximation
- The log-convexity of \(r\)-derangement numbers
- The log-balancedness of generalized derangement numbers
- Immigrated urn models-theoretical properties and applications
- Some probabilistic results on the nonrandomness of simple sequence repeats in DNA sequences
- Interim analysis of clinical trials based on urn models
- New sufficient conditions for log-balancedness, with applications to combinatorial sequences
- The log-convexity of the poly-Cauchy numbers
- The log-behavior of the sequence for the partial sum of a log-convex sequence
- The log-behavior of some sequences related to a linear recurrence sequence
- The log-behavior of some sequences related to the generalized Leonardo numbers
- Restricted partition functions and the r-log-concavity of quasi-polynomial-like functions
- The log-balancedness of the sequence for the alternating sums of Motzkin numbers
- Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case
- Seven (lattice) paths to log-convexity
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)