Abstract
This paper introduces and analyzes a particular class of Pólya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color compositions varies (the urns are said to be balanced). These properties make this class of urns ideally suited for analysis from an “analytic combinatorics” point-of-view, following in the footsteps of Flajolet et al. [4]. Through an algebraic generating function to which we apply a multiple coalescing saddle-point method, we are able to give precise asymptotic results for the probability distribution of the composition of the urn, as well as local limit law and large deviation bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bagchi, A., Pal, A.: Asymptotic Normality in the Generalized Pólya-Eggenberger Urn Model, with an Application to Computer Data Structures. SIAM Journal on Algebraic and Discrete Methods 6(3), 394–405 (1985)
Banderier, C., Flajolet, P., Schaeffer, G., Soria, M.: Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena. Random Structures & Algorithms 19(3/4), 194–246 (2001)
Chauvin, B., Pouyanne, N., Sahnoun, R.: Limit Distributions for Large Pólya Urns. Annals of Applied Probability 21(1), 1–32 (2011)
Flajolet, P., Dumas, P., Puyhaubert, V.: Some Exactly Solvable Models of Urn Process Theory. Discrete Mathematics & Theoretical Computer Science Proceedings AG, 59–118 (2006)
Flajolet, P., Gabarro, J., Pekari, H.: Analytic Urns. Annals of Probability 33(3), 1200–1233 (2005)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press (2009)
Hwang, H.-K., Kuba, M., Panholzer, A.: Analysis of Some Exactly Solvable Diminishing Urn Models. In: 19th Formal Power Series and Algebraic Combinatorics, Tianjin China (2007)
Janson, S.: Functional Limit Theorems for Multitype Branching Processes and Generalized Pólya Urns. Stochastic Processes and their Applications 110, 177–245 (2004)
Janson, S.: Limit Theorems for Triangular Urn Schemes. Probability Theory Related Fields 134(3), 417–452 (2005)
Janson, S.: Plane Recursive Trees, Stirling Permutations and an Urn Model. Discrete Mathematics & Theoretical Computer Science Proceedings AI, 541–548 (2008)
Johnson, N.L., Kotz, S.: Urn Models and Their Application. John Wiley & Sons (1977)
Mahmoud, H.: Pólya Urn Models and Connections to Random Trees: A Review. Journal of the Iranian Statistical Society 2, 53–114 (2003)
Mahmoud, H.: Pólya Urn Models. Chapman-Hall/CRC Press (2008)
Morcrette, B.: Combinatoire analytique et modèles d’urnes, Master’s thesis, MPRI - École Normale Supérieure de Cachan, INRIA Rocquencourt (2010)
Panholzer, A., Seitz, G.: Ordered Increasing k-trees: Introduction and Analysis of a Preferential Attachment Network Model. Discrete Mathematics & Theoretical Computer Science Proceedings AM, 549–564 (2010)
Smythe, R.: Central Limit Theorems for Urn Models. Stochastic Processes and their Applications 65, 115–137 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morcrette, B. (2012). Fully Analyzing an Algebraic Pólya Urn Model. In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-29344-3_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29343-6
Online ISBN: 978-3-642-29344-3
eBook Packages: Computer ScienceComputer Science (R0)