Stability of Vertex Fixed Points and Applications
Michael D. Vose
C. S. Dept.
107 Ayres Hall
The University of Tennessee
Knoxville, TN 37996-1301
Alden H. Wright
Thanks(This work was done while the second author was visiting
the Computer Science Department of the University of Tennessee)
Computer Science Dept.
The University of Montana
Missoula, MT 59812-1008
In the Infinite Population Simple Genetic Algorithm, stability of
fixed points is considered when mutation is zero. The analysis is
based on the spectrum of the differential of the mapping which defines
the transition from one generation to the next. Based on a simple
formula for this spectrum, fully nondeceptive functions having
exponentially many non-optimal fixed points are constructed.