From loop clusters and random interlacement to the free field

Abstract

It was shown by Le Jan that the occupation field of a Poisson ensemble of Markov loops ("loop soup") of parameter one-half associated to a transient symmetric Markov jump process on a network is half the square of the Gaussian free field on this network. We construct a coupling between these loops and the free field such that an additional constraint holds: the sign of the free field is constant on each cluster of loops. As a consequence of our coupling we deduce that the loop clusters of parameter one-half do not percolate on periodic lattices. We also construct a coupling between the random interlacement on ${\mathbb{Z}}^d$, $d\ge 3$, introduced by Sznitman, and the Gaussian free field on the lattice such that the set of vertices visited by the interlacement is contained in a level set of the free field. We deduce an inequality between the critical level for the percolation by level sets of the free field and the critical parameter for the percolation of the vacant set of the random interlacement. Both in the case of loops and of the random interlacement, the couplings are constructed by replacing discrete graphs by metric graphs. Le Jan's and Sznitman's isomorphism theorems between the Gaussian free field and the occupation field of trajectories can be extended to the metric graph setting on which the intermediate value principle for continuous fields holds.

Author's version, 25 pages, 1 figure. Compared to the version published in AOP, this one contains a detailed argument that was missing in the proof of Proposition 4.2. The bibliography has also been updated and some typos have been corrected

References in corpus (1)

• Markovian loop clusters on graphs

Cited by in corpus (34)

• On decoupling inequalities and percolation of excursion sets of the Gaussian free field
• Equality of critical parameters for percolation of Gaussian free field level-sets
• Convergence of the two-dimensional random walk loop soup clusters to CLE
• Critical exponents for a percolation model on transient graphs
• Decomposition of Brownian loop-soup clusters
• Existence of phase transition for percolation using the Gaussian Free Field
• The sign clusters of the massless Gaussian free field percolate on ${\mathbb{Z}}^d$, $d⩾3$ (and more)
• The first passage sets of the 2D Gaussian free field: convergence and isomorphisms
• On the radius of Gaussian free field excursion clusters
• On macroscopic holes in some supercritical strongly dependent percolation models
• Height function delocalisation on cubic planar graphs
• Self-adjoint and Markovian extensions of infinite quantum graphs
• Geometry of Gaussian free field sign clusters and random interlacements
• Cluster capacity functionals and isomorphism theorems for Gaussian free fields
• An elementary proof of phase transition in the planar XY model
• Level-set percolation for the Gaussian free field on a transient tree
• The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph
• Covariant Symanzik identities
• Exceptional points of two-dimensional random walks at multiples of the cover time
• Inverting the coupling of the signed Gausssian free field with a loop soup
• Disconnection and entropic repulsion for the harmonic crystal with random conductances
• Loop percolation on discrete half-plane
• Percolation for the Gaussian free field on the cable system: counterexamples
• The trunks of CLE(4) explorations
• Inverting the Ray-Knight identity on the line
• On coupling and vacant set level set percolation
• Generating Galton-Watson trees using random walks and percolation for the Gaussian free field
• Percolation for two-dimensional excursion clouds and the discrete Gaussian free field
• Villain action in lattice gauge theory
• Divide and color representations for threshold Gaussian and stable vectors
• Crossing exponent in the Brownian loop soup
• A Ray-Knight theorem for $\nabla \varphi$ interface models and scaling limits
• 1+O(1) asymptotics for loop percolation in five and higher dimensions
• Inverting Ray-Knight identities on trees