A Markov Chain Model of the B-Cell Algorithm

An exact Markov chain model of the B-cell algorithm (BCA) is constructed via a novel possible transit method. The model is used to formulate a proof that the BCA is convergent absolute under a very broad set of conditions. Results from a simple numerical example are presented, we use this to demonstrate how the model can be applied to increase understanding of the performance of the BCA in optimizing function landscapes as well as giving insight into the optimal parameter settings for the BCA.

• Type: Conference
• Year: 2005
• Where: ICARIS
• Authors: Edward Clark, Andrew Hone, Jon Timmis
• Keywords: ICARIS 2005, Markov Chain Model, Optimal Parameter Settings, Simple Numerical Example