1,661
Views
1
CrossRef citations to date
0
Altmetric
Research Article

On the basic reproduction number in semi-Markov switching networks

, , &
Pages 73-85 | Received 17 Jun 2020, Accepted 11 Dec 2020, Published online: 05 Jan 2021

ABSTRACT

Basic reproduction number R0 in network epidemic dynamics is studied in the case of stochastic regime-switching networks. For generality, the dependence between successive networks is considered to follow a continuous time semi-Markov chain. R0 is the weighted average of the basic reproduction numbers of deterministic subnetworks. Its position with respect to 1 can determine epidemic persistence or extinction in theories and simulations.

2010 Mathematics Subject Classifications:

1. Introduction

Contacts between a population can cause the spread of infectious diseases. Traditional mathematical models investigating epidemics assume that the contacts occur through mass action mixing [Citation7]. However, it ignores important details of the structure of social interactions that has high levels of heterogeneity in the number of contacts per individual. In recent years, network epidemiology which can reflect heterogeneity of the social contacts has been widely researched (see e.g.[Citation11,Citation12,Citation14,Citation15,Citation21]).

To date, studies of epidemic transmission over networks have mainly focused on the static networks that ignore the time scale of the contagion process and temporal variations of the contacts (edges or links in network terminology). In fact, in the case of many real-world contact networks to which epidemic processes are relevant are dynamic, with connections appearing, disappearing and being rewired with different time scales, and are better represented in accordance with a time-varying or temporal network [Citation6]. Temporal networks can explicitly take into account the time of contacts, which makes epidemic dynamics different from the same epidemic dynamics occurring in static networks. There's a lot of outstanding work here in temporal networks (see e.g. [Citation2,Citation6,Citation10,Citation21]).

Temporally-switching networks are a crucial type of time-varying networks. A large proportion of temporality of network structure is contributed by mobility of individuals. The movement of individuals leads to the formation of physical interaction networks over which the disease can be transmitted, and it can be seen as switching between a sequence of static networks due to addition or deletion of edges between nodes. Because temporally-switching networks may be more realistic for many real contact networks, explorations of this field have caused great concerns in recent years (see e.g. [Citation3,Citation4,Citation9,Citation13,Citation16–19]). Speidel et al. and Valdano et al. presented a theory to calculate the epidemic threshold in temporally-switching networks for the continuous and discrete time individual-based SIS epidemic model, respectively, and obtained a propagation threshold as a function of the spectral radius of the social contact networks [Citation18,Citation19]. They found that ignoring the dynamic nature of networks would lead to underestimation of endemicity. Volz et al. suggested that the frequency of networks switching is a significant factor for the emergence of endemic [Citation21]. Vazquez et al. found that the disease spreads in randomly switched networks much more slowly than in a regular static network [Citation20]. Ogura et al investigated an individual-based network epidemic model with random regime switching and presented sufficient conditions for disease extinction [Citation13]. Based on [Citation13], Cao et al. made a further promotion using Lyapunov function method and got a series of more complete dynamic analysis [Citation3]. Li et al. established a degree-based temporally-switching networks epidemic model, and found that the epidemic threshold depends on the first moment of nodes degree distributions of the two switching networks [Citation9]. Li et al. [Citation9] considered the case where the waiting time (dwell time or sojourn time ) in each regime lasts for the same. However, waiting time may be subject to some distribution. Hence, Cao et al. studied the case that waiting time obeys exponential distribution, based on the continuous time Markov chain and using stochastic theory, then obtained epidemic threshold and ergodicity of an SIS model with Markovian switching [Citation4].

