English

A Polynomial Rate of Convergence for the Dirichlet Problem on Orthodiagonal Maps

Probability 2025-03-27 v1 Analysis of PDEs Complex Variables

Abstract

We extend recent work of Gurel-Gurevich--Jerison--Nachmias (2020) and Bou-Rabee--Gwynne (2024) by showing that as the mesh of our lattice tends to 00, we have a polynomial rate of convergence for the Dirichlet problem on orthodiagonal maps with H\"older boundary data to its continuous counterpart. The key idea is that the convolution of a discrete harmonic function on an orthodiagonal map with a smooth mollifier has small Laplacian and so is ``almost harmonic." This also allows us to show that discrete harmonic functions on orthodiagonal maps are Lipschitz in the bulk on a mesoscopic scale.

Keywords

Cite

@article{arxiv.2503.20284,
  title  = {A Polynomial Rate of Convergence for the Dirichlet Problem on Orthodiagonal Maps},
  author = {David Pechersky},
  journal= {arXiv preprint arXiv:2503.20284},
  year   = {2025}
}

Comments

37 pages