Simulator: counting process (Poisson)
This simulator generates sample paths of a counting process on the time interval \([0,T]\) with a constant average rate \(\lambda\). The goal is to demonstrate practically how the binomial discretization (simple method), the inter-arrival method (exact) and direct sampling of the count (exact) behave and how to compare the results with the theoretical predictions of the Poisson process.