Corpus ID: 166228281

Interacting Urns on a Finite Directed Graph.

  title={Interacting Urns on a Finite Directed Graph.},
  author={G. Kaur and N. Sahasrabudhe},
  journal={arXiv: Probability},
Consider a finite directed graph $G=(V, E)$ and place an urn with balls of two colours: white and black, at each node at time $t=0$. The urns evolve, in discrete time, depending upon a common replacement matrix $R$ and the underlying graph structure. At each time-step, urns reinforce their neighbours according to a fixed replacement matrix $R$. We study asymptotic properties of the fraction of balls of either colour and obtain limit theorems for general replacement matrices. In particular, we… Expand
A Finite Memory Interacting Pólya Contagion Network and its Approximating Dynamical Systems


Strongly reinforced P\'olya urns with graph-based competition
A generalized Pólya's urn with graph based interactions
On Generalized Pólya Urn Models
Fluctuation theorems for synchronization of interacting Pólya’s urns
Synchronization via Interacting Reinforcement
Synchronization and fluctuation theorems for interacting Friedman urns
  • N. Sahasrabudhe
  • Computer Science, Mathematics
  • Journal of Applied Probability
  • 2016
Matrix analysis
A survey of random processes with reinforcement