Related papers: Crossing estimates for the Ising model on general …

We discuss the notion of s-embeddings $\mathcal{S}=\mathcal{S}_\mathcal{X}$ of planar graphs carrying a nearest-neighbor Ising model. The construction of $\mathcal{S}_\mathcal{X}$ is based upon a choice of a global complex-valued solution…

We prove Russo-Seymour-Welsh-type uniform bounds on crossing probabilities for the FK Ising model at criticality, independent of the boundary conditions. Our proof relies mainly on Smirnov's fermionic observable for the FK Ising model,…

We consider the FK-Ising model in two dimensions at criticality. We obtain bounds on crossing probabilities of arbitrary topological rectangles, uniform with respect to the boundary conditions, generalizing results of [DCHN11] and [CS12].…

This paper is devoted to the proof of uniform H\"older and Lipschitz estimates close to oscillating boundaries, for divergence form elliptic systems with periodically oscillating coefficients. Our main point is that no structure is assumed…

We prove convergence of the 2- and 4-point fermionic observables of the FK-Ising model on simply connected domains discretised by a planar isoradial lattice in massive (near-critical) scaling limit. The former is alternatively known as a…

We prove a Russo-Seymour-Welsh theorem for large and natural perturbative families of discrete percolation models that do not necessarily satisfy the Fortuin-Kasteleyn-Ginibre condition of positive association. In particular, we prove the…

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…

In this essay, we briefly discuss recent developments, started a decade ago in the seminal work of Smirnov and continued by a number of authors, centered around the conformal invariance of the critical planar Ising model on $\mathbb{Z}^2$…

Using the formalism of differential equations, we introduce a new method to continuously deform the $s$-embeddings associated with a family of Ising models as their coupling constants vary. This provides a geometric interpretation of the…

The OSSS inequality [O'Donnell, Saks, Schramm and Servedio, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), Pittsburgh (2005)] gives an upper bound for the variance of a function f of independent 0-1 valued random…

We show on non-flat but critical s-embeddings the celebrated convergence of the interface curves of the critical FK Ising model to an $\operatorname{SLE}_{16/3}$ curve, using discrete complex analytic techniques first used in…

We establish uniform Lipschitz estimates for second-order elliptic systems in divergence form with rapidly oscillating, almost-periodic coefficients. We give interior estimates as well as estimates up to the boundary in bounded…

The mean field approximation to the Ising model is a canonical variational tool that is used for analysis and inference in Ising models. We provide a simple and optimal bound for the KL error of the mean field approximation for Ising models…

We consider the problem of learning the structure of ferromagnetic Ising models Markov on sparse Erdos-Renyi random graph. We propose simple local algorithms and analyze their performance in the regime of correlation decay. We prove that an…

We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…

We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the Poisson Voronoi triangulation in the plane.…

The Nash-Kuiper Theorem states that the collection of $C^1$-isometric embeddings from a Riemannian manifold $M^n$ into $\mathbb{E}^N$ is $C^0$-dense within the collection of all smooth 1-Lipschitz embeddings provided that $n < N$. This…

We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest…

We study the problem of testing and recovering $k$-clique Ferromagnetic mean shift in the planted Sherrington-Kirkpatrick model (i.e., a type of spin glass model) with $n$ spins. The planted SK model -- a stylized mixture of an uncountable…

We present a resummed mean-field approximation for inferring the parameters of an Ising or a Potts model from empirical, noisy, one- and two-point correlation functions. Based on a resummation of a class of diagrams of the small correlation…