Kesten's incipient infinite cluster for the three-dimensional, metric-graph Gaussian free field, from critical level-set percolation, and for the Villain model, from random cluster geometries and a Swendsen-Wang type algorithm
Pete Rigas

TL;DR
This paper proves the existence of the incipient infinite cluster (IIC) for the three-dimensional metric-graph Gaussian free field, extending classical percolation results and addressing open problems for the Villain model.
Contribution
It introduces a novel approach to construct the IIC for the 3D metric-graph GFF and the Villain model, building on and streamlining previous percolation and crossing probability techniques.
Findings
Established the IIC for the 3D metric-graph GFF.
Constructed the IIC for the Villain model.
Extended percolation theory to new models in three dimensions.
Abstract
We address one open problem in a recent work due to Ding and Wirth, the first version of which was available in , relating to level-set percolation on metric-graphs for the Gaussian free field in three dimensions, in which it was shown that a percolation estimate that the authors employ for studying connectivity properties of different heights of the metric graph Gaussian free field is bounded above poly-logarithmically. In three dimensions, in order to construct Kesten's incipient infinite cluster which was first seminally introduced for Bernoulli percolation in two dimensions, in , through the equality of two probabilistic quantities, we make use of a streamlined version of the argument due to Basu and Sapozhnikov, which was first made available in , that introduces properties of crossing probabilities for demonstrating that the IIC exists for Bernoulli…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Data Management and Algorithms · Markov Chains and Monte Carlo Methods
