On the speed of random walks on a percolation cluster of trees
classification
🧮 math.PR
keywords
treesrandomclusterpercolationsimplespeedwalkbernoulli
read the original abstract
We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of trees. A sufficient condition is established for Galton-Watson trees.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.