Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-07T03:36:26.414Z Has data issue: false hasContentIssue false

On decay–surge population models

Published online by Cambridge University Press:  08 November 2022

Branda Goncalves*
Affiliation:
CY Cergy Paris Université
Thierry Huillet*
Affiliation:
CY Cergy Paris Université
Eva Löcherbach*
Affiliation:
Université Paris 1 Panthéon-Sorbonne
*
*Postal address: LPTM, Laboratoire de Physique Théorique et Modélisation, CNRS UMR-8089, 2 avenue Adolphe-Chauvin, 95302 Cergy-Pontoise, France.
*Postal address: LPTM, Laboratoire de Physique Théorique et Modélisation, CNRS UMR-8089, 2 avenue Adolphe-Chauvin, 95302 Cergy-Pontoise, France.
****Postal address: SAMM, Statistique, Analyse et Modélisation Multidisciplinaire, EA 4543 et FR FP2M 2036 CNRS, 90 rue de Tolbiac, 75013 Paris, France. Email address: eva.locherbach@univ-paris1.fr
Rights & Permissions [Opens in a new window]

Abstract

We consider continuous space–time decay–surge population models, which are semi-stochastic processes for which deterministically declining populations, bound to fade away, are reinvigorated at random times by bursts or surges of random sizes. In a particular separable framework (in a sense made precise below) we provide explicit formulae for the scale (or harmonic) function and the speed measure of the process. The behavior of the scale function at infinity allows us to formulate conditions under which such processes either explode or are transient at infinity, or Harris recurrent. A description of the structures of both the discrete-time embedded chain and extreme record chain of such continuous-time processes is supplied.

Information

Type
Original Article
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. Notice that in accordance with the fact that $k(x)=1/(1+x^2)$ has slower-decaying tails than $k(x)= e^{-x}$, the process with jump distribution $k(x)=1/(1+x^2)$ has higher maxima than the process with $k(x)= e^{-x}$.

Figure 1

Figure 2. The above graphs give the positions $Z_n$ as a function of the jump times $S_n$. The waiting times between successive jumps are longer in the first process than in the second one. Since we use the same jump rate function in both processes and since this rate is an increasing function of the positions, this is due to the fact that jumps lead to higher values in the second process than in the first, so that jumps occur more frequently.

Figure 2

Figure 3. These graphs represent the sequence $T_{n}=S_{n}-S_{n-1} $ of the inter-jump waiting times for the two processes, showing once more that these waiting times are indeed longer in the first process than in the second.

Figure 3

Figure 4. The above graphs represent the records of the two processes as a function of the ranks of the records, the one on the left with $k(x) = e^{-x}$ and the one on the right with $k(x) = 1/(1+x^2)$. We can notice that there are more records in the first graph than in the second. Records occur more frequently in the first graph than in the second. On the other hand, the heights of the records are much lower in the first graph than in the second.

Figure 4

Figure 5. The above graphs give $Z_{R_n} $ as a function of $R_n$. We remark that the gap between two consecutive records decreases over time, whereas the time between two consecutive records becomes longer. In other words, the higher a record is, the longer it takes to surpass it statistically.

Figure 5

Figure 6. The above graphs give $A_n= R_n-R_{n-1} $ as a function of $n$. The differences between two consecutive records are much greater in the first graph than in the second. It is also noted that the maximum time gap is reached between the penultimate record and the last record.

Figure 6

Figure 7. The above graphs give the records obtained from the simulation of the two processes, as a function of time. We remark that the curve is slowly increasing with the time. In fact, to reach the 12th record, the first simulated process needs 5500 units of time, and analogously, the second simulated process needs 1500 units of time to reach its 8th record.