Ising model and s-embeddings of planar graphs
Dmitry Chelkak

TL;DR
This paper introduces s-embeddings for planar graphs with Ising models, providing a framework for analyzing fermionic observables and proving crossing estimates and convergence results in the critical case.
Contribution
It develops a novel s-embedding framework based on fermionic solutions, enabling analysis of Ising models and proving new crossing and convergence results.
Findings
Established a general framework for s-embeddings and fermionic observables.
Proved RSW-type crossing estimates for critical Ising models on doubly periodic graphs.
Demonstrated convergence of fermionic observables with quantitative speed estimates.
Abstract
We discuss the notion of s-embeddings of planar graphs carrying a nearest-neighbor Ising model. The construction of is based upon a choice of a global complex-valued solution of the propagation equation for Kadanoff-Ceva fermions. Each choice of provides an interpretation of all other fermionic observables as s-holomorphic functions on . We set up a general framework for the analysis of such functions on s-embeddings with . Throughout this analysis, a key role is played by the functions associated with , the so-called origami maps in the bipartite dimer model terminology. In particular, we give an interpretation of the mean curvature of the limit of discrete surfaces…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Topological and Geometric Data Analysis · Markov Chains and Monte Carlo Methods
