An example of branching random walk can be constructed where the branching process generates exactly two descendants for each element, a binary branching random walk. Given the initial condition that Xϵ = 0, we suppose that X1 and X2 are the two children of Xϵ. Further, we suppose that they are independent N(0, 1) random variables. Consequently, in generation 2, the random variables X1,1 and X1,2 are each the sum of X1 and a N(0, 1) random variable. In the next generation, the random variables X1,2,1 and X1,2,2 are each the sum of X1,2 and a N(0, 1) random variable. The same construction produces the values at successive times.
Each lineage in the infinite "genealogical tree" produced by this process, such as the sequence Xϵ, X1, X1,2, X1,2,2, ..., forms a conventional random walk.
Kaplan, Norman (1982). "A Note on the Branching Random Walk". Journal of Applied Probability. 19 (2): 421–424. doi:10.2307/3213494. ISSN 0021-9002. https://www.jstor.org/stable/3213494 ↩
Shi, Zhan (2015). Branching Random Walks. École d’Été de Probabilités de Saint-Flour XLII – 2012. Vol. 2151. Paris: Springer. doi:10.1007/978-3-319-25372-5. ISBN 978-3-319-25371-8. ISSN 0075-8434. 978-3-319-25371-8 ↩
Bovier, Anton, ed. (2016), "Branching Brownian Motion", Gaussian Processes on Trees: From Spin Glasses to Branching Brownian Motion, Cambridge Studies in Advanced Mathematics, Cambridge: Cambridge University Press, pp. 60–75, ISBN 978-1-107-16049-1, retrieved 2024-11-25 978-1-107-16049-1 ↩