How fast does a general branching random walk spread?

by J.D.Biggins

In Classical and Modern Branching processes, (K.B. Athreya, P. Jagers, eds.). IMA Volumes in Mathematics and its Applications (1996) 84, 19-40. Springer-Verlag, New York.

1991 Mathematics Subject Classification: 60J80

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.

Availability

postscript file

dvi file


See also the companion paper
Other publications by J.D. Biggins

Return to my home page