Abstract
We study necessary and sufficient conditions for the strong tenability of Pólya urn schemes under the sampling of multisets of balls. We also investigate sufficient conditions for the tenability (not necessarily in the strong sense) of Pólya urn schemes under the sampling of multisets of balls. We enumerate certain balanced classes and give algorithmic constructions for the replacement matrices for members in the class. We probabilistically analyze the zero-balanced tenable class, and find the asymptotic average proportion of each color, when the starting number of balls is large. We also give an algorithm to determine tenability and construct the Markov chain underlying the scheme, when it is tenable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen M, Wei C (2005) A new urn model. J Appl Probab 42:964–976
Davidson A (2014) Study of the tenability of Pólya urn schemes. Purdue University Dissertation, Purdue, West Lafayette, Indiana
Eggenberger F, Pólya G (1923) Uber die statistik verketteter vorgänge. Zeitschrift für Angewandte Mathematik und Mechanik 1:279–289
Ehrenfest P, Ehrenfest T (1907) Uber zwei bekannte einwände gegen das Boltzmannsche H-theorem. Physik, Z 8:311–314
Friedman B (1949) A simple urn model. Commun Pure Appl Math 2:59–70
Johnson N, Kotz S, Mahmoud H (2004) Pólya-type urn models with multiple drawings. J Iran Stat Soc 3:165–173
Kholfi S, Mahmoud H (2012) The class of tenable zero-balanced Pólya urn schemes: characterization and Gaussian phases. Adv Appl Probab 44:702–728
Knuth D (2009) The art of computer programming, Volume 4A: Combinatorial algorithms, Part 1. Addison-Wesley, Reading, Massachusetts
Kotz S, Balakrishnan N (1997) Advances in urn models during the past two decades. In Advances in combinatorial methods and applications to probability and statistics, vol 49. Birkhäuser, Boston, pp 203–257
Kuba M, Mahmoud H (2014) Two-colour balanced affine urn models with multiple drawings I: urns with a small index. Advances in Applied Probability (submitted)
Kuba M, Mahmoud H, Panholzer A (2013) Analysis of a generalized Friedman’s urn with multiple drawings. Discret Appl Math 161:2968–2984
Mahmoud H (2003) Pólya urn models and connections to random trees: A review. J Iran Stat Soc 53–114
Mahmoud H (2008) Pólya urn models. Chapman-Hall, Florida
Mahmoud H (2013) Drawing multisets of balls from tenable balanced linear urns. Probab Eng Informational Sci 27:147–162
Mahmoud H, Smythe R (1995) Probabilistic analysis of bucket recursive trees. Theor Comput Sci 144:221–249
Mahmoud H, Tsukiji T (2000) A limit law for outputs in random recursive circuits. Algorithmica 31:403–412
Mahmoud H, Smythe R, Szymański J (1993) On the structure of plane-oriented recursive trees and their branches. Random Struct Algorithm 4:151–176
Moler J, Plo F, Urmeneta H (2013) A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits. Test 22:46–61
Author information
Authors and Affiliations
Corresponding author
Additional information
The analysis and conclusions set forth are those of the authors and do not indicate concurrence by other members of the research staff or the Board of Governors.
Rights and permissions
About this article
Cite this article
Konzem, S.R., Mahmoud, H.M. Characterization and Enumeration of Certain Classes of Tenable Pólya Urns Grown by Drawing Multisets of Balls. Methodol Comput Appl Probab 18, 359–375 (2016). https://doi.org/10.1007/s11009-014-9421-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-014-9421-8