An explicit formula of hitting times for random walks on graphs
نویسندگان
چکیده
منابع مشابه
Hitting times for random walks on vertex-transitive graphs
For random walks on finite graphs, we record some equalities, inequalities and limit theorems (as the size of graph tends to infinity) which hold for vertex-transitive graphs but not for general regular graphs. The main result is a sharp condition for asymptotic exponentiality of the hitting time to a single vertex. Another result is a lower bound for the coefficient of variation of hitting tim...
متن کاملHitting Times for Random Walks with Restarts
The time it takes a random walker in a lattice to reach the origin from another vertex x, has infinite mean. If the walker can restart the walk at x at will, then the minimum expected hitting time γ(x, 0) (minimized over restarting strategies) is finite; it was called the “grade” of x by Dumitriu, Tetali and Winkler. They showed that, in a more general setting, the grade (a variant of the “Gitt...
متن کاملLectures 16-17: Random Walks on Graphs 1.1 Hitting times and Cover Times
Let G (V, E) be an undirected graph. The random walk on G is a Markov chain on V that, at each time step, moves to a uniformly random neighbor of the current vertex. Ffsor x ∈ V , use dx to denote the degree of vertex x. Then more formally, random walk on G is the following process {Xt}. We start at at some node X0 v0 ∈ V . Then if Xt v, we put Xt+1 w with probability 1/dv for every neighbor w ...
متن کاملA Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected hitting time from an arbitrary spanning tree of the graph. We illustrate this method with two examples. In these examples, we show that the bounds obtained from the spanning method are sharper than bounds obtained from...
متن کاملMeeting Times of Random Walks on Graphs
We prove an upper bound on the meeting time of an arbitrary number of random walks in any connected undirected graph in terms of the meeting times of fewer random walks. We show that the bound is tight for rings, and that it is both stronger and more general than a bound suggested by Tetali and Winkler [4].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pure and Applied Mathematics Quarterly
سال: 2014
ISSN: 1558-8599,1558-8602
DOI: 10.4310/pamq.2014.v10.n3.a6