The Annals of Applied Probability

Synchronization of reinforced stochastic processes with a network-based interaction

Giacomo Aletti, Irene Crimaldi, and Andrea Ghiglietti

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Randomly evolving systems composed by elements which interact among each other have always been of great interest in several scientific fields. This work deals with the synchronization phenomenon that could be roughly defined as the tendency of different components to adopt a common behavior. We continue the study of a model of interacting stochastic processes with reinforcement that recently has been introduced in [Crimaldi et al. (2016)]. Generally speaking, by reinforcement we mean any mechanism for which the probability that a given event occurs has an increasing dependence on the number of times that events of the same type occurred in the past. The particularity of systems of such interacting stochastic processes is that synchronization is induced along time by the reinforcement mechanism itself and does not require a large-scale limit. We focus on the relationship between the topology of the network of the interactions and the long-time synchronization phenomenon. After proving the almost sure synchronization, we provide some CLTs in the sense of stable convergence that establish the convergence rates and the asymptotic distributions for both convergence to the common limit and synchronization. The obtained results lead to the construction of asymptotic confidence intervals for the limit random variable and of statistical tests to make inference on the topology of the network.

Article information

Source
Ann. Appl. Probab., Volume 27, Number 6 (2017), 3787-3844.

Dates
Received: July 2016
Revised: March 2017
First available in Project Euclid: 15 December 2017

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1513328714

Digital Object Identifier
doi:10.1214/17-AAP1296

Mathematical Reviews number (MathSciNet)
MR3737938

Zentralblatt MATH identifier
1382.60046

Subjects
Primary: 60F05: Central limit and other weak theorems 60F15: Strong theorems 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]
Secondary: 62P35: Applications to physics 91D30: Social networks

Keywords
Interacting systems reinforced stochastic processes urn models complex networks synchronization asymptotic normality

Citation

Aletti, Giacomo; Crimaldi, Irene; Ghiglietti, Andrea. Synchronization of reinforced stochastic processes with a network-based interaction. Ann. Appl. Probab. 27 (2017), no. 6, 3787--3844. doi:10.1214/17-AAP1296. https://projecteuclid.org/euclid.aoap/1513328714


Export citation