Temporally-switching networks mentioned above focused on the dwell time is either a constant or a particular distribution, which enables the proposed models to be analysed mathematically. As a matter of fact, the dwell time of the network regime can follow arbitrary distribution. For example, if the regimes of people travelling on various vehicles are regarded as subnetworks, and the time spent on transportation is regarded as the sojourn time, then the sojourn time can be subject to any distribution. For overcoming the drawback of particular regime-switching models, in this paper, we will assume that in each network state the dwell time distribution obeys a broad distribution, which can be any probability distribution. In other words, the process used for characterizing network stochastic switching is semi-Markov one, a special case of which is the continuous time Markov process. About stochastic epidemic models driven by a semi-Markov process, there is no much progress has been made. Li et al. did some pioneering work in this field [Citation8]. Relied on the traditional compartment epidemic SIRS model, Li et al. [Citation8] studied the threshold dynamics and ergodicity of the model with the disease transmission rate driven by a semi-Markov process. However, to the best of our knowledge, there is no yet work about network epidemic models driven by a semi-Markov process. As a result, it is important to generalize the results obtained in [Citation4] for an SIS network epidemic model with Markov regime-switching to the case where the network switching is described by a semi-Markov process.

We model the time variations of network structures and disease transmission parameters based on the classical network epidemic SIS model [Citation14,Citation15]. Basic reproduction number R0 is established for epidemic in temporally-switching networks model driven by the semi-Markov process, and show that its position with respect to 1 determine the epidemic extinction or persistence. Unlike Markov regime-switching [Citation4], R0 is related not only to disease parameters, structures of contact networks and steady distribution of the embedded Markov chain but also to the mean waiting time between successive networks. In a sense, our work is a deliberate supplement and improvement to the existing theory of temporal-varying network epidemic model.

This paper is organized as follows. In Section 2, after giving the semi-Markov process and SIS epidemic model in static networks, we set up the epidemic model in switching network driven by semi-Markov process, and analyse the existence of the global positive solution of the model. In Section 3, we give the basic reproduction number R0 and analyse the threshold dynamics of the disease for stochastic extinction and persistence in time mean. In Section 4, numerical simulations are carried out to illustrate our theoretical results.

2. Preliminaries and model description

This section starts by introducing semi-Markov process and some basic assumptions in Section 2.1. Then, in Section 2.2, we review preliminary facts about degree-based network epidemic SIS model in static networks, then introduce the temporally-switching networks epidemic model driving by semi-Markov process and give the existence of the global positive solution of the model.

2.1. Semi-Markov process

Let{r(t),t0} be a semi-Markov process on the probability space taking values in a finite state space S={1,2,,M}, which denotes the state of switching networks based on the individuals movement. Let P=(pij)M×M represent the transition probability matrix, and Fi(t),t[0,) is the conditional waiting time distribution of {r(t),t0}. Let 0=τ0<τ1<τ2<<τn<are jump times, and κ1=τ1τ0,κ2=τ2τ1,,κn=τnτn1,are time intervals between two adjacent jumps, then Prτn+1=j, κn+1t|rτn=i=pijFi(t).Let Xn is nth visited state, then {Xn:=r(τn),n=0,1,} is Markov chain with transition probability pij, and it is called the embedded Markov chain of {r(t),t0}.

2.2. SIS epidemic model in switching networks

One of the important network epidemic models is degree-based SIS model which has been given by Pastor-Satorras and Vespignani [Citation14,Citation15] and represented by (1) dIk(t)dt=δIk(t)+λk[1Ik(t)]θ(t),k=1,2,,n,(1) where Ik(t) is the relative density of infected nodes with degree k at time t and k represents the number of neighbours of nodes (k=1,2,,n.); δ and λ are, respectively, the recovery and infection rates; p(k) is the proportion of nodes with degree k; I(t)=k=1np(k)Ik(t) is the global density of infected nodes at time t, which can reflect the total infected nodes density in networks; k=k=1nkp(k) is the mean degree of nodes, and θ(t)=k1k=1nkp(k)Ik(t) represents the density of edges emitted from infected nodes in the all edges, that is also the probability of taking any edge that connects to the infected nodes. System (Equation1) is a static network epidemic model without considering individuals' movement, and Pastor-Satorras and Vespignani [Citation14] found that R0=λk2δkis the basic reproduction number of system (Equation1), where k2=k=1nk2p(k) is the second-order moment of degree distribution of nodes. On the basis of this fact, Wang et al. gave a complete theoretical proof that R0 is the threshold of the epidemic spread [Citation22].

