Incollection,

How fast does a general branching random walk spread?

.
Classical and modern branching processes (Minneapolis, MN, 1994), volume 84 of IMA Vol. Math. Appl., Springer, New York, (1997)

Abstract

New results on the speed of spread of the one-dimensional spatial branching process are described. Generalizations to the multitype case and to $d$ dimensions are discussed. The relationship of the results with deterministic theory is also indicated. Finally, the theory developed is used to re-prove smoothly (and improve slightly) results on certain data-storage algorithms arising in computer science.

Tags

Users

  • @peter.ralph

Comments and Reviews