44 citations · 60 across the 3 of their papers we have counts for
1 paper · 1 filter
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…