We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks. Due to a reinforcement mechanism and interaction, the walks are strongly correlated and converge almost surely to the same, possibly random, limit. We study random walks interacting through a mean-field rule and compare the rate they converge to their limit with the rate of synchronization, i.e. the rate at which their mutual distances converge to zero. We show that, under certain conditions, synchronization is faster than convergence. Even if our focus is on theoretical results, we propose as main motivations two contexts in which such results could directly apply: urn models and opinion dynamics in a random network evolving via ...
14 pages, 13 figuresMany natural and artificial networks evolve in time. Nodes and connections appea...
A token located at some vertex v of a connected, undirected graph G on n vertices is said to be taki...
International audienceChen [Ann. Appl. Probab. 11 (2001), 1242–1262] derived exact convergence rates...
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting ra...
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting ra...
Randomly evolving systems composed by elements which interact among each other have always been of g...
The Pólya urn is the paradigmatic example of a reinforced stochastic process. It leads to a random (...
We study a discrete time random walk in v in a dynamic random environment, when the evolution of the...
AbstractWe study a discrete time random walk in Zv in a dynamic random environment, when the evoluti...
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic ...
Synchronization is an emergent property in networks of interacting dynamical elements. Here we revie...
Abstract. We present a brief survey of results concerning self-interacting ran-dom walks and self-re...
This work deals with systems of interacting reinforced stochastic processes, where each process Xj=(...
Random walks are one of the most fundamental types of stochastic processes and have been applied in ...
In a companion paper, a quenched large deviation principle (LDP) has been established for the empiri...
14 pages, 13 figuresMany natural and artificial networks evolve in time. Nodes and connections appea...
A token located at some vertex v of a connected, undirected graph G on n vertices is said to be taki...
International audienceChen [Ann. Appl. Probab. 11 (2001), 1242–1262] derived exact convergence rates...
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting ra...
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting ra...
Randomly evolving systems composed by elements which interact among each other have always been of g...
The Pólya urn is the paradigmatic example of a reinforced stochastic process. It leads to a random (...
We study a discrete time random walk in v in a dynamic random environment, when the evolution of the...
AbstractWe study a discrete time random walk in Zv in a dynamic random environment, when the evoluti...
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic ...
Synchronization is an emergent property in networks of interacting dynamical elements. Here we revie...
Abstract. We present a brief survey of results concerning self-interacting ran-dom walks and self-re...
This work deals with systems of interacting reinforced stochastic processes, where each process Xj=(...
Random walks are one of the most fundamental types of stochastic processes and have been applied in ...
In a companion paper, a quenched large deviation principle (LDP) has been established for the empiri...
14 pages, 13 figuresMany natural and artificial networks evolve in time. Nodes and connections appea...
A token located at some vertex v of a connected, undirected graph G on n vertices is said to be taki...
International audienceChen [Ann. Appl. Probab. 11 (2001), 1242–1262] derived exact convergence rates...