Scaling-limit conjecture for the excursion decomposition of the two-dimensional DGFF
Scaling-limit conjecture for the excursion decomposition of the two-dimensional DGFF
Consider lattice graphs converging to a bounded, simply connected domain , and let be the zero-boundary DGFF on converging almost surely to the continuum GFF in, say, . Write for the excursion decompositions of the DGFFs. Let and denote the continuum level-set objects used to describe the GFF excursion decomposition, with the relevant boundary value.
Excursion-decomposition scaling-limit conjecture. The discrete decompositions converge to a decomposition such that the union of outermost positive clusters is given by and the union of outermost negative clusters by . Individual clusters are obtained by taking or in the holes of having sign or , respectively. Recursively, in holes surrounded by a negative cluster, a positive cluster is given by , while holes surrounded by a positive cluster yield negative clusters by taking . Given the clusters, the signs are determined up to a global multiplication by , and the sign-excursion measures are the Minkowski-content measures of in the same gauge as in Theorem.
This conjecture proposes the continuum scaling limit of the excursion decomposition of the discrete two-dimensional GFF, extending the convergence of the field itself to the joint geometry, signs, and measures of its sign-excursion clusters. The source presents it informally and indicates that a precise formulation would parallel an earlier convergence theorem; no resolution is supplied here.
Sources & referencesView supporting material
Primary source
Juhan Aru, Titus Lupu and Avelio Sepúlveda, “Excursion decomposition of the 2D continuum GFF”, arXiv:2304.03150 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.