Now, let's incorporate the impact of individuals' movement into system (Equation1). We assume that individuals' movement between networks is described by a semi-Markov process {r(t),t0}. Once taking into account the spread processes in switching networks, degree k representing network topology and disease parameters δ and λ in model (Equation1) may switch between different levels with semi-Markov jump processes. Therefore, static network epidemic model (Equation1) develops into a stochastic SIS model with semi-Markov switching of the form (2) dIk(t)dt=Ik(t)+λr(t)k[1Ik(t)]θ(t),(2) where k=kr(t)=1r(t),2r(t),,nr(t), {nr(t)} is the degree sequence of the network. In above model, we assume recovery rates δr(t) are the same and equal to 1 after doing time scale conversion, which does not change the system dynamics. If r(0)=i0 is the initial state of the driving process {r(t)),t0}, then system (Equation2) is operated as follows. Starting from the initial value Ik(0)=I0, system obeys (Equation2) with λ=λi0,k=ki0 until time τ1 with probability distribution function Fi0() when the network switches to state i1 from state i0; and the process restarts from the state i1 and continues along (Equation2) with λ=λi1,k=ki1 until τ2 with probability distribution function Fi1(),. In this way, the switching processes will repeat as long as the semi-Markov process jumps. In particular, if distribution functions obey exponential distribution, i.e. Fi(t)=1eqit for some qi>0,iS, then system (Equation2) is a special case of system (2.2) in [Citation4].

Clearly, system (Equation2) has a zero solution. In fact, maybe positive solution has more practical meaning. The following theorem solves the issue of the existence of positive solution for any given initial value. Proof of Theorem 2.1 is similar to Theorem 2.1 in [Citation4], so it is omitted. We finish this section by Theorem 2.1.

Theorem 2.1

For any initial value (I0,r0)(0,1)×S of system (Equation2), 0I01 satisfies θ0>0, then there exist the solution Ik(t) on t[0,+) to system (Equation2) such that (3) PIk(t)(0,1) for all t0=1.(3) Moreover, (4) Pθ(t)(0,1) for all t0=1.(4)

3. Threshold dynamics of the epidemic

Theorem 2.1 proves the existence of the positive solution of system (Equation2). This positive property is crucial for an epidemic system. In the following subsections, we will discuss other important issue in the infectious disease dynamics: basic reproduction number R0 and threshold dynamics of the epidemic.

3.1. The basic reproduction number

In this paper, we assume the embedded Markov chain {Xn,nN} associated to the semi-Markov process {r(t),t0} is irreducible and thus has a unique positive stationary distribution π={πi:iS} with πP=π. Denote by mi the mean dwell time of {r(t),t0} in state i, mi=0[1Fi(s)]ds.Using the ergodic theorem with respect to the semi-Markov process (see e.g. [Citation5]), we can get limt1t0tg(r(s))ds=iSg(i)πimiiSπimi a.s.where g() are any bounded measurable functions.

Multiplying krp(kr)Footnote1 on both sides of system (Equation2) and then summing kr, we convert system(Equation2) to the following system (see Section 3 in [Citation4] for more details). (5) dθ(t)dt=θ(t)Rr1λrkr1kr=1nrkr2p(kr)Ik(t),(5) where Ri=λik2iki are the basic reproduction numbers of the subsystems on state iS. Thus, node-based system (Equation2) is converted into edge-based system (Equation5).

The basic reproduction number R0 refers to the average number of the infected during a period of infection when an infected individual enters a host population who are all susceptible, which is the most quantity in studying epidemic models. In this subsection, we will give the mathematical expression of R0 for system (Equation2) in the semi-Markov random regime switching. In the early stages of the disease, assume that there is a single infected individual in the population, and thus I00. Linearize the system (Equation5) about the disease-free equilibrium to give (6) dθ(t)dt=θ(t)(Rr1).(6) By the generalized Itô's formula and Theorem 2.1, if θ0>0, we have dlnθ(t)dt=Rr1.By the ergodic theory of the semi-Markov chain, one can obtain limt1tlnθ(t)=limt1t0t(Rr1)ds=1iSπimiiS(Ri1)πimi a.s.By [Citation1], define the largest Lyapunov exponent of (Equation6) as α(A,B):=limt1tlnθ(t)=AB,where A=limt1t0tRrds=1iSπimiiSRiπimi a.s.,and B=limt1t0t1ds=1.Hence, the basic reproduction number of system (Equation5) is represented as a positive number R0 such that α(A/R0,B)=0. Thus, R0=AB=iSπimiRiiSπimi.If the conditional holding time distribution Fi() is exponential, i.e. Fi(t)=1eqit for some qi>0,iS. Then the semi-Markov process {r(t),t0} will be degenerated to a continuous time Markov chain. At this time, the mean sojourn time mi=1/qi,iS. As a result, the basic reproduction number is reduced to R0=iSπiRi, which is the threshold for the extinction or permanence of the epidemic in the continuous time Markovian regime switching (see our previous work [Citation4], only need to do the appropriate formal transformation to get R0).

