Percolation for level-sets of Gaussian free fields on metric graphs
From MaRDI portal
Publication:784175
DOI10.1214/19-AOP1397zbMATH Open1505.60087arXiv1807.11117MaRDI QIDQ784175FDOQ784175
Publication date: 31 July 2020
Published in: The Annals of Probability (Search for Journal in Brave)
Abstract: We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability conditioned on connectivity and the bound is sharp up to a poly-logarithmic factor with an exponent of one-quarter. This substantially improves a previous result by Li and the first author. In three dimensions and higher, we provide rather sharp estimates of percolation probabilities in different regimes which altogether describe a sharp phase transition.
Full work available at URL: https://arxiv.org/abs/1807.11117
Random fields (60G60) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random Walk: A Modern Introduction
- Percolation in strongly correlated systems: The massless Gaussian field
- Phase transition and level-set percolation for the Gaussian free field
- On decoupling inequalities and percolation of excursion sets of the Gaussian free field
- Coupling and an application to level-set percolation of the Gaussian free field
- The incipient infinite cluster in two-dimensional percolation
- First passage sets of the 2D continuum Gaussian free field
- From loop clusters and random interlacements to the free field
- Disconnection and level-set percolation for the Gaussian free field
- High-dimensional asymptotics for percolation of Gaussian free field level sets
- Chemical distances for percolation of planar Gaussian free fields and critical random walk loop soups
- The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph
- The sign clusters of the massless Gaussian free field percolate on \(\mathbb{Z}^{d}\), \(d \geqslant 3\) (and more)
- A 0-1 law for the massive Gaussian free field
- The first passage sets of the 2D Gaussian free field: convergence and isomorphisms
- On macroscopic holes in some supercritical strongly dependent percolation models
- Level set percolation for random interlacements and the Gaussian free field
- Kesten's incipient infinite cluster and quasi-multiplicativity of crossing probabilities
Cited In (15)
- Disconnection and entropic repulsion for the harmonic crystal with random conductances
- Title not available (Why is that?)
- Some percolations involving the Gaussian free fields
- Monotonicity of the probability of percolation for Bernoulli random fields on periodic graphs
- Entropic repulsion for the Gaussian free field conditioned on disconnection by level-sets
- Percolation for two-dimensional excursion clouds and the discrete Gaussian free field
- Cylinders' percolation: decoupling and applications
- Critical exponents for a percolation model on transient graphs
- Percolation for the Gaussian free field on the cable system: counterexamples
- On decoupling inequalities and percolation of excursion sets of the Gaussian free field
- The distance exponent for Liouville first passage percolation is positive
- On the radius of Gaussian free field excursion clusters
- Crossing estimates from metric graph and discrete GFF
- Cluster capacity functionals and isomorphism theorems for Gaussian free fields
- Disconnection and level-set percolation for the Gaussian free field
This page was built for publication: Percolation for level-sets of Gaussian free fields on metric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784175)