IDEAS home Printed from https://ideas.repec.org/a/spr/testjl/v22y2013i1p46-61.html
   My bibliography  Save this article

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

Author

Listed:
  • José Moler
  • Fernando Plo
  • Henar Urmeneta

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. Copyright Sociedad de Estadística e Investigación Operativa 2013

Suggested Citation

  • José Moler & Fernando Plo & Henar Urmeneta, 2013. "A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 46-61, March.
    • Handle: RePEc:spr:testjl:v:22:y:2013:i:1:p:46-61
    DOI: 10.1007/s11749-012-0292-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11749-012-0292-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11749-012-0292-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Janson, Svante, 2004. "Functional limit theorems for multitype branching processes and generalized Pólya urns," Stochastic Processes and their Applications, Elsevier, vol. 110(2), pages 177-245, April.
    2. Pemantle, Robin & Skyrms, Brian, 2004. "Time to absorption in discounted reinforcement models," Stochastic Processes and their Applications, Elsevier, vol. 109(1), pages 1-12, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Panpan Zhang & Hosam M. Mahmoud, 2020. "On Nodes of Small Degrees and Degree Profile in Preferential Dynamic Attachment Circuits," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 625-645, June.
    2. Scott R. Konzem & Hosam M. Mahmoud, 2016. "Characterization and Enumeration of Certain Classes of Tenable Pólya Urns Grown by Drawing Multisets of Balls," Methodology and Computing in Applied Probability, Springer, vol. 18(2), pages 359-375, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Soumaya Idriss & Hosam Mahmoud, 2023. "Exact Covariances and Refined Asymptotics in Dichromatic Tenable Balanced Pólya Urn Schemes," Methodology and Computing in Applied Probability, Springer, vol. 25(2), pages 1-16, June.
    2. Crimaldi, Irene & Dai Pra, Paolo & Louis, Pierre-Yves & Minelli, Ida G., 2019. "Synchronization and functional central limit theorems for interacting reinforced random walks," Stochastic Processes and their Applications, Elsevier, vol. 129(1), pages 70-101.
    3. Berti, Patrizia & Crimaldi, Irene & Pratelli, Luca & Rigo, Pietro, 2010. "Central limit theorems for multicolor urns with dominated colors," Stochastic Processes and their Applications, Elsevier, vol. 120(8), pages 1473-1491, August.
    4. Michael D Nicholson & Tibor Antal, 2019. "Competing evolutionary paths in growing populations with applications to multidrug resistance," PLOS Computational Biology, Public Library of Science, vol. 15(4), pages 1-25, April.
    5. Liggett, Thomas M. & Rolles, Silke W. W., 2004. "An infinite stochastic model of social network formation," Stochastic Processes and their Applications, Elsevier, vol. 113(1), pages 65-80, September.
    6. Brian Skyrms & Robin Pemantle, 2004. "Learning to Network," Levine's Bibliography 122247000000000436, UCLA Department of Economics.
    7. Mailler, Cécile & Marckert, Jean-François, 2022. "Parameterised branching processes: A functional version of Kesten & Stigum theorem," Stochastic Processes and their Applications, Elsevier, vol. 152(C), pages 339-377.
    8. Gopal K. Basak & Amites Dasgupta, 2006. "Central and Functional Central Limit Theorems for a Class of Urn Models," Journal of Theoretical Probability, Springer, vol. 19(3), pages 741-756, December.
    9. Kortchemski, Igor, 2015. "A predator–prey SIR type dynamics on large complete graphs with three phase transitions," Stochastic Processes and their Applications, Elsevier, vol. 125(3), pages 886-917.
    10. Yuan, Ao & Chai, Gen Xiang, 2008. "Optimal adaptive generalized Polya urn design for multi-arm clinical trials," Journal of Multivariate Analysis, Elsevier, vol. 99(1), pages 1-24, January.
    11. Dimitris Cheliotis & Dimitra Kouloumpou, 2022. "Functional Limit Theorems for the Pólya Urn," Journal of Theoretical Probability, Springer, vol. 35(3), pages 2038-2051, September.
    12. Kaj, Ingemar & Tahir, Daniah, 2019. "Stochastic equations and limit results for some two-type branching models," Statistics & Probability Letters, Elsevier, vol. 150(C), pages 35-46.
    13. Kaur, Gursharn & Choi, Kwok Pui & Wu, Taoyang, 2023. "Distributions of cherries and pitchforks for the Ford model," Theoretical Population Biology, Elsevier, vol. 149(C), pages 27-38.
    14. Patrizia Berti & Irene Crimaldi & Luca Pratelli & Pietro Rigo, 2009. "Central Limit Theorems For Multicolor Urns With Dominated Colors," Quaderni di Dipartimento 106, University of Pavia, Department of Economics and Quantitative Methods.
    15. Berbeglia, Franco & Berbeglia, Gerardo & Van Hentenryck, Pascal, 2021. "Market segmentation in online platforms," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1025-1041.
    16. Chen Chen & Hosam Mahmoud, 2018. "The continuous-time triangular Pólya process," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 70(2), pages 303-321, April.
    17. Mitsokapas, Evangelos & Harris, Rosemary J., 2022. "Decision-making with distorted memory: Escaping the trap of past experience," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 593(C).
    18. Dasgupta, Amites, 2024. "Azuma-Hoeffding bounds for a class of urn models," Statistics & Probability Letters, Elsevier, vol. 204(C).
    19. Pemantle, Robin & Skyrms, Brian, 2004. "Network formation by reinforcement learning: the long and medium run," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 315-327, November.
    20. Yuan Ao & Li Qizhai & Xiong Ming & Tan Ming T., 2016. "Adaptive Design for Staggered-Start Clinical Trial," The International Journal of Biostatistics, De Gruyter, vol. 12(2), pages 1-17, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:testjl:v:22:y:2013:i:1:p:46-61. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.