High-dimensional critical percolation and critical Branching random walks are intersection equivalent

arXiv:2610.37133 · math.PR · Submitted 2026-10-27 · Read on arXiv

math.PR

Submitted: 2026-10-27

Updated: 2026-10-27

Comments: 22p. No use of AI

License: http://creativecommons.org/licenses/by/4.0/

The gist: We prove that on Z d, with d>6, and under the usual assumption that the two-point function and the Green's function are of the same order…

Abstract

We prove that on Z d, with d>6, and under the usual assumption that the two-point function and the Green's function are of the same order, the probabilities to hit any finite set for a critical Branching random walk starting from the origin and the critical percolation cluster of the origin are within a positive multiplicative constant one from each other, as long as the set is sufficiently far away from the origin comparatively to its diameter. The proof relies on the introduction of a truncated equilibrium measure in percolation and the derivation of an approximate last passage formula.

Related papers