Paper detail

Branching Random Walks on Free Products of Groups

We study certain phase transitions of branching random walks (BRW) on Cayley graphs of free products. The aim of this paper is to compare the size and structural properties of the trace, i.e., the subgraph that consists of all edges and vertices that were visited by some particle, with those of the original Cayley graph. We investigate the phase when the growth parameter $λ$ is small enough such that the process survives but the trace is not the original graph. A first result is that the box-counting dimension of the boundary of the trace exists, is almost surely constant and equals the Hausdorff dimension which we denote by $Φ(λ)$. The main result states that the function $Φ(λ)$ has only one point of discontinuity which is at $λ_{c}=R$ where $R$ is the radius of convergence of the Green function of the underlying random walk. Furthermore, $Φ(R)$ is bounded by one half the Hausdorff dimension of the boundary of the original Cayley graph and the behaviour of $Φ(R)-Φ(λ)$ as $λ\uparrow R$ is classified. In the case of free products of infinite groups the end-boundary can be decomposed into words of finite and words of infinite length. We prove the existence of a phase transition such that if $λ\leq \tildeλ_{c}$ the end boundary of the trace consists only of infinite words and if $λ>\tildeλ_{c}$ it also contains finite words. In the last case, the Hausdorff dimension of the set of ends (of the trace and the original graph) induced by finite words is strictly smaller than the one of the ends induced by infinite words.