Simple random walks on trees
From MaRDI portal
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.
Recommendations
Cites work
- GEOMETRIC ERGODICITY IN DENUMERABLE MARKOV CHAINS
- scientific article; zbMATH DE number 3862178 (Why is no real title available?)
- scientific article; zbMATH DE number 3780277 (Why is no real title available?)
- scientific article; zbMATH DE number 3610561 (Why is no real title available?)
- scientific article; zbMATH DE number 3629935 (Why is no real title available?)
- scientific article; zbMATH DE number 3443951 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- scientific article; zbMATH DE number 3361677 (Why is no real title available?)
- scientific article; zbMATH DE number 3399118 (Why is no real title available?)
- Isotropic random walks in a tree
- Random walks and periodic continued fractions
- Random walks on graphs
- Random walks on trees
- Strong ratio limits, R-recurrence and mixing properties of discrete parameter Markov processes
Cited in
(33)- Local limits and harmonic functions for nonisotropic random walks on free groups
- Transience and volumes of trees
- Harmonic analysis on the free product of two cyclic groups
- Random walks on graphs with a strong isoperimetric property
- Isoperimetric inequalities, growth, and the spectrum of graphs
- The Dirichlet problem at infinity for random walks on graphs with a strong isoperimetric inequality
- On the spectrum, the growth, and the diameter of a graph
- The range of random walk on trees and related trapping problem
- Fractal dimensions and random walks on random trees.
- Random walks on trees and the law of iterated logarithm
- Excited random walk on trees
- The full spectrum of random walks on complete finite \(d\)-ary trees
- On a random walk that grows its own tree
- Tree builder random walk: recurrence, transience and ballisticity
- The type problem for random walks on trees
- scientific article; zbMATH DE number 3862178 (Why is no real title available?)
- Function Series, Catalan Numbers, and Random Walks on Trees
- scientific article; zbMATH DE number 5159453 (Why is no real title available?)
- Reversibility of a simple random walk on periodic trees
- scientific article; zbMATH DE number 3949430 (Why is no real title available?)
- Harmonic functions on infinite graphs
- A Counterexample to the Conjecture of Woess on Simple Random Walks on Trees
- scientific article; zbMATH DE number 1192303 (Why is no real title available?)
- scientific article; zbMATH DE number 590875 (Why is no real title available?)
- scientific article; zbMATH DE number 1984557 (Why is no real title available?)
- Extremal cover times for random walks on trees
- Martin Boundaries of Random Walks: Ends of Trees and Groups
- Recurrence and moment of first return time for the discrete-time random walks on trees
- Simple random walks on radial trees
- On the speed of random walks on random trees
- Boundaries of random walks on graphs and groups with infinitely many ends
- Factorization of the Green's operator and weak-type estimates for a random walk on a tree
- Random walk covering of some special trees
This page was built for publication: Simple random walks on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084401)
