14 citations · 16 across the 2 of their papers we have counts for
3 papers
math.PR2014★ 14 cited
Graph-based Polya's urn: completion of the linear case
Yuri Lima
Given a finite connected graph , place a bin at each vertex. Two bins are called a pair if they share an edge of . At discrete times, a ball is added to each pair of bins. In…
math.PR2013★ 2 cited
A generalized Pólya's Urn with graph based interactions: convergence at linearity
Jun Chen, Cyrille Lucas
We consider a special case of the generalized Pólya's urn model introduced by Benaim et al (2013). Given a finite connected graph , place a bin at each vertex. Two bins are call…
math.PR2012
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…