Sample Chapter: Deterministic Randomness (Web links)
- 1
- Problem: Deterministic Randomness
- 2
- Theory:
Random Sequences
- 3
- Method:
Pseudo-Random-Number
Generators
- 4
- Assessment:
Random Sequences
- 5
- Implementation: Simple and Not random.f (.c);
call.f,
RandNum.java
- 6
- Assessment: Randomness and Uniformity
- 7
- Assessment: Tests for Randomness and Uniformity
- 8
- Problem:
A Random Walk
- 9
- Model: Random Walk Simulation
- 10
- Method:
Numerical Random Walk
- 11
- Implementation: Random Walk,
walk.f(.c),
Walk.java
- 12
- Assessment: Different Random Walkers
Example 1: Monte-Carlo Techniques, Random Walkers
Figure 2: Seven random walks starting from the origin. 
Figure 3:
The distance R from the origin after N two-dimensional random steps. The
dashed curve is the theoretical results, the red and black solid curves correspond to
different algorithms for choosing random steps in two dimensions.