Crossing estimates from metric graph and discrete GFF

DOI10.1214/21-AIHP1204MaRDI QIDQ2157459zbMATH OpenFDO

Authors Jian Ding, Mateo Wirth, Hao Wu

Publication date 22 July 2022

Published in Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.06447

zbMATH Keywords

Gaussian free fieldscaling limitcrossing eventpivotal edge

Mathematics Subject Classification ID

Gaussian processes (60G15) Random fields (60G60) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We compare level-set percolation for Gaussian free fields (GFFs) defined on a rectangular subset of $deltamathbb{Z}^2$ to level-set percolation for GFFs defined on the corresponding metric graph as the mesh size $delta$ goes to 0. In particular, we look at the probability that there is a path that crosses the rectangle in the horizontal direction on which the field is positive. We show this probability is strictly larger in the discrete graph. In the metric graph case, we show that for appropriate boundary conditions the probability that there exists a closed pivotal edge for the horizontal crossing event decays logarithmically in $delta$. In the discrete graph case, we compute the limit of the probability of a horizontal crossing for appropriate boundary conditions.

Recommendations

• Scaling limits of crossing probabilities in metric graph GFF
• Percolation for level-sets of Gaussian free fields on metric graphs
• The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph
• Disconnection and level-set percolation for the Gaussian free field
• Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees

Cites work

• scientific article; zbMATH DE number 1817636 (Why is no real title available?)
• scientific article; zbMATH DE number 1245556 (Why is no real title available?)
• Basic properties of SLE
• Chemical distances for percolation of planar Gaussian free fields and critical random walk loop soups
• Contour lines of the two-dimensional discrete Gaussian free field
• From loop clusters and random interlacements to the free field
• Level lines of Gaussian free field. I: Zero-boundary GFF.
• On extensions of the Brunn-Minkowski and Prekopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation
• Percolation for level-sets of Gaussian free fields on metric graphs
• Random walk: A modern introduction
• Scaling limits of crossing probabilities in metric graph GFF
• The first passage sets of the 2D Gaussian free field: convergence and isomorphisms
• The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph

Cited in

(7)

• Percolation for level-sets of Gaussian free fields on metric graphs
• Perturbations of multiple Schramm-Loewner evolution with two non-colliding Dyson Brownian motions
• 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
• Scaling limits of crossing probabilities in metric graph GFF
• The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph
• Disconnection and level-set percolation for the Gaussian free field

This page was built for publication: Crossing estimates from metric graph and discrete GFF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2157459)