Connectivity properties of Branching Interlacements

zbMath1406.60121arXiv1612.00406MaRDI QIDQ4623162

Eviatar B. Procaccia, Yuan Zhang

Publication date: 14 February 2019

Full work available at URL: https://arxiv.org/abs/1612.00406

zbMATH Keywords

branching random walkbranching interlacements

Mathematics Subject Classification ID

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

Related Items (1)

The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)

Cites Work

• Geometry of the random interlacement
• 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
• Parabolic Harnack inequality and estimates of Markov chains on graphs
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Connectivity properties of random interlacement and intersection of random walks
• Random Walk: A Modern Introduction

This page was built for publication: Connectivity properties of Branching Interlacements