correlations, deemed relevant to large neural networks as one of its possible .

The Ising problem without an external field can be equivalently formulated as a graph maximum cut (Max-Cut) problem that can be solved via combinatorial optimization.

Definition

Consider a set of lattice sites, each with a set of adjacent sites (e.g. a graph)