Efficient transition path sampling: Application to Lennard-Jones cluster rearrangements

We develop an efficient Monte-Carlo algorithm to sample an ensemble of stochastic transition paths between stable states. In our description, paths are represented by chains of states linked by Markovian transition probabilities. Rate constants and mechanisms characterizing the transition may be determined from the path ensemble. We have previously devised several algorithms for sampling the path ensemble. For these algorithms, the numerical effort scales with the square of the path length. In the new simulation scheme, the required computation scales linearly with the length of the transition path. This improved efficiency allows the calculation of rate constants in complex molecular systems. As an example, we study rearrangement processes in a cluster consisting of seven Lennard-Jones particles in two dimensions. Using a quenching technique we are able to identify the relevant transition mechanisms and to locate the related transition states. We furthermore calculate transition rate constants for various isomerization processes.