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 times. Proofs exploit the complete monotonicity properties of the associated continuous-time walk.
منابع مشابه
First Hitting times of Simple Random Walks on Graphs with Congestion Points
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...
متن کاملSimple random walks on wheel graphs
A simple random walk on a graph is defined in which a particle moves from one vertex to any adjacent vertex, each with equal probability. The expected hitting time is the expected number of steps to get from one vertex to another before returning to the starting vertex. In this paper, using the electrical network approach, we provide explicit formulae for expected hitting times for simple rando...
متن کاملFinding hitting times in various graphs
The hitting time, huv , of a random walk on a finite graph G, is the expected time for the walk to reach vertex v given that it started at vertex u. We present two methods of calculating the hitting time between vertices of finite graphs, along with applications to specific classes of graphs, including grids, trees, and the ’tadpole’ graphs. keywords: random walks, hitting time
متن کامل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...
متن کاملRandom Walks on Diestel-leader Graphs
We investigate various features of a quite new family of graphs, introduced as a possible example of vertex-transitive graph not roughly isometric with a Cayley graph of some finitely generated group. We exhibit a natural compactification and study a large class of random walks, proving theorems concerning almost sure convergence to the boundary, a strong law of large numbers and a central limi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989