Random walks on Galton-Watson trees with random conductances
Abstract
We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that, if the mean conductance is finite, there is a deterministic, strictly positive speed such that a.s.\ (here, stands for the distance from the root). We give a formula for in terms of the laws of certain effective conductances and show that, if the conductances share the same expected value, the speed is not larger than the speed of simple random walk on Galton--Watson trees. The proof relies on finding a reversible measure for the environment observed by the particle.
Cite
@article{arxiv.1101.2769,
title = {Random walks on Galton-Watson trees with random conductances},
author = {Nina Gantert and Sebastian Müller and Serguei Popov and Marina Vachkovskaia},
journal= {arXiv preprint arXiv:1101.2769},
year = {2015}
}
Comments
24 pages, 5 figures, revised version