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 $v$ such that ${\lim }_{n\to \infty }\frac{|X_n|}{n}=v$ a.s.\ (here, $|\cdot |$ stands for the distance from the root). We give a formula for $v$ 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.

24 pages, 5 figures, revised version

References in corpus (1)

• A central limit theorem for random walk in random environment on marked Galton-Watson trees

Cited by in corpus (7)

• Recent progress on the Random Conductance Model
• The harmonic measure of balls in random trees
• The speed of the tagged particle in the exclusion process on Galton-Watson trees
• A proof of the Lyons-Pemantle-Peres monotonicity conjecture for high biases
• Speed of the biased random walk on a Galton--Watson tree
• Monotonicity of the speed for biased random walk on Galton-Watson tree
• Generating Galton-Watson trees using random walks and percolation for the Gaussian free field