3.2. Extinction and persistent in time mean of the epidemic

We will see later that R0 is the threshold for the extinction or persistent in time mean of the epidemic. Before we prove this result, let's state a proposition which gives an equivalent condition for R0 with respect to 1 in terms of the basic reproduction number of the each subsystem, the stationary distribution of the embedded Markov chain, and the mean sojourn time in each state of the semi-Markov process.

Proposition 3.1

The following alternative conditions on the value of R0 are valid:

  • R0<1 if and only if iS(Ri1)πimi<0;

  • R0=1 if and only if iS(Ri1)πimi=0;

  • R0>1 if and only if iS(Ri1)πimi>0.

It is easy to prove this proposition, so it is omitted here. We can now state a lemma before giving the main results.

Lemma 3.2

[Citation23]

Let f(t)C([0,)×Ω,(0,)) and F(t)C([0,)×Ω,(,+))

(a)

If there exist positive constants T,λ0,λ such that logf(t)λtλ00tf(s)ds+F(t),a.s.,for all tTwhere limtF(t)t=0, then limsupt1t0tf(s)dsλλ0  a.s.

(b)

If there exist positive constants T,λ0,λ such that logf(t)λtλ00tf(s)ds+F(t),as.,for all tTwhere limtF(t)t=0,thenlim inft1t0tf(s)dsλλ0 a.s.

In the following theorem, we give the threshold dynamics of system (Equation2). But it is worth noting that, in the process of proving the theorem, we rely on system (Equation5). In fact, the threshold dynamics of systems (Equation2) and (Equation5) are consistent because θ(t) and Ik(t) have a relationship: θ(t)=k1k=1nkp(k)Ik(t).

Theorem 3.3

For system (Equation2), the following assertions hold.

(a)

If iS(Ri1)πimi<0, then limtIk(t)=0,i.e. the epidemic is exponentially extinct.

(b)

If iS(Ri1)πimi=0, then limt1t0tIk(s)ds=0,i.e. the epidemic is nonpersistent in time mean.

(c)

If iS(Ri1)πimi>0, then lim inft1t0tIk(s)ds>0,i.e. the epidemic is persistent in time mean.

Proof.

Clearly, if iS(Ri1)πimi<0, then system (Equation5) is almost surely exponentially stable at zero, i.e. the disease will become extinct exponentially with probability one. This completes the proof of (a).

Now we prove (b). By the fact limt1tlnθ(0)+0t(Rr1)ds=1iSπimiiS(Ri1)πimi,for arbitrary ϵ>0, there exists a constant T1>0 such that for all t>T1, (7) lnθ(0)+0t(Rr1)ds1iSπimiiS(Ri1)πimi+ϵt,(7) (8) lnθ(0)+0t(Rr1)ds1iSπimiiS(Ri1)πimiϵt.(8) It follows from (Equation5) leads (9) lnθ(t)lnθ(0)+0t(Rr1)dsλr0tθ(s)ds,(9) (10) lnθ(t)lnθ(0)+0t(Rr1)dsλrnr0tθ(s)ds.(10) Substituting (Equation7) into (Equation9), we have lnθ(t)1iSπimiiS(Ri1)πimi+ϵtλr0tθ(s)ds.By Lemma 3.2, if iS(Ri1)πimi>0, we have lim supt1t0tθ(s)ds1λˆiSπimiiS(Ri1)πimi+ϵ a.s.,where λˆ=miniλi>0,iS.

