Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology
Combinatorics
2012-07-25 v1 Discrete Mathematics
Probability
Abstract
This paper develops an analytic theory for the study of some Polya urns with random rules. The idea is to extend the isomorphism theorem in Flajolet et al. (2006), which connects deterministic balanced urns to a differential system for the generating function. The methodology is based upon adaptation of operators and use of a weighted probability generating function. Systems of differential equations are developed, and when they can be solved, they lead to characterization of the exact distributions underlying the urn evolution. We give a few illustrative examples.
Cite
@article{arxiv.1207.4948,
title = {Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology},
author = {Basile Morcrette and Hosam M. Mahmoud},
journal= {arXiv preprint arXiv:1207.4948},
year = {2012}
}
Comments
23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), Montreal : Canada (2012)