Montecarlo techniques are useful when the system has highest degrees of freedom. In a raw statement one can define that any technique that uses random numbers is known as montecarlo techniques. We have to use suitable computational algorithms to solve these type of problems.
Random numbers
Random numbers are generated by some process/algorithm whose outcome is not predictable. To use statistical mechanics or montecarlo techniques, random numbers should be uniformly distributed. There are several methods to create random numbers. Of course, from nature one can obtain random numbers. For example, counting cosmic particles and calculating modulo, calculating decay or throwing a die/coin etc. But these natural processes are not fast. In fact these doesn't satisfy some tests which are necessary to use statistical mechanics. Hence we used to generate random numbers using computer. These random numbers are known as pseudo random numbers, since these are not completely random. These follow some algorithm.
There are different methods to generate random numbers.
- Linear Congruential method
Here X(0) is the seed and M is the modulo. A and B are constants. Using this recurrence relation we can get random numbers. Accuracy of randomness depends on values of A and B. This is the simplest and most efficient method.
Tests for checking randomness
- Uniform test
- Frequency test
- Correlation test
- Run up - run down test
Montecarlo Techniques
- Acceptance rejection techniques
- Inversion technique
- Classical montecarlo
- Quantum montecarlo
- Path integral montecarlo
- Simulation montecarlo etc...
Library:
- Random number generation and montecarlo methods by James E. Gentle
- Montecarlo methods in statistical physics by K.P.N. Murthy
No comments:
Post a Comment