Genetic Algorithm for SU(N) gauge theory on a lattice
<|reference_start|>Genetic Algorithm for SU(N) gauge theory on a lattice: An Algorithm is proposed for the simulation of pure SU(N) lattice gauge theories based on Genetic Algorithms(GAs). Main difference between GAs and Metropolis methods(MPs) is that GAs treat a population of points at once, while MPs treat only one point in the searching space. This provides GAs with information about the assortment as well as the fitness of the evolution function and producting a better solution. We apply GAs to SU(2) pure gauge theory on a 2 dimensional lattice and show the results are consistent with those given by MP and Heatbath methods(HBs). Thermalization speed of GAs is especially faster than the simple MPs.<|reference_end|>
@article{azusa1998genetic,
    title={Genetic Algorithm for SU(N) gauge theory on a lattice},
    author={Yamaguchi Azusa},
    journal={arXiv preprint arXiv:hep-lat/9808001},
    year={1998},
    number={OCHA-PP-122},
    archivePrefix={arXiv},
    eprint={hep-lat/9808001},
    primaryClass={hep-lat cs.NE}
}