Hostname: page-component-6bf8c574d5-rwnhh Total loading time: 0 Render date: 2025-02-17T15:49:21.998Z Has data issue: false hasContentIssue false
  • English
  • Français

Interacting urns on a finite directed graph

Part of: Special processes Limit theorems Operations research and management science

Published online by Cambridge University Press:  23 September 2022

Gursharn Kaur  and
Neeraja Sahasrabudhe
Gursharn Kaur*
Affiliation:
University of Virginia
Neeraja Sahasrabudhe*
Affiliation:
Indian Institute of Science Education and Research
*
*Postal address: Biocomplexity Institute and Initiative, 994 Research Park Boulevard, University of Virginia, Charlottesville, VA 22911. Email address: [email protected]
**Postal address: Department of Mathematical Sciences, IISER Mohali, Knowledge City, Sector 81, SAS Nagar, Manauli PO 140306. Email address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We introduce a general two-colour interacting urn model on a finite directed graph, where each urn at a node reinforces all the urns in its out-neighbours according to a fixed, non-negative, and balanced reinforcement matrix. We show that the fraction of balls of either colour converges almost surely to a deterministic limit if either the reinforcement is not of Pólya type or the graph is such that every vertex with non-zero in-degree can be reached from some vertex with zero in-degree. We also obtain joint central limit theorems with appropriate scalings. Furthermore, in the remaining case when there are no vertices with zero in-degree and the reinforcement is of Pólya type, we restrict our analysis to a regular graph and show that the fraction of balls of either colour converges almost surely to a finite random limit, which is the same across all the urns.

Keywords

ReinforcementPólya urnsFriedman urnslimit theoremsopinion dynamics on networkssynchronisation

MSC classification

Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory
Secondary: 60F05: Central limit and other weak theorems 90B15: Network models, stochastic
Type
Original Article
Information
Journal of Applied Probability , Volume 60 , Issue 1 , March 2023 , pp. 166 - 188
Check for updates
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of Applied Probability Trust

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aletti, G., Crimaldi, I. and Ghiglietti, A. (2020). Interacting reinforced stochastic processes: statistical inference based on the weighted empirical means. Bernoulli 26, 1098–1138.CrossRefGoogle Scholar
Benaïm, M., Benjamini, I., Chen, J. and Lima, Y. (2015). A generalized Pólya’s urn with graph based interactions. Random Structures Algorithms 46, 614–634.CrossRefGoogle Scholar
Borkar, V. S. (2008). Stochastic Approximation: a Dynamical Systems Viewpoint. Cambridge University Press.CrossRefGoogle Scholar
Crimaldi, I., Dai Pra, P., Louis, P.-Y. and Minelli, I. G. (2019). Synchronization and functional central limit theorems for interacting reinforced random walks. Stoch. Process. Appl. 129, 70–101.CrossRefGoogle Scholar
Crimaldi, I., Dai Pra, P. and Minelli, I. G. (2016). Fluctuation theorems for synchronization of interacting Pólya’s urns. Stochastic Process. Appl. 126, 930–947.CrossRefGoogle Scholar
Dai Pra, P., Louis, P.-Y. and Minelli, I. G. (2014). Synchronization via interacting reinforcement. J. Appl. Prob. 51, 556–568.CrossRefGoogle Scholar
Freedman, D. A. (1965). Bernard Friedman’s urn. Ann. Math. Statist. 36, 956–970.10.1214/aoms/1177700068CrossRefGoogle Scholar
Laruelle, S. and Pagès, G. (2013). Randomized urn models revisited using stochastic approximation. Ann. Appl. Prob. 23, 1409–1436.CrossRefGoogle Scholar
Mahmoud, H. M. (2009). Pólya Urn Models. CRC Press, Boca Raton.Google Scholar
Métivier, M. (1982). Semimartingales: a Course on Stochastic Processes. Walter de Gruyter, Berlin, New York.CrossRefGoogle Scholar
Pemantle, R. (2007). A survey of random processes with reinforcement. Prob. Surveys 4, 1–79.CrossRefGoogle Scholar
Robbins, H. and Siegmund, D. (1971). A convergence theorem for non negative almost supermartingales and some applications. In Optimizing Methods in Statistics: Proceedings of a Symposium Held at the Center for Tomorrow, the Ohio State University, June 14–16, 1971, Academic Press, New York, pp. 233–257.Google Scholar
Sahasrabudhe, N. (2016). Synchronization and fluctuation theorems for interacting Friedman urns. J. Appl. Prob. 53, 1221–1239.CrossRefGoogle Scholar
Van der Hofstad, R., Holmes, M., Kuznetsov, A. and Ruszel, W. (2016). Strongly reinforced Pólya urns with graph-based competition. Ann. Appl. Prob. 26, 2494–2539.CrossRefGoogle Scholar
Zhang, L.-X. (2016). Central limit theorems of a recursive stochastic algorithm with applications to adaptive designs. Ann. Appl. Prob. 26, 3630–3658.CrossRefGoogle Scholar