Crossing estimates from metric graph and discrete GFF
From MaRDI portal
Publication:2157459
DOI10.1214/21-AIHP1204zbMath1492.60271arXiv2001.06447MaRDI QIDQ2157459
Jian Ding, Hao Wu, Mateo Wirth
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
Random fields (60G60) Gaussian processes (60G15) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Level lines of Gaussian free field. I: Zero-boundary GFF.
- Contour lines of the two-dimensional discrete Gaussian free field
- From loop clusters and random interlacements to the free field
- Percolation for level-sets of Gaussian free fields on metric graphs
- On extensions of the Brunn-Minkowski and Prekopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation
- 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
- Scaling limits of crossing probabilities in metric graph GFF
- The first passage sets of the 2D Gaussian free field: convergence and isomorphisms
- Basic properties of SLE
- Random Walk: A Modern Introduction
This page was built for publication: Crossing estimates from metric graph and discrete GFF
