Connectivity properties of random interlacement and intersection of random walks

MaRDI QIDQ2863798zbMATH OpenFDO

Authors Balázs Ráth, Artem Sapozhnikov

Publication date 4 December 2013

Published in ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.4711, http://alea.impa.br/articles/v9/09-03.pdf

zbMATH Keywords

random walkcapacityrandom interlacementWiener testintersection of random walks

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Abstract: We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least one of these trajectories is the random interlacement at level u of Sznitman arXiv:0704.2560 . We prove that for any u>0, almost surely, (1) any two vertices in the random interlacement at level u are connected via at most ceiling(d/2) trajectories of the point process, and (2) there are vertices in the random interlacement at level u which can only be connected via at least ceiling(d/2) trajectories of the point process. In particular, this implies the already known result of Sznitman arXiv:0704.2560 that the random interlacement at level u is connected.

Recommendations

• Geometry of the random interlacement
• On the transience of random interlacements
• On the easiest way to connect \(k\) points in the random interlacements process
• Connectivity properties of branching interlacements
• Percolation for the vacant set of random interlacements

Cited in

(24)

• On the percolative properties of the intersectionof two independent interlacements
• Transience of the vacant set for near-critical random interlacements in high dimensions
• The chemical distance in random interlacements in the low-intensity regime
• On the transience of random interlacements
• Capacity of the range of random walk on \(\mathbb {Z}^d\)
• Geometry of the random interlacement
• Random interlacements and amenability
• On chemical distances and shape theorems in percolation models with long-range correlations
• Percolative properties of Brownian interlacements and its vacant set
• On scaling limits and Brownian interlacements
• Capacity of the range of random walk on \(\mathbb{Z}^{4}\)
• The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
• Connectivity properties of branching interlacements
• On the easiest way to connect \(k\) points in the random interlacements process
• On questions of uniqueness for the vacant set of Wiener sausages and Brownian interlacements
• Visibility in the vacant set of the Brownian interlacements and the Brownian excursion process
• Percolation of worms
• The effect of small quenched noise on connectivity properties of random interlacements
• Percolation for the finitary random interlacements of random spherical harmonics
• First passage percolation, local uniqueness for interlacements and capacity of random walk
• Disconnection, random walks, and random interlacements
• Some intersection properties of random walk paths
• Shape theorem and surface fluctuation for Poisson cylinders
• On the exact orders of critical value in finitary random interlacements

This page was built for publication: Connectivity properties of random interlacement and intersection of random walks

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