Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees
From MaRDI portal
(Redirected from Publication:782808)
Abstract: We study level-set percolation of the Gaussian free field on the infinite -regular tree for fixed . Denoting by the critical value, we obtain the following results: for we derive estimates on conditional exponential moments of the size of a fixed connected component of the level set above level ; for we prove that the number of vertices connected over distance above level to a fixed vertex grows exponentially in with positive probability. Furthermore, we show that the percolation probability is a continuous function of the level , at least away from the critical value . Along the way we also obtain matching upper and lower bounds on the eigenfunctions involved in the spectral characterisation of the critical value and link the probability of a non-vanishing limit of the martingale used therein to the percolation probability. A number of the results derived here are applied in the accompanying paper [AC2].
Recommendations
- Level-set percolation of the Gaussian free field on regular graphs II: finite expanders
- Level-set percolation for the Gaussian free field on a transient tree
- Percolation for level-sets of Gaussian free fields on metric graphs
- Coupling and an application to level-set percolation of the Gaussian free field
- Phase transition and level-set percolation for the Gaussian free field
Cites work
- scientific article; zbMATH DE number 2001586 (Why is no real title available?)
- Coupling and an application to level-set percolation of the Gaussian free field
- Disconnection and level-set percolation for the Gaussian free field
- Disconnection by level sets of the discrete Gaussian free field and entropic repulsion
- Entropic repulsion for the Gaussian free field conditioned on disconnection by level-sets
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Interlacement percolation on transient weighted graphs
- Level-set percolation for the Gaussian free field on a transient tree
- Local picture and level-set percolation of the Gaussian free field on a large discrete torus
- On coupling and ``Vacant set level set percolation
- On decoupling inequalities and percolation of excursion sets of the Gaussian free field
- Percolation in strongly correlated systems
- Percolation in strongly correlated systems: The massless Gaussian field
- Phase transition and level-set percolation for the Gaussian free field
- Random Walks on Infinite Graphs and Groups
- The sign clusters of the massless Gaussian free field percolate on \(\mathbb{Z}^{d}\), \(d \geqslant 3\) (and more)
Cited in
(16)- High-dimensional asymptotics for percolation of Gaussian free field level sets
- Analyticity of Gaussian free field percolation observables
- Coupling and an application to level-set percolation of the Gaussian free field
- Equality of critical parameters for percolation of Gaussian free field level sets
- Finite-energy infinite clusters without anchored expansion
- Level-set percolation of the Gaussian free field on regular graphs II: finite expanders
- Generating Galton-Watson trees using random walks and percolation for the Gaussian free field
- Disconnection and level-set percolation for the Gaussian free field
- Level-set percolation for the Gaussian free field on a transient tree
- Percolation for the Gaussian free field on the cable system: counterexamples
- Local picture and level-set percolation of the Gaussian free field on a large discrete torus
- Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs
- Cluster capacity functionals and isomorphism theorems for Gaussian free fields
- Percolation for level-sets of Gaussian free fields on metric graphs
- Giant component for the supercritical level‐set percolation of the Gaussian free field on regular expander graphs
- Crossing estimates from metric graph and discrete GFF
This page was built for publication: Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782808)