Non triviality of the percolation threshold and Gumbel fluctuations for Branching Interlacements

Abstract

We consider the model of Branching Interlacements, introduced by Zhu, which is a natural analogue of Sznitman's Random Interlacements model, where the random walk trajectories are replaced by ranges of some suitable tree-indexed random walks. We first prove a basic decorrelation inequality for events depending on the state of the field on distinct boxes. We then show that in all relevant dimensions, the vacant set undergoes a nontrivial phase transition regarding the existence of an infinite connected component. Finally we obtain the Gumbel fluctuations for the cover level of finite sets, which is analogous to Belius' result in the setting of Random Interlacements.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…