This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

\equalcont

These authors contributed equally to this work.

\equalcont

Three authors contributed equally to this work.

[1]\fnmLei \surDai \equalcontThese authors contributed equally to this work.

1]\orgdivSchool of Mathematics and Statistics, \orgnameCentral South University, \orgaddress \cityChangsha, \postcode410000, \stateHNP-LAMA, \countryChina

An unconditional boundary and dynamics preserving scheme for the stochastic epidemic model

\fnmRuishu \surLiu chicago@mail.ustc.edu.cn    \fnmXiaojie \surWang x.j.wang7@csu.edu.cn    dailei@csu.edu.cn [
Abstract

In the present article, we construct a logarithm transformation based Milstein-type method for the stochastic susceptible-infected-susceptible (SIS) epidemic model evolving in the domain (0,N)(0,N). The new scheme is explicit and unconditionally boundary and dynamics preserving, when used to solve the stochastic SIS epidemic model. Also, it is proved that the scheme has a strong convergence rate of order one. Different from existing time discretization schemes, the newly proposed scheme for any time step size h>0h>0, not only produces numerical approximations living in the entire domain (0,N)(0,N), but also unconditionally reproduces the extinction and persistence behavior of the original model, with no additional requirements imposed on the model parameters. Numerical experiments are presented to verify our theoretical findings.

keywords:
Stochastic SIS epidemic model, Boundary preserving, Extinction, Persistence, Explicit scheme, Order 1 strong convergence

1 Introduction

Over the past few decades, mathematical models have been constructed to describe the evolution of different kinds of epidemics. The classical Kermack-McKendrick model [1] was used for modelling common childhood diseases, where a typical individual starts off susceptible, at some stage catches the disease, and after a short infectious period becomes permanently immune. Nevertheless, in terms of many unstable sources of infection, particularly most viruses, cured people can rarely get long-time immunity and turn to be susceptible to some mutations of the same original virus. For these cases, the susceptible-infected-susceptible (SIS) model was constructed in [2]. By adding randomness to the model, the classical susceptible-infected-susceptible epidemic model was extended by Gray et al. in [3] from a deterministic framework to a stochastic one, which is formulated as the following stochastic differential equations (SDEs) of Itô type:

dSt\displaystyle{\rm d}S_{t} =[μNβStIt+γItμSt]dtσStItdWt,\displaystyle=\left[\mu N-\beta S_{t}I_{t}+\gamma I_{t}-\mu S_{t}\right]\,{\rm d}t-\sigma S_{t}I_{t}\,{\rm d}W_{t}\,, (1.1)
dIt\displaystyle{\rm d}I_{t} =[βStIt(μ+γ)It]dt+σStItdWt,\displaystyle=\left[\beta S_{t}I_{t}-(\mu+\gamma)I_{t}\right]\,{\rm d}t+\sigma S_{t}I_{t}\,{\rm d}W_{t}\,, (1.2)

where StS_{t} denotes the number of susceptibles and ItI_{t} the number of infecteds at time t[0,T]t\in[0,T], with initial values satisfying S0+I0=NS_{0}+I_{0}=N. In this model, the total population NN is divided into susceptibles StS_{t} and infecteds ItI_{t}, with the assumption that recovered people become susceptible again. Here and below, the model parameters μ\mu, β\beta, γ\gamma, σ>0\sigma>0 are assumed to be positive constants. More accurately, μ\mu stands for the per capita death rate, β\beta is the disease transmission coefficient, γ\gamma means the cure rate and σ\sigma represents the variance of the occurrence of potentially infectious contacts between infecteds and susceptibles. In addition, {Wt}t[0,T]\{W_{t}\}_{t\in[0,T]}, T>0T>0 is a standard Brownian motion defined on a complete probability space (Ω,,)(\Omega,\mathcal{F},\mathbb{P}). Since d[St+It]=[μNμ(St+It)]dt{\rm d}\,[S_{t}+I_{t}]=[\mu N-\mu(S_{t}+I_{t})]\,{\rm d}t, it can be directly deduced that St+It=NS_{t}+I_{t}=N. Thus the original SDE system (1.1)-(1.2) can be reduced to a scalar SDE for ItI_{t}:

dIt=It(βNμγβIt)dt+σIt(NIt)dWt,t[0,T],I0(0,N).{\rm d}I_{t}=I_{t}(\beta N-\mu-\gamma-\beta I_{t})\,{\rm d}t+\sigma I_{t}(N-I_{t})\,{\rm d}W_{t},\quad t\in[0,T],\quad I_{0}\in(0,N). (1.3)

It was asserted in [3] that SDE (1.3) admits a unique global solution in (0,N)(0,N), whose dynamics behavior was also discussed. On the one hand, the extinction property of SDE (1.3), which means that the disease will die out with probability one (see Definition 4.1), was confirmed under the conditions that

  • R0S<1R_{0}^{S}<1,

  • σ2βN\sigma^{2}\leq\tfrac{\beta}{N} or σ2>βNβ22(μ+γ)\sigma^{2}>\tfrac{\beta}{N}\vee\tfrac{\beta^{2}}{2(\mu+\gamma)},

where

R0D:=βNμ+γandR0S:=R0Dσ2N22(μ+γ)\displaystyle R_{0}^{D}:=\tfrac{\beta N}{\mu+\gamma}\quad\text{and}\quad R_{0}^{S}:=R_{0}^{D}-\tfrac{\sigma^{2}N^{2}}{2(\mu+\gamma)} (1.4)

are the basic reproduction numbers for the deterministic and stochastic SIS epidemic models respectively. On the other hand, SDE (1.3) was shown to possess the persistence property, that is, the disease will stay (see Definition 4.4), when R0S>1R_{0}^{S}>1. Since the analytic solution of SDE (1.3) is not available, people resort to numerical solutions that are expected to be convergent and preserve as many properties of the original model as possible. We mention that the numerical scheme must be carefully designed to obtain good approximations. Indeed, the well-known Euler Maruyama (EM) scheme cannot preserve the domain of the original model and the super-linear drift and diffusion coefficients of (1.3) make the resulting approximations divergent [4]. In the past few years, many researchers have made a great of efforts to design implicit [5, 6, 7, 8, 9] and explicit [10, 11, 12, 13, 14, 15, 16, 17, 18, 19] schemes for SDEs with super-linearly growing coefficients. However, boundary and dynamics preserving schemes are much less studied. In [20, 21], the authors combined a Lamperti-type transformation with the backward Euler method to derive strongly convergent and domain-preserving schemes for scalar SDEs. More recently, the authors of [22] proposed a positivity-preserving logarithmic transformed truncated Euler-Maruyama method for scalar SDEs and proved its strong and weak convergence rates. For the model (1.3), some authors [23, 24, 25, 26] relied on the Lamperti-type transformation and applied some explicit schemes to the transformed SDE that has an additive noise. Transforming back yields the desired numerical approximations, which preserves the domain and possesses a strong convergence rate of order one in [23, 24, 25] and order 1.5 in [26]. In [27, 28], a truncated Wiener process was used to construct one-half order strong schemes for the model (1.3), where restrictive assumptions were imposed on the step size hh to preserve the domain and dynamics behavior of the original model. It is worthwhile to point out that the numerical approximations produced by the above domain-preserving schemes cover the entire domain (0,N)(0,N), except for that in [25], where a truncation strategy leads to approximations living in a sub-set of (0,N)(0,N). Also, we mention that the dynamics behavior of the numerical approximations was investigated in [25, 27, 26, 28], but not in [23, 24]. More precisely, the proposed schemes in [25, 27, 26, 28] were proven to reproduce extinction under certain conditions, and the preservation of the persistence property was achieved in [26, 27, 28]. A comparison between numerical schemes concerning dynamics behavior with ours is made in Table 1 presented below, to provide a more comprehensive overview of the properties of these domain-preserving schemes.

Table 1: Comparison between numerical schemes for the stochastic SIS model
Paper Strong convergence rates Domain preservation Extinction preservation Persistence preservation
[25] 1 Unconditionally Assumptions on the step size NA
[26] 1.5 Unconditionally Assumptions on the model parameters Unconditionally
[27, 28] 0.5 Assumptions on the step size Assumptions on the step size Assumptions on the step size
This paper 1 Unconditionally Unconditionally Unconditionally

An interesting question thus arises as to whether one can construct any boundary and dynamics preserving scheme for the stochastic epidemic model, without any restriction on the step size h>0h>0. This is desirable, particularly in the multi-level Monte Carlo (MLMC) setting [29], where one is required to use many simulations with large discretization time step size h>0h>0. It is therefore natural to look for more advanced numerical schemes that capture such properties unconditionally. The present work aims to give a positive answer, by introducing an explicit, strongly convergent scheme that preserves both the dynamics behavior and the boundaries of the analytic solutions for any given step size h>0h>0. To this end, for M+M\in\mathbb{N}^{+} we construct a uniform mesh {tk=kh}k=0M\{t_{k}=kh\}_{k=0}^{M} over [0,T][0,T] with a uniform step size h=TMh=\tfrac{T}{M}. Our strategy is to combine a logarithm transformation with a corrected Milstein method. More precisely, by a logarithm transformation Xt=log(It)X_{t}=\log(I_{t}), we obtain the transformed SDE (2.2), for which corrected Milstein approximations {Yk}k0\{Y_{k}\}_{k\geq 0}, given by (2.10), are designed. The correction used here guarantees that the approximations {Yk}k0\{Y_{k}\}_{k\geq 0} live in (,logN)(-\infty,\log N). Transforming back by k:=eYk\mathcal{I}_{k}:=\text{e}^{Y_{k}} gives the desired approximation of ItkI_{t_{k}}, which is boundary preserving and strongly convergent with order one (see Theorem 3.2, 3.3):

𝔼[supk=0,,M|Itkk|p]Chp,p1.\mathbb{E}\Big{[}\sup_{k=0,...,M}\big{|}I_{t_{k}}-\mathcal{I}_{k}\big{|}^{p}\Big{]}\leq Ch^{p},\ p\geq 1. (1.5)

Throughout this paper the notation CC might be slightly abused to denote a generic positive constant depending on TT but independent of hh, and might vary from each time of appearance. Recall that a Lamperti-type transformation Xt=log(ItNIt)X_{t}=\log(\tfrac{I_{t}}{N-I_{t}}) was used in [23, 26, 24, 25] to design explicit boundary preserving schemes. Different from [23, 26, 24, 25], we turn to a direct logarithm transformation Xt=log(It)X_{t}=\log(I_{t}), which, combined with a corrected Milstein time-stepping scheme (2.10), helps covering the entire domain (0,N)(0,N) and preserving the dynamics behavior of original model for any step size h>0h>0. Under exactly the same conditions as required in [3], the proposed scheme reproduces the extinction and persistence properties of the original model (see Theorem 4.3, 4.6). This is also confirmed in the numerical experiments, showing that the proposed scheme performs well in dynamics preserving, even with large step sizes.

The rest of this paper is organized as follows. In the next section, the basic properties of the stochastic SIS epidemic model are stated and the numerical scheme is proposed. In Section 3, the first order strong convergence is elaborated. Section 4 is devoted to the analysis of the dynamics behavior for the proposed scheme. Numerical experiments are presented in Section 5 to verify our theoretical findings. A short conclusion is made finally in Section 6.

2 The stochastic epidemic model and the proposed scheme

The present section revisits the stochastic epidemic model (1.3) and attempts to design a desirable time-stepping scheme. For the well-posedness of (1.3), we recall the following lemma, which can be found in [3, Theorem 3.1].

Lemma 2.1.

For any initial value I0(0,N)I_{0}\in(0,N), the SDE (1.3) has a unique global positive solution It(0,N)I_{t}\in(0,N) for all t0t\geq 0 with probability one, namely,

(It(0,N),t0)=1.\mathbb{P}(I_{t}\in(0,N),\forall t\geq 0)=1. (2.1)

We utilize a logarithmic transform Xt=logItX_{t}=\log I_{t} to turn (1.3) into

{XtX0=0tf(Xs)ds+0tg(Xs)dWs,t[0,T],X0=logI0,\left\{\begin{array}[]{l}X_{t}-X_{0}=\int_{0}^{t}f(X_{s}){\rm d}s+\int_{0}^{t}g(X_{s}){\rm d}W_{s},\ t\in[0,T],\\ X_{0}=\log I_{0},\end{array}\right. (2.2)

where and throughout the article f,g:f,g:\mathbb{R}\rightarrow\mathbb{R} are defined as

f(x)\displaystyle f(x) :=12σ2e2x+(σ2Nβ)ex+(βNμγ12σ2N2),\displaystyle:=-\tfrac{1}{2}\sigma^{2}\text{e}^{2x}+(\sigma^{2}N-\beta)\text{e}^{x}+(\beta N-\mu-\gamma-\tfrac{1}{2}\sigma^{2}N^{2}), (2.3)
g(x)\displaystyle g(x) :=σ(Nex).\displaystyle:=\sigma(N-\text{e}^{x}). (2.4)

One can readily obtain from Lemma 2.1 that

(Xt(,logN),t0)=1.\mathbb{P}\big{(}X_{t}\in(-\infty,\log N),\,\forall t\geq 0\big{)}=1. (2.5)

Moreover, the coefficients ff and gg satisfy the Lipschitz conditions in the domain (,logN)(-\infty,\log N), which will be used in the error analysis.

Lemma 2.2.

For any x,y(,logN)x,y\in(-\infty,\log N), there exists a non-negative constant LL such that

|f(x)f(y)||g(x)g(y)|L|xy||f(x)-f(y)|\vee|g(x)-g(y)|\leq L|x-y| (2.6)

and

|g(x)g(x)g(y)g(y)|L|xy|.|g(x)g^{\prime}(x)-g(y)g^{\prime}(y)|\leq L|x-y|. (2.7)

Proof: The assertions are trivial due to the boundedness of ex\text{e}^{x} in (,logN)(-\infty,\log N). ∎

For any chosen positive integer M+M\in\mathbb{N}^{+}, a uniform mesh {tn=nh}n=0M\{t_{n}=nh\}_{n=0}^{M} is constructed with the uniform step size h=T/Mh=T/M. For convenience, we define

ΔWk:=Wtk+1Wtk,k=0,,M1.\displaystyle\Delta W_{k}:=W_{t_{k+1}}-W_{t_{k}},\quad\forall k=0,...,M-1. (2.8)

In addition, for s[0,T]s\in[0,T], denote

κ(s):=supk=0,,M{tk:tks}.\displaystyle\kappa(s):=\sup\limits_{k=0,...,M}\{t_{k}:t_{k}\leq s\}. (2.9)

Letting α(0,1]\alpha\in(0,1], θ32\theta\geq\frac{3}{2} be fixed, we propose a corrected Milstein scheme {Yk}k=0,,M\{Y_{k}\}_{k=0,...,M} starting from Y0=X0Y_{0}=X_{0} for the transformed SDE (2.2), given by

{Y¯k+1=Yk+f(Yk)h+g(Yk)ΔWk+g(Yk)g(Yk)Δζk,Yk+1=Y¯k+1𝟙{Y¯k+1<logN}+(logNαhθ)𝟙{Y¯k+1logN},k=0,1,,M1,\left\{\begin{array}[]{l}\bar{Y}_{k+1}=Y_{k}+f(Y_{k})h+g(Y_{k})\Delta W_{k}+g(Y_{k})g^{\prime}(Y_{k})\Delta\zeta_{k},\\ {Y}_{k+1}=\bar{Y}_{k+1}\mathbbm{1}_{{\color[rgb]{1,0,0}\{}\bar{Y}_{k+1}<\log N{\color[rgb]{1,0,0}\}}}+(\log N-\alpha h^{\theta})\mathbbm{1}_{{\color[rgb]{1,0,0}\{}\bar{Y}_{k+1}\geq\log N{\color[rgb]{1,0,0}\}}},\ k=0,1,...,M-1,\end{array}\right. (2.10)

where

Δζk:=tktk+1tksdWrdWs=12ΔWk212h\Delta\zeta_{k}:=\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\,{\rm d}W_{r}{\rm d}W_{s}=\tfrac{1}{2}\Delta W_{k}^{2}-\tfrac{1}{2}h (2.11)

and 𝟙A\mathbbm{1}_{A} is the indicator function of some set AA, i.e., 𝟙A(ω)=1\mathbbm{1}_{A}(\omega)=1 when ωA\omega\in A and 𝟙A(ω)=0\mathbbm{1}_{A}(\omega)=0 when ωA\omega\notin A. Then transforming the {Yk}k=0M\{Y_{k}\}_{k=0}^{M} back gives the true numerical approximations {k}k=0M\{\mathcal{I}_{k}\}_{k=0}^{M} for the original model (1.3), given by

k=eYk,k=0,,M.\mathcal{I}_{k}=e^{Y_{k}},\quad k=0,...,M. (2.12)

Such a scheme is termed as the logarithmic corrected Milstein (LCM) method. In light of (2.10), one knows

(Yk(,logN),k=0,,M)=1\mathbb{P}\big{(}Y_{k}\in(-\infty,\log N),\,{\color[rgb]{0,1,0}k=0,...,M}\big{)}=1 (2.13)

and thus

(k(0,N),k=0,,M)=1.\mathbb{P}\big{(}\mathcal{I}_{k}\in(0,N),\,{\color[rgb]{0,1,0}k=0,...,M}\big{)}=1. (2.14)

In other words, the LCM method is able to preserve the domain of the stochastic epidemic model.

In the next two lemmas we establish the moment and exponential moment bounds of the solution for the transformed SDE (2.2) and its numerical approximation (2.10).

Lemma 2.3 (Exponential moment bounds).

Let T>0T>0 and {Xt}t[0,T]\{X_{t}\}_{t\in[0,T]}, {Yk}k=0M\{Y_{k}\}_{k=0}^{M} be defined as (2.2), (2.10). For any q0q\geq 0, it holds that

supt[0,T]𝔼[eqXt]supk=0,,M𝔼[eqYk]<.\sup_{t\in[0,T]}\mathbb{E}\big{[}{\rm e}^{qX_{t}}\big{]}\bigvee\sup_{k=0,...,M}\mathbb{E}\big{[}{\rm e}^{qY_{k}}\big{]}<\infty. (2.15)

Proof: The assertion follows due to (2.5) and (2.13). ∎

Lemma 2.4 (Moment bounds).

Let T>0T>0 and {Xt}t[0,T]\{X_{t}\}_{t\in[0,T]}, {Yk}k=0M\{Y_{k}\}_{k=0}^{M} be defined as (2.2), (2.10). For any q0q\geq 0, it holds that

supt[0,T]𝔼[|Xt|q]supk=0,,M𝔼[|Yk|q]<.\sup_{t\in[0,T]}\mathbb{E}\big{[}|X_{t}|^{q}\big{]}\bigvee\sup_{k=0,...,M}\mathbb{E}\big{[}|Y_{k}|^{q}\big{]}<\infty. (2.16)

Proof: The assertion can be derived directly by definitions of {Xt}t[0,T]\{X_{t}\}_{t\in[0,T]}, {Yk}k=0M\{Y_{k}\}_{k=0}^{M} and Lemma 2.3. ∎

In view of Lemmas 2.2, 2.3 and 2.4, moments of the analitical and numerical solutions we encounter later are all bounded, which will not be emphasized further.

3 The first-order strong convergence of the scheme

In this section we attempt to present the analysis of the strong convergence rate for the proposed LCM scheme. To begin with, we recall first a discrete version of the Burkholder-Davis-Gundy inequality, quoted from [30, Lemma 4.1].

Lemma 3.1.

Let MM\in\mathbb{N} and ξ1,,ξM:Ω\xi_{1},...,\xi_{M}:\Omega\rightarrow\mathbb{R} be /()\mathcal{F}/\mathcal{B}(\mathbb{R})-measurable mappings with 𝔼[|ξn|2]<+\mathbb{E}\big{[}|\xi_{n}|^{2}\big{]}<+\infty for all n{1,,M}n\in\{1,...,M\} and with 𝔼[ξn+1|ξ1,,ξn]=0\mathbb{E}\big{[}\xi_{n+1}|\xi_{1},...,\xi_{n}\big{]}=0 for all n{1,,M1}n\in\{1,...,M-1\}. Then

ξ1++ξMpCp(ξ1p2++ξMp2)12\displaystyle\|\xi_{1}+\cdots+\xi_{M}\|_{\mathcal{L}^{p}}\leq C_{p}\cdot\Big{(}\|\xi_{1}\|_{\mathcal{L}^{p}}^{2}+\cdots+\|\xi_{M}\|_{\mathcal{L}^{p}}^{2}\Big{)}^{\tfrac{1}{2}} (3.1)

for every p[2,+)p\in[2,+\infty), where Cp,p[2,+)C_{p},p\in[2,+\infty) are universal constants.

Here and below we denote ξq:=(𝔼[|ξ|q])1q[0,+]\|\xi\|_{\mathcal{L}^{q}}:=\big{(}\mathbb{E}[|\xi|^{q}]\big{)}^{\tfrac{1}{q}}\in[0,+\infty] for any q[1,+)q\in[1,+\infty). Now we are ready to carry out error analysis on the mesh grids.

Theorem 3.2.

Let T>0T>0 and XtX_{t}, YkY_{k} be defined as (2.2), (2.10). For any q1q\geq 1, it holds that

𝔼[supk=0,,M|XtkYk|q]Chq.\mathbb{E}\Big{[}\sup\limits_{k=0,...,M}|X_{t_{k}}-Y_{k}|^{q}\Big{]}\leq Ch^{q}. (3.2)

Proof: It is easy to deduce that

|Xtk+1Yk+1|2\displaystyle|X_{t_{k+1}}-Y_{k+1}|^{2} (3.3)
=𝟙{Y¯k+1<logN}|Xtk+1Y¯k+1|2\displaystyle=\mathbbm{1}_{{\color[rgb]{1,0,0}\{}\bar{Y}_{k+1}<\log N{\color[rgb]{1,0,0}\}}}|X_{t_{k+1}}-\bar{Y}_{k+1}|^{2}
+𝟙{Y¯k+1logN}𝟙{Xtk+1logNαhθ}|Xtk+1(logNαhθ)|2\displaystyle\quad+\mathbbm{1}_{\{\bar{Y}_{k+1}\geq\log N\}}\cdot\mathbbm{1}_{\{X_{t_{k+1}}\leq\log N-\alpha h^{\theta}\}}|X_{t_{k+1}}-(\log N-\alpha h^{\theta})|^{2}
+𝟙{Y¯k+1logN}𝟙{logN>Xtk+1>logNαhθ}|Xtk+1(logNαhθ)|2\displaystyle\quad+\mathbbm{1}_{\{\bar{Y}_{k+1}\geq\log N\}}\cdot\mathbbm{1}_{\{\log N>X_{t_{k+1}}>\log N-\alpha h^{\theta}\}}|X_{t_{k+1}}-(\log N-\alpha h^{\theta})|^{2}
|Xtk+1Y¯k+1|2+α2h2θ.\displaystyle\leq|X_{t_{k+1}}-\bar{Y}_{k+1}|^{2}+\alpha^{2}h^{2\theta}.

Recalling (2.2) and (2.10) we have

Xtk+1Y¯k+1\displaystyle X_{t_{k+1}}-\bar{Y}_{k+1} =XtkYk+(f(Xtk)f(Yk))h+(g(Xtk)g(Yk))ΔWk\displaystyle=X_{t_{k}}-Y_{k}+\Big{(}f(X_{t_{k}})-f(Y_{k})\Big{)}h+\Big{(}g(X_{t_{k}})-g(Y_{k})\Big{)}\Delta W_{k} (3.4)
+(g(Xtk)g(Xtk)g(Yk)g(Yk))Δζk+Rk,\displaystyle\quad+\Big{(}g(X_{t_{k}})g^{\prime}(X_{t_{k}})-g(Y_{k})g^{\prime}(Y_{k})\Big{)}\Delta\zeta_{k}+R_{k},

where we denote

Rk\displaystyle R_{k} :=tktk+1[f(Xs)f(Xtk)]ds+tktk+1[g(Xs)g(Xtk)]dWs\displaystyle:=\int_{t_{k}}^{t_{k+1}}[f(X_{s})-f(X_{t_{k}})]\,{\rm d}s+\int_{t_{k}}^{t_{k+1}}[g(X_{s})-g(X_{t_{k}})]\,{\rm d}W_{s} (3.5)
tktk+1tksg(Xtk)g(Xtk)dWrdWs.\displaystyle\quad-\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}g(X_{t_{k}})g^{\prime}(X_{t_{k}})\,{\rm d}W_{r}{\rm d}W_{s}.

Next we estimate RkR_{k} first. For k=0,,M1k=0,...,M-1, the Itô formula shows that

Rk\displaystyle R_{k} =tktk+1tks[f(Xr)f(Xr)+12f′′(Xr)g2(Xr)]drds+tktk+1tksf(Xr)g(Xr)dWrds\displaystyle=\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\big{[}f^{\prime}(X_{r})f(X_{r})+\tfrac{1}{2}f^{\prime\prime}(X_{r})g^{2}(X_{r})\big{]}\,{\rm d}r{\rm d}s+\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}f^{\prime}(X_{r})g(X_{r})\,{\rm d}W_{r}{\rm d}s (3.6)
+tktk+1tks[g(Xr)f(Xr)+12g′′(Xr)g2(Xr)]drdWs\displaystyle\quad+\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\big{[}g^{\prime}(X_{r})f(X_{r})+\tfrac{1}{2}g^{\prime\prime}(X_{r})g^{2}(X_{r})\big{]}\,{\rm d}r{\rm d}W_{s}
+tktk+1tks[g(Xr)g(Xr)g(Xtk)g(Xtk)]dWrdWs\displaystyle\quad+\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\big{[}g(X_{r})g^{\prime}(X_{r})-g(X_{t_{k}})g^{\prime}(X_{t_{k}})\big{]}\,{\rm d}W_{r}{\rm d}W_{s}
=Rk(1)+Rk(2),\displaystyle=R_{k}^{(1)}+R_{k}^{(2)},

where we split RkR_{k} into two parts as follows:

Rk(1)\displaystyle R_{k}^{(1)} :=tktk+1tks[f(Xr)f(Xr)+12f′′(Xr)g2(Xr)]drds\displaystyle:=\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\big{[}f^{\prime}(X_{r})f(X_{r})+\tfrac{1}{2}f^{\prime\prime}(X_{r})g^{2}(X_{r})\big{]}\,{\rm d}r{\rm d}s (3.7)
Rk(2)\displaystyle R_{k}^{(2)} :=tktk+1tksf(Xr)g(Xr)dWrds+tktk+1tks[g(Xr)f(Xr)+12g′′(Xr)g2(Xr)]drdWs\displaystyle:=\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}f^{\prime}(X_{r})g(X_{r})\,{\rm d}W_{r}{\rm d}s+\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\big{[}g^{\prime}(X_{r})f(X_{r})+\tfrac{1}{2}g^{\prime\prime}(X_{r})g^{2}(X_{r})\big{]}\,{\rm d}r{\rm d}W_{s}
+tktk+1tks[g(Xr)g(Xr)g(Xtk)g(Xtk)]dWrdWs.\displaystyle\quad+\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\big{[}g(X_{r})g^{\prime}(X_{r})-g(X_{t_{k}})g^{\prime}(X_{t_{k}})\big{]}\,{\rm d}W_{r}{\rm d}W_{s}. (3.8)

The moment inequality and the Jensen inequality together with Lemma 2.2 yield that, for any q1q\geq 1

𝔼[|tktk+1tks[g(Xr)g(Xr)g(Xtk)g(Xtk)]dWrdWs|2q]\displaystyle\mathbb{E}\Bigg{[}\bigg{|}\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\big{[}g(X_{r})g^{\prime}(X_{r})-g(X_{t_{k}})g^{\prime}(X_{t_{k}})\big{]}\,{\rm d}W_{r}{\rm d}W_{s}\bigg{|}^{2q}\Bigg{]} (3.9)
h2q2tktk+1tks𝔼[|g(Xr)g(Xr)g(Xtk)g(Xtk)|2q]drds\displaystyle\leq h^{2q-2}\cdot\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\mathbb{E}\Big{[}\big{|}g(X_{r})g^{\prime}(X_{r})-g(X_{t_{k}})g^{\prime}(X_{t_{k}})\big{|}^{2q}\Big{]}\,{\rm d}r{\rm d}s
Lh2q2𝔼[tktk+1tks|XrXtk|2qdrds]\displaystyle\leq Lh^{2q-2}\cdot\mathbb{E}\bigg{[}\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\big{|}X_{r}-X_{t_{k}}\big{|}^{2q}\,{\rm d}r{\rm d}s\bigg{]}
CLh4q3tktk+1tkstkr𝔼[|f(Xu)|2q]dudrds\displaystyle\leq CLh^{4q-3}\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\int_{t_{k}}^{r}\mathbb{E}\Big{[}\big{|}f(X_{u})\big{|}^{2q}\Big{]}\,{\rm d}u{\rm d}r{\rm d}s
+CLh3q3tktk+1tkstkr𝔼[|g(Xu)|2q]dudrds,\displaystyle\quad+CLh^{3q-3}\int_{t_{k}}^{t_{k+1}}\int_{t_{k}}^{s}\int_{t_{k}}^{r}\mathbb{E}\Big{[}\big{|}g(X_{u})\big{|}^{2q}\Big{]}\,{\rm d}u{\rm d}r{\rm d}s,

where the Hölder inequality is also used in the last inequality. Therefore, the boundedness of moments ensure that, for any q1q\geq 1 and k=0,1,,M1k=0,1,...,M-1

𝔼[|Rk(1)|2q]Ch4q,𝔼[|Rk(2)|2q]Ch3q\displaystyle\mathbb{E}\Big{[}\big{|}R_{k}^{(1)}\big{|}^{2q}\Big{]}\leq Ch^{4q},\quad\mathbb{E}\Big{[}\big{|}R_{k}^{(2)}\big{|}^{2q}\Big{]}\leq Ch^{3q} (3.10)

and thus

𝔼[|Rk|2q]Ch3q.\mathbb{E}\Big{[}\big{|}R_{k}\big{|}^{2q}\Big{]}\leq Ch^{3q}. (3.11)

Denote for brevity

ek\displaystyle e_{k} :=XtkYk,\displaystyle:=X_{t_{k}}-Y_{k}, Ak\displaystyle\quad A_{k} :=(f(Xtk)f(Yk))h,\displaystyle:=\Big{(}f(X_{t_{k}})-f(Y_{k})\Big{)}h,
Bk\displaystyle B_{k} :=(g(Xtk)g(Yk))ΔWk,\displaystyle:=\Big{(}g(X_{t_{k}})-g(Y_{k})\Big{)}\Delta W_{k}, Dk\displaystyle\quad D_{k} :=(g(Xtk)g(Xtk)g(Yk)g(Yk))Δζk.\displaystyle:=\Big{(}g(X_{t_{k}})g^{\prime}(X_{t_{k}})-g(Y_{k})g^{\prime}(Y_{k})\Big{)}\Delta\zeta_{k}.

Thanks to Lemma 2.2, we have

|Ak|Lh|ek|,|Bk|L|ek||ΔWk|,|Dk|L|ek||Δζk|.\displaystyle|A_{k}|\leq Lh|e_{k}|,\quad|B_{k}|\leq L|e_{k}||\Delta W_{k}|,\quad|D_{k}|\leq L|e_{k}||\Delta\zeta_{k}|. (3.12)

Plugging (3.4) into (3.3) and by the Young inequality we get, for any k=0,,M1k=0,...,M-1,

ek+12\displaystyle e^{2}_{k+1} ek2+Ak2+Bk2+Dk2+Rk2+2ekAk+2ekBk+2ekDk+2ekRk\displaystyle\leq e^{2}_{k}+A^{2}_{k}+B^{2}_{k}+D^{2}_{k}+R^{2}_{k}+2e_{k}A_{k}+2e_{k}B_{k}+2e_{k}D_{k}+2e_{k}R_{k} (3.13)
+2AkBk+2AkRk+2AkDk+2BkDk+2BkRk+2DkRk+α2h2θ\displaystyle\quad+2A_{k}B_{k}+2A_{k}R_{k}+2A_{k}D_{k}+2B_{k}D_{k}+2B_{k}R_{k}+2D_{k}R_{k}+\alpha^{2}h^{2\theta}
(1+3h)ek2+(4+h1)(Ak2+Dk2)+4(Bk2+Rk2)+2ekBk\displaystyle\leq(1+3h)e^{2}_{k}+\big{(}4+h^{-1}\big{)}(A^{2}_{k}+D^{2}_{k})+4\big{(}B^{2}_{k}+R^{2}_{k}\big{)}+2e_{k}B_{k}
+h1|Rk(1)|2+2ekRk(2)+α2h2θ.\displaystyle\quad+h^{-1}|R^{(1)}_{k}|^{2}+2e_{k}R^{(2)}_{k}+\alpha^{2}h^{2\theta}.

By iteration, we arrive at

ek+12\displaystyle e^{2}_{k+1} (1+3h)ki=0k1(1+3h)i[(4+h1)(Ai2+Di2)+4(Bi2+Ri2)+h1|Ri(1)|2]\displaystyle\leq(1+3h)^{k}\sum_{i=0}^{k}\tfrac{1}{(1+3h)^{i}}\Big{[}(4+h^{-1})(A^{2}_{i}+D^{2}_{i})+4\big{(}B^{2}_{i}+R^{2}_{i}\big{)}+h^{-1}|R^{(1)}_{i}|^{2}\Big{]} (3.14)
+(1+3h)ki=0k1(1+3h)i[2eiBi+2eiRi(2)]+Ch2θ1.\displaystyle\quad+(1+3h)^{k}\sum_{i=0}^{k}\tfrac{1}{(1+3h)^{i}}\Big{[}2e_{i}B_{i}+2e_{i}R^{(2)}_{i}\Big{]}+Ch^{2\theta-1}.

For any n=0,,M1n=0,...,M-1 and p2p\geq 2, raising both sides of (3.14) to the power of pp, taking supremum and expectation as well as applying the Jensen inequality we get

𝔼[supk=0,,n|ek+1|2p]\displaystyle\mathbb{E}\Big{[}\sup_{k=0,...,n}|e_{k+1}|^{2p}\Big{]} Chi=0n𝔼[|ei|2p]+C(1+3h)np𝔼[supk=0,,n|i=0k1(1+3h)i2eiBi|p]\displaystyle\leq Ch\sum_{i=0}^{n}\mathbb{E}\Big{[}|e_{i}|^{2p}\Big{]}+C(1+3h)^{np}\cdot\mathbb{E}\Bigg{[}\sup_{k=0,...,n}\bigg{|}\sum_{i=0}^{k}\tfrac{1}{(1+3h)^{i}}2e_{i}B_{i}\bigg{|}^{p}\Bigg{]} (3.15)
+C(1+3h)np𝔼[supk=0,,n|i=0k1(1+3h)i2eiRi(2)|p]+Ch2p.\displaystyle\quad+C(1+3h)^{np}\cdot\mathbb{E}\Bigg{[}\sup_{k=0,...,n}\bigg{|}\sum_{i=0}^{k}\tfrac{1}{(1+3h)^{i}}2e_{i}R^{(2)}_{i}\bigg{|}^{p}\Bigg{]}+Ch^{2p}.

By denoting ξi(1):=(1+3h)ieiBi\xi_{i}^{(1)}:=(1+3h)^{-i}e_{i}B_{i} and ξi(2):=(1+3h)ieiRi(2),\xi_{i}^{(2)}:=(1+3h)^{-i}e_{i}R_{i}^{(2)}, it is not difficult to check that 𝔼[ξi+1(1)|ξ1(1),,ξi(1)]=0\mathbb{E}\big{[}\xi_{i+1}^{(1)}|\xi_{1}^{(1)},...,\xi_{i}^{(1)}\big{]}=0 and 𝔼[ξi+1(2)|ξ1(2),,ξi(2)]=0.\mathbb{E}\big{[}\xi_{i+1}^{(2)}|\xi_{1}^{(2)},...,\xi_{i}^{(2)}\big{]}=0. Moreover, {Ξk(1)}k=1M:={i=0k1ξi(1)}k=1M\{\Xi_{k}^{(1)}\}_{k=1}^{M}:=\Big{\{}\sum\limits_{i=0}^{k-1}\xi_{i}^{(1)}\Big{\}}_{k=1}^{M} and {Ξk(2)}k=1M:={i=0k1ξi(2)}k=1M\{\Xi_{k}^{(2)}\}_{k=1}^{M}:=\Big{\{}\sum\limits_{i=0}^{k-1}\xi_{i}^{(2)}\Big{\}}_{k=1}^{M} are square-integrable discrete time martingales. Hence the Doob discrete martingale inequality, Lemma 3.1 and the Jensen inequality can be applied to infer that

𝔼[|supk=0,,ni=0k1(1+3h)i2eiBi|p]\displaystyle\mathbb{E}\Bigg{[}\bigg{|}\sup_{k=0,...,n}\sum_{i=0}^{k}\tfrac{1}{(1+3h)^{i}}2e_{i}B_{i}\bigg{|}^{p}\Bigg{]} C(1h)p21i=0n𝔼[|2eiBi|p]Chi=0n𝔼[|ei|2p].\displaystyle\leq C\cdot(\tfrac{1}{h})^{\frac{p}{2}-1}\sum_{i=0}^{n}\mathbb{E}\bigg{[}\Big{|}2e_{i}B_{i}\Big{|}^{p}\bigg{]}\leq Ch\sum_{i=0}^{n}\mathbb{E}\Big{[}|e_{i}|^{2p}\Big{]}. (3.16)

With the help of the Young inequality additionally, we have

𝔼[|supk=0,,ni=0k1(1+3h)i2eiRi(2)|p]\displaystyle\mathbb{E}\Bigg{[}\bigg{|}\sup_{k=0,...,n}\sum_{i=0}^{k}\tfrac{1}{(1+3h)^{i}}2e_{i}R_{i}^{(2)}\bigg{|}^{p}\Bigg{]} C(1h)p21i=0n𝔼[|2eiRi(2)|p]\displaystyle\leq C\cdot(\tfrac{1}{h})^{\frac{p}{2}-1}\sum_{i=0}^{n}\mathbb{E}\bigg{[}\Big{|}2e_{i}R_{i}^{(2)}\Big{|}^{p}\bigg{]} (3.17)
Chi=0n𝔼[|ei|2p]+Ch2p.\displaystyle\leq Ch\sum_{i=0}^{n}\mathbb{E}\Big{[}|e_{i}|^{2p}\Big{]}+Ch^{2p}.

Inserting (3.16)-(3.17) into (3.15) we arrive at

𝔼[supk=0,,n|ek+1|2p]Chi=1n𝔼[|ei|2p]+Ch2p<.\displaystyle\mathbb{E}\Big{[}\sup_{k=0,...,n}|e_{k+1}|^{2p}\Big{]}\leq Ch\sum_{i=1}^{n}\mathbb{E}\Big{[}|e_{i}|^{2p}\Big{]}+Ch^{2p}<\infty. (3.18)

Finally, the Gronwall inequality and the Lyapunov inequality finish the proof. ∎

Equipped with the above convergence result for the approximations of the transformed SDE, we therefore obtain a convergence rate of order one for the LCM scheme.

Theorem 3.3.

Let T>0T>0 and ItI_{t}, k\mathcal{I}_{k} be defined as (1.3), (2.12). For any q1q\geq 1, there exists some positive constant CC independent of hh such that

𝔼[supk=0,,M|Itkk|q]Chq.\mathbb{E}\Big{[}\sup_{k=0,...,M}\big{|}I_{t_{k}}-\mathcal{I}_{k}\big{|}^{q}\Big{]}\leq Ch^{q}. (3.19)

Proof: The Hölder inequality and boundedness of the exponential moment together imply that for p2p\geq 2,

𝔼[supk=0,,M|eXtkeYk|p]C𝔼[supk=0,,M|XtkYk|p]Chp.\displaystyle\mathbb{E}\Big{[}\sup_{k=0,...,M}\big{|}e^{X_{t_{k}}}-e^{Y_{k}}\big{|}^{p}\Big{]}\leq C\mathbb{E}\Big{[}\sup_{k=0,...,M}\big{|}X_{t_{k}}-Y_{k}\big{|}^{p}\Big{]}\leq Ch^{p}. (3.20)

Thus by the Lyapunov inequality the assertion holds for any q1q\geq 1. ∎

4 Dynamics behavior of numerical approximations

In this section we investigate the ability of the proposed scheme to reproduce significant dynamics behavior of the stochastic epidemic model. More precisely, we examine the extinction and persistence properties of the time discretization and show that, under exactly the same conditions as required in [3], the proposed scheme is able to preserve the dynamics behavior of the original model for any step size h>0h>0.

4.1 Unconditional extinction preserving

As the first dynamics behavior of the stochastic model, we focus on the extinction property that is defined as follows.

Definition 4.1 (Extinction).

If the unique positive solution ItI_{t}, t0t\geq 0 of the stochastic SIS model tends to zero in almost sure sense as tt\rightarrow\infty, that is,

limtIt=0a.s.,\lim\limits_{t\rightarrow\infty}I_{t}=0\quad a.s., (4.1)

then we say that the infected population system has the extinction property. Similarly, the numerical approximation {k}k0\{\mathcal{I}_{k}\}_{k\geq 0} is said to have the extinction property if

limkhk=0a.s..\lim\limits_{kh\rightarrow\infty}\mathcal{I}_{k}=0\quad a.s.. (4.2)

The next theorem presents some sufficient conditions to ensure the extinction property of the original stochastic SIS model (1.3), which is indeed quote from [3, Theorems 4.1, 4.3].

Theorem 4.2.

Let the basic reproduction number of the stochastic SIS model (1.3) be less than one, i.e.,

R0S=βNμ+γσ2N22(μ+γ)<1.\displaystyle R_{0}^{S}=\tfrac{\beta N}{\mu+\gamma}-\tfrac{\sigma^{2}N^{2}}{2(\mu+\gamma)}<1. (4.3)

For any given initial value I0(0,N)I_{0}\in(0,N), we have the following extinction properties.

  1. (i)

    If σ2βN\sigma^{2}\leq\frac{\beta}{N}, then

    lim suptlogIttβN12σ2N2μγ<0a.s..\displaystyle\limsup\limits_{t\rightarrow\infty}\frac{\log{I_{t}}}{t}\leq\beta N-\tfrac{1}{2}\sigma^{2}N^{2}-\mu-\gamma<0\quad a.s.. (4.4)
  2. (ii)

    If σ2>max{βN,β22(μ+γ)}\sigma^{2}>\max\Big{\{}\frac{\beta}{N},\,\frac{\beta^{2}}{2(\mu+\gamma)}\Big{\}}, then

    lim suptlogIttβ22σ2μγ<0a.s..\displaystyle\limsup\limits_{t\rightarrow\infty}\frac{\log{I_{t}}}{t}\leq\tfrac{\beta^{2}}{2\sigma^{2}}-\mu-\gamma<0\quad a.s.. (4.5)

We mention that the assertions (4.4) and (4.5) imply that the solution ItI_{t} of the stochastic SIS model tends to zero exponentially almost surely as time grows. In other words, the disease dies out with probability one, as time tends to infinity. In what follows, we investigate under which conditions the numerical approximation will admit the extinction property in the sense that k\mathcal{I}_{k} tends to zero exponentially almost surely, which is to be stated in the next theorem.

Theorem 4.3.

Let the condition (4.3) hold, i.e., R0S<1R_{0}^{S}<1. For any given initial value I0(0,N)I_{0}\in(0,N) and for any step size h>0h>0, the numerical approximations k\mathcal{I}_{k} possess the following extinction properties.

  1. (i)

    If σ2βN\sigma^{2}\leq\frac{\beta}{N}, then

    lim supkhlogkkhβN12σ2N2μγ<0a.s..\displaystyle\limsup\limits_{kh\rightarrow\infty}\frac{\log{\mathcal{I}_{k}}}{kh}\leq\beta N-\tfrac{1}{2}\sigma^{2}N^{2}-\mu-\gamma<0\quad a.s.. (4.6)
  2. (ii)

    If σ2>max{βN,β22(μ+γ)}\sigma^{2}>\max\Big{\{}\frac{\beta}{N},\,\frac{\beta^{2}}{2(\mu+\gamma)}\Big{\}}, then

    lim supkhlogkkhβ22σ2μγ<0a.s..\displaystyle\limsup\limits_{kh\rightarrow\infty}\frac{\log{\mathcal{I}_{k}}}{kh}\leq\tfrac{\beta^{2}}{2\sigma^{2}}-\mu-\gamma<0\quad a.s.. (4.7)

    In other words, the numerical approximations produced by (2.10) tends to zero exponentially almost surely as time evolves.

Proof: Recall first that

f(x)\displaystyle f(x) =12σ2e2x+(σ2Nβ)ex+(βNμγ12σ2N2),x(,logN).\displaystyle=-\tfrac{1}{2}\sigma^{2}\text{e}^{2x}+(\sigma^{2}N-\beta)\text{e}^{x}+(\beta N-\mu-\gamma-\tfrac{1}{2}\sigma^{2}N^{2}),\quad x\in(-\infty,\log N).

In the first case that σ2βN\sigma^{2}\leq\tfrac{\beta}{N}, clearly f(x)βNμγ12σ2N2<0f(x)\leq\beta N-\mu-\gamma-\frac{1}{2}\sigma^{2}N^{2}<0. In the second case that σ2>max{βN,β22(μ+γ)}\sigma^{2}>\max\Big{\{}\frac{\beta}{N},\,\frac{\beta^{2}}{2(\mu+\gamma)}\Big{\}}, f(x)f(x) reaches its maximum value β22σ2μγ<0\tfrac{\beta^{2}}{2\sigma^{2}}-\mu-\gamma<0 when ex=σ2Nβσ2e^{x}=\tfrac{\sigma^{2}N-\beta}{\sigma^{2}}. By denoting

fmaxσ:={βNμγ12σ2N2,σ2βN;β22σ2μγ,σ2>max{βN,β22(μ+γ)},\displaystyle f_{max}^{\sigma}:=\begin{cases}\beta N-\mu-\gamma-\frac{1}{2}\sigma^{2}N^{2},\quad\sigma^{2}\leq\tfrac{\beta}{N};\\ \tfrac{\beta^{2}}{2\sigma^{2}}-\mu-\gamma,\quad\sigma^{2}>\max\Big{\{}\frac{\beta}{N},\,\frac{\beta^{2}}{2(\mu+\gamma)}\Big{\}},\end{cases} (4.8)

in any case we have

f(x)fmaxσ<0.\displaystyle f(x)\leq f_{max}^{\sigma}<0. (4.9)

Recall that

{Y¯k+1=Yk+f(Yk)h+g(Yk)ΔWk+g(Yk)g(Yk)Δζk,Yk+1=Y¯k+1𝟙{Y¯k+1<logN}+(logNαhθ)𝟙{Y¯k+1logN}.\left\{\begin{array}[]{l}\bar{Y}_{k+1}=Y_{k}+f(Y_{k})h+g(Y_{k})\Delta W_{k}+g(Y_{k})g^{\prime}(Y_{k})\Delta\zeta_{k},\\ {Y}_{k+1}=\bar{Y}_{k+1}\mathbbm{1}_{{\color[rgb]{1,0,0}\{}\bar{Y}_{k+1}<\log N{\color[rgb]{1,0,0}\}}}+(\log N-\alpha h^{\theta})\mathbbm{1}_{\{\bar{Y}_{k+1}\geq\log N\}}.\end{array}\right.

It follows from (4.9) and by induction that

Y¯k+1\displaystyle\bar{Y}_{k+1} Yk+hfmaxσ+g(Yk)ΔWk+g(Yk)g(Yk)Δζk\displaystyle\leq Y_{k}+hf_{max}^{\sigma}+g(Y_{k})\Delta W_{k}+g(Y_{k})g^{\prime}(Y_{k})\Delta\zeta_{k}
Y0+(k+1)hfmaxσ+i=0kg(Yi)ΔWi+i=0kg(Yi)g(Yi)Δζi,\displaystyle\leq Y_{0}+(k+1)hf_{max}^{\sigma}+\sum_{i=0}^{k}g(Y_{i})\Delta W_{i}+\sum_{i=0}^{k}g(Y_{i})g^{\prime}(Y_{i})\Delta\zeta_{i}, (4.10)

and thus

Yk+1Y¯k+1Y0+(k+1)hfmaxσ+i=0kg(Yi)ΔWi+i=0kg(Yi)g(Yi)Δζi.\displaystyle Y_{k+1}\leq\bar{Y}_{k+1}\leq Y_{0}+(k+1)hf_{max}^{\sigma}+\sum_{i=0}^{k}g(Y_{i})\Delta W_{i}+\sum_{i=0}^{k}g(Y_{i})g^{\prime}(Y_{i})\Delta\zeta_{i}. (4.11)

Therefore,

lim supkhYkkh\displaystyle\limsup\limits_{kh\rightarrow\infty}\frac{Y_{k}}{kh} fmaxσ+lim supkh1khi=0k1g(Yi)ΔWi+lim supkh1khi=0k1g(Yi)g(Yi)Δζia.s..\displaystyle\leq f_{max}^{\sigma}+\limsup\limits_{kh\rightarrow\infty}\frac{1}{kh}\sum_{i=0}^{k-1}g(Y_{i})\Delta W_{i}+\limsup\limits_{kh\rightarrow\infty}\frac{1}{kh}\sum_{i=0}^{k-1}g(Y_{i})g^{\prime}(Y_{i})\Delta\zeta_{i}\quad a.s..

Further, note that

Ξt(3):=0tg(Yκ(s))dWs,Ξt(4):=0tg(Yκ(s))g(Yκ(s))(WsWκ(s))dWs\Xi^{(3)}_{t}:=\int_{0}^{t}g(Y_{\kappa(s)}){\rm d}W_{s},\ \Xi^{(4)}_{t}:=\int_{0}^{t}g^{\prime}(Y_{\kappa(s)})g(Y_{\kappa(s)})(W_{s}-W_{\kappa(s)}){\rm d}W_{s}

are both square-integrable continuous time martingales. By the large number theorem (see e.g., [31, Theorem 3.4.]) for martingales we have

limtΞt(3)t=limtΞt(4)t=0,a.s.,\lim\limits_{t\rightarrow\infty}\frac{\Xi^{(3)}_{t}}{t}=\lim\limits_{t\rightarrow\infty}\frac{\Xi^{(4)}_{t}}{t}=0,\ a.s.,

which yields that

lim supkh1khi=0k1g(Yi)ΔWi=lim supkh1khi=0k1g(Yi)g(Yi)Δζi=0a.s..\displaystyle\limsup\limits_{kh\rightarrow\infty}\frac{1}{kh}\sum_{i=0}^{k-1}g(Y_{i})\Delta W_{i}=\limsup\limits_{kh\rightarrow\infty}\frac{1}{kh}\sum_{i=0}^{k-1}g(Y_{i})g^{\prime}(Y_{i})\Delta\zeta_{i}=0\quad a.s.. (4.12)

Therefore

lim supkhYkkhfmaxσ<0a.s..\displaystyle\limsup\limits_{kh\rightarrow\infty}\frac{Y_{k}}{kh}\leq f_{max}^{\sigma}<0\quad a.s.. (4.13)

Noting that logk=Yk,\log\mathcal{I}_{k}=Y_{k}, we finally arrive at

lim supkhlogkkh\displaystyle\limsup\limits_{kh\rightarrow\infty}\frac{\log\mathcal{I}_{k}}{kh} =lim supkhYkkhfmaxσ<0a.s..\displaystyle=\limsup\limits_{kh\rightarrow\infty}\frac{Y_{k}}{kh}\leq f_{max}^{\sigma}<0\quad a.s..

The proof is thus completed. ∎

Theorem 4.3 shows that the numerical approximation produced by the LCM scheme is able to reproduce the extinction property of the original model for any step size h>0h>0.

4.2 Unconditional persistence preserving

In this subsection, let us turn to the persistence property of the model, defined as follows.

Definition 4.4 (Persistence).

If the unique positive solution ItI_{t}, t0t\geq 0 of the stochastic SIS model obeys

lim suptItλa.s.andlim inftItλa.s.,\limsup\limits_{t\rightarrow\infty}I_{t}\geq\lambda\quad a.s.\quad\text{and}\quad\liminf\limits_{t\rightarrow\infty}I_{t}\leq\lambda\quad a.s., (4.14)

where λ\lambda is a positive constant, namely, ItI_{t} will rise to or above λ\lambda infinitely often with probability one, we say that the infected population system has the persistence property. Similarly, the numerical approximation {k}k0\{\mathcal{I}_{k}\}_{k\geq 0} is said to have the persistence property if

lim supkhkλa.s.andlim infkhkλa.s..\limsup\limits_{kh\rightarrow\infty}\mathcal{I}_{k}\geq\lambda\quad a.s.\quad\text{and}\quad\liminf\limits_{kh\rightarrow\infty}\mathcal{I}_{k}\leq\lambda\quad a.s.. (4.15)

We mention that lim suptIt\limsup\limits_{t\rightarrow\infty}I_{t} λ>0\geq\lambda>0 implies that ItI_{t} will rise to or above λ\lambda infinitely often, which means the disease will persist and never die out. The other assertion lim inftIt\liminf\limits_{t\rightarrow\infty}I_{t} λ\leq\lambda, i.e., ItI_{t} will be below λ\lambda infinitely often, then provides more precise information about the range of the ”Persistence”. We are now in a position to provide some sufficient conditions to ensure the persistence property of the original stochastic SIS mode (1.3), which have been established in [3, Theorem 5.1].

Theorem 4.5.

If

R0S=βNμ+γσ2N22(μ+γ)>1,\displaystyle R_{0}^{S}=\tfrac{\beta N}{\mu+\gamma}-\tfrac{\sigma^{2}N^{2}}{2(\mu+\gamma)}>1, (4.16)

then for any given initial value I0(0,N)I_{0}\in(0,N), the solution of the stochastic SIS model (1.3) obeys

lim suptItλa.s.andlim inftItλa.s.,\limsup\limits_{t\rightarrow\infty}I_{t}\geq\lambda\quad a.s.\quad\text{and}\quad\liminf\limits_{t\rightarrow\infty}I_{t}\leq\lambda\quad a.s., (4.17)

where λ\lambda is the unique root in (0,N)(0,N) of

βNμγβλ12σ2(Nλ)2=0.\displaystyle\beta N-\mu-\gamma-\beta\lambda-\tfrac{1}{2}\sigma^{2}(N-\lambda)^{2}=0. (4.18)

In other words, ItI_{t} will rise to or above λ\lambda infinitely often with probability one.

Next, let us investigate the ability of the numerical approximation produced by the LCM scheme to preserve the persistence property in the sense that k\mathcal{I}_{k} rise to or above a positive constant infinitely often with probability one.

Theorem 4.6.

Let the condition (4.16) hold, i.e., R0S>1R_{0}^{S}>1. For any step size h>0h>0, if we chose a proper constant α(0,1]\alpha\in(0,1] in the scheme (2.10) satisfying

α<hθlog(σ2Nσ2Nβ+β22σ2(μ+γ)),\alpha<h^{-\theta}\log\Big{(}\tfrac{\sigma^{2}N}{\sigma^{2}N-\beta+\sqrt{\beta^{2}-2\sigma^{2}(\mu+\gamma)}}\Big{)}, (4.19)

then for any given initial value I0(0,N)I_{0}\in(0,N) the numerical approximation obeys:

lim supkhkλa.s.andlim infkhkλa.s.,\limsup\limits_{kh\rightarrow\infty}\mathcal{I}_{k}\geq\lambda\quad a.s.\quad\text{and}\quad\liminf\limits_{kh\rightarrow\infty}\mathcal{I}_{k}\leq\lambda\quad a.s., (4.20)

where λ\lambda is the unique root of

βNμγβλ12σ2(Nλ)2=0.\displaystyle\beta N-\mu-\gamma-\beta\lambda-\tfrac{1}{2}\sigma^{2}(N-\lambda)^{2}=0. (4.21)

In other words, the numerical approximations produced by (2.10) will rise to or above λ\lambda infinitely often with probability one.

Proof: By the assumption (4.16), there exists a positive constant δ\delta such that δ<R0S1.\delta<R_{0}^{S}-1. Recall that

f(x)=12σ2e2x+(σ2Nβ)ex+(βNμγ12σ2N2).f(x)=-\tfrac{1}{2}\sigma^{2}\text{e}^{2x}+(\sigma^{2}N-\beta)\text{e}^{x}+(\beta N-\mu-\gamma-\tfrac{1}{2}\sigma^{2}N^{2}).

Clearly we have

limxf(x)\displaystyle\lim\limits_{x\rightarrow-\infty}f(x) =βNμγ12σ2N2>δ(μ+γ)>0,\displaystyle=\beta N-\mu-\gamma-\tfrac{1}{2}\sigma^{2}N^{2}>\delta(\mu+\gamma)>0, (4.22)
limx(logNαhθ)f(x)\displaystyle\lim\limits_{x\rightarrow(\log N-\alpha h^{\theta})^{-}}f(x) =12σ2N2(1eαhθ)2+βN(1eαhθ)μγ.\displaystyle=-\tfrac{1}{2}\sigma^{2}N^{2}\big{(}1-\text{e}^{-\alpha h^{\theta}}\big{)}^{2}+\beta N\big{(}1-\text{e}^{-\alpha h^{\theta}}\big{)}-\mu-\gamma. (4.23)

It is easy to derive that

limx(logNαhθ)f(x)<0\lim\limits_{x\rightarrow(\log N-\alpha h^{\theta})^{-}}f(x)<0 (4.24)

holds true, provided

1eαhθ<ββ22σ2(μ+γ)σ2N.1-\text{e}^{-\alpha h^{\theta}}<\tfrac{\beta-\sqrt{\beta^{2}-2\sigma^{2}(\mu+\gamma)}}{\sigma^{2}N}. (4.25)

This can be fulfilled under the assumption (4.19), that is,

α<hθlog(σ2Nσ2Nβ+β22σ2(μ+γ)).\alpha<h^{-\theta}\log\Big{(}\tfrac{\sigma^{2}N}{\sigma^{2}N-\beta+\sqrt{\beta^{2}-2\sigma^{2}(\mu+\gamma)}}\Big{)}.

Noting

f(x)=σ2e2x+(σ2Nβ)ex,f^{\prime}(x)=-\sigma^{2}\text{e}^{2x}+(\sigma^{2}N-\beta)\text{e}^{x},

one can readily infer that f(x)<0f^{\prime}(x)<0 and f(x)f(x) is decreasing in the case σ2Nβ0\sigma^{2}N-\beta\leq 0. In the other case σ2Nβ>0\sigma^{2}N-\beta>0,

  • f(x)f(x) is strictly increasing as x<log(σ2Nβσ2)x<\log(\tfrac{\sigma^{2}N-\beta}{\sigma^{2}}),

  • f(x)f(x) is strictly decreasing as x>log(σ2Nβσ2)x>\log(\tfrac{\sigma^{2}N-\beta}{\sigma^{2}}).

Thus the equation f(x)=0f(x)=0 has a unique root, denoted as η\eta, satisfying eη=λ\text{e}^{\eta}=\lambda and η<logNαhθ\eta<\log N-\alpha h^{\theta}.

Now we validate the two assertions in (4.20) in two steps. If the first assertion of (4.20) is not true, then there exists a positive constant ϵ\epsilon such that

P(Ω1)>ϵ,\displaystyle P(\Omega_{1})>\epsilon, (4.26)

where Ω1:={ω:lim supkhYk(ω)η2ϵ}\Omega_{1}:=\{\omega:\limsup\limits_{kh\rightarrow\infty}Y_{k}(\omega)\leq\eta-2\epsilon\}. Hence ωΩ1\forall\omega\in\Omega_{1}, there exists a m=m(ω)>0m=m(\omega)>0 such that

Y¯k(ω)=Yk(ω)ηϵ<logNαhθ\displaystyle\bar{Y}_{k}(\omega)=Y_{k}(\omega)\leq\eta-\epsilon<\log N-\alpha h^{\theta} (4.27)

whenever k>mk>m. We can choose ϵ\epsilon sufficiently small such that 0<f(ηϵ)<δ(μ+γ)0<f(\eta-\epsilon)<\delta(\mu+\gamma), which, together with (4.22), implies that

f(Yk(ω))f(ηϵ),\displaystyle f(Y_{k}(\omega))\geq f(\eta-\epsilon), (4.28)

whenever k>mk>m. Moreover, by the large number theorem of martingales, there is an Ω2Ω\Omega_{2}\subset\Omega with P(Ω2)=1P(\Omega_{2})=1 such that ωΩ2\forall\omega\in\Omega_{2}

limkh1khi=0k1g(Yi(ω))ΔWi(ω)+limkh1khi=0k1g(Yi(ω))g(Yi(ω))Δζi(ω)=0.\displaystyle\lim\limits_{kh\rightarrow\infty}\frac{1}{kh}\sum_{i=0}^{k-1}g(Y_{i}(\omega))\Delta W_{i}(\omega)+\lim\limits_{kh\rightarrow\infty}\frac{1}{kh}\sum_{i=0}^{k-1}g(Y_{i}(\omega))g^{\prime}(Y_{i}(\omega))\Delta\zeta_{i}(\omega)=0. (4.29)

Fix any ωΩ1Ω2\omega\in\Omega_{1}\cap\Omega_{2} and let k>m+1k>m+1. Then it follows from (4.28) and by induction that

Y¯k+1(ω)\displaystyle\bar{Y}_{k+1}(\omega) =Y¯k(ω)+f(Yk(ω))h+g(Yk(ω))ΔWk(ω)+g(Yk(ω))g(Yk(ω))Δζk(ω)\displaystyle=\bar{Y}_{k}(\omega)+f(Y_{k}(\omega))h+g(Y_{k}(\omega))\Delta W_{k}(\omega)+g(Y_{k}(\omega))g^{\prime}(Y_{k}(\omega))\Delta\zeta_{k}(\omega)
=Ym+1(ω)+i=m+1kf(Yi(ω))h\displaystyle=Y_{m+1}(\omega)+\sum_{i=m+1}^{k}f(Y_{i}(\omega))h
+i=m+1k[g(Yi(ω))ΔWi(ω)+g(Yi(ω))g(Yi(ω))Δζi(ω)]\displaystyle\quad+\sum_{i=m+1}^{k}\Big{[}g(Y_{i}(\omega))\Delta W_{i}(\omega)+g(Y_{i}(\omega))g^{\prime}(Y_{i}(\omega))\Delta\zeta_{i}(\omega)\Big{]}
Ym+1(ω)+(km)f(ηϵ)h\displaystyle\geq Y_{m+1}(\omega)+(k-m)f(\eta-\epsilon)h
+i=m+1k[g(Yi(ω))ΔWi(ω)+g(Yi(ω))g(Yi(ω))Δζi(ω)].\displaystyle\quad+\sum_{i=m+1}^{k}\Big{[}g(Y_{i}(\omega))\Delta W_{i}(\omega)+g(Y_{i}(\omega))g^{\prime}(Y_{i}(\omega))\Delta\zeta_{i}(\omega)\Big{]}. (4.30)

Thus

lim infkhY¯k(ω)khf(ηϵ)>0,\displaystyle\liminf\limits_{kh\rightarrow\infty}\frac{\bar{Y}_{k}(\omega)}{kh}\geq f(\eta-\epsilon)>0, (4.31)

and consequently

limkhY¯k(ω)=+.\displaystyle\lim\limits_{kh\rightarrow\infty}\bar{Y}_{k}(\omega)=+\infty. (4.32)

which contradicts (4.27). Thus

lim supkhYkηa.s..\displaystyle\limsup\limits_{kh\rightarrow\infty}Y_{k}\geq\eta\quad a.s.. (4.33)

Further, if the second assertion of (4.20) is not true, then there exists a positive constant ϵ\epsilon such that

P(Ω3)>ϵ,η+2ϵ<logN,\displaystyle P(\Omega_{3})>\epsilon,\ \eta+2\epsilon<\log N, (4.34)

where Ω3:={ω:lim infkhYk(ω)η+2ϵ}\Omega_{3}:=\{\omega:\liminf\limits_{kh\rightarrow\infty}Y_{k}(\omega)\geq\eta+2\epsilon\}. Hence ωΩ3\forall\omega\in\Omega_{3}, there exists a m=m(ω)>0m=m(\omega)>0 such that

Yk(ω)η+ϵ\displaystyle Y_{k}(\omega)\geq\eta+\epsilon (4.35)

whenever k>mk>m. Simple analysis on f(x)f(x) implies that

f(Yk(ω))f(η+ϵ)<0\displaystyle f(Y_{k}(\omega))\leq f(\eta+\epsilon)<0 (4.36)

whenever k>mk>m. Fix any ωΩ3Ω2\omega\in\Omega_{3}\cap\Omega_{2}. Then it follows from (4.36) and by induction that

Y¯k+1(ω)\displaystyle\bar{Y}_{k+1}(\omega) =Yk(ω)+f(Yk(ω))h+g(Yk(ω))ΔWk(ω)+g(Yk(ω))g(Yk(ω))Δζk(ω)\displaystyle=Y_{k}(\omega)+f(Y_{k}(\omega))h+g(Y_{k}(\omega))\Delta W_{k}(\omega)+g(Y_{k}(\omega))g^{\prime}(Y_{k}(\omega))\Delta\zeta_{k}(\omega)
Y0(ω)+i=0mf(Yi(ω))h+(km)f(η+ϵ)h\displaystyle\leq Y_{0}(\omega)+\sum_{i=0}^{m}f(Y_{i}(\omega))h+(k-m)f(\eta+\epsilon)h
+i=0k[g(Yi(ω))ΔWi(ω)+g(Yi(ω))g(Yi(ω))Δζi(ω)].\displaystyle\quad+\sum_{i=0}^{k}\Big{[}g(Y_{i}(\omega))\Delta W_{i}(\omega)+g(Y_{i}(\omega))g^{\prime}(Y_{i}(\omega))\Delta\zeta_{i}(\omega)\Big{]}. (4.37)

Thus by (4.29) we have

lim supkhY¯k(ω)khf(η+ϵ)<0,\displaystyle\limsup\limits_{kh\rightarrow\infty}\frac{\bar{Y}_{k}(\omega)}{kh}\leq f(\eta+\epsilon)<0, (4.38)

and consequently

limkhY¯k(ω)=.\displaystyle\lim\limits_{kh\rightarrow\infty}\bar{Y}_{k}(\omega)=-\infty. (4.39)

Therefore we have

limkhYk(ω)limkhY¯k(ω)=,\displaystyle\lim\limits_{kh\rightarrow\infty}Y_{k}(\omega)\leq\lim\limits_{kh\rightarrow\infty}\bar{Y}_{k}(\omega)=-\infty, (4.40)

which contradicts (4.35). Thus

lim infkhYkηa.s..\displaystyle\liminf\limits_{kh\rightarrow\infty}Y_{k}\leq\eta\quad a.s.. (4.41)

The proof of assertion (4.20) is therefore completed.

Remark 4.7.

Theorem 4.6 illustrates that, when the scheme parameters α,θ\alpha,\theta obey the condition (4.19), the numerical approximation produced by the LCM scheme with any step size h>0h>0 is able to reproduce the persistence property of the original model without any addition restriction on the model parameters. It is worthwhile to point out that, the condition (4.19) can be easily fulfilled, by taking α\alpha to be sufficiently small.

5 Numerical experiments

In this section, we provide numerical experiments to illustrate the previous theoretical findings. Consider the stochastic SIS epidemic model

dIt=It(βNμγβIt)dt+σIt(NIt)dWt,0tT.{\rm d}I_{t}=I_{t}(\beta N-\mu-\gamma-\beta I_{t})\,{\rm d}t+\sigma I_{t}(N-I_{t})\,{\rm d}W_{t},\quad 0\leq t\leq T.

The population sizes are measured in units of 1 billion and the unit of time is assumed to be one day throughout this section.

The approximation errors will be calculated in terms of

(𝔼[supk=0,,M|Itkk|2])12.\bigg{(}\mathbb{E}\Big{[}\sup\limits_{k=0,...,M}\big{|}I_{t_{k}}-\mathcal{I}_{k}\big{|}^{2}\Big{]}\bigg{)}^{\frac{1}{2}}.

The newly proposed LCM scheme (2.10), and the Lamperti truncated Euler-Maruyama (LTEM) scheme proposed in [25] with the scheme parameter K=(1+eY0)+50K=(1+e^{Y_{0}})+50 will be tested for comparison. Note that the specific value of the scheme parameter KK was not explicitly stated in [25]. In the numerical experiments, we choose K=1+eY0+50K=1+e^{Y_{0}}+50 such that K>1+eY0K>1+e^{Y_{0}}, which was required by assumptions in [25]. Moreover, we use numerical approximations produced by LTEM, which has been proved to convergent with order one, with the step size hexact=214h_{exact}=2^{-14} to identify the ”exact” solutions and those with step sizes h=2i,i=4,5,6,7,8h=2^{-i},i=4,5,6,7,8 for numerical schemes. The expectations appearing in the errors are approximated by calculating averages over 1000010000 paths. The following two sets of parameters, with fixed N=10N=10, are taken for tests.

Example 5.1.

T=1,β=0.5,σ=0.2,μ+γ=4,α=0.1,θ=2T=1,\beta=0.5,\sigma=0.2,\mu+\gamma=4,\alpha=0.1,\theta=2, I0=1I_{0}=1.

Example 5.2.

T=1,β=0.7,σ=0.1,μ+γ=2,α=1,θ=3T=1,\beta=0.7,\sigma=0.1,\mu+\gamma=2,\alpha=1,\theta=3 I0=9I_{0}=9.

Refer to caption
Figure 1: Example 5.1
Refer to caption
Figure 2: Example 5.2
Table 2: Sample average errors
hh 2102^{-10} 292^{-9} 282^{-8} 272^{-7} 262^{-6}
Ex 5.1 LCM 0.0006 0.0013 0.0026 0.0051 0.0103
LTEM 0.0007 0.0013 0.0027 0.0053 0.0113
Ex 5.2 LCM 0.0014 0.0029 0.0059 0.0120 0.0243
LTEM 0.0015 0.0030 0.0061 0.0124 0.0253
Table 3: Least-squares fit for the convergence rate qq
LCM scheme LTEM scheme
Ex 5.1 q=1.0047q=1.0047, resid = 0.01200.0120 q=1.0223q=1.0223, resid = 0.0417
Ex 5.2 q=1.0198q=1.0198, resid = 0.0032 q=1.0245q=1.0245, resid = 0.0016

Figs 2 and 2 show the average sample errors against various step sizes on a log-log scale. Detailed data is presented in Table 2. The approximation errors of the LCM and LTEM scheme are plotted in the blue and red solid lines. The black dashed lines are reference lines of slope 1. From the figures we can easily identify convergence rates of order 1 for both the LCM and LTEM scheme. Moreover, by assuming that errorChqerror\approx Ch^{q} such that log(error)logC+qlogh\log(error)\approx\log C+q\log h, the convergence rate qq and the least square residual is obtained with a least-squares fitting as presented in Table 3. These results confirm the expected convergence rate.

Concerning the dynamics behavior of the approximations, we test three different schemes for comparison: the newly proposed LCM scheme, the LTEM scheme and the usual Milstein scheme [32] directly applied to the original SDE without any transformation. The following two sets of model parameters, carefully chosen to meet all conditions in Theorems 4.3 or 4.6, with fixed α=0.1\alpha=0.1 and θ=2\theta=2, are taken as examples.

Example 5.3.

β=0.42,σ=0.9,μ+γ=10,I0=90,N=100\beta=0.42,\sigma=0.9,\mu+\gamma=10,I_{0}=90,N=100.

Example 5.4.

β=0.6,σ=0.01,μ+γ=40,I0=10,N=100{\color[rgb]{0,0,0}\beta=0.6,\sigma=0.01,\mu+\gamma=40,I_{0}=10,N=100}.

We mention that parameters in Example 5.3 satisfy the conditions of extinction in Theorem 4.2 and 4.3, while those in Example 5.4 meet the requirements of persistence in Theorem 4.5 and 4.6. Moreover, we can conclude by simple calculations that

lim infkhk32.9588lim supkhka.s.\liminf\limits_{kh\rightarrow\infty}\mathcal{I}_{k}\leq{\color[rgb]{0,0,0}32.9588}\leq\limsup\limits_{kh\rightarrow\infty}\mathcal{I}_{k}\quad a.s.

when the Example 5.4 is under consideration.

Refer to caption
Figure 3: Example 5.3: hexact=214h_{\text{exact}}=2^{-14}
Refer to caption
Figure 4: Example 5.3: h=24h=2^{-4}
Refer to caption
Figure 5: Example 5.3: h=22h=2^{-2}
Refer to caption
Figure 6: Example 5.4: hexact=214h_{\text{exact}}=2^{-14}
Refer to caption
Figure 7: Example 5.4: h=22h=2^{-2}
Refer to caption
Figure 8: Example 5.4: h=21h=2^{-1}
Table 4: The average percentage of truncation over 2×1042\times 10^{4} paths
hh 252^{-5} 242^{-4} 232^{-3} 222^{-2} 212^{-1}
Set (1) I0=10I_{0}=10 0 0 0 0 0
I0=50I_{0}=50 0.0072%0.0072\% 0.0081%0.0081\% 0.0129%0.0129\% 0.0508%0.0508\% 0.1199%0.1199\%
I0=90I_{0}=90 0.0488%0.0488\% 0.0578%0.0578\% 0.0977%0.0977\% 0.3927%0.3927\% 0.9408%0.9408\%
Set (2) I0=10I_{0}=10 0 5.5191%5.5191\% 49.9986%49.9986\% 50%50\% 50%50\%
I0=50I_{0}=50 0 5.5430%5.5430\% 49.9985%49.9985\% 50%50\% 50%50\%
I0=90I_{0}=90 0 5.4993%5.4993\% 49.9986%49.9986\% 50%50\% 50%50\%
Set (3) I0=10I_{0}=10 0 0 0.5397%0.5397\% 19.5684%19.5684\% 25.0898%25.0898\%
I0=50I_{0}=50 0 0 0.5382%0.5382\% 19.5228%19.5228\% 24.9660%24.9660\%
I0=90I_{0}=90 0 0 0.5379%0.5379\% 19.4598%19.4598\% 24.8422%24.8422\%
Set (4) I0=10I_{0}=10 0.0007%0.0007\% 0.0015%0.0015\% 0.0009%0.0009\% 0.0006%0.0006\% <0.0001%<0.0001\%
I0=50I_{0}=50 0.0006%0.0006\% 0.0011%0.0011\% 0.0011%0.0011\% 0.0008%0.0008\% 0.0004%0.0004\%
I0=90I_{0}=90 0.0006%0.0006\% 0.0013%0.0013\% 0.0015%0.0015\% 0.0003%0.0003\% <0.0001%<0.0001\%

We conduct numerical experiments on one-path simulations for the three different schemes with various step sizes h=2i,i=0,1,,5,14h=2^{-i},i=0,1,...,5,14. In Figures 3-8, we only show simulations with some chosen stepsizes. More accurately, Figure 3 presents numerical approximations to the SDE produced by three different schemes with a very fine step size hexact=214h_{\text{exact}}=2^{-14}, which reveal the exact behavior of the exact solution. This allows us to tell which scheme is most accurate and reliable when used to approximate the dynamics behavior of the model with larger and usual step sizes later. Our numerical results show, LCM exactly preserves the extinction property with six different step sizes, as opposed to explosion of LTEM when h24h\geq 2^{-4}, which can be also observed from Figures 5-5 for h=24h=2^{-4} and h=22h=2^{-2}. For Example 5.4, Figure 6 provides a glance at the dynamics behavior of the ”exact” solutions. From Figures 8-8 one can observe that the newly proposed LCM scheme reveals a persistent property for all step sizes. Instead, the LTEM scheme for Example 5.4 can only preserve the persistence property for sufficiently small step sizes h22h\leq 2^{-2} but fails with step sizes h21h\geq 2^{-1}. The Milstein scheme even explodes for all chosen step sizes except for h=214h=2^{-14}. These results confirm the excellent dynamics-preserving properties of the LCM scheme we construct.

Next, we are concerned with the truncation frequency of the LCM method, which would lead to a bias and is expected to be heavily dependent on the parameters and step sizes. To this end, we fix α=0.1\alpha=0.1, θ=2\theta=2 and take four sets of parameters as follows:

  1. (1)

    (R0S=400.8)(R_{0}^{S}=-400.8) β=0.42\beta=0.42, μ+γ=10\mu+\gamma=10, σ=0.9\sigma=0.9,

  2. (2)

    (R0S=4.15)(R_{0}^{S}=4.15) β=0.42\beta=0.42, μ+γ=10\mu+\gamma=10, σ=0.01\sigma=0.01,

  3. (3)

    (R0S=1.4875)(R_{0}^{S}=1.4875) β=0.6\beta=0.6, μ+γ=40\mu+\gamma=40, σ=0.01\sigma=0.01,

  4. (4)

    (R0S=0.25)(R_{0}^{S}=0.25) β=0.6\beta=0.6, μ+γ=40\mu+\gamma=40, σ=0.1\sigma=0.1,

with different initial values I0=10,50,90I_{0}=10,50,90 and five different step sizes h=2i,i=1,2,,5h=2^{-i},i=1,2,...,5. We run 2×1042\times 10^{4} trajectories and list the average percentage of truncation over 2×1042\times 10^{4} paths in Table 4. Numerical results indicate that the truncation frequency is extremely low for small step sizes (h=24,25h=2^{-4},2^{-5}). Furthermore, the truncation frequency for the extinction cases (1) and (4) is significantly lower than that for the persistence cases (2) and (3). For both cases, the truncation frequency tends to zero, as the step size hh shrinks.

6 Conclusion

In this paper we propose a first-order strongly convergent scheme for the stochastic SIS epidemic model which preserves the domain as well as the dynamics behavior of the model unconditionally. The easily implementable scheme relies on a logarithm transformation combined with a corrected explicit Milstein-type method. The strong convergence rate of the scheme is carefully analyzed and proved to be order 11. Moreover, the proposed scheme is able to reproduce the dynamics behavior, namely, the extinction and persistence properties of the original model without additional requirements on the model parameters and the step size h>0h>0 . Numerical experiments are provided to verify the convergence analysis and comparisons of dynamics behavior between different schemes are presented to show the advantage of the proposed scheme. Before closing the conclusion section, we mention that higher-order schemes which are also able to reproduce the dynamic properties of the considered model, as studied by [26], are on the top of the list of our future works.

\bmhead

Acknowledgments The authors thank the associated editor and anonymous reviewers for the helpful comments and suggestions.

Declarations

Funding

This work is supported by Natural Science Foundation of China (12471394, 12071488, 11971488) and the Fundamental Research Funds for the Central Universities of Central South University (Grant No. 2023zzts0348).

Conflict of interest/Competing interests

No potential conflict of interest was reported by the authors.

Ethical Approval

Not applicable

Consent to participate

Not applicable

Consent for publication

All authors have approved the manuscript for its submission and publication.

Availability of data and materials

The authors confirm that the data and materials supporting the findings of this study are available within the article.

Code availability

Code will be made available on request.

Authors’ contributions

Ruishu Liu: Formal analysis, Visualization, Writing - Original Draft, Software. Xiaojie Wang: Conceptualization, Methodology, Writing - Review & Editing, Funding acquisition, Supervision. Lei Dai: Methodology, Validation, Investigation, Formal analysis.

References

  • \bibcommenthead
  • Kermack and Mckendrick [1927] Kermack, W.O., Mckendrick, A.G.: A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London Series A 115 (1927)
  • Hethcote and Yorke [1984] Hethcote, H.W., Yorke, J.A.: Gonorrhea Transmission Dynamics and Control. Lecture Notes in Biomathematics. Springer, Berlin (1984)
  • Gray et al. [2011] Gray, A., Greenhalgh, D., Hu, L., Mao, X., Pan, J.: A stochastic differential equation SIS epidemic model. SIAM Journal on Applied Mathematics 71(3), 876–902 (2011)
  • Hutzenthaler et al. [2011] Hutzenthaler, M., Jentzen, A., Kloeden, P.E.: Strong and weak divergence in finite time of Euler’s method for stochastic differential equations with non-globally Lipschitz continuous coefficients. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467(2130), 1563–1576 (2011)
  • Beyn et al. [2016] Beyn, W.-J., Isaak, E., Kruse, R.: Stochastic C-stability and B-consistency of explicit and implicit Euler-type schemes. Journal of Scientific Computing 67(3), 955–987 (2016)
  • Beyn et al. [2017] Beyn, W.-J., Isaak, E., Kruse, R.: Stochastic C-stability and B-consistency of explicit and implicit Milstein-type schemes. Journal of Scientific Computing 70(3), 1042–1077 (2017)
  • Higham et al. [2002] Higham, D.J., Mao, X., Stuart, A.M.: Strong convergence of Euler-type methods for nonlinear stochastic differential equations. SIAM Journal on Numerical Analysis 40(3), 1041–1063 (2002)
  • Wang et al. [2020] Wang, X., Wu, J., Dong, B.: Mean-square convergence rates of stochastic theta methods for SDEs under a coupled monotonicity condition. BIT Numerical Mathematics 60(3), 759–790 (2020)
  • Andersson and Kruse [2017] Andersson, A., Kruse, R.: Mean-square convergence of the BDF2-Maruyama and backward Euler schemes for SDE satisfying a global monotonicity condition. BIT Numerical Mathematics 57(1), 21–53 (2017)
  • Hutzenthaler et al. [2012] Hutzenthaler, M., Jentzen, A., Kloeden, P.E.: Strong convergence of an explicit numerical method for SDEs with nonglobally Lipschitz continuous coefficients. The Annals of Applied Probability 22(4), 1611–1641 (2012)
  • Sabanis [2013] Sabanis, S.: A note on tamed Euler approximations. Electronic Communications in Probability 18, 1–10 (2013)
  • Wang and Gan [2013] Wang, X., Gan, S.: The tamed Milstein method for commutative stochastic differential equations with non-globally Lipschitz continuous coefficients. Journal of Difference Equations and Applications 19(3), 466–490 (2013)
  • Mao [2015] Mao, X.: The truncated Euler–Maruyama method for stochastic differential equations. Journal of Computational and Applied Mathematics 290, 370–384 (2015)
  • Tretyakov and Zhang [2013] Tretyakov, M.V., Zhang, Z.: A fundamental mean-square convergence theorem for SDEs with locally Lipschitz coefficients and its applications. SIAM Journal on Numerical Analysis 51(6), 3135–3162 (2013)
  • Hutzenthaler and Jentzen [2020] Hutzenthaler, M., Jentzen, A.: On a perturbation theory and on strong convergence rates for stochastic ordinary and partial differential equations with nonglobally monotone coefficients. The Annals of Probability 48(1), 53–93 (2020)
  • Brehier [2023] Brehier, C.-E.: Approximation of the invariant distribution for a class of ergodic SDEs with one-sided Lipschitz continuous drift coefficient using an explicit tamed Euler scheme. ESAIM: Probability and Statistics 27, 841–866 (2023)
  • Sabanis and Zhang [2019] Sabanis, S., Zhang, Y.: On explicit order 1.5 approximations with varying coefficients: the case of super-linear diffusion coefficients. Journal of Complexity 50, 84–115 (2019)
  • Cai et al. [2022] Cai, Y., Hu, J., Mao, X.: Positivity and boundedness preserving numerical scheme for the stochastic epidemic model with square-root diffusion term. Applied Numerical Mathematics 182, 100–116 (2022)
  • Yi et al. [2021] Yi, Y., Hu, Y., Zhao, J.: Positivity preserving logarithmic Euler-Maruyama type scheme for stochastic differential equations. Communications in Nonlinear Science and Numerical Simulation 101, 105895 (2021)
  • Alfonsi [2013] Alfonsi, A.: Strong order one convergence of a drift implicit Euler scheme: Application to the CIR process. Statistics & Probability Letters 83(2), 602–607 (2013)
  • Neuenkirch and Szpruch [2014] Neuenkirch, A., Szpruch, L.: First order strong approximations of scalar SDEs defined in a domain. Numerische Mathematik 128(1), 103–136 (2014)
  • Lei et al. [2023] Lei, Z., Gan, S., Chen, Z.: Strong and weak convergence rates of logarithmic transformed truncated EM methods for SDEs with positive solutions. Journal of Computational and Applied Mathematics 419, 114758 (2023)
  • Chen et al. [2021] Chen, L., Gan, S., Wang, X.: First order strong convergence of an explicit scheme for the stochastic SIS epidemic model. Journal of Computational and Applied Mathematics 392, 113482 (2021)
  • Yang and Huang [2021] Yang, H., Huang, J.: First order strong convergence of positivity preserving logarithmic Euler–Maruyama method for the stochastic SIS epidemic model. Applied Mathematics Letters 121, 107451 (2021)
  • Yang and Huang [2023] Yang, H., Huang, J.: Strong convergence and extinction of positivity preserving explicit scheme for the stochastic SIS epidemic model. Numerical Algorithms (2023)
  • Liu and Wang [2023] Liu, R., Wang, X.: A higher order positivity preserving scheme for the strong approximations of a stochastic epidemic model. Communications in Nonlinear Science and Numerical Simulation, 107258 (2023)
  • Yang et al. [2022] Yang, H., Pan, Y., Liu, W., Mu, Z.: Numerical analysis of split-step θ\theta methods with truncated Wiener process for a stochastic SIS epidemic model. Journal of Computational and Applied Mathematics 415, 114433 (2022)
  • Yang et al. [2023] Yang, X., Li, M., Yang, Z., Zhang, C.: Numerical analysis of a linearly backward Euler method with truncated Wiener process for a stochastic SIS model. Numerical Algorithms 93(2), 563–579 (2023)
  • Giles [2008] Giles, M.B.: Multilevel Monte Carlo path simulation. Operations research 56(3), 607–617 (2008)
  • Hutzenthaler and Jentzen [2011] Hutzenthaler, M., Jentzen, A.: Convergence of the stochastic Euler scheme for locally Lipschitz coefficients. Foundations of Computational Mathematics 11(6), 657–706 (2011)
  • Mao [2008] Mao, X.: Stochastic Differential Equations and Applications. Horwood, Chichester (2008)
  • Milshtein [1975] Milshtein, G.N.: Approximate integration of stochastic differential equations. Theory of Probability & Its Applications 19(3), 557–562 (1975)