The KBD algorithm is a cluster update algorithm designed for the fully frustrated Ising model in two dimensions, or more generally any two dimensional spin glass with frustrated plaquettes arranged in a checkered pattern. It is discovered in 1990 by Daniel Kandel, Radel Ben-Av, and Eytan Domany, and generalized by P. D. Coddington and L. Han in 1994. It is the inspiration for cluster algorithms used in quantum monte carlo simulations.
Motivation The SW algorithm is the first non-local algorithm designed for efficient simulation of ferromagnetic spin models. However, it is soon realized that the efficiency of the algorithm cannot be extended to frustrated systems, due to an overly large correlation length of the generated clusters with respect to the underlying spin system. The KBD algorithm is an attempt to extend the bond-formation rule to the plaquettes of the lattice, such that the generated clusters are informed by the frustration profile, resulting in them being smaller than the SW ones, thereby making the algorithm more efficient in comparison. However, at the current stage, it is not known whether this algorithm can be generalized for arbitrary spin glass models.
Algorithm We begin by decomposing the square lattice down into plaquettes arranged in a checkered pattern (such that the plaquettes only overlap vertex-wise but not edge-wise). Since the spin model is fully-frustrated, each plaquette must contain exactly one or three negative interactions. If the plaquette contains three negative interactions, then no bonds can be formed. However, if the plaquette contains one negative interaction, then two parallel bonds can be formed (perpendicular to the negative edge) with probability p = 1 − e − 4 β {\displaystyle p=1-e^{-4\beta }} , where β {\displaystyle \beta } is the inverse temperature of the spin model. The bonds will then form clusters on the lattice, on which the spins can be collectively flipped (either with the SW rule or the Wolff rule ). It can be shown that the update satisfies detailed balance, meaning that correctness is guaranteed if the algorithm is used in conjunction with ergodic algorithms like single spin-flip updates.
Topological features At zero temperature, or the β → ∞ {\displaystyle \beta \to \infty } limit, all the plaquettes will contain exactly one negative edge. In this case, on each checkered plaquette, the KBD algorithm will always open two parallel bonds perpendicular to the negative edge, meaning that the bond will be closed on the negative edge along with the edge opposite to it. If we were to track the closed bonds in the dual lattice, by drawing a straight/bent line inside each plaquette such that it intersects with the closed bonds, then it can be shown that a path following the lines must form a cycle. Furthermore, it can be shown that there must be at least two such cycles, and that the cycles cannot intersect. Most importantly, each cycle cannot be contracted to a point in the underlying surface that the lattice is embedded in. On a periodic lattice (or a torus), this means that the cycles of closed bonds must wind around the torus in the same direction, from which one can show that the largest cluster (which must be "squeezed" between these cycles) at zero temperature cannot span a finite fraction of the lattice size in the thermodynamic limit.
References
