Random walks on Galton-Watson trees with random conductances

preprint2011arXivOpen access

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 vv such that lim⁡n→∞∣Xn∣n=v\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 vv 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.