Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Exactly Solvable Bal ...
Conference paper

Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology

Basile Morcrette (1) (2), Hosam M. Mahmoud (3)
(1) Algorithms
(2) Algorithmes, Programmes et Résolution
(3) Department of Statistics [Washington]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
Proceedings
DOI
10.46298/dmtcs.2996
License
Attribution 4.0 International (CC BY 4.0)
Indicators
1281
Views
810
Downloads

Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology

Basile Morcrette (1) (2), Hosam M. Mahmoud (3)
(1) Algorithms
(2) Algorithmes, Programmes et Résolution
(3) Department of Statistics [Washington]
Abstract
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.
Keywords
  • [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]
  • differential equations
  • Pólya urn
  • random structure
  • combinatorial probability
  • mixed models
Cited by

Source: OpenCitations

  • Simulating Deterministic Dynamics by Drawing Coloured Balls at Random in Urns

    Fundamental theories of physics

    Authors : Léon Brenig ORCID

    Journal reference : Volume , 2022, pp. 117-134

    DOI : 10.1007/978-3-031-04458-8_6
  • Periodic Pólya urns, the density method and asymptotics of Young tableaux

    The Annals of Probability

    Authors : Cyril Banderier ORCID, Philippe Marchal, Michael Wallner ORCID

    Journal reference : Volume 48, 2020, pp.

    DOI : 10.1214/19-aop1411
  • The necklace process: A generating function approach

    arXiv (Cornell University)

    Authors : Benjamin Hackl ORCID, Helmut Prodinger ORCID

    Journal reference : Volume 142, 2018, pp. 57-61

    DOI : 10.1016/j.spl.2018.06.010
  • Exactly solvable urn models under random replacement schemes and their applications

    Journal of Applied Probability

    Authors : Kiyoshi Inoue ORCID

    Journal reference : Volume 60, 2023, pp. 835-854

    DOI : 10.1017/jpr.2022.103
Preview
Loading PDF preview...