Metric scaling limits of critical FK planar maps
A critical Fortuin–Kasteleyn map is a random planar graph weighted by a random-cluster model. After rescaling graph distances and giving vertices their degree-weighted probability measure, does the whole finite map approach a Liouville quantum gravity sphere?
Why it matters and what counts as progress
Why it matters: A map encoding can converge while shortest paths on the map behave differently. Joint convergence identifies both the limiting metric and the limiting area.
What counts as progress: Specify the map ensemble, the cluster parameter, the distance rescaling and the vertex measure. Prove joint metric-measure convergence in the claimed range.
How the problem developed
- 2 Feb 2015 · Encoding and loop statistics [1]
Ewain Gwynne, Cheng Mao and Xin Sun Established scaling of cone times and associated loop-component area and boundary-length statistics in the FK encoding.
- 6 Oct 2026 · Reported metric-measure convergence [2]
OpenAI’s internal model The paper claims joint metric-measure convergence of finite critical FK planar maps at fixed and uniform spanning-tree-decorated spherical maps to unit-area Liouville quantum gravity spheres in Gromov–Hausdorff–Prokhorov law. Distances use all primal edges, and the vertex measure is proportional to degree.
AI contribution
Metric-measure limits of subcritical FK and spanning-tree planar maps
The paper claims joint metric-measure convergence of finite critical FK planar maps at fixed and uniform spanning-tree-decorated spherical maps to unit-area Liouville quantum gravity spheres in Gromov–Hausdorff–Prokhorov law. Distances use all primal edges, and the vertex measure is proportional to degree.
Sources
Publication history
Metric-measure limits of subcritical FK and spanning-tree planar maps
Daily emails by default, only when there’s an update.