论文部分内容阅读
We consider connectivity properties of the Branching Interlacements model in Zd,d≥ 5,recently defined by Angel,Rath and Zhu.Using stochastic dimension techniques we show that every two vertices visited by the branching interlacements are connected via at most[d/4] conditioned critical branching random walks from the underlying Poisson process,and that this upper bound is sharp.