A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Two different elementary approaches for deriving an explicit formula for the distribution of the range of a simple random walk on Z of length n are presented. Both of them rely on Hermann Weyl's discrepancy norm, which equals the maximal partial sum of the elements of a sequence. By this the original combinatorial problem on Z can be turned into a known path-enumeration problem on a bounded lattice. The solution is provided by means of the adjacency matrix Q d of the walk on a bounded latticefatcat:kecnftrqmnbspfsqz6b5lrzxy4