Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities

03/04/2019
by   Thomas Sauerwald, et al.
0

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 allows 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 connected graphs for which the stationary distribution does not change over time, we show that their behaviour is in a certain sense similar to static graphs. For example, we show that the mixing and hitting times of any sequence of d-regular connected graphs is O(n^2), generalising a well-known result for static graphs. We also provide refined bounds depending on the isoperimetric dimension of the graph, matching again known results for static graphs. Finally, we investigate properties of random walks on dynamic graphs that are not always connected: we relate their convergence to stationarity to the spectral properties of an average of transition matrices and provide some examples that demonstrate strong discrepancies between static and dynamic graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2021

Metropolis Walks on Dynamic Graphs

Recently, random walks on dynamic graphs have been studied because of it...
research
06/18/2020

Random walks on randomly evolving graphs

A random walk is a basic stochastic process on graphs and a key primitiv...
research
07/18/2018

Random walks on graphs: new bounds on hitting, meeting, coalescing and returning

We prove new results on lazy random walks on finite graphs. To start, we...
research
01/04/2021

Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph

We investigate special structures due to automorphisms in isogeny graphs...
research
11/16/2020

Multiple Random Walks on Graphs: Mixing Few to Cover Many

Random walks on graphs are an essential primitive for many randomised al...
research
12/06/2017

Oblivious Routing via Random Walks

We present novel oblivious routing algorithms for both splittable and un...
research
01/25/2021

Rapid mixing in unimodal landscapes and efficient simulatedannealing for multimodal distributions

We consider nearest neighbor weighted random walks on the d-dimensional ...

Please sign up or login with your details

Forgot password? Click here to reset