44 citations · 53 across the 5 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.PR2012★ 44 cited
A generalized Polya's urn with graph based interactions
Michel Benaim, Itai Benjamini, Jun Chen +1
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a p…
math.PR2012
A Class of Multi-particle Reinforced Interacting Random Walks
Jun Chen
We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite o…