Groups, Geometry, and Dynamics
Full-Text PDF (191 KB) | Table of Contents | GGD summary
On the trace of branching random walks
Itai Benjamini (1) and Sebastian Müller (2)(1) Department of Mathematics, Weizmann Institute of Science, P.O. BOX 26, 76100, REHOVOT, ISRAEL
(2) Laboratoire d'Analyse, Topologie, Probabilités, Université de Provence, 39, rue F. Joliot Curie, 13453, MARSEILLE CEDEX 13, FRANCE
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is almost surely (a.s.) transient for the simple random walk. In addition, it has a.s. critical percolation probability less than one and exponential volume growth. The proofs rely on the fact that the trace induces an invariant percolation on the family tree of the branching random walk. Furthermore, we prove that the trace is a.s. strongly recurrent for any (non-trivial) branching random walk. This follows from the observation that the trace, after appropriate biasing of the root, defines a unimodular measure. All results are stated in the more general context of branching random walks on unimodular random graphs.
Keywords: Branching random walk, trace, unimodular random network, recurrence, invariant percolation