6 citations · 17 across the 12 of their papers we have counts for
1 paper · 1 filter
Javier M. Magan
We study a family of weighted random walks on complete graphs. These `democratic walks' turn out to be explicitly solvable, and we find the hierarchy window for which the character…