Abstract
We introduce a generalized Pólya urn model with the feature that the evolution of the urn is governed by a function which may change depending on the stage of the process, and we obtain a Strong Law of Large Numbers and a Central Limit Theorem for this model, using stochastic recurrence techniques. This model is used to represent the evolution of a family of acyclic directed graphs, called random circuits, which can be seen as logic circuits. The model provides asymptotic results for the number of outputs, that is, terminal nodes, of this family of random circuits.
Similar content being viewed by others
References
Arthur WB (1994) Increasing returns and path dependence in the economy. University of Michigan Press, Ann Arbor
Arya S, Golin MJ, Mehlorn K (1999) On the expected depth of random circuits. Comb Probab Comput 8:209–228
Chung F, Handjani S, Jungreis D (2003) Generalizations of Pólya’s urn problem. Ann Comb 7:141–153
Duflo M (1997) Random iterative models. Springer, Berlin
Gouet R (1997) Strong convergence of proportions in a multicolor Pólya urn. J Appl Probab 34:426–435
Higueras I, Moler JA, Plo F, San Miguel M (2006) Central limit theorems for generalized Pólya urn models. J Appl Probab 43:938–951
Janson S (2004) Functional limit theorems for multitype branching processes and generalized Pólya urns. Stoch Process Appl 110:177–245
Mahmoud HM (2002) The size of random bucket trees via urn models. Acta Inform 38:813–838
Mahmoud HM (2008) Pólya urn models. Chapman & Hall, Boca Raton
Mahmoud HM, Tsukiji T (2004) Limit laws for terminal nodes in random circuits. Acta Inform 41:99–110
Nakata T (2009) Neclace processes via Pólya urns. J Appl Probab 46:284–295
Pelletier M (1998) Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing. Ann Appl Probab 8(1):10–44
Pemantle R, Skyrms B (2004) Time to absorption in discounted reinforcement models. Stoch Process Appl 109:1–12
Smythe RT, Mahmoud HM (1995) A survey of recursive trees. Theory Probab Math Stat 51:1–27
Tsukiji T, Mahmoud HM (2001) A limit law for outputs in random recursive circuits. Algorithmica 31:403–412
Acknowledgements
This research was partially supported by the MEC project MTM2010-15972. The authors wish to thank the editor and three referees for their helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Domingo Morales.
Rights and permissions
About this article
Cite this article
Moler, J., Plo, F. & Urmeneta, H. A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits. TEST 22, 46–61 (2013). https://doi.org/10.1007/s11749-012-0292-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11749-012-0292-4