2 papers
math.PR2020
Random walks on randomly evolving graphs
Leran Cai, Thomas Sauerwald, Luca Zanetti
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under…
cs.DC2017
Randomized Load Balancing on Networks with Stochastic Inputs
Leran Cai, Thomas Sauerwald
Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past. Complementing previous worst-case analyses, we study an average-case scenario…