How Fast Does a General Branching Random Walk Spread?

作者:John D. Biggins 刊名: 上传者:闫晓玲

【摘要】New results on the speed of spread of the one-dimensionalspatial 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 reprove smoothly (and improve slightly) results on certain data-storage algorithms arising in computer science.

参考文献

引证文献

问答

我要提问