Topological Representation of the Transit Sets of k-Point Crossover Operators

$k$-point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of $k$-point crossover generate, for all $k>1$, the same convexity as the interval function of the underlying graph. This settles in the negative an open problem by Mulder about whether the geodesic convexity of a connected graph $G$ is uniquely determined by its interval function $I$. The conjecture of Gitchoff and Wagner that for each transit set $R_k(x,y)$ distinct from a hypercube there is a unique pair of parents from which it is generated is settled affirmatively. Along the way we characterize transit functions whose underlying graphs are Hamming graphs, and those with underlying partial cube graphs. For general values of $k$ it is shown that the transit sets of $k$-point crossover operators are the subsets with maximal Vapnik-Chervonenkis dimension. Moreover, the transit sets of $k$-point crossover on binary strings form topes of uniform oriented matroid of VC-dimension $k+1$. The Topological Representation Theorem for oriented matroids therefore implies that $k$-point crossover operators can be represented by pseudosphere arrangements. This provides the tools necessary to study the special case $k=2$ in detail.

[1]  G. Wagner,et al.  Population dependent Fourier decomposition of fitness landscapes over recombination spaces: Evolvability of complex characters , 2000, Bulletin of mathematical biology.

[2]  Katharina T. Huber,et al.  Basic Phylogenetic Combinatorics , 2011 .

[3]  John G. Stell,et al.  Oriented matroids as a foundation for space in GIS , 2007, Comput. Environ. Urban Syst..

[4]  Günter P. Wagner,et al.  Asymmetry of Configuration Space Induced by Unequal Crossover: Implications for a Mathematical Theory of Evolutionary Innovation , 1999, Artificial Life.

[5]  Alexander Bockmayr,et al.  Fast thermodynamically constrained flux variability analysis , 2013, Bioinform..

[6]  Michel Mollard,et al.  Two characterizations of generalized hypercube , 1991, Discret. Math..

[7]  W. Imrich,et al.  Handbook of Product Graphs, Second Edition , 2011 .

[8]  Jean-Marie Laborde,et al.  Another characterization of hypercubes , 1982, Discret. Math..

[9]  H. M. Mulder The interval function of a graph , 1980 .

[10]  Arne C. Reimers Metabolic Networks, Thermodynamic Constraints, and Matroid Theory (Metabolische Netzwerke, Thermodynamische Nebenbedingungen und Matroidtheorie) , 2014 .

[11]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[12]  Harris Papadopoulos,et al.  Measures of Complexity , 2015, Springer International Publishing.

[13]  Steffen Klamt,et al.  Computation of elementary modes: a unifying framework and the new binary approach , 2004, BMC Bioinformatics.

[14]  Georg Regensburger,et al.  Enzyme allocation problems in kinetic metabolic networks: optimal solutions are elementary flux modes. , 2013, Journal of theoretical biology.

[15]  Riccardo Poli,et al.  Topological Interpretation of Crossover , 2004, GECCO.

[16]  B. Sturmfels Oriented Matroids , 1993 .

[17]  Sandi Klavzar,et al.  The All-Paths Transit Function of a Graph , 2001 .

[18]  Nicholas J. Radcliffe,et al.  The algebra of genetic algorithms , 1994, Annals of Mathematics and Artificial Intelligence.

[19]  Emo Welzl,et al.  Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements , 1994, Discret. Comput. Geom..

[20]  SpacesPETER F. STADLERInstitut Evolvability of Complex Characters : Population Dependent Fourier Decomposition of FitnessLandscapes over Recombination , 1999 .

[21]  Andreas W. M. Dress,et al.  The Category of X-Nets , 2007 .

[22]  D. Rideout,et al.  Oriented matroids—combinatorial structures underlying loop quantum gravity , 2010, 1003.2348.

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

[24]  Thomas M. English,et al.  Some Geometric and Algebraic Results on Crossover , 1997, Evolutionary Programming.

[25]  Sergei Ovchinnikov,et al.  Graphs and Cubes , 2011 .

[26]  Robert Manger,et al.  Comparison of eight evolutionary crossover operators for the vehicle routing problem , 2013 .

[27]  Lothar M. Schmitt,et al.  Theory of genetic algorithms , 2001, Theor. Comput. Sci..

[28]  Henry Martyn Mulder,et al.  The induced path function, monotonicity and betweenness , 2006, Discret. Appl. Math..

[29]  SETH CHAIKENDefinition,et al.  Oriented Matroid Pairs, Theory and an Electric Application , 1996 .

[30]  Simon King,et al.  The Topological Representation of Oriented Matroids , 2005, Discret. Comput. Geom..

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

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

[33]  Ladislav Nebeský,et al.  A characterization of the interval function of a connected graph , 1994 .

[34]  Komei Fukuda,et al.  Antipodal graphs and oriented matroids , 1993, Discret. Math..

[35]  Henry Martyn Mulder,et al.  Axiomatic characterization of the interval function of a graph , 2008, Eur. J. Comb..

[36]  A. Sharma,et al.  A comparative study of modified crossover operators , 2015, 2015 Third International Conference on Image Information Processing (ICIIP).

[37]  Kenneth A. De Jong,et al.  A formal analysis of the role of multi-point crossover in genetic algorithms , 1992, Annals of Mathematics and Artificial Intelligence.

[38]  Paul Field,et al.  Nonbinary Transforms for Genetic Algorithm Problems , 1994, Complex Syst..

[39]  Takao Nishizeki,et al.  Planar Graphs: Theory and Algorithms , 1988 .

[40]  Ladislav Nebeský,et al.  The interval function of a connected graph and a characterization of geodetic graphs , 2001 .

[41]  Martyn Mulder,et al.  Transit functions on graphs (and posets) , 2007 .