TITLE: Applications of Markov Chain Methodology in Evolutionary Computation
SPEAKER: Jun He (Department of Computer Science, Aberystwyth University)

ABSTRACT:

It is well-known that the majority of random search heuristics including evolutionary algorithms are naturally modelled as discrete-time stochastic processes. Furthermore, these stochastic processes are most frequently Markov processes. 

In this talk, I intend to introduce the applications of Markov chain methodology in evolutionary computation. I will start the talk by briefly reviewing Markov chains. Following this, I will talk about how the theory of Markov chains could be applied in analysing the convergence, rate of convergence and first hitting time of evolutionary algorithms in turn.