Particularly, when iS(Ri1)πimi=0, we have lim supt1t0tθ(s)dsϵλˆiSπimi a.s.Then the desired result holds by the arbitrariness of ε.

We are now prove (c). Substituting (Equation8) into (Equation10) one has lnθ(t)1iSπimiiS(Ri1)πimiϵtλrnr0tθ(s)ds.By Lemma 3.2, if iS(Ri1)πimi>0, we have lim inft1t0tθ(s)ds1λˇnˇiSπimiiS(Ri1)πimiϵ a.s.,where λˇ=maxiλi>0,nˇ=maxini,iS. Then the desired result holds by the arbitrariness of ε. This completes the proof of (c).

Remark 3.1

Theorem 3.3 shows that steady-state distribution of the embedded Markov chain π and the mean sojourn time mi of the semi-Markov chain in state i play an important role in terms of epidemic transmission. It is known that system (Equation2) contains several subsystems which are alternately and repeatedly switched according to the law of the semi-Markov chain. If the epidemic is extinct (persistent) in each subsystem, i.e. Ri1<0(>0)  iS, then overall system (Equation2) is still stochastically extinct (persistent in time mean), i.e. iS(Ri1)πimi<0(>0) a.s.. However, the more interesting thing about this theorem is that, if the epidemic is extinct in some subsystems but persistent in the others, then overall system (Equation2) maybe either stochastically extinct or persistent in time mean, and final results rely on the symbol of iS(Ri1)πimi which are related to the mean sojourn time mi of the semi-Markov chain in state i and steady-state distribution of the embedded Markov chain π. This is essentially different from the propagation of epidemic in the static network.

4. Simulations

In this section, some numerical simulations are carried out in three networks to verify theoretical results in Section 3. We assume that all parameters are given in suitable units. Three networks under regime switching are chosen a power-law network with power index γ=2.7, maximum degree 50, and two random networks with maximum degrees 20 and 30, respectively. We always assume the conditional holding time distribution Fi() of the semi-Markov process in state i obeys gamma distribution whose probability density function is given by f(t;α,β)=βαΓ(α)tα1eβt,t0and the cumulative distribution function is F(t;α,β)=0tf(u;α,β)du,t0where α>0,β>0, Γ() is a gamma function. Specially, if the parameter α=1, the gamma distribution is an exponential distribution with rate parameter β.

Extinction and persistent in time mean of system (Equation2) are discussed in the following cases:

Case 1. If the infectious disease dies out in all subsystems, then it remains extinct in whole system (Equation2). In this case, we let F1(t), F2(t) and F3(t) are gamma distributions with parameters α1=0.6,β1=0.1389; α2=0.8,β2=0.2148; α3=0.7,β3=0.186, then the mean sojourn times are m1=4.3197,m2=3.7244, m3=3.7634, respectively. Other parameters of system (Equation2) are assumed to be λ1=0.1,λ2=0.2,λ3=0.15,π1=0.4,π2=0.3,π3=0.3, then R1=0.9,R2=0.8186,R3=0.75. Obviously, (R11)π1m1+(R21)π2m2+(R31)π3m3=0.6577<0. By Theorem 3.3, the global infected density I(t) will tend to zero with probability one (see Figure (a)).

Figure 1. Numerical simulation of semi-Markov chain r(t) and its corresponding global infected density I(t). Switching times of r(t) obey the gamma distribution.

Figure 1. Numerical simulation of semi-Markov chain r(t) and its corresponding global infected density I(t). Switching times of r(t) obey the gamma distribution.

Case 2. If the infectious disease dies out in both subsystems and persists in one subsystem, then it may remain randomly extinct in the whole system (Equation2). In this case, we let F1(t), F2(t) and F3(t) are gamma distributions with parameters α1=0.8,β1=0.6; α2=1.1,β2=0.8; α3=0.7,β3=0.186, then the mean sojourn times are m1=1.3333,m2=1.375, m3=3.7634, respectively. Other parameters of system (Equation2) are assumed to be λ1=0.2,λ2=0.15,λ3=0.15,π1=0.4,π2=0.3,π3=0.3, then R1=1.8,R2=0.6139,R3=0.75. Obviously, (R11)π1m1+(R21)π2m2+(R31)π3m3=0.0148<0. We can see the global infected density I(t) will almost surely tend to zero (see Figure (b)).

