English

The Dirichlet problem for orthodiagonal maps

Probability 2019-06-05 v1 Complex Variables

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.

Keywords

Cite

@article{arxiv.1906.01613,
  title  = {The Dirichlet problem for orthodiagonal maps},
  author = {Ori Gurel-Gurevich and Daniel C. Jerison and Asaf Nachmias},
  journal= {arXiv preprint arXiv:1906.01613},
  year   = {2019}
}

Comments

44 pages, 11 figures

R2 v1 2026-06-23T09:41:54.519Z