Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm

Genetic Programming and Evolvable Machines

Volumn 9, Issue 2, 2008, Pages 109-123

  Mitavskiy, Boris ^a   Rowe, Jonathan E ^b   Wright, Alden ^c   Schmitt, Lothar M ^d  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c UNIVERSITY OF MONTANA   (United States)

^d UNIVERSITY OF AIZU   (Japan)

Author keywords

Asymptotics; Coarse graining; Evolutionary algorithm; Markov chain; Mutation rate; Quotient; Selection pressure; Stationary distribution; Uniform population

Indexed keywords

COARSE GRAINING; SELECTION PRESSURE; STATIONARY DISTRIBUTION; UNIFORM POPULATION;

COMPUTER SIMULATION; EVOLUTIONARY ALGORITHMS; PROBABILITY; STATE SPACE METHODS;

MARKOV PROCESSES;

EID: 41149146985     PISSN: 13892576     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10710-007-9038-6     Document Type: Article

References (18)

1. Schmitt, L.: Theory of genetic algorithms. Theor. Comput. Sci. 259, 1-61 (2001)
2. Schmitt, L.: Theory of genetic algorithms ii: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. Theor. Comput. Sci. 310, 181-231 (2004)
3. Vose, M.: The Simple Genetic Algorithm: Foundations and Theory. MIT Press (1999)
4. Coffey, S.: An Applied Probabilist's Guide to Genetic Algorithms. A Thesis Submitted to The University of Dublin for the degree of Master in Science (1999)
5. Mitavskiy, B., Rowe, J.: An Extension of Geiringer Theorem for a wide class of evolutionary search algorithms. Evol. Comput. 14(1), 87-118 (2006)
6. Mitavskiy, B.: A schema-based version of Geiringer's Theorem for nonlinear Genetic Programming with homologous crossover. Found. Gen. Algorithms 8, 156-175 Springer-Verlag (2005)
7. Mitavskiy, B., Rowe, J.: Some results about the Markov chains associated to GPs and general EAs. Theor. Comput. Sci. 361(1), 72-110 (2006)
8. Davis, T., Principe, J.: A simulated annealing like convergence theory for the simple genetic algorithm. In: Belew, R., Bookers, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 174-181. Morgan Kaufmann (1991)
9. Suzuki, J.: A further result on the Markov chain model of genetic algorithm and its application to simulated annealing-like strategy. IEEE Trans. Syst. Man Cybernet. 28(1), 95-102 (1998)
10. Mitavskiy, B., Rowe, J., Wright, A., Schmitt, L.: Exploiting quotients of Markov chains to derive properties of the stationary distribution of the markov chain associated to an evolutionary algorithm. In: Simulated Evolution and Learning, Proceedings of SEAL 2006, Lecture Notes in Computer Science v. 4247, pp. 726-733. Springer Verlag (2006)
11. Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (unpublished book) (2001) http://www.stat.berkeley.edu/
12. Rowe, J., Vose, M., Wright, A.: Differentiable coarse graining. Theor. Comput. Sci. 361, 111-129 (2006)
13. Spears, W., De Jong, K.: Analyzing GAs using Markov chain models with semantically ordered and lumped states. In: Belew, R., Vose, M. (eds.) Foundations of Genetic Algorithms 4, pp. 85-100. Morgan Kaufmann (1997)
14. Moey, C., Rowe, J.: Population aggregation based on fitness. Nat. Comput. 3, 5-19 (2004)
15. Moey, C.: Investigating state aggregation for Markov models of genetic algorithms. Thesis, The University of Birmingham (2006)
16. Radcliffe, N.: The algebra of genetic algorithms. Ann. Math. Artif. Intel. 10, 339-384 (1994)
17. Mitavskiy, B.: Crossover invariant subsets of the search space for evolutionary algorithms. Evol. Comput. 12(1), 19-46 (2004)
18. Antonisse, J.: A new interpretation of schema notation that overturns the binary encoding constraint. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, pp. 86-97. Morgan Kaufmann (1989)