Skip to main content
Log in

A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits

  • Original Paper
  • Published:
TEST Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

Download references

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

Authors

Corresponding author

Correspondence to José Moler.

Additional information

Communicated by Domingo Morales.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11749-012-0292-4

Keywords

Mathematics Subject Classification

Navigation