Basile Morcrette ; Hosam M. Mahmoud - Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology

dmtcs:2996 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12) - https://doi.org/10.46298/dmtcs.2996
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic MethodologyArticle

Authors: Basile Morcrette 1,2; Hosam M. Mahmoud 3

  • 1 Algorithms
  • 2 Algorithmes, Programmes et Résolution
  • 3 Department of Statistics [Washington]

This paper develops an analytic theory for the study of some Pólya 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.


Volume: DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
Section: Proceedings
Published on: January 1, 2012
Imported on: January 31, 2017
Keywords: differential equations,Pólya urn,random structure,combinatorial probability,mixed models,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]

4 Documents citing this article

Consultation statistics

This page has been seen 202 times.
This article's PDF has been downloaded 303 times.