On coupling and ``Vacant set level set percolation
From MaRDI portal
Publication:2631815
DOI10.1214/19-ECP217zbMATH Open1412.60135arXiv1807.10719OpenAlexW2884087685MaRDI QIDQ2631815FDOQ2631815
Publication date: 16 May 2019
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Abstract: In this note we discuss vacant set level set percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ coupling and derive a stochastic domination from which we deduce in a rather general set-up a certain monotonicity property of the percolation function. In the case of regular trees this stochastic domination leads to a strict inequality between some eigenvalues related to Ornstein-Uhlenbeck semi-groups for which we have no direct analytical proof. It underpins a certain strict monotonicity property that has significant consequences for the percolation diagram. It is presently open whether a similar looking diagram holds in the case of Z^d, with d bigger or equal to 3.
Full work available at URL: https://arxiv.org/abs/1807.10719
Recommendations
- Interlacement percolation on transient weighted graphs
- Coupling and an application to level-set percolation of the Gaussian free field
- Level-set percolation for the Gaussian free field on a transient tree
- Decoupling inequalities and interlacement percolation on \(G\times \mathbb Z\)
- Percolation for the vacant set of random interlacements
Gaussian processes (60G15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Cites Work
- Title not available (Why is that?)
- Interlacement percolation on transient weighted graphs
- An Introduction to Random Interlacements
- Markov Processes, Gaussian Processes, and Local Times
- Coupling and an application to level-set percolation of the Gaussian free field
- An isomorphism theorem for random interlacements
- Volume growth and stochastic completeness of graphs
- From loop clusters and random interlacements to the free field
- Inverting Ray-Knight identity
- Level-set percolation for the Gaussian free field on a transient tree
- The sign clusters of the massless Gaussian free field percolate on \(\mathbb{Z}^{d}\), \(d \geqslant 3\) (and more)
- Exponential concentration of cover times
- Inverting the coupling of the signed Gaussian free field with a loop-soup
Cited In (4)
- Interlacement percolation on transient weighted graphs
- Level-set percolation of the Gaussian free field on regular graphs II: finite expanders
- Percolation for two-dimensional excursion clouds and the discrete Gaussian free field
- Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees
This page was built for publication: On coupling and ``Vacant set level set percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631815)
