Paper detail

Yaglom theorem for critical branching random walk on $\mathbb{Z}^d$

We study the critical branching random walk on $\mathbb{Z}^d$ started from a distant point $x$ and conditioned to hit some compact set $K$ in $\mathbb{Z}^d$. We are interested in the occupation time in $K$ and present its asymptotic behaviors in different dimensions. It is shown in this work that the occupation time is of order $\|x\|^{4-d}$ in dimensions $d\leq 3$, of order $\log\|x\|$ in dimension $d=4$, and of order 1 in dimensions $d\geq 5$. The corresponding weak convergences are also established. These results answer a question raised by Le Gall and Merle (Elect. Comm. in Probab. 11 (2006), 252-265).

preprint2025arXivOpen access

Signal facts

What is known right now

Open access2 authors1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

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

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.