The Dirichlet problem for orthodiagonal maps

Ori Gurel-Gurevich, Daniel C. Jerison, Asaf Nachmias*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 [4] for isoradial graphs. We observe that by the double circle packing theorem [3], any finite, simple, 3-connected planar map admits an orthodiagonal representation. Our result improves the work of Skopenkov [41] and Werness [47] 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 [21], we show that this can be done for the discrete mating-of-trees random map model of Duplantier, Gwynne, Miller and Sheffield [15,25].

Original languageAmerican English
Article number107379
JournalAdvances in Mathematics
Volume374
DOIs
StatePublished - 18 Nov 2020

Bibliographical note

Publisher Copyright:
© 2020 Elsevier Inc.

Keywords

  • Circle packing
  • Planar map
  • Random walk

Fingerprint

Dive into the research topics of 'The Dirichlet problem for orthodiagonal maps'. Together they form a unique fingerprint.

Cite this