Description: 2D version of Brownian motion. A random walk is similar to markov process, however a
markov process has no memory, where a random walk uses an initial state.
The next step in the walk does not necessarily depend on your current
state but will be referenced from your current state, that is to say the
random vector is added to your current state. depending on complexity
To Search:
File list (Check if you may need any files):
random_walk.m
Download