Branching Random Walk Algorithm

A Branching Random Walk Algorithm is an algorithm that is based on a branching random walk.

• Example(s):
  • …
• Counter-Example(s):
  • Continuous-Time Random Walk,
  • Heterogeneous 1-D Random Walk,
  • Loop-Erased Random Walk,
  • Random Surfing Model,
  • Wiener Process,
  • Bernoulli Process,
  • Poisson Process,
  • Markov Process,
  • Levy Process.
• See: Random Variable, Probability Theory, Stochastic Process, Random Walk, Branching Process, Discrete Time, Linear Space, Real Line, Discrete-Time Dynamical System, Brownian Web, Double Fourier Sphere (DFS) Algorithm, Gambler's Ruin Algorithm, Ornstein-Uhlenbeck Process, Walk-on-Spheres (WoS) Algorithm.

---

---

References

2021

• (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Branching_random_walk Retrieved:2021-8-19.
  • In probability theory, a branching random walk is a stochastic process that generalizes both the concept of a random walk and of a branching process. At every generation (a point of discrete time), a branching random walk's value is a set of elements that are located in some linear space, such as the real line. Each element of a given generation can have several descendants in the next generation. The location of any descendant is the sum of its parent's location and a random variable.

---