Case 3. If the infectious disease dies out in both subsystems and persists in one subsystem, then it may also remain randomly persistent in time mean in the whole system (Equation2). In this case, we let F1(t), F2(t) and F3(t) are gamma distributions with parameters α1=1.0,β1=0.6; α2=0.5,β2=0.7; α3=0.5,β3=0.186, then the mean sojourn times are m1=1.6667,m2=0.7143, m3=2.6882, respectively. Other parameters of system (Equation2) are assumed to be λ1=0.3,λ2=0.15,λ3=0.1,π1=0.6,π2=0.3,π3=0.1, then R1=2.7,R2=0.6139,R3=0.5. Obviously, (R11)π1m1+(R21)π2m2+(R31)π3m3=1.4829>0. By Theorem 3.3, for any given initial value (I0,r0)(0,1)×S, system (Equation2) will be persistent in time mean (see Figure (a)).

Figure 2. Numerical simulation of semi-Markov chain r(t) and its corresponding global infected density in time mean 1t0tI(s)ds. Switching times of r(t) obey the gamma distribution.

Figure 2. Numerical simulation of semi-Markov chain r(t) and its corresponding global infected density in time mean 1t∫0tI(s)ds. Switching times of r(t) obey the gamma distribution.

Case 4. If the infectious disease is persistent in all three subsystems, then it is still persistent in time mean in the whole system (Equation2). In this case, we let F1(t), F2(t) and F3(t) are gamma distributions with parameters α1=0.6,β1=0.1389; α2=0.8,β2=0.2148; α3=0.7,β3=0.186, then the mean sojourn times are m1=4.3197,m2=3.7244, m3=3.7634, respectively. Other parameters of system (Equation2) are assumed to be λ1=0.2,λ2=0.4,λ3=0.3,π1=0.4,π2=0.3,π3=0.3, then R1=1.8,R2=1.6372,R3=1.5. Obviously, (R11)π1m1+(R21)π2m2+(R31)π3m3=2.6588>0. By Theorem 3.3, for any given initial value (I0,r0)(0,1)×S, epidemic will be persistent in time mean. Figure (b) simulates this case.

Case 5. If the infectious disease dies out in both subsystems and persists in one subsystem, then it may also remain be nonpersistent in time mean (Equation2). In this case, we let F1(t), F2(t) and F3(t) are gamma distributions with parameters α1=0.6,β1=0.1389; α2=0.4,β2=0.2148; α3=0.7,β3=0.1947, then the mean sojourn times are m1=4.3197,m2=1.8622, m3=3.5953, respectively. Other parameters of system (Equation2) are assumed to be λ1=0.1,λ2=0.15,λ3=0.25,π1=0.25,π2=0.3,π3=0.4, then R1=0.9,R2=0.6139,R3=1.25. Obviously, (R11)π1m1+(R21)π2m2+(R31)π3m3=0.0000. By Theorem 3.3, epidemic will be nonpersistent in time mean (see Figure (c)).

5. Conclusions

In this paper, we have studied the propagation dynamics of the temporal networks with random regime switching. Making use of a static network epidemic SIS model and the semi-Markov regime switching mechanism, we establish model (Equation2) and its corresponding transformation form (Equation5). A feasible method for analysing the basic reproduction number and threshold dynamics was proposed. It is the position of R0 with respect to 1, which decides whether the epidemic is persistent in time mean or extinct in theories and simulations. For the special case where Markov regime switching of system (2.2) in [Citation4], a generalized version in a semi-Markov regime switching has been studied.

Acknowledgments

This work is supported by the National Natural Science Foundation of China (61873154,11331009,11971279), Shanxi Key Laboratory (201705D111006), Shanxi Scientific and Technology Innovation Team (201805D131012-1).

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This work is supported by the National Natural Science Foundation of China [61873154; 11971279; 11331009], Shanxi Key Laboratory [201705D111006], Shanxi Scientific and Technology Innovation Team [201805D131012-1].

Notes

1 Without causing confusion, t is omitted in r(t) below.

