Discrete complex analysis on isoradial graphs
Complex Variables
2011-05-12 v2 Probability
Abstract
We study discrete complex analysis and potential theory on a large family of planar graphs, the so-called isoradial ones. Along with discrete analogues of several classical results, we prove uniform convergence of discrete harmonic measures, Green's functions and Poisson kernels to their continuous counterparts. Among other applications, the results can be used to establish universality of the critical Ising and other lattice models.
Cite
@article{arxiv.0810.2188,
title = {Discrete complex analysis on isoradial graphs},
author = {Dmitry Chelkak and Stanislav Smirnov},
journal= {arXiv preprint arXiv:0810.2188},
year = {2011}
}
Comments
35 pages, 4 figures. Several changes: Sections 2.4-2.6 expanded; Theorem 3.10 added; Section 3.4 rewritten