Estimating the ratios of the stationary distribution values for Markov chains modeling evolutionary algorithms

Evolutionary Computation

Volumn 17, Issue 3, 2009, Pages 343-377

  Mitavskiy, Boris ^a   Cannings, Chris ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Antonesse's schemata; Estimates; Evolutionary algorithms; Genetic algorithms; Genetic load; Holland schemata; Invariant subsets; Lumpability; Lumpable markov chains; Lumping quotient; Mutation; Quotient markov chains; Recombination; Selection; Stationary distributions

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; PROBABILITY; STATISTICAL MODEL;

ALGORITHMS; MARKOV CHAINS; MODELS, GENETIC; MODELS, STATISTICAL;

EID: 70349631168     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2009.17.3.343     Document Type: Article

References (34)

1. Aldous, D., and Fill, J. (2009). Reversible Markov chains and random walks on graphs. Unpublished online book: http://www.stat.berkeley.edu/aldous/RWG/book.html.
2. Antonisse, J. (1989). A new interpretation of schema notation that overturns the binary encoding constraint. In Proceedings of the Third International Conference on Genetic Algorithms, Vol. 1 (pp. 86-97). San Mateo, CA: Morgan Kaufmann.
3. Bennett, J. (1953). Panmixia with tetrasomic and hexasomic inheritance. Genetics, 39:150-158.
4. Buchholz, P. (1994). Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability, 31(1):59-75.
5. Coffey, S. (1999). An applied probabilist's guide to genetic algorithms. Master's thesis, The University of Dublin, Ireland.
6. Dayer, T., and Stewart, W. (1997). Quasi-lumpability, lower bounding coupling matricies, and nearly completely decomposable Markov chains. SIAM Journal on Matrix Analysis and Applications, 18(2):482-498.
7. Ellison, B. (1966). Limit theorems for random mating in infinite populations. Journal of Applied Probability, 3:94-114.
8. Geiringer, H. (1944). On the probability of linkage in Mendelian heredity. Annals of Mathematical Statistics, 15:25-57.
9. Hackstein, J., Hochstenbach, P., and Pearson, P. (2000). Towards an understanding of the genetics of human male infertility; Lesson from flies. Trends in Genetics, 16:568-572.
10. Haldane, J. (1957). The cost of natural selection. Journal of Genetics, 55:511-524.
11. Iosifescu, M. (2007). Finite Markov processes and their applications. Mineola, NY: Dover Publications.
12. McPhee, F., and Poli, R. (2001). A schema theory analysis of the evolution of size in genetic programming with linear representations. In Proceedings of EuroGP, Genetic Programming (pp. 108-125). Berlin: Springer-Verlag
13. McPhee, F., and Poli, R. (2002). Using schema theory to explore interactions of multiple operators. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Vol. 1 (pp. 853-860). San Mateo, CA: Morgan Kaufmann.
14. Mitavskiy, B. (2003a). A category theoretic method for comparing evolutionary computation techniques via their representation. In B. T. Cate (Ed.), Proceedings of the Eighth ESSLLI Student Session, pp. 201-210.
15. Mitavskiy, B. (2003b). Comparing evolutionary computation techniques via their representation. In Proceedings of the Genetic and Evolutionary Computation (GECCO) Conference, Vol. 1 (pp. 1196-1209). Berlin: Springer-Verlag.
16. Mitavskiy, B. (2004). Crossover invariant subsets of the search space for evolutionary algorithms. Evolutionary Computation, 12(1):19-46.
17. Mitavskiy, B., and Rowe, J. E. (2005a). A schema-based version of Geiringer's theorem for non-linear genetic programming with homologous crossover. In A. H. Wright, M. D. Vose, K. A. De Jong, and L. M. Schmitt (Eds.), Foundations of Genetic Algorithms 8 (pp. 156-175). Berlin: Springer-Verlag.
18. Mitavskiy, B., and Rowe, J. E. (2005b). Some results about the Markov chains associated with GPS and general EAs. Theoretical Computer Science, 361(1):72-110.
19. Mitavskiy, B., and Rowe, J. E. (2006). An extension of Geiringer theorem for a wide class of evolutionary search algorithms. Evolutionary Computation, 14(1):87-118.
20. Mitavskiy, B., Rowe, J., Wright, A., and Schmitt, L. (2006). Exploiting quotients of Markov chains to derive properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm. In T.-D. Wang, X. Li, S.-H. Chen, and X. Wang (Eds.), Proceedings of the 6th International Conference on Simulated Evolution and Learning (pp. 726-733). Berlin: Springer-Verlag.
21. Moey, C., and Rowe, J. (2004a). Population aggregation based on fitness. Natural Computing, 3:5-19.
22. Moey, C., and Rowe, J. (2004b). A reduced Markov model of gas without the exact transition matrix. In X. Yao (Ed.), Proceedings of PPSN VIII, LNCS 3242 (pp. 72-80). Berlin: Springer-Verlag.
23. Norris, J. (1997). Markov chains. Cambridge, UK: Cambridge University Press.
24. Rabani, Y., Rabinovich, Y., and Sinclair, A. (1995). A computational view of population genetics. In Annual ACM Symposium on the Theory of Computing (pp. 83-92).
25. Radcliffe, N. (1994). The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence, 10:339-384.
26. Rowe, J., and McPhee, N. (2001). The effects of crossover and mutation operators on variable length linear structures. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (pp. 535-542). San Mateo, CA: Morgan Kaufmann.
27. Schmitt, L. (2001). Theory of genetic algorithms. Theoretical Computer Science, 259:1-61.
28. Schmitt, L. (2004). 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. Theoretical Computer Science, 310:181-231.
29. Silva, C. D., and Suzuki, J. (2005). On the stationary distribution of gas with fixed crossover probability. In H. Beyer and U. O'Reilly (Eds.), Proceedings of GECCO 2005 (pp. 1147-1151). New York: ACM Press.
30. Spears, W., and Jong, K. D. (1996). Analyzing gas using Markov chains with semantically ordered and lumped states. In Foundations of Genetic Algorithms, pp. 85-100.
31. Suzuki, J. (1997). A further result on the Markov chain model. In R. Belew, and M. Vose (Eds.), Foundations of Genetic Algorithms, pp. 53-72.
32. Suzuki, J. (1998). A further result on the Markov chain model of genetic algorithm and its application to simulated annealing-like strategy. IEEE Transactions on Systems, Man and Cybernatics, 28(1):95-102.
33. Vose, M. (1999). The simple genetic algorithm: Foundations and theory. Cambridge, MA: MIT Press.
34. Xu, J.-L.,Wang, J.-M., Sun, Y.-Q., Wei, L.-J., Luo,R.-T., Zhang,M.-X., and Li, Z.-K. (2006). Heavy genetic load associated with subspecific differentiation of japonica rice. Journal of Experimental Botany, 57:2815-2824.