The type problem for random walks on trees
From MaRDI portal
Publication:2277669
Recommendations
Cites work
- scientific article; zbMATH DE number 3163289 (Why is no real title available?)
- scientific article; zbMATH DE number 3862178 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 3551675 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A simple criterion for transience of a reversible Markov chain
- Critical phenomena for Spitzer's reversible nearest particle systems
- Random walks and percolation on trees
Cited in
(15)- Recurrence and moment of first return time for the discrete-time random walks on trees
- The speed of random walks on trees and electric networks
- Random walks and dimensions of random trees
- scientific article; zbMATH DE number 1984557 (Why is no real title available?)
- Fractal dimensions and random walks on random trees.
- Recurrence vs transience: an introduction to random walks
- Random walks on trees and the law of iterated logarithm
- FRACTAL AND RESISTANCE DIMENSIONS OF RANDOM TREES
- Transient and slim versus recurrent and fat: random walks and the trees they grow
- Dimensions of random trees.
- Random walks on a tree and capacity in the interval
- Transience and volumes of trees
- On the speed of random walks on random trees
- A Counterexample to the Conjecture of Woess on Simple Random Walks on Trees
- Random walks on trees with finitely many cone types
This page was built for publication: The type problem for random walks on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277669)