Introduction to the Kinetic Monte Carlo Method

@inproceedings{Voter2005IntroductionTT,
  title={Introduction to the Kinetic Monte Carlo Method},
  author={Arthur F. Voter},
  year={2005}
}
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… CONTINUE READING
62 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 62 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Classical and Quantum Dynamics in Condensed Phase Simulations, edited by B.J

  • H. Jónsson, G. Mills, K. W. Jacobsen
  • Berne, G. Ciccotti and D.F. Coker (World…
  • 1998
1 Excerpt

Markov Chains (Cambridge

  • R. Norris
  • 1997
1 Excerpt

Icca J

  • Technical report 88 Computer Science Department University o A.L. Zobrist, Reprinted in
  • 13, 69
  • 1990
1 Excerpt

Kalos, in Monte Carlo Methods in Statistical Physics (Springer Topics in Current Physics, Vol. 7) edited by K Binder (Springer, Berlin

  • M.H.K. Binder
  • 1979
1 Excerpt

Monte Carlo Methods in Statistical Physics (Springer Topics in Current Physics, Vol. 7) edited by K Binder (Springer, Berlin

  • K. Binder
  • 1979
1 Excerpt

Algorithms for Chemical Computation, edited by R.E

  • C. H. Bennett
  • Christofferson (American Chemical Society,
  • 1977
1 Excerpt

An Introduction to Probability

  • W. Feller
  • Theory and its Applications,
  • 1966
1 Excerpt

Similar Papers

Loading similar papers…