A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities
2019
International Colloquium on Automata, Languages and Programming
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 based on rather intuitive notions of local expansion properties which allow us to capture the progress the random walk makes through t-step probabilities. We apply our framework to dynamically changing graphs, where the set of vertices is fixed while the set of edges changes in each round. For random walks on dynamic
doi:10.4230/lipics.icalp.2019.93
dblp:conf/icalp/SauerwaldZ19
fatcat:2tzvaq2gxveorlvghva6l73ec4