Small-Network Approximations for Geometrically Frustrated Ising Systems

TL;DR

This paper introduces a method to approximate the thermodynamic properties of two-dimensional frustrated Ising systems using small networks, enabling faster simulations and analytical calculations, which is particularly useful for complex geometries like triangular and Kagome lattices.

Contribution

The paper presents a novel approach to approximate frustrated Ising systems with small networks, reducing computational effort and allowing analytical insights.

Findings

Small networks can effectively approximate prototype frustrated systems.

Analytical calculations from small networks are feasible and accurate.

Criteria for constructing small networks for general systems are developed.

Abstract

The study of frustrated spin systems often requires time-consuming numerical simulations. As the simplest approach, the classical Ising model is often used to investigate the thermodynamic behavior of such systems. Exploiting the small correlation lengths in frustrated Ising systems, we develop a method for obtaining a first approximation to the energetic properties of frustrated two-dimensional Ising systems using small networks of less than 30 spins. These small networks allow much faster numerical simulations, and more importantly, analytical calculation of the properties from the partition function is possible. We choose Ising systems on the triangular lattice, the Kagome lattice, and the triangular Kagome lattice as prototype systems and find small systems that can serve as good approximations to these prototype systems. We also develop criteria for constructing small networks to approximate general two-dimensional frustrated Ising systems. This method of using small networks provides a novel and efficient way to obtain a first approximation to the properties of frustrated spin systems.