Scaling-limit conjecture for the metric-graph GFF local-time distance and CLE4_4

From papers

Let DD be an open bounded simply connected domain of C\mathbb{C}. Let DεD^\varepsilon be a fine-mesh approximation of DD, AεA^{\varepsilon} the approximation of the boundary D\partial D, and ϕ~ε\tilde{\phi}^{\varepsilon} the metric graph GFF on DεD^\varepsilon with zero boundary condition on AεA^{\varepsilon}. Let δx,A(ϕ~ε)\delta_{x,A}(\tilde{\phi}^{\varepsilon}) denote the local-time distance from xx to AA. Scaling-limit conjecture. As ε0\varepsilon\to 0, the local-time distance δx,A(ϕ~ε)\delta_{x,A}(\tilde{\phi}^{\varepsilon}), jointly with the outermost sign clusters of ϕ~ε\tilde{\phi}^{\varepsilon}, converges to the time parameters t(Γ)t(\Gamma) on CLE4{\rm CLE}_4. This conjecture proposes that the second coupling between the Gaussian free field and CLE4{\rm CLE}_4 arises as the scaling limit of the metric-graph pseudo-metric construction; the source provides no resolution, so the convergence remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Titus Lupu and Wendelin Werner, “The random pseudo-metric on a graph defined via the zero-set of the Gaussian free field on its metric graph”, arXiv:1607.06424 (2017).

Solutions 0

No solutions have been posted yet.