MERW chooses the stochastic matrix which maximizes H ( S ) , or equivalently assumes uniform probability distribution among all paths in a given graph. Its formula is obtained by first calculating the dominant eigenvalue λ λ and corresponding eigenvector ψ ψ of the adjacency matrix, i.e. the largest λ λ ∈ ∈ R with corresponding ψ ψ ∈ ∈ R n such that ψ ψ A = λ λ ψ ψ . Then stochastic matrix and stationary probability distribution are given by