Connectivity properties of branching interlacements

MaRDI QIDQ4623162zbMATH OpenFDO

Authors Eviatar B. Procaccia, Yuan Zhang

Publication date 14 February 2019

Full work available at URL https://arxiv.org/abs/1612.00406, http://alea.impa.br/articles/v16/16-10.pdf

zbMATH Keywords

branching interlacementsbranching random walk

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random measures (60G57) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: We consider connectivity properties of the Branching Interlacements model in $mathbb{Z}^d,dge5$, 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 $lceild/4ceil$ 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 $5ledle8$. 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.

Recommendations

• Connectivity properties of random interlacement and intersection of random walks
• Geometry of the random interlacement
• Connectivity bounds for the vacant set of random interlacements
• On the critical parameter of interlacement percolation in high dimension
• Intersection-equivalence of Brownian paths and certain branching processes

Cites work

• Connectivity properties of random interlacement and intersection of random walks
• Geometry of the random interlacement
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Parabolic Harnack inequality and estimates of Markov chains on graphs
• Random walk: A modern introduction
• Recurrence of the \(\mathbb{Z}^d\)-valued infinite snake via unimodularity
• The range of tree-indexed random walk in low dimensions
• Vacant set of random interlacements and percolation

Cited in

(5)

• The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
• Connectivity properties of random interlacement and intersection of random walks
• Geometry of the random interlacement
• CONNECTIVITY PROPERTIES OF SIERPIŃSKI RELATIVES
• Time spent in a ball by a critical branching random walk

This page was built for publication: Connectivity properties of branching interlacements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4623162)