Sammendrag
This report presents a method for finding the Fastest Mixing Markov Chain. This is shown to be formulated as a semidefinite optimization problem, and solves this via a subgradient method as well as analytically. This report also includes a rich description of the prerequisites, theory, examples and discussions to provide intuition for the FMMC problem. We remark that Fastest Mixing does not necessarily imply fast mixing.