References

  • [1] Albert, R. and Barabási, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74 47–97.
  • [2] Aletti, G. and Ghiglietti, A. (2017). Interacting generalized Friedman’s urn systems. Stochastic Process. Appl. 127 2650–2678.
  • [3] Aletti, G., Ghiglietti, A. and Paganoni, A. M. (2013). Randomly reinforced urn designs with prespecified allocations. J. Appl. Probab. 50 486–498.
  • [4] Aletti, G., Ghiglietti, A. and Vidyashankar, A. N. (2017). Dynamics of an adaptive randomly reinforced urn. Bernoulli. To appear.
  • [5] Aletti, G., May, C. and Secchi, P. (2009). A central limit theorem, and related results, for a two-color randomly reinforced urn. Adv. in Appl. Probab. 41 829–844.
  • [6] Aoudia, D. A. and Perron, F. (2012). A new randomized Pólya urn model. Appl. Math. 3 2118–2122.
  • [7] Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y. and Zhou, C. (2008). Synchronization in complex networks. Phys. Rep. 469 93–153.
  • [8] Barabási, A.-L. and Albert, R. (1999). Emergence of scaling in random networks. Science 286 509–512.
  • [9] 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.
    Mathematical Reviews (MathSciNet): MR3346459
    Digital Object Identifier: doi:10.1002/rsa.20523
  • [10] Berti, P., Crimaldi, I., Pratelli, L. and Rigo, P. (2011). A central limit theorem and its applications to multicolor randomly reinforced urns. J. Appl. Probab. 48 527–546.
  • [11] Berti, P., Crimaldi, I., Pratelli, L. and Rigo, P. (2016). Asymptotics for randomly reinforced urns with random barriers. J. Appl. Probab. 53 1206–1220.
  • [12] Caldarelli, G., Chessa, A., Crimaldi, I. and Pammolli, F. (2013). Weighted networks as randomly reinforced urn processes. Phys. Rev. E 87 020106(R).
  • [13] Chen, J. and Lucas, C. (2014). A generalized Pólya’s urn with graph based interactions: Convergence at linearity. Electron. Commun. Probab. 19 no. 67, 13.
  • [14] Chen, M.-R. and Kuba, M. (2013). On generalized Pólya urn models. J. Appl. Probab. 50 1169–1186.
    Mathematical Reviews (MathSciNet): MR3161380
    Digital Object Identifier: doi:10.1239/jap/1389370106
    Project Euclid: euclid.jap/1389370106
  • [15] Cirillo, P., Gallegati, M. and Hüsler, J. (2012). A Pólya lattice model to study leverage dynamics and contagious financial fragility. Adv. Complex Syst. 15 1250069, 26.
  • [16] Collevecchio, A., Cotar, C. and LiCalzi, M. (2013). On a preferential attachment and generalized Pólya’s urn model. Ann. Appl. Probab. 23 1219–1253.
  • [17] Contucci, P. and Ghirlanda, S. (2007). Modeling society with statistical mechanics: An application to cultural contact and immigration. Qual. Quant. 41 569–578.
  • [18] Crimaldi, I. (2009). An almost sure conditional convergence result and an application to a generalized Pólya urn. Int. Math. Forum 4 1139–1156.
  • [19] Crimaldi, I. (2016). Central limit theorems for a hypergeometric randomly reinforced urn. J. Appl. Probab. 53 899–913.
  • [20] Crimaldi, I. (2016). Introduzione Alla Nozione di Convergenza Stabile e sue Varianti (Introduction to the Notion of Stable Convergence and Its Variants) 57. Unione Matematica Italiana, Monograf s.r.l., Bologna, Italy. (In Italian.)
  • [21] Crimaldi, I., Dai Pra, P., Louis, P. Y. and Minelli, I. G. (2016). Synchronization and functional central limit theorems for interacting reinforced random walks. Preprint. Available at arXiv:1602.06217.
    arXiv: 1602.06217
  • [22] 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.
  • [23] Crimaldi, I., Letta, G. and Pratelli, L. (2007). A strong form of stable convergence. In Séminaire de Probabilités XL. Lecture Notes in Math. 1899 203–225. Springer, Berlin.
  • [24] Crimaldi, I. and Pratelli, L. (2005). Convergence results for multivariate martingales. Stochastic Process. Appl. 115 571–577.
  • [25] Dai Pra, P., Louis, P.-Y. and Minelli, I. G. (2014). Synchronization via interacting reinforcement. J. Appl. Probab. 51 556–568.
  • [26] Eggenberger, F. and Pólya, G. (1923). Uber die Statistik verketteter Vorgänge. Z. Angewandte Math. Mech. 3 279–289.
  • [27] Ghiglietti, A. and Paganoni, A. M. (2014). Statistical properties of two-color randomly reinforced urn design targeting fixed allocations. Electron. J. Stat. 8 708–737.
  • [28] Ghiglietti, A., Vidyashankar, A. N. and Rosenberger, W. F. (2017). Central limit theorem for an adaptive randomly reinforced urn model. Ann. Appl. Probab. To appear.
  • [29] Hall, P. and Heyde, C. C. (1980). Martingale Limit Theory and Its Application: Probability and Mathematical Statistics. Academic Press, New York.
  • [30] Horn, R. A. and Johnson, C. R. (2013). Matrix Analysis, 2nd ed. Cambridge Univ. Press, Cambridge.
  • [31] Laruelle, S. and Pagès, G. (2013). Randomized urn models revisited using stochastic approximation. Ann. Appl. Probab. 23 1409–1436.
  • [32] Launay, M. (2011). Interacting urn models. Preprint. Available at arXiv:1101.1410.
    arXiv: 1101.1410
  • [33] Launay, M. and Limic, V. (2012). Generalized interacting urn models. Preprint. Available at arXiv:1207.5635.
    arXiv: 1207.5635
  • [34] Lima, Y. (2016). Graph-based Pólya’s urn: Completion of the linear case. Stoch. Dyn. 16 1660007, 13.
  • [35] Linero, A. and Rosalsky, A. (2013). On the Toeplitz lemma, convergence in probability, and mean convergence. Stoch. Anal. Appl. 31 684–694.
  • [36] Mahmoud, H. M. (2009). Pólya Urn Models. CRC Press, Boca Raton, FL.
  • [37] Marsili, M. and Valleriani, A. (1998). Self organization of interacting Pólya urns. Eur. Phys. J. B 3 417–420.
  • [38] Newman, M. E. J. (2010). Networks: An Introduction. Oxford Univ. Press, Oxford.
  • [39] Norris, J. R. (1998). Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics 2. Cambridge Univ. Press, Cambridge.
  • [40] Paganoni, A. M. and Secchi, P. (2004). Interacting reinforced-urn systems. Adv. in Appl. Probab. 36 791–804.
  • [41] Pemantle, R. (2007). A survey of random processes with reinforcement. Probab. Surv. 4 1–79.
  • [42] Robbins, H. and Siegmund, D. (1971). A convergence theorem for non negative almost supermartingales and some applications. In Optimizing methods in statistics (Proc. Sympos., Ohio State Univ., Columbus, Ohio, 1971) 233–257. Academic Press, New York.
  • [43] Sahasrabudhe, N. (2016). Synchronization and fluctuation theorems for interacting Friedman urns. J. Appl. Probab. 53 1221–1239.
  • [44] van der Hofstad, R. (2009). Random Graphs and Complex Networks. Available at https://www.win.tue.nl/~rhofstad/NotesRGCN.html.
  • [45] Zhang, L.-X. (2014). A Gaussian process approximation for two-color randomly reinforced urns. Electron. J. Probab. 19 no. 86, 19.

The Institute of Mathematical Statistics

The Annals of Applied Probability

New content alerts

Email RSS ToC RSS Article
  • You have access to this content.
  • You have partial access to this content.
  • You do not have access to this content.
Turn Off MathJax

What is MathJax?

More like this

+ See more