Interacting reinforced stochastic processes: Statistical inference based on the weighted empirical means

This work deals with a system of interacting reinforced stochastic processes, where each process Xj = (Xn,j )n is located at a vertex j of a finite weighted directed graph, and it can be interpreted as the sequence of "actions" adopted by an agent j of the network. The interaction among the dynamics of these processes depends on the weighted adjacency matrix W associated to the underlying graph: Indeed, the probability that an agent j chooses a certain action depends on its personal "inclination" Zn,j and on the inclinations Zn,h, with h ≠= j , of the other agents according to the entries of W. The best known example of reinforced stochastic process is the Pólya urn. The present paper focuses on the weighted empirical means Nn,j =Σn k=1 qn,kXk,j , since, for example, the current experience is more important than the past one in reinforced learning. Their almost sure synchronization and some central limit theorems in the sense of stable convergence are proven. The new approach with weighted means highlights the key points in proving some recent results for the personal inclinations Zj = (Zn,j )n and for the empirical means X j = ( Σn k=1 Xk,j/n)n given in recent papers (e.g. Aletti, Crimaldi and Ghiglietti (2019), Ann. Appl. Probab. 27 (2017) 3787-3844, Crimaldi et al. Stochastic Process. Appl. 129 (2019) 70-101). In fact, with a more sophisticated decomposition of the considered processes, we can understand how the different convergence rates of the involved stochastic processes combine. From an application point of view, we provide confidence intervals for the common limit inclination of the agents and a test statistics to make inference on the matrix W, based on the weighted empirical means. In particular, we answer a research question posed in Aletti, Crimaldi and Ghiglietti (2019).