Networks of reinforced stochastic processes: a complete description of the first-order asymptotics

arXiv2206.07514MaRDI QIDQ6402176FDOQ6402176

Irene Crimaldi, Giacomo Aletti, Andrea Ghiglietti

Publication date: 15 June 2022

Abstract: We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization, which could be roughly defined as the almost sure long-run uniformization of the behavior of interacting processes. Specifically, we detect a regime of complete synchronization, where all the processes converge toward the same random variable, a second regime where the system almost surely converges, but there exists no form of almost sure asymptotic synchronization, and another regime where the system does not converge with a strictly positive probability. In this latter case, partitioning the system in cyclic classes according to the period of the interaction matrix, we have an almost sure asymptotic synchronization within the cyclic classes, and, with a strictly positive probability, an asymptotic periodic behavior of these classes.

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Social networks; opinion dynamics (91D30) Strong limit theorems (60F15)

This page was built for publication: Networks of reinforced stochastic processes: a complete description of the first-order asymptotics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402176)