English

Connectivity properties of Branching Interlacements

Probability 2016-12-02 v1

Abstract

We consider connectivity properties of the Branching Interlacements model in Zd, d5\mathbb{Z}^d,~d\ge5, recently introduced by Angel, R\'ath and Zhu in 2016. Using stochastic dimension techniques we show that every two vertices visited by the branching interlacements are connected via at most d/4\lceil d/4\rceil conditioned critical branching random walks from the underlying Poisson process, and that this upper bound is sharp. In particular every such two branching random walks intersect if and only if 5d85\le d\le 8. The stochastic dimension of branching random walk result is of independent interest. We additionally obtain heat kernel bounds for branching random walks conditioned on survival.

Keywords

Cite

@article{arxiv.1612.00406,
  title  = {Connectivity properties of Branching Interlacements},
  author = {Eviatar B. Procaccia and Yuan Zhang},
  journal= {arXiv preprint arXiv:1612.00406},
  year   = {2016}
}

Comments

32 pages

R2 v1 2026-06-22T17:11:00.898Z