Related papers: Ising model and s-embeddings of planar graphs
We solve a 4-(bond)-vertex model on an ensemble of 3-regular Phi3 planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The method of solution, by mapping onto an Ising model in field, is inspired by…
Given a graph $G$, we form a random subgraph $G_p$ by including each edge of $G$ independently with probability $p$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite…
We discuss infinitesimal isometries of the middle surfaces and present some characteristic conditions for a function to be the normal component of an infinitesimal isometry. Our results show that those characteristic conditions depend on…
We present an intuitive diagrammatic representation of a new class of integrable $\s$-models. It is shown that to any given diagram corresponds an integrable theory that couples $N$ WZW models with a certain number of each of the following…
We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…
We consider an infinite spatial inhomogeneous random graph model with an integrable connection kernel that interpolates nicely between existing spatial random graph models. Key examples are versions of the weight-dependent random connection…
After having introduced the notion of universality in statistical mechanics and its importance for our comprehension of the macroscopic behavior of interacting systems, I review recent progress in the understanding of the scaling limit of…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models,…
We use the cavity method to study parallel dynamics of disordered Ising models on a graph. In particular, we derive a set of recursive equations in single site probabilities of paths propagating along the edges of the graph. These equations…
The S-matrix in the static limit of a dispersion relation has a finite order N and is a matrix of meromorfic functions of energy in the complex plane with cuts. In the elastic case it reduces to N functions connected by the crossing…
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between planar and non-planar interaction graphs, and thus fails to…
We develop an intensive embedding for visualizing the space of all predictions for probabalistic models, using replica theory. Our embedding is isometric (preserves the distinguishability between models) and faithful (yields low-dimensional…
This paper is devoted to a study of $S$-curves, that is systems of curves in the complex plane whose equilibrium potential in a harmonic external field satisfies a special symmetry property ($S$-property). Such curves have many…
The Kac-Ward formula allows to compute the Ising partition function on any finite graph G from the determinant of 2^{2g} matrices, where g is the genus of a surface in which G embeds. We show that in the case of isoradially embedded graphs…
We study the 2-dimensional Ising model at critical temperature on a simply connected subset $\Omega_{\delta}$ of the square grid $\delta\mathbb{Z}^{2}$. The scaling limit of the critical Ising model is conjectured to be described by…
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].…
The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link between matrix models and combinatorics of discrete surfaces has strongly tightened. This manuscript aims to investigate these deep links…
We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…