A random walk that reflects off the boundary at infinity yields new algorithmic constructions of the free uniform spanning forest and a conjectural embedding framework for supercritical Liouville quantum gravity.
The Dirichlet problem for orthodiagonal maps
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as the mesh size goes to 0. This provides a convergence statement for discrete holomorphic functions, similar to the one obtained by Chelkak and Smirnov for isoradial graphs. We observe that by the double circle packing theorem, any finite, simple, 3-connected planar map admits an orthodiagonal representation. Our result improves the work of Skopenkov and Werness by dropping all regularity assumptions required in their work and providing effective bounds. In particular, no bound on the vertex degrees is required. Thus, the result can be applied to models of random planar maps that with high probability admit orthodiagonal representation with mesh size tending to 0. In a companion paper, we show that this can be done for the discrete mating-of-trees random map model of Duplantier, Gwynne, Miller and Sheffield.
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Random walk reflected off of infinity, with applications to uniform spanning forests and supercritical Liouville quantum gravity
A random walk that reflects off the boundary at infinity yields new algorithmic constructions of the free uniform spanning forest and a conjectural embedding framework for supercritical Liouville quantum gravity.