Related papers: A Potts/Ising Correspondence on Thin Graphs
We apply the Bethe-Peierls approximation to the problem of the inverse Ising model and show how the linear response relation leads to a simple method to reconstruct couplings and fields of the Ising model. This reconstruction is exact on…
We analyze the effect of adding quenched disorder along a defect line in the 2D conformal minimal models using replicas. The disorder is realized by a random applied magnetic field in the Ising model, by fluctuations in the ferromagnetic…
The study of the Ising model from a percolation perspective has played a significant role in the modern theory of critical phenomena. We consider the celebrated square-lattice Ising model and construct percolation clusters by placing bonds,…
We study the effect of interfacial phenomena in two-dimensional perfect and random (or disordered) $q$-state Potts models with continuous phase transitions, using, mainly, Monte Carlo techniques. In particular, for the total interfacial…
A matchstick graph is a planar unit-distance graph. We call it \emph{4-regular} if every vertex has degree 4. While examples of 4-regular matchstick graphs with fewer than 63 vertices are known only for $n \in \{52, 54, 57, 60\}$, we prove…
We present a rigorous determination of the critical value of the ground-state quantum Ising model in a transverse field, on a class of planar graphs which we call star-like. These include the star graph, which is a junction of several…
We consider the sum of dichromatic polynomials over non-separable rooted planar maps, an interesting special case of which is the enumeration of such maps. We present some known results and derive new ones. The general problem is equivalent…
We discuss the utility of analytical and numerical investigation of spin models, in particular spin glasses, on ordinary ``thin'' random graphs (in effect Feynman diagrams) using methods borrowed from the ``fat'' graphs of two dimensional…
We consider the problem of sampling from the Potts model on random regular graphs. It is conjectured that sampling is possible when the temperature of the model is in the uniqueness regime of the regular tree, but positive algorithmic…
Recently, it has been shown that, when the dimension of a graph turns out to be infinite dimensional in a broad sense, the upper critical surface and the corresponding critical behavior of an arbitrary Ising spin glass model defined over…
We consider the $U_q[SU(2)]$ symmetric Heisenberg chain when $q=e^{i\pi/(m+1)}$ and $m$ is integer. We consider the cases $m=3$ and $m=5$ which correspond to the Ising and 3-state Potts models. We study the finite size scaling (FSS) of the…
We prove that random-cluster models with q larger than 1 on a variety of planar lattices have a sharp phase transition, that is that there exists some parameter p_c below which the model exhibits exponential decay and above which there…
The use of combinatorial optimization algorithms has contributed substantially to the major progress that has occurred in recent years in the understanding of the physics of disordered systems, such as the random-field Ising model. While…
Monte Carlo simulations are performed to study the two-dimensional Potts models with q=3 and 4 states on directed Small-World network. The disordered system is simulated applying the Heat bath Monte Carlo update algorithm. A first-order and…
The two-dimensional $Q$-state Potts model with real couplings has a first-order transition for $Q>4$. We study a loop-model realization in which $Q$ is a continuous parameter. This model allows for the collision of a critical and a…
We examine Ising models with heat-bath dynamics on directed networks. Our simulations show that Ising models on directed triangular and simple cubic lattices undergo a phase transition that most likely belongs to the Ising universality…
Given an infinite graph $\GI$ quasi-transitive and amenable with maximum degree $\D$, we show that reduced ground state degeneracy per site $W_r(\GI,q)$ of the q-state antiferromagnetic Potts model at zero temperature on $\GI$ is analytic…
We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…
The critical behaviour of a bond-disordered Ashkin-Teller model on a square lattice is investigated by intensive Monte-Carlo simulations. A duality transformation is used to locate a critical plane of the disordered model. This critical…
Let $G$ be a finite simple graph on the vertex set $V(G)$ and let $\text{ind-match}(G)$, $\text{min-match}(G)$ and $\text{match}(G)$ denote the induced matching number, the minimum matching number and the matching number of $G$,…