Related papers: Small-Network Approximations for Geometrically Fru…
We study the frustration properties of the Ising model on several decorated lattices with arbitrary numbers of decorating spins on all bonds of the lattice within an exact analytical approach based on the Kramers--Wannier transfer-matrix…
In this paper, the frustration properties of the Ising model on a one-dimensional monoatomic equidistant lattice in an external magnetic field are investigated, taking into account the exchange interactions of atomic spins at the sites of…
The geometric frustration of the spin-1/2 Ising-Heisenberg model on the triangulated Kagome (triangles-in-triangles) lattice is investigated within the framework of an exact analytical method based on the generalized star-triangle mapping…
We study pairwise Ising models for describing the statistics of multi-neuron spike trains, using data from a simulated cortical network. We explore efficient ways of finding the optimal couplings in these models and examine their…
The low-energy magnetic configurations of artificial frustrated spin chains are investigated using magnetic force microscopy and micromagnetic simulations. Contrary to most studies on two-dimensional artificial spin systems where…
Here is proposed a general subgraph-based method for efficiently sampling certain graphical models, typically using subgraphs of a fixed treewidth, and also a related method for finding minimum energy (ground) states. In the case of models…
We study the frustration properties of the Ising model on a decorated triangular lattice with an arbitrary number of decorating spins on all lattice bonds in the framework of an exact analytical approach based on the Kramers--Wannier…
Here we consider the Ising-Heisenberg model in the expanded Kagom\'e lattice, also known as triangle-dodecagon (3-12) or star lattice. This model can still be understood as a decorated honeycomb lattice. Assuming that the Heisenberg spins…
The past decade has seen the emergence of Ising machines targeting hard combinatorial optimization problems by minimizing the Ising Hamiltonian with spins represented by continuous dynamical variables. However, capabilities of these…
We consider itinerant spinless fermions as moving defects in a dilute two-dimensional frustrated Ising system where they occupy site vacancies. Fermions interact via local spin fluctuations and we analyze coupled self-consistent mean-field…
The properties of the ground state of one of the simplest models of frustrated magnetic systems, a dilute Ising chain in a magnetic field, are considered for all values of the concentration of charged non-magnetic impurities. An analytical…
In random networks decorated with Ising spins, an increase of the density of frustrations reduces the transition temperature of the spin-glass ordering. This result is in contradiction to the Bethe theory. Here we investigate if this effect…
Frustration is a ubiquitous phenomenon in many-body physics that influences the nature of the system in a profound way with exotic emergent behavior. Despite its long research history, the analytical or numerical investigations on…
We propose a novel way of investigating the universal properties of spin systems by coupling them to an ensemble of causal dynamically triangulated lattices, instead of studying them on a fixed regular or random lattice. Somewhat…
We analyze the collective spin noise in interacting spin systems. General expressions are derived for the short time behaviour of spin systems with general spin-spin interactions, and we suggest optimum experimental conditions for the…
Many scientific problems seek to find the ground state in a rugged energy landscape, a task that becomes prohibitively difficult for large systems. Within a particular class of problems, however, the short-range correlations within energy…
We use network analysis to describe and characterize an archetypal quantum system - an Ising spin chain in a transverse magnetic field. We analyze weighted networks for this quantum system, with link weights given by various measures of…
Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search of…
Various combinatorial optimization NP-hard problems can be reduced to finding the minimizer of an Ising model, which is a discrete mathematical model. It is an intellectual challenge to develop some mathematical tools or algorithms for…
We introduce a variational method for the approximation of ground states of strongly interacting spin systems in arbitrary geometries and spatial dimensions. The approach is based on weighted graph states and superpositions thereof. These…