Introduction to the Kinetic Monte Carlo Method

Monte Carlo refers to a broad class of algorithms that solve problems through the use of random numbers. They first emerged in the late 1940’s and 1950’s as electronic computers came into use [1], and the name means just what it sounds like, whimsically referring to the random nature of the gambling at Monte Carlo, Monaco. The most famous of the Monte Carlo methods is the Metropolis algorithm [2], invented just over 50 years ago at Los Alamos National Laboratory. Metropolis Monte Carlo (which is not the subject of this chapter) offers an elegant and powerful way to generate a sampling of geometries appropriate for a desired physical ensemble, such as a thermal ensemble. This is accomplished through surprisingly simple rules, involving almost nothing more than moving one atom at a time by a small random displacement. The Metropolis algorithm and the numerous methods built on it are at the heart of many, if not most, of the simulations studies of equilibrium properties of physical systems. In the 1960’s researchers began to develop a different kind of Monte Carlo algorithm for evolving systems dynamically from state to state. The earliest application of this approach for an atomistic system may have been Beeler’s 1966 simulation of radiation damage annealing [3]. Over the next 20 years, there were developments and applications in this area (e.g., see [3, 4, 5, 6, 7]), as well as in surface adsorption, diffusion and growth (e.g., see [8, 9, 10, 11, 12, 13, 14, 15, 16, 17]), in statistical physics (e.g., see [18, 19, 20]), and likely other areas, too. In the 1990’s the terminology for this approach settled in as kinetic Monte Carlo, though the early papers typically don’t use this term [21]. The popularity and range of applications of kinetic Monte Carlo (KMC) has continued to grow and KMC is now a common tool for studying materials subject to irradiation, the topic of this book. The purpose of this chapter is to provide an introduction to this KMC method, by taking the reader through the basic concepts underpinning KMC and how it is typically implemented, assuming no prior knowledge of these kinds of simulations. An appealing property of KMC is that it can, in principle, give the exact dynamical evolution of a system. Although this ideal is virtually never achieved, and usually not even attempted, the KMC method is presented here from this point of view because it makes a good framework for