Exploiting Quotients of Markov Chains to Derive Properties of the Stationary Distribution of the Markov Chain Associated to an Evolutionary Algorithm

Abstract

In this work, a method is presented for analysis of Markov chains modeling evolutionary algorithms through use of a suitable quotient construction. Such a notion of quotient of a Markov chain is frequently referred to as “coarse graining” in the evolutionary computation literature. We shall discuss the construction of a quotient of an irreducible Markov chain with respect to an arbitrary equivalence relation on the state space. The stationary distribution of the quotient chain is “coherent” with the stationary distribution of the original chain. Although the transition probabilities of the quotient chain depend on the stationary distribution of the original chain, we can still exploit the quotient construction to deduce some relevant properties of the stationary distribution of the original chain. As one application, we shall establish inequalities that describe how fast the stationary distribution of Markov chains modelling evolutionary algorithms concentrates on the uniform populations as the mutation rate converges to 0. Further applications are discussed.