How Fast Does a General Branching Random Walk Spread?
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.
Key wordsspatial spread asymptotic speed propagation rate binary search tree CMJ process multitype
Unable to display preview. Download preview PDF.
- Baccelli F., and Konstantopoulos, P. (1991) Estimates of cycle times in stochastic Perti nets. In Proceedings of the Rutgers Conference on Stochastic Processes ed. I. Karatzas. Springer Berlin.Google Scholar
- Biggins J.D. (1980) Spatial spread in branching processes. In Lecture notes in Biomathematics Biological Growth and Spread eds W. Jäger, H. Rost, P. Tautu, Springer Berlin 38 57–67.Google Scholar
- Biggins J.D. (1995) Growth and spread of the general branching random walk. Ann. Appl. Probab. 5. Google Scholar
- Bramson M. (1983) The convergence of solutions of the Kohnogorov non-linear diffusion equations to travelling waves. Mem. Amer. Math. Soc. 44(285).Google Scholar
- Jagers, P. (1995), Branching processes as population dynamics. Bernoulli. 1. Google Scholar
- Knuth, D.E. (1968), The Art of Computer Programming: Fundamental Algorithms. Addison-Wesley, Mass.Google Scholar
- Olofsson, P. (1994) General branching processes with local dependencies. Thesis, Dept Mathematics, Chalmers Univ. Tech. and Gothenburg Univ.Google Scholar
- Ryan, T.A. (1968), On age-dependent branching processes. PhD thesis, Cornell Univ.Google Scholar