RANDOM WALK
We have implemented the following patterns
In this project formulae are derived to compute the mean number of times a site has been visited in a random walk on a two dimensional lattice. Asymmetric random walks are considered, with or without drift, for different boundary conditions. It is shown that in case of absorbing boundaries the mean number of visits reaches stationary values over the lattice; comparisons with a Monte Carlo simulation are also presented.
This project analyses the statistics of visits to a site in random walks. First general formulas will be derived, and next they will be applied to simple symmetric random walks on finite and infinite lattices; the dependence of the statistics on the lattices dimensionality will also be studied. Finally, an application will be presented to explain the structure of the radio-maps that trace the supernova remnants.