An improved decoupling inequality for random interlacements
From MaRDI portal
Abstract: In this paper we obtain a decoupling feature of the random interlacements process , at level , . More precisely, we show that the trace of the random interlacements process on two disjoint finite sets, and its translated , can be coupled with high probability of success, when is large, with the trace of a process of independent excursions, which we call the noodle soup process. As a consequence, we obtain an upper bound on the covariance between two -valued functions depending on the configuration of the random interlacements on and , respectively. This improves a previous bound obtained by Sznitman in [12].
Recommendations
Cites work
- An Introduction to Random Interlacements
- Biased random walks on the interlacement set
- Conditional decoupling of random interlacements
- Cover levels and random interlacements
- From random walk trajectories to random interlacements
- On decoupling inequalities and percolation of excursion sets of the Gaussian free field
- On large deviations for the cover time of two-dimensional torus
- On uniform closeness of local times of Markov chains and i.i.d. sequences
- Random walk: A modern introduction
- Russo's formula for random interlacements
- Soft local times and decoupling of random interlacements
- Vacant set of random interlacements and percolation
Cited in
(5)
This page was built for publication: An improved decoupling inequality for random interlacements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283173)