The Simple Genetic Algorithm and the Walsh Transform: Part II, The Inverse
本文继续研究简单遗传算法与沃尔什变换的关系，将交叉和变异组成的混合方案用沃尔什基表示并三角化，推导出下一代期望算子的逆，确定混合方案的固定点，并给出任意初始种群对应的固定点公式。
This paper continues the development, begun in Part I, of the relationship between the simple genetic algorithm and the Walsh transform. The mixing scheme (comprised of crossover and mutation) is essentially "triangularized" when expressed in terms of the Walsh basis. This leads to a formulation of the inverse of the expected next generation operator. The fixed points of the mixing scheme are also determined, and a formula is obtained giving the fixed point corresponding to any starting population. Geiringer's theorem follows from these results in the special case corresponding to zero mutation.