At the start of a simulation, the distribution of the number of trees in the size classes is drawn at random and multiplied by the desired basal area.
In this case, the lag is not initialized, and this causes a time when recruitment is not linked to the status of the population. The size classes linked to the lag are gradually filled by recruitment.
To modify this method, the lag can be filled as a function of the time taken to move from one class to another, using the following equation:
At the start of a simulation, the distribution of the number of trees in the size classes is drawn at random and multiplied by the desired basal area.
In this case, the lag is not initialized, and this causes a time when recruitment is not linked to the status of the population. The size classes linked to the lag are gradually filled by recruitment.
To modify this method, the lag can be filled as a function of the time taken to move from one class to another, using the following equation:
$n_{lagi} = \frac{1}{ \frac{\Delta d{m1}}{ \tilde{g} }} \times n_{t0,m1}$
With :
I'm testing this idea below :