Networks of reinforced stochastic processes: a complete description of the first-order asymptotics
arXiv:2206.07514 · doi:10.1016/j.spa.2024.104427
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.
arXiv comment28 pages + supplementary material (13 pages), 2 figures
References in corpus (13)
- Statistical mechanics of complex networks
- Synchronization in complex networks
- A survey of random processes with reinforcement
- A generalized Polya's urn with graph based interactions
- Synchronization via interacting reinforcement
- Interacting generalized Friedman's urn systems
- Synchronization of Reinforced Stochastic Processes with a Network-based Interaction
- Self Organization of Interacting Polya Urns
- Generalized Interacting Urn Models
- Graph-based Polya's urn: completion of the linear case
- Interacting reinforced stochastic processes: statistical inference based on the weighted empirical means
- Interacting Innovation processes: case studies from Reddit and Gutenberg
- Networks of reinforced stochastic processes: probability of asymptotic polarization and related general results