Pith. sign in

REVIEW 1 cited by

On the critical branching random walk II: Branching capacity and branching recurrence

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1612.00161 v2 pith:NIJGYG47 submitted 2016-12-01 math.PR

Qingsan Zhu This is my paper · ORCID
classification math.PR
keywords branchingcapacitycriticalrandomrecurrencewalkanalogouscontinue
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We continue our study of critical branching random walk and branching capacity. In this paper we introduce branching recurrence and branching transience and prove an analogous version of Wiener's Test.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    math.PR 2025-12 conditional novelty 7.0 of 10

    Conditioned on hitting a distant set K, the total occupation time of a critical branching random walk is of order ||x||^{4-d} for d≤3, log||x|| for d=4, and bounded for d≥5, with explicit weak limits in all dimensions.

Pith tools