A simple algorithm to test for linking to Wilson loops in percolation

Abstract

A simple burning or epidemic type of algorithm is developed in order to test whether any loops in percolation clusters link a fixed reference loop, a problem considered recently by Gliozzi, Lottini, Panero, and Rago in the context of gauge theory. We test our algorithm at criticality in both 2d, where the behavior agrees with a theoretical prediction, and in 3d.

v1: A third figure added with additional simulation results. Small corrections also

References in corpus (3)

• A fast Monte Carlo algorithm for site or bond percolation
• Random percolation as a gauge theory
• Confinement-deconfinement and universal string effects from random percolation

Cited by in corpus (1)

• The conformal anomaly of k-strings