Occupation Statistics of Critical Branching Random Walks in Two or Higher Dimensions

preprint2010arXivOpen access

Abstract

Consider a critical nearest neighbor branching random walk on the dd-dimensional integer lattice initiated by a single particle at the origin. Let GnG_{n} be the event that the branching random walk survives to generation nn. We obtain limit theorems conditional on the event GnG_{n} for a variety of occupation statistics: (1) Let VnV_{n} be the maximal number of particles at a single site at time nn. If the offspring distribution has finite ααth moment for some integer α≥2α\geq 2, then in dimensions 3 and higher, Vn=Op(n1/α)V_n=O_p(n^{1/α}); and if the offspring distribution has an exponentially decaying tail, then Vn=Op(log⁡n)V_n=O_p(\log n) in dimensions 3 and higher, and Vn=Op((log⁡n)2)V_n=O_p((\log n)^2) in dimension 2. Furthermore, if the offspring distribution is non-degenerate then P(Vn≥δlog⁡n∣Gn)→1P(V_n\geq δ\log n | G_{n})\to 1 for some δ>0δ>0. (2) Let Mn(j)M_{n} (j) be the number of multiplicity-jj sites in the nnth generation, that is, sites occupied by exactly jj particles. In dimensions 3 and higher, the random variables Mn(j)/nM_{n} (j)/n converge jointly to multiples of an exponential random variable. (3) In dimension 2, the number of particles at a "typical" site (that is, at the location of a randomly chosen particle of the nnth generation) is of order Op(log⁡n)O_p(\log n), and the number of occupied sites is Op(n/log⁡n)O_p(n/\log n).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.