How fast does a general branching random walk spread?
J. Biggins. 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.
Description
How fast does a general branching random walk spread?
%0 Book Section
%1 MR1601689
%A Biggins, J. D.
%B Classical and modern branching processes (Minneapolis, MN, 1994)
%C New York
%D 1997
%I Springer
%K Fisher-KPP branching_random_walk
%P 19--39
%T How fast does a general branching random walk spread?
%V 84
%X 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.
@incollection{MR1601689,
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.},
added-at = {2009-10-07T21:57:50.000+0200},
address = {New York},
author = {Biggins, J. D.},
biburl = {https://www.bibsonomy.org/bibtex/2166cc1b7c10827161dffac49c8c3e961/peter.ralph},
booktitle = {Classical and modern branching processes ({M}inneapolis, {MN}, 1994)},
description = {How fast does a general branching random walk spread?},
interhash = {230f3677414c95674d95bcc59b8badf6},
intrahash = {166cc1b7c10827161dffac49c8c3e961},
keywords = {Fisher-KPP branching_random_walk},
mrclass = {60J80},
mrnumber = {MR1601689 (99c:60186)},
mrreviewer = {Gail Ivanoff},
pages = {19--39},
publisher = {Springer},
series = {IMA Vol. Math. Appl.},
timestamp = {2009-10-07T21:57:50.000+0200},
title = {How fast does a general branching random walk spread?},
volume = 84,
year = 1997
}