Recognition: unknown
On the critical branching random walk II: Branching capacity and branching recurrence
classification
🧮 math.PR
keywords
branchingcapacitycriticalrandomrecurrencewalkanalogouscontinue
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Multipoint connectivity in the branching interlacement process
In the branching interlacement model, k points are connected almost surely by at most ceil(d(k-1)/4) - (k-2) trajectories, and this bound is tight.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.