References

  • N. Bacaër, M. Khaladi, On the basic reproduction number in a random environment, J. Math. Biol. 67(6) (2013), pp. 1729–1739.
  • F. Brauer, Epidemic models with heterogeneous mixing and treatment, Bull. Math. Biol. 70(7) (2008), pp. 1869–1885.
  • X. Cao and Z. Jin, N-intertwined SIS epidemic model with markovian switching, Stoc. Dyn. 19 (2018), pp. 1950031.
  • X. Cao and Z. Jin, Epidemic threshold and ergodicity of an SIS model in switched networks, J. Math. Anal. Appl. 479(1) (2019), pp. 1182–1194.
  • I.I. Gihman and A.V. Skorohod, The Theory of Stochastic Processes II, Springer-Verlag, New York, 1975.
  • P. Holme and J. Saramäki, Temporal networks, Phys. Reports 519(3) (2012), pp. 97–125.
  • W.O. Kermack and A.G. Mckendrick, A contribution to the mathematical theory of epidemics, Proc. Roy. Soc. London A 115 (1927), pp. 700–721.
  • D. Li, S. Liu, and J. Cui, Threshold dynamics and ergodicity of an SIRS epidemic model with semi-markov switching, J. Differ. Equ. 266(7) (2019), pp. 3973–4017.
  • K. Li, H. Zhang, X. Fu, Y. Ding, and M. Small, Epidemic threshold determined by the first moments of network with alternating degree distributions, Phys. A: Stat. Mech. Appl. 419 (2015), pp. 585–593.
  • N. Masuda and P. Holme, Temporal Network Epidemiology, Springer Nature, Singapore, 2017.
  • J.C. Miller, Epidemic size and probability in populations with heterogeneous infectivity and susceptibility, Phys. Rev. E Stat. Nonlinear Soft. Matter Phys. 76(1 Pt 1) (2007), pp. 010101.
  • M.E. Newman, Spread of epidemic disease on networks, Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 66(1 Pt 2) (2002), pp. 016128.
  • M. Ogura and V.M. Preciado, Stability of spreading processes over time-varying large-scale networks, IEEE Trans. Netw. Sci. Eng. 3(1) (2016), pp. 44–57.
  • R. Pastor-Satorras and A. Vespignani, Epidemic spreading in scale-free networks, Phys. Rev. Lett.86(14) (2001), pp. 3200.
  • R. Pastor-Satorras and A. Vespignani, Epidemic dynamics in finite size scale-free networks, Phys. Rev. E 65(3) (2002), pp. 035108.
  • B.A. Prakash, H. Tong, N. Valler, M. Faloutsos, and C. Faloutsos, Virus propagation on time-varying networks: Theory and immunization algorithms, Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer, 2010, pp. 99–114.
  • M.R. Sanatkar, W.N. White, B. Natarajan, C.M. Scoglio, and K.A. Garrett, Epidemic threshold of an SIS model in dynamic switching networks, IEEE Trans. Syst. Man Cybern. Syst. 46(3) (2016), pp. 345–355.
  • L. Speidel, K. Klemm, V.M. Eguíluz, and N. Masuda, Temporal interactions facilitate endemicity in the susceptible-infected-susceptible epidemic model, New J. Phys. 18(7) (2016), pp. 073013.
  • E. Valdano, L. Ferreri, C. Poletto, and V. Colizza, Analytical computation of the epidemic threshold on temporal networks, Phys. Rev. X 18(3) (2014), pp. 503–512.
  • A. Vazquez, B. Rácz, A. Lukács, and A.L. Barabási, Impact of non-Poissonian activity patterns on spreading processes, Phys. Rev. Lett. 98(15) (2007), pp. 158702.
  • E. Volz and L.A. Meyers, Epidemic thresholds in dynamic contact networks, J. Roy. Soc. Interface6(32) (2009), p. 233.
  • L. Wang and G.-Z. Dai, Global stability of virus spreading in complex heterogeneous networks, SIAM J. Appl. Math. 68(5) (2008), pp. 1495–1502.
  • X. Yu, S. Yuan, and T. Zhang, Persistence and ergodicity of a stochastic single species model with allee effect under regime switching, Commun. Nonlinear Sci. Numer. Simul. 59 (2018), pp. 359–374.