Note on the Metropolis Monte Carlo method on random lattices Original Research Article

Efficiency of algorithms in the Metropolis Monte Carlo method is examined for the problem of random walks on random lattices. Three types of algorithms, which satisfy the detailed balance, are considered. The efficiency mainly depends on the relative ease in obtaining geometrical factors and Boltzmann factors. The most efficient algorithm for the dynamical triangulation of random surfaces is suggested.