Genetic Algorithms and the Search for Viable String Vacua
arXiv:1404.7359 · doi:10.1007/JHEP08(2014)010
Abstract
Genetic Algorithms are introduced as a search method for finding string vacua with viable phenomenological properties. It is shown, by testing them against a class of Free Fermionic models, that they are orders of magnitude more efficient than a randomised search. As an example, three generation, exophobic, Pati-Salam models with a top Yukawa occur once in every 10^{10} models, and yet a Genetic Algorithm can find them after constructing only 10^5 examples. Such non-deterministic search methods may be the only means to search for Standard Model string vacua with detailed phenomenological requirements.
10 figures, 24 pages, JHEP version
References in corpus (11)
- Computational complexity of the landscape I
- Statistics on the Heterotic Landscape: Gauge Groups and Cosmological Constants of Four-Dimensional Heterotic Strings
- Chiral family classification of fermionic Z2xZ2 heterotic orbifold models
- Spinor-Vector Duality in fermionic Z2XZ2 heterotic orbifold models
- Classification of Heterotic Pati-Salam Models
- Supersymmetry versus Gauge Symmetry on the Heterotic Landscape
- Spinor-Vector Duality in N=2 Heterotic String Vacua
- Fighting the Floating Correlations: Expectations and Complications in Extracting Statistical Correlations from the String Theory Landscape
- Top quark mass coupling and classification of weakly-coupled heterotic superstring vacua
- Is SUSY Natural?
- Towards the classification of Z2XZ2 fermionic models