Algebraic Theory of Recombination Spaces

A new mathematical representation is proposed for the configuration space structure induced by recombination, which we call P-structure. It consists of a mapping of pairs of objects to the power set of all objects in the search space. The mapping assigns to each pair of parental genotypes the set of all recombinant genotypes obtainable from the parental ones. It is shown that this construction allows a Fourier decomposition of fitness landscapes into a superposition of elementary landscapes. This decomposition is analogous to the Fourier decomposition of fitness landscapes on mutation spaces. The elementary landscapes are obtained as eigenfunctions of a Laplacian operator defined for P-structures. For binary string recombination, the elementary landscapes are exactly the p-spin functions (Walsh functions), that is, the same as the elementary landscapes of the string point mutation spaces (i.e., the hypercube). This supports the notion of a strong homomorphism between string mutation and recombination spaces. However, the effective nearest neighbor correlations on these elementary landscapes differ between mutation and recombination and among different recombination operators. On average, the nearest neighbor correlation is higher for one-point recombination than for uniform recombination. For one-point recombination, the correlations are higher for elementary landscapes with fewer interacting sites as well as for sites that have closer linkage, confirming the qualitative predictions of the Schema Theorem. We conclude that the algebraic approach to fitness landscape analysis can be extended to recombination spaces and provides an effective way to analyze the relative hardness of a landscape for a given recombination operator.

[1]  P. Stadler,et al.  The landscape of the traveling salesman problem , 1992 .

[2]  M. Fiedler A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[3]  P. Schuster,et al.  Statistics of landscapes based on free energies, replication and degradation rate constants of RNA secondary structures , 1991 .

[4]  David H. Wolpert,et al.  What makes an optimization problem hard? , 1995, Complex..

[5]  Peter F. Stadler,et al.  Linear Operators on Correlated Landscapes , 1994 .

[6]  Peter F. Stadler,et al.  Towards a theory of landscapes , 1995 .

[7]  Bernard Manderick,et al.  The Genetic Algorithm and the Structure of the Fitness Landscape , 1991, ICGA.

[8]  F. Spitzer Principles Of Random Walk , 1966 .

[9]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[10]  Peter F. Stadler,et al.  Local minima in the graph bipartitioning problem , 1996 .

[11]  Marco Tomassini,et al.  Evolutionary Algorithms , 1995, Towards Evolvable Hardware.

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Lov K. Grover Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..

[14]  Scott E. Page,et al.  Walsh Functions, Schema Variance, and Deception , 1992, Complex Syst..

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Albert Donally Bethke,et al.  Genetic Algorithms as Function Optimizers , 1980 .

[17]  Bernard Derrida,et al.  The random energy model , 1980 .

[18]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[19]  Peter F. Stadler,et al.  Local Minima of p-Spin Models , 1995 .

[20]  K. Binder,et al.  Spin glasses: Experimental facts, theoretical concepts, and open questions , 1986 .

[21]  B. Derrida Random-Energy Model: Limit of a Family of Disordered Models , 1980 .

[22]  Weinberger,et al.  RNA folding and combinatory landscapes. , 1993, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[23]  H WolpertDavid,et al.  What makes an optimization problem hard , 1995 .

[24]  John H. Holland Genetic Algorithms and Classifier Systems: Foundations and Future Directions , 1987, ICGA.

[25]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[26]  Peter F. Stadler,et al.  Correlation length, isotropy and meta-stable states , 1997 .

[27]  Marianna Bolla,et al.  Spectra, Euclidean representations and clusterings of hypergraphs , 1993, Discret. Math..

[28]  I. Chavel Eigenvalues in Riemannian geometry , 1984 .

[29]  D. G. Higman Coherent configurations , 1975 .

[30]  B. Mohar THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[31]  Peter F. Stadler,et al.  Random walks and orthogonal functions associated with highly symmetric graphs , 1995, Discret. Math..

[32]  R. M. Damerell On Moore graphs , 1973, Mathematical Proceedings of the Cambridge Philosophical Society.

[33]  D. Cvetkovic,et al.  Spectra of Graphs: Theory and Applications , 1997 .

[34]  P. Stadler Landscapes and their correlation functions , 1996 .

[35]  Joseph C. Culberson,et al.  Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions , 1994, Evolutionary Computation.

[36]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[37]  G. Wagner,et al.  Recombination induced hypergraphs: a new approach to mutation-recombination isomorphism , 1996 .

[38]  R. C. Bose,et al.  On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs , 1959 .

[39]  Wim Hordijk,et al.  A Measure of Landscapes , 1996, Evolutionary Computation.

[40]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[41]  B. Mohar,et al.  Eigenvalues in Combinatorial Optimization , 1993 .

[42]  V. Sunder,et al.  The Laplacian spectrum of a graph , 1990 .

[43]  N. Biggs THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[44]  Peter F. Stadler,et al.  Landscapes: Complex Optimization Problems and Biopolymer Structures , 1994, Comput. Chem..

[45]  David E. Goldberg,et al.  Genetic Algorithms and the Variance of Fitness , 1991, Complex Syst..

[46]  D. G. Higman Coherent configurations , 1975 .

[47]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[48]  D. G. Higman Part I: Ordinary Representation Theory , 1975 .

[49]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[50]  Chris D. Godsil,et al.  ALGEBRAIC COMBINATORICS , 2013 .

[51]  Tim Jones Evolutionary Algorithms, Fitness Landscapes and Search , 1995 .

[52]  Gunar E. Liepins,et al.  Polynomials, Basis Sets, and Deceptiveness in Genetic Algorithms , 1991, Complex Syst..

[53]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[54]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..