Extremal-distance distribution conjecture for first-passage local sets

Let Σ\Sigma be a domain with boundary pieces B1(Σ)B_1(\Sigma), B2(Σ)B_2(\Sigma) and B3(Σ)B_3(\Sigma), and let ΛaΣ\Lambda_a^\Sigma be the minimal local set containing B1(Σ)B_1(\Sigma) whose conditional Gaussian free field has boundary value aa on the local set, value h2h_2 on B2(Σ)ΛaΣB_2(\Sigma)\setminus\Lambda_a^\Sigma, and free boundary condition on B3(Σ)ΛaΣB_3(\Sigma)\setminus\Lambda_a^\Sigma. Assume a<minB1(Σ)h1a<\min_{B_1(\Sigma)}h_1, and let mm be the excursion-measure average of the boundary value h1h_1 on B1(Σ)B_1(\Sigma).

First-passage extremal-distance conjecture. The extremal distance ED(ΛaΣ,B2(Σ))\operatorname{ED}(\Lambda_a^\Sigma,B_2(\Sigma)) is distributed as the last visit time of level aa by a Brownian bridge of length ED(B1(Σ),B2(Σ))\operatorname{ED}(B_1(\Sigma),B_2(\Sigma)) from h2h_2 to mm, with the last visit time defined to be 00 if the bridge never hits aa.

This extends the metric-graph first-passage identity to continuum Gaussian free fields and local sets. The statement is presented as a conjectural scaling-limit consequence of the corresponding metric-graph result; its general continuum validity remains open.

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).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.