We use the concept of unimodular random graph to show that the branching simple random walk on Zᵈ indexed by a critical geometric Galton-Watson tree conditioned to survive is recurrent if and only if d ≤ 4.
No takes yet. Share an insight, caveat, or question.
Benjamini et al. (2012) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: