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.
Users
Please
log in to take part in the discussion (add own reviews or comments).