Discrete complex analysis on isoradial graphs
classification
🧮 math.CV
math.PR
keywords
discreteanalysiscomplexgraphsisoradialotherresultsalong
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.