Skip to main content
A Poisson process models event counts over time — arrivals at a queue, clicks, failures — where events occur independently at a constant average rate. It is the baseline against which bursty or self-exciting arrival patterns are compared.
The model ytPoisson(λ),E[yt]=Var(yt)=λy_t \sim \mathrm{Poisson}(\lambda), \qquad \mathbb{E}[y_t] = \mathrm{Var}(y_t) = \lambda Events arrive independently at rate lambda per unit time, so counts in disjoint windows are independent and Poisson-distributed. The result is the memoryless benchmark: no clustering, no correlation between successive intervals.

1. Arrival rate

lambda_rate is the expected number of events per time step, and it sets both the mean and the variance. Each panel shares an axis so the change in level and in spread is directly comparable.

2. Cumulative counts

The same process but with cumulative counting — useful for modeling total arrivals over time.

3. Daily event counts

Change the frequency to daily with 5 events per day on average.

4. Multiple processes

Generate multiple independent processes in one call.
Related generators
  • Hawkes process — arrivals that cluster because each event raises the rate.
  • INAR — autocorrelated integer counts.
Rate parameters are in the generator reference.