Simple random walks on trees (Q1084401): Difference between revisions

Let T be a locally finite, infinite tree. The simple random walk on T is the Markov chain on T with transition probabilities \(p(v,w)=1/d(v)\) if v, w are adjacent vertices, and \(p(v,w)=0\) otherwise, where d(v) is the degree of the vertex v. In this paper the authors investigate recurrence properties of tree and relations between the radius of convergence of the simple random walks on a tree T with the growth of T and with the ends of T.