The Algorithm

The Monte Carlo method implemented by the algorithm starts by normalizing rates so to have only one parameter: dead_rate, corresponding to a number between 0 and 1, representing a probability.

Before normalizing rates, the birth-dead process has two parameters which are positive Real numbers: (i) birth and (ii) dead rates. Notice however, that birth has to be bigger than dead or the process goes extinct. So, particles must give birth before they die. This means we can take the time it takes to give birth (1/birth) to be the clock of our system (as nothing happens faster than this). Now we measure rates of events (birth and dead) in units of this clock. This way, particles give birth with probability birth/birth = 1 in one dt unit. At the same time, in this same period, particles can die with probability dead_rate = dead/birth.

As events (birth and dead) are stochastic, we cannot update the Lattice in any particular order as our choice will affect (bias) the spatial process. To avoid this, in one dt, we need to visit all sites in the lattice with equal probability (almost all sites once). So as long the simulation is running, to implement 1 tick of the clock repeat for as many as sites in the Lattice:

1.- Pick a site at random (thus with random spatial coordinates). We call this site, the focal site.