Related papers: Mapping between Spin-Glass Three-Dimensional (3D) …
If we have a system of binary variables and we measure the pairwise correlations among these variables, then the least structured or maximum entropy model for their joint distribution is an Ising model with pairwise interactions among the…
The Ising spin-glass model on the three-dimensional (d=3) hierarchical lattice with long-range ferromagnetic or spin-glass interactions is studied by the exact renormalization-group solution of the hierarchical lattice. The chaotic…
Recent numerical simulations indicate that several different equilibrium glass transitions may be characterized by diverging correlation lengths, and that these divergences are described by a non-mean-field, Ising-like, critical exponent. I…
In this work, we study and evaluate the impact of a periodic spin-lattice coupling in an Ising-like system on a 2D triangular lattice. Our proposed simple Hamiltonian considers this additional interaction as an effect of preferential phonon…
The structural phase transitions and computational complexity of random 3-SAT instances are traditionally described using thermodynamic analogies from statistical physics, such as Replica Symmetry Breaking and energy landscapes. While…
Spin-1/2 antiferromagnetic triangular lattice models are paradigms of geometrical frustration, revealing very different ground states and quantum effects depending on the nature of anisotropies in the model. Due to strong spin orbit…
There is no an exact solution to three-dimensional (3D) finite-size Ising model (referred to as the Ising model hereafter for simplicity) and even two-dimensional (2D) Ising model with non-zero external field to our knowledge. Here by using…
Using Monte Carlo simulations, we have studied aging phenomena in three-dimensional Gaussian Ising spin-glass model focusing on quasi-equilibrium behavior of the spin auto-correlation functions. Weak violation of the time translational…
This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler. Through the analysis of the SAT problem using the elements,…
Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\geq 3$) implies efficient solutions to a large number of hard optimization problems…
We study the $\pm J$ three-dimensional Ising model with a longitudinal anisotropic bond randomness on the simple cubic lattice. The random exchange interaction is applied only in the $z$ direction, whereas in the other two directions, $xy$…
We define a 2-dimensional Ising model on a triangulated sphere, $\mathbb S^2$, designed to approach the exact conformal field theory (CFT) in the continuum limit. Surprisingly, the derivation leads to a set of geometric constraints that the…
Using Monte Carlo simulations (MCS) and the Migdal-Kadanoff approximation (MKA), Marinari et al. study in their comment on our paper the link overlap between two replicas of a three-dimensional Ising spin glass in the presence of a coupling…
We study constrained percolation models on planar lattices including the $[m,4,n,4]$ lattice and the square tilings of the hyperbolic plane, satisfying certain local constraints on faces of degree 4, and investigate the existence of…
Motivated by recent experiments, we investigate the spin-1/2 XXZ model on the triangular lattice with strong Ising anisotropy, combining large-scale numerical simulations and analytical methods to uncover unconventional spin dynamics.…
Spin glasses are frustrated magnetic systems due to a random distribution of ferro- and antiferromagnetic interactions. An experimental three dimensional (3d) spin glass exhibits a second order phase transition to a low temperature spin…
We discuss a geometrical interpretation of the Z-invariant Ising model in terms of isoradial embeddings of planar lattices. The Z-invariant Ising model can be defined on an arbitrary planar lattice if and only if certain paths on the…
The Boolean Satisfiability Problem is perhaps one of the most well-known problems in theoretical computer science. On the one hand, it is proven to be NP-complete, which means that it is generally considered hard to solve. On the other…
The leading irrelevant perturbation, which controls the deviation of critical square lattice Ising model with periodic boundary conditions from its continuous CFT analog is identified. An explicit expression for the coupling constant in…
The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…