Level-set percolation for the Gaussian free field on a transient tree
From MaRDI portal
(Redirected from Publication:1635965)
Abstract: We investigate level-set percolation of the Gaussian free field on transient trees, for instance on super-critical Galton-Watson trees conditioned on non-extinction. Recently developed Dynkin-type isomorphism theorems provide a comparison with percolation of the vacant set of random interlacements, which is more tractable in the case of trees. If and denote the respective (non-negative) critical values of level-set percolation of the Gaussian free field and of the vacant set of random interlacements, we show here that in a broad enough set-up, but provide an example where occurs. We also obtain some sufficient conditions ensuring that .
Recommendations
- Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees
- Coupling and an application to level-set percolation of the Gaussian free field
- Level set percolation for random interlacements and the Gaussian free field
- Phase transition and level-set percolation for the Gaussian free field
- The sign clusters of the massless Gaussian free field percolate on \(\mathbb{Z}^{d}\), \(d \geqslant 3\) (and more)
Cites work
- An Introduction to Random Interlacements
- An isomorphism theorem for random interlacements
- Coupling and an application to level-set percolation of the Gaussian free field
- Exponential concentration of cover times
- From loop clusters and random interlacements to the free field
- From random walk trajectories to random interlacements
- High-dimensional asymptotics for percolation of Gaussian free field level sets
- Interlacement percolation on transient weighted graphs
- Inverting Ray-Knight identity
- Percolation in strongly correlated systems: The massless Gaussian field
- Phase transition and level-set percolation for the Gaussian free field
- Probability on trees and networks
- RANDOM ELECTRICAL NETWORKS ON COMPLETE GRAPHS
- Random interlacements on Galton-Watson trees
- Random walks and percolation on trees
- Random walks, capacity and percolation on trees
- Topics in occupation times and Gaussian free fields
- Volume growth and stochastic completeness of graphs
Cited in
(16)- Level set percolation for random interlacements and the Gaussian free field
- On coupling and ``Vacant set level set percolation
- Some percolations involving the Gaussian free fields
- Coupling and an application to level-set percolation of the Gaussian free field
- Analyticity of Gaussian free field percolation observables
- Generating Galton-Watson trees using random walks and percolation for the Gaussian free field
- 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
- Giant component for the supercritical level‐set percolation of the Gaussian free field on regular expander graphs
- Percolation for the Gaussian free field on the cable system: counterexamples
- Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs
- Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees
- Phase transition for level-set percolation of the membrane model in dimensions \(d \geq 5\)
- The sign clusters of the massless Gaussian free field percolate on \(\mathbb{Z}^{d}\), \(d \geqslant 3\) (and more)
- Cluster capacity functionals and isomorphism theorems for Gaussian free fields
- Isomorphism theorems, extended Markov processes and random interlacements
This page was built for publication: Level-set percolation for the Gaussian free field on a transient tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1635965)