7 citations · 7 across the 1 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
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…
math.PR2019★ 7 cited
Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities
Thomas Sauerwald, Luca Zanetti
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are…