
Mathematical modeling of epidemic diseases is increasingly being used to respond to emerging diseases. Although conditions modeled by SIS dynamics will eventually reach either a disease-free steady-state or an endemic steady state without interventions, it is desirable to eradicate the disease as quickly as possible by introducing a control scheme. Here, we investigate the control methods of epidemic models on dynamic networks with temporary link deactivation. A quick link deactivation mechanism can simulate a community effort to reduce the risk of infection by temporarily avoiding infected neighbors. Once infected individuals recover, the links between the susceptible and recovered are activated. Our study suggests that a control scheme that has been shown ineffective in controlling dynamic network models may yield effective responses for networks with certain types of link dynamics, such as the temporary link deactivation mechanisms. We observe that a faster and more effective eradication could be achieved by updating control schemes frequently.
Citation: Jun Hyung Bae, Sang-Mook Lee. Investigation of SIS epidemics on dynamic network models with temporary link deactivation control schemes[J]. Mathematical Biosciences and Engineering, 2022, 19(6): 6317-6330. doi: 10.3934/mbe.2022295
[1] | Junbo Jia, Wei Shi, Pan Yang, Xinchu Fu . Immunization strategies in directed networks. Mathematical Biosciences and Engineering, 2020, 17(4): 3925-3952. doi: 10.3934/mbe.2020218 |
[2] | Philip K. Pollett . An SIS epidemic model with individual variation. Mathematical Biosciences and Engineering, 2024, 21(4): 5446-5455. doi: 10.3934/mbe.2024240 |
[3] | Jianquan Li, Zhien Ma, Fred Brauer . Global analysis of discrete-time SI and SIS epidemic models. Mathematical Biosciences and Engineering, 2007, 4(4): 699-710. doi: 10.3934/mbe.2007.4.699 |
[4] | Ke Guo, Wanbiao Ma . Global dynamics of an SI epidemic model with nonlinear incidence rate, feedback controls and time delays. Mathematical Biosciences and Engineering, 2021, 18(1): 643-672. doi: 10.3934/mbe.2021035 |
[5] | F. S. Vannucchi, S. Boccaletti . Chaotic spreading of epidemics in complex networks of excitable units. Mathematical Biosciences and Engineering, 2004, 1(1): 49-55. doi: 10.3934/mbe.2004.1.49 |
[6] | Jing Li, Zhen Jin, Yuan Yuan . Effect of adaptive rewiring delay in an SIS network epidemic model. Mathematical Biosciences and Engineering, 2019, 16(6): 8092-8108. doi: 10.3934/mbe.2019407 |
[7] | Zhen Jin, Guiquan Sun, Huaiping Zhu . Epidemic models for complex networks with demographics. Mathematical Biosciences and Engineering, 2014, 11(6): 1295-1317. doi: 10.3934/mbe.2014.11.1295 |
[8] | Yicang Zhou, Zhien Ma . Global stability of a class of discrete age-structured SIS models with immigration. Mathematical Biosciences and Engineering, 2009, 6(2): 409-425. doi: 10.3934/mbe.2009.6.409 |
[9] | Jinna Lu, Xiaoguang Zhang . Bifurcation analysis of a pair-wise epidemic model on adaptive networks. Mathematical Biosciences and Engineering, 2019, 16(4): 2973-2989. doi: 10.3934/mbe.2019147 |
[10] | Meici Sun, Qiming Liu . An SIS epidemic model with time delay and stochastic perturbation on heterogeneous networks. Mathematical Biosciences and Engineering, 2021, 18(5): 6790-6805. doi: 10.3934/mbe.2021337 |
Mathematical modeling of epidemic diseases is increasingly being used to respond to emerging diseases. Although conditions modeled by SIS dynamics will eventually reach either a disease-free steady-state or an endemic steady state without interventions, it is desirable to eradicate the disease as quickly as possible by introducing a control scheme. Here, we investigate the control methods of epidemic models on dynamic networks with temporary link deactivation. A quick link deactivation mechanism can simulate a community effort to reduce the risk of infection by temporarily avoiding infected neighbors. Once infected individuals recover, the links between the susceptible and recovered are activated. Our study suggests that a control scheme that has been shown ineffective in controlling dynamic network models may yield effective responses for networks with certain types of link dynamics, such as the temporary link deactivation mechanisms. We observe that a faster and more effective eradication could be achieved by updating control schemes frequently.
Infectious diseases are unique from other conditions in that the direct cause of the disease is another infected individual. A dichotomy to classify such communicable diseases is whether they confer a long-term or short-term immunity upon infection. The condition will eventually die out after one cycle in the former case. Short-term immunity can be of more significant concern, as witnessed by recent COVID-19. Reinfection by mutated diseases can also complicate the situation. In general, with the absence of any intervention, infectious diseases with low transmission rates or high recovery rates will progressively disappear. In contrast, those with high transmission rates or low recovery rates will reach some steady state.
The presence of infectious diseases causes harm to human society in myriad ways, including placing a high burden on healthcare services and disrupting economic activities. A control method can be implemented to reduce socioeconomic costs to eradicate the transmissible disease even quicker. Also, if the epidemic is difficult to eliminate, a control scheme can lower the spread rate and reduce unhappiness.
Various interventions are used in the real world and can be divided into two main types. First is pharmaceutical interventions, including vaccinations and medical treatments [1]. The second is non-pharmaceutical interventions (NPIs) like social distancing. Both can be considered control methods that attempt to reduce the spread of disease. However, the distribution of antidotes can be another complicating issue among countries. Hence, a more readily approach may be through personal and community efforts, including curfews and lockdowns [2].
Finding an effective means to control the disease spread can be achieved by taking mathematical approaches [3]. The susceptible-infectious-susceptible (SIS) model is one of the most popular models for short-term immunity. A simplistic view is taken from the viewpoint of disease transmission such that each individual in a randomly mixed population is susceptible (S) or infectious (I). A susceptible individual becomes an infectious one upon infection and back to susceptible upon recovery. Various modifications of compartmental models exist where extra classes are added to reflect disease-specific processes, including the standard SIR model that confers immunity upon recovery and SEIR that accounts for infected individuals who are not yet infectious. The flow between compartments can be described in ordinary differential equations (ODEs) in all these models [4,5].
Although compartmental epidemic models are intuitive and straightforward, their legitimacy has often been questioned for their oversimplification, assuming all-to-all connectivity among homogeneously well-mixed individuals [6,7]. Modeling epidemics on networks is an alternative and novel approach that emerged from renowned works [8,9]. Modern network-based models with explicit network structures can describe the individual-level interactions in more detail and thus capture the observed dynamics with higher integrity.
A more sophisticated investigation of disease control methods also followed [5,10]. Dynamic networks with changing links allow variations within the network structure and offer new modeling options for studying the influence of control measures. It is in many ways similar to our intuitive perception of forming and breaking human relationships [10]. Over the past decade, modeling and analyzing disease spread on temporal links have advanced significantly as studies continue to reveal the nature of networks existing in the real world, such as biological, social, and technological networks, are indeed dynamic [5].
This study examines how well an actual spread can be controlled within a set time by simulating social distancing on a network. Healthy individuals can temporarily stop interacting with infected neighbors. The non-linear model predictive control (NMPC) method is used to compute control signals to bring the number of infected closer to the target. These signals are applied to individual-based models (IBMs) having the same epidemic parameters as the ODE system. We further explore how the system can converge to the desired state even faster.
Many idealized networks have been suggested for modeling epidemiologically relevant contacts within a real population. Here we use the Erdős‑Rényi (ER) network, where the degree distribution follows a Poisson distribution. Our results demonstrate that more frequent updates of control signals do drive the system to converge to the target under epidemics with higher transmission rates. We note that the success of control is contingent on system parameters, control parameters, and damping parameters. Also, network-based epidemic simulations are yet subject to drawbacks where the sensitivity of outcomes to the properties of networks is difficult to ascertain [10]. Our approach focuses on closing this gap and gaining an intuitive understanding of connecting control theory with modern network-based epidemics.
In this section, we present the setup of the ODEs and the stochastic IBM of the dynamic network model. An SIS disease spreads on a fixed network, in which links can temporarily deactivate [11].
Compartmentalizing individuals according to their disease status is the foundation of almost all mathematical infectious disease models [4,12]. The basic SIS model takes a simplified view of how disease propagates within a population by classifying individuals as either S or I. The assumption leads to the standard system of differential equations:
.[S]=γ[I]−λ[S].[I]=l[S]−γ[I] | (2.1) |
where [S],[I] are mean numbers of susceptible and infectious individuals, respectively, where the total number of the population is N [10]. λ is the rate of infection, which depends on the expected number of infected individuals such that λ=τn(I/N). Here, τ denotes the transmission rate per contact and n is the total number of links in the system. γ is the rate of recovery from infection. The system of ODEs describes the transition between compartments, which allows tracking the variation in the expected number of individuals in each compartment. In the simplest case, γ and τ can be considered constant.
A pairwise model is an alternative approach that approximates the spreading process using linked pairs of individuals [13,14]. A system of pairwise ODEs consists of the expected number of links [XY], which connects individuals of status X and status Y where X, Y ∈ S,I. For instance, [SI] represents a connection between a susceptible and an infected. Furthermore, [XYZ] indicates the number of triples, where X, Y, Z ∈ S,I. Here, the central node Y connects to the nodes of status X and Z. Since the network is assumed to be undirected and symmetric, the relationship [SI] = [IS] holds. Also, every link shall be counted twice.
The system of pairwise differential equations for SIS epidemics on an undirected and unweighted network is shown in (2.2). A disease can propagate from an infected node to its susceptible neighbors with a constant rate τ per SI link. The infection rate of a susceptible individual is kτ where k denotes the number of infected nodes. An infected individual is assumed to recover independently, regardless of the status of its neighbors.
Triples in the system can be further simplified by adopting a moment closure approximation. This
˙[S]=γ[I]−τ[SI]˙[I]=τ[SI]−γ[I]˙[SI]=γ([II]−[SI])+τ([SSI]−[ISI]−[SI])˙[II]=−2γ[II]+2τ([ISI]+[SI])˙[SS]=2γ[SI]−2τ[SSI] | (2.2) |
assumption replaces each triple with singles and pairs as follows [10]:
[XYZ]≈[XY][YZ][Y] |
In dynamic network-based epidemic models with a temporary link deactivation mechanism, each susceptible can adjust their contacts to their neighbors, whose infection statuses are assumed to be known at all times. The model consists of a deactivation rate d at which SI links temporarily deactivate, and a reactivation rate a at which deactivated links reactivate once both nodes become susceptible.
We use the ER random network model [15]. It is one of the most widely used networks for modeling complex processes including population dynamics models. It is a type of homogeneous network, in which each node is assumed to have nearly the same degree. The links are randomly created with a fixed probability such that the average degree distribution κ=2K/N. The network topology is fixed with N nodes and K links.
The system of ODEs that approximates the change in the number of nodes and links can be expressed as follows [16,17]:
.[S]=γ[I]−τ[SI].[I]=τ[SI]−γ[I].[SI]=−(τ+γ)[SI]+τ([SSI]−[ISI])+γ([II])−d[SI].[II]=−2γ[II]+2τ([ISI]+[SI]).[SS]=2γ[SI]−2τ[SSI]+a^[SS].^[SI]=−γ^[SI]+τ([^SSI]−[I^SI])+γ^[II]+d[SI].[^II]=−2γ[^II]+2τ[I^SI].[^SS]=2γ[^SI]−2τ[^SSI]−a[^SS]. | (2.3) |
here, [^XY],[^XYZ],[X^YZ] where X,Y,Z∈S,I are temporarily deactivated edges. Also, the following relation holds: [^SI]=[^IS],[^SSI]=[I^SS],[^ISI]=[I^SI]. The closure relation for deactivated links is as follows:
[^XYZ]≈[^XY][YZ][Y]. |
The system of ODEs can be further simplified by substituting the conservation of nodes and links:
[S]=N−[I][^II]=N⋅K−2[SI]−[II]−[SS]−2[^SI]−[^SS] |
The lower-dimensional approximations suitable for computing control methods are (2.4). The values of [X],[XY],[^XY] where X, Y ∈ S,I are assumed continuous.
.[I]=τ[SI]−γ[I].[SI]=(τ([SS]−[II]N−[I])−(τ+γ+d))[SI]+γ[II].[II]=−2γ[II]+2τ[SI]([SI]N−[I]+1).[SS]=2γ[SI]−2τ[SS][SI]N−[I]+a[^SS].[^SI]=−γ[^SI]+(τ([^SS]−[^SI]N−[I])+d)[SI]+γ[^II].[^SS]=2γ[^SI]−(2τ([SI]N−[I])+a)[^SS]. | (2.4) |
IBMs simulate the interactions of multiple abstract entities computationally [18,19]. A variety of Python packages for running IBM simulations has come into existence over the last few years. In this study, we use Mesa (version 0.8.8.1), which provides an individual-based modeling framework, and NetworkX, (version 2.6.3), which facilitates creating and investigating the dynamics and structures of complex networks.
The IBM generates a random ER network with the same parameters used in the pairwise model. These include the total population, the average degree of individuals, the number of infected, the virus spread chance per SI link at each time step, the recovery rate per individual, the deactivation rate d, and the reactivation rate a. At each step, deactivated links are activated with the reactivation rate a, and SI links are deactivated with the deactivation rate d. Then, infected nodes spread the infection to all their susceptible neighbors with a transmission rate τ.
This section describes the process for computing control signals for the pairwise ODEs and the stochastic IBMs. These models are placed in a feedback loop, where control signals are updated at each time step. Individuals are assumed to be willing to maintain their active contacts when there is no threat to infection. Extreme measures, such as deactivating all connections pausing the whole propagation, are considered unrealistic and therefore neglected.
The purpose of applying control measures is to eradicate the epidemic and at the same time keep the number of activated connections as many as possible before the end of the period. We incorporate the time-dependent control, a method that iteratively tunes the control signals at each time step. The deactivation rate d and the reactivation rate a become piecewise constant functions as they can change every step. These rates are bounded as follows:
0≤dmin≤d≤dmax≤10≤amin≤a≤amax≤1. |
A fixed time step Δt>0 determines how often the control signals are updated. In realistic scenarios, the value of Δt translates to the period of updating control policies every Δt days or every Δt weeks.
As carried out in [2], the target numbers to be achieved within the finite time horizon T>0 are denoted as I(T)=I∗ for infected individuals and n(T)=n∗ for the average number of active links. We set these values as I∗=0 and n∗=n(0), which translates to zero infected individuals and fully activated social contacts. ε is defined to measure the effectiveness of the control as follows:
|[I](T)−I∗|≤ε|n(T)−n∗|≤ε |
An ideal control scheme would drive the system such that ε=0.
Substituting the bounds of the rates into the system yields:
.[I]=τ[SI]−γ[I].[SI]=(τ([SS]−[II]N−[I])−(τ+γ+[dmin,dmax]))[SI]+γ[II].[II]=−2γ[II]+2τ[SI]([SI]N−[I]+1).[SS]=2γ[SI]−2τ[SS][SI]N−[I]+[amin,amax][^SS].[^SI]=−γ[^SI]+(τ([^SS]−[^SI]N−[I])+[dmin,dmax])[SI]+γ[^II].[^SS]=2γ[^SI]−(2τ([SI]N−[I])+[amin,amax])[^SS] | (3.1) |
The piecewise constant functions a and d are updated at each step so that these signals are applied to the system such that the target values reach lower or equal to ε.
The NMPC method is an adaptation of the model predictive control method, where sequences of control values are repeatedly computed over the finite prediction range to minimize the objective functional [20,21].
To implement the NMPC method, the ODEs are first discretized using the Runge-Kutta-Fehlberg method (RKF45), a method of 4th order, and an error estimator of 5th order. Then the system is vectorized to ease matrix computations:
X=([I],[SI],[II],[SS],^[SI],^[SS])Y=([I],n)C=(a,d) |
where x(k)=X(kΔt),y(k)=Y(kΔt), and c(k)=C(kΔt). P denotes the length of the prediction horizon, which shortens at each time step. P is used to calculate the sequence of control actions C at each time step kΔt until the time horizon is reached, such that Ci(k+j), where i=1,2, j=0,1,....,P−1. These control signals produce solutions of the system at each time step:
x(k+j)=F(x(k+j−1),u(k+j−1)) where j=1,2,...,P |
The objective functional J is defined for computing series of control signals C(k),C(k+1),…,C(k+P−1) to let the targets Y(k+1),Y(k+2),…,Y(k+P) converge to (I∗,n∗):
J(c(k),…,c(k+P−1))=P∑j=1(λ1(y1(k+j)−I∗)2+λ2(y2(k+j)−n∗)2+λ3(ΔC1(k+j))2+λ4(ΔC2(k+j))2). |
here, λ1,λ2,λ3,λ4 are damping parameters and y1,y2,C1,C2 are the first and second elements of Y and C, respectively. ΔC1(k+j)=a(k+j)−a(k+j−1) and ΔC2(k+j)=d(k+j)−d(k+j−1) measures the cost occurring from changing control signals. λ1(y1(k+j)−I∗)2 accounts for the difference between the current number of infected individuals and the target, and λ3(ΔC1(k+j))2 accounts for that of the average active degree and the target.
The series of control values c(k),c(k+1),...,c(k+P−1) are obtained by computing the optimization equation using the nonlinear least-squares solver lsqnonlin from the MATLAB Optimization toolbox. The first value of the sequence c(k) is applied to x(k), updating the system to x(k+1) for the time period [kΔt,(k+1)Δt]. The entire process is repeated until the system reaches the end of the time horizon T.
Two different cases are considered for computing the control inputs for the IBM [2]. In case A, the entire sequences of control signals C1 and C2 for [(k−1)Δt, kΔt] where k=1,2,....,K and KΔt=T, are computed by the pairwise ODEs. The sequences of control signals are then applied to the IBM at their respective time step over the finite time horizon. In case B, the entire sequences of control signals are computed in the same way as done in case A. However, only the first values in the sequences are applied to the IBM. The same process is repeated until the system reaches the end of the time horizon. We note that the model parameters and the control parameters of the IBM are the same for pairwise ODEs.
This section presents the results of the simulations where the stochastic IBM is controlled using cases A and B.
We begin by running extensive simulations on the pairwise ODEs and use the Monte Carlo algorithm to find the maximum value of τ to two decimal places that drives the solution to desired values (I∗=0 and n∗=n(0)). The sequence of control signals can then be obtained and applied back to the stochastic IBM. Figure 2(a) presents the effect of those signals on the prevalence and the mean active degree of both the pairwise ODEs and the stochastic IBM. Figure 2(b) shows that the target values of the system of pairwise ODEs diverge such that ε>10% when τ is higher than 0.15, which is the maximum value of τ that drives the system such that ε≤10%.
This experiment is repeated with different values of τ,amax, and dmax. Table 1 compares the target average active degree and the number of infected nodes at the terminal with those of simulation results. We observe that the number of prevalence and the mean active degree for stochastic simulations converge to the target values when those for pairwise models do so as well, and vice versa. Also, both models tend to be controllable when the transmission rate is not too large.
τ | amax | dmax | [I]s(T)−I∗ | ns(T)−n∗ | [I]p(T)−I∗ | np(T)−n∗ |
0.10 | 1 | 1 | 0 | 0 | 0.01 | 0.01 |
0.15 | 1 | 1 | 0 | 0 | 0.50 | 0.05 |
0.20 | 1 | 1 | 856 | 9.95 | 29.73 | 0.30 |
0.10 | 0.5 | 0.5 | 0 | 0 | 0.32 | 0.02 |
0.15 | 0.5 | 0.5 | 0 | 0 | 26.02 | 0.17 |
0.20 | 0.5 | 0.5 | 1068 | 9.98 | 1673.40 | 4.55 |
Figure 3(a) shows that case B is an effective method to control the stochastic IBMs up to τ=0.18. Figure 4 shows the control signals obtained from the pairwise ODEs in case B. Control signals are piecewise constant functions applied to the stochastic IBMs in Figure 3(a). Figure 3(b) shows the temporal dependence of the infected and the mean active degree of the pairwise ODEs and the stochastic IBM, where the same parameters are used as in Figure 3(a) but with ten times longer time step ∆t.
Regarded as one of the simplest disease dynamics models, SIS disease is simulated so that the study can readily be extended to its variants. SIS epidemics involve connections between susceptible and infectious individuals, which are just sufficient for transmitting infection [22].
Exact equations encompassing the probability of realistic size networks being in every possible state are beset with fundamental difficulties, resulting in too many equations for practical applications. For example, there are 2N distinct state spaces for N individuals for SIS epidemic models.
As done by one of the earliest developed dynamic network-based epidemic models, we use the pairwise modeling framework to relax the high dimensionality. Mean-field models that approximate stochastic processes can be formulated using pairwise approximations, having the potential to be exact in large systems. However, its focus on expected population-scale quantities makes it difficult to analyze variations of epidemic dynamics in different network structures [10,13].
Modern IBMs simulating simultaneous interactions of multiple entities on explicit structures have shown increasingly superior to traditional compartmental models in regard to accuracy in predictions [18,19]. On the other hand, an increase in uncertainty is inevitable when parameters are added for building more realistic IBMs.
Computing control signals of the stochastic IBMs using the system of pairwise ODEs requires much less computational cost than computing control signals directly from the stochastic model. That is, the rates at which the SI links temporarily deactivate and SS links reactivate are regulated by the system of pairwise ODEs. As a result, we examine how well an actual spread can be controlled using the pairwise ODEs.
Notably, the outcomes are contrasting when the method used in case A is repeated on dynamic networks with contact-conserving rewiring mechanisms. In [2], case A is deemed ineffective since control signals obtained from the controllable system of pairwise ODEs do not drive the stochastic model to the target values, even for lower values of τ. The effectiveness of the methods used in case A may highlight the variation in responses between different dynamic network models to model predictive control methods. On the other hand, the difference may be simply because our model considers a larger population than that used in [2]. We recall that the sensitivity of the network-based simulation outcomes to the property of the networks is difficult to assess [10].
Our outcome agrees with that of [2] in that the process used in case B is a more effective approach than that of case A when using the NMPC method to control the stochastic simulations of dynamic networks. Also, when the time step ∆t is increased as in [2], the probability of stochastic simulations being effectively controlled decreases.
In Figure 4, the deactivation rate reaches the maximum at earlier stages of the process. Link activation rate remains low at this stage so that the number of prevalence can decrease. However, the link activation rate increases steadily so that the mean active degree can reach the target value. These observations can be seen as control measures focusing on the early eradication of diseases and steady relaxation of social distancing. Seeking an optimal balance between minimizing the number of infected and maintaining active social contacts is intentionally planned through the damping parameters of the model predictive control.
We highlight that the controllability of our simulations highly depends on the control parameters, including the time horizon, the step size, epidemic parameters, and damping parameters that significantly impact the optimization processes of the model predictive control.
A limited amount of research exists where pairwise ODEs are used to compute control signals for controlling real networks modeled with IBMs. This paper considers two different cases for computing control inputs for dynamic networks with a temporary link mechanism. The ER network is assumed. In the first case, little computational resources are used to compute the control signals. That is, control inputs are calculated only once at the beginning of the control period. In the second case, we collect the epidemic data of the stochastic IBM at each time step and use the data as the initial condition of the pairwise model for computing the control signals for stochastic IBM. Our results show that the prevalence and the mean active degree converging to the target values increased when control signals were updated more frequently.
The goal of the study is to explore the opportunity arising from linking the modern network-based epidemic models and control, thereby gaining an intuitive understanding. The scope is limited to dynamic networks with a temporary link deactivation mechanism, investigating the degree of effectiveness for controlling stochastic IBMs using the results obtained from the pairwise ODEs. We compute control signals from ODE approximations, which requires fewer costs and efforts than calculating those from stochastic simulations. Our method provides a stepping stone towards the applications of controlling real-world complex systems.
When the transmission rate is low, the effectiveness of control measures predicted by pairwise ODEs coincides with stochastic simulations applied with the same control signals used for the pairwise model. On the other hand, when the transmission rate is high, case B outperforms case A for controlling stochastic simulations using pairwise ODEs. As with the limitations of all network-based simulations, where the sensitivity of the epidemiological outcomes to the specifications of the network is unclear, we highlight that the controllability strongly depends on the parameters that define the models [10].
Our approach can be extended to more refined settings, complementing the simplifications and limitations. While our approach concentrates on the end target of the prevalence and active degree, studies can look into minimizing the peak or the total number of infections. Such an approach may be more practical in the context of epidemiology when maintaining the intensive care units (ICUs) capacity rises as an issue. Moreover, studies can account for the costs occurring from the activation and deactivation of links. They do not focus on network control, and this cannot be examined with simple compartmental models. Finally, we used the homogeneous mean-field pairwise approximations, which do not fully capture the system behavior of networks in which degree distributions are heterogeneous. Since many observed networks are far from homogeneous, the next step shall be incorporating degree heterogeneity, significantly affecting disease dynamics [10].
This research was a part of the project titled “Understanding the deepsea biosphere on seafloor hydrothermal vents in the Indian Ridge” (No. 20170411), funded by the Ministry of Oceans and Fisheries, Republic of Korea. The initial stage of the work was also supported by the research programs of the Korea Institute of Ocean Science and Technology as part of the Shared Use Program (No. PE99656 and PE99796) and the Fellowship for Fundamental Academic Fields by Seoul National University (No. 2020-86).
All authors declare no conflicts of interest in this paper.
[1] | Centers for Disease Control and Prevention, Nonpharmaceutical Interventions (NPIs), 2021. Available from: https://www.cdc.gov/nonpharmaceutical-interventions/index.html. |
[2] |
Á. Bodó, P. L Simon, Control of epidemic propagation on networks by using a mean-field model : Dedicated to Professor László Hatvani on the occasion of his 75th birthday, Electron. J. Qual. Theory Differ. Equation, (2018), 1–13. https://doi.org/10.14232/ejqtde.2018.1.41 doi: 10.14232/ejqtde.2018.1.41
![]() |
[3] | D. J. Daley, J. Gani, Epidemic modelling: an introduction, Cambridge University Press, 2001. |
[4] |
W. O. Kermack, A. G. McKendrick, A contribution to the mathematical theory of epidemics, Proc. Math. Phys., 115 (1927), 700–721. https://doi.org/10.1098/rspa.1927.0118 doi: 10.1098/rspa.1927.0118
![]() |
[5] | I. Z. Kiss, J. C. Miller, P. L. Simon, Mathematics of Epidemics on Networks, Springer, 2017. |
[6] |
W. Yang, D. Zhang, L. Peng, C. Zhuge, L. Hong, Rational evaluation of various epidemic models based on the COVID-19 data of China, medRxiv, (2020), https://doi.org/10.1101/2020.03.12.20034595 doi: 10.1101/2020.03.12.20034595
![]() |
[7] | F. Brauer, C. Castillo-Chávez, Basic ideas of mathematical epidemiology, in Mathematical Models in Population Biology and Epidemiology, (2001), 275–337. |
[8] |
A. L. Barabási, R. Albert, Emergence of scaling in random networks, Science, 286 (1999), 509–512. https://doi.org/10.1126/science.286.5439.509 doi: 10.1126/science.286.5439.509
![]() |
[9] |
D. J. Watts, S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, 393 (1998), 440–442. https://doi.org/10.1038/30918 doi: 10.1038/30918
![]() |
[10] |
M. J. Keeling, K. T. Eames, Networks and epidemic models, J. R. Soc. Interface, 2 (2005), 295–307. https://doi.org/10.1098/rsif.2005.0051 doi: 10.1098/rsif.2005.0051
![]() |
[11] |
I. Tunc, M. S. Shkarayev, L. B. Shaw, Epidemics in adaptive social networks with temporary link deactivation, J. Stat. Phys., 151 (2013), 355–366. https://doi.org/10.1007/s10955-012-0667-7 doi: 10.1007/s10955-012-0667-7
![]() |
[12] | R. M. Anderson, R. M. May, Infectious Diseases of Humans: Dynamics and Control, Oxford University Press, 1992. |
[13] |
M. J. Keeling, D. A. Rand, A. J. Morris, Correlation models for childhood epidemics, Proc. Royal Soc. B, 264 (1997), 1149–1156. https://doi.org/10.1098/rspb.1997.0159 doi: 10.1098/rspb.1997.0159
![]() |
[14] |
M. J. Keeling, The effects of local spatial structure on epidemiological invasions, Proc. Royal Soc. B, 266 (1999), 859–867. https://doi.org/10.1098/rspb.1999.0716 doi: 10.1098/rspb.1999.0716
![]() |
[15] | P. Erdős, A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci., 5 (1960), 17–60. |
[16] |
T. Gross, C. J. D. D'Lima, B. Blasius, Epidemic dynamics on an adaptive network, Phys. Rev. Lett., 96 (2006), 208701. https://doi.org/10.1103/PhysRevLett.96.208701 doi: 10.1103/PhysRevLett.96.208701
![]() |
[17] |
R. Pastor-Satorras, A. Vespignani, Epidemic spreading in scale-free networks, Phys. Rev. Lett., 86 (2001), 3200–3203. https://doi.org/10.1103/PhysRevLett.86.3200 doi: 10.1103/PhysRevLett.86.3200
![]() |
[18] | V. Grimm, S. F. Railsback, Individual-Based Modeling and Ecology, Princeton University Press, 2005. |
[19] | S. F. Railsback, V. Grimm, Agent-Based and Individual-Based Modeling: A Practical Introduction, Princeton University Press, 2019. |
[20] |
F. Sélley, Á. Besenyei, I. Z. Kiss, P. L. Simon, Dynamic control of modern, network-based epidemic models, SIAM J. Appl. Dyn. Syst., 14 (2015), 168–187. https://doi.org/10.1137/130947039 doi: 10.1137/130947039
![]() |
[21] | L. Grüne, J. Pannek, Nonlinear Model Predictive Control. Communications and Control Engineering, Springer, 2011. |
[22] |
A. Gray, D. Greenhalgh, L. Hu, X. Mao, J. Pan, A stochastic differential equation SIS epidemic model, SIAM J. Appl. Math., 71 (2011), 876–902. https://doi.org/10.1137/10081856X doi: 10.1137/10081856X
![]() |
1. | Nadia M. G. Al-Saidi, Husam Yahya, Suzan J. Obaiys, Discrete Dynamic Model of a Disease-Causing Organism Caused by 2D-Quantum Tsallis Entropy, 2022, 14, 2073-8994, 1677, 10.3390/sym14081677 |
τ | amax | dmax | [I]s(T)−I∗ | ns(T)−n∗ | [I]p(T)−I∗ | np(T)−n∗ |
0.10 | 1 | 1 | 0 | 0 | 0.01 | 0.01 |
0.15 | 1 | 1 | 0 | 0 | 0.50 | 0.05 |
0.20 | 1 | 1 | 856 | 9.95 | 29.73 | 0.30 |
0.10 | 0.5 | 0.5 | 0 | 0 | 0.32 | 0.02 |
0.15 | 0.5 | 0.5 | 0 | 0 | 26.02 | 0.17 |
0.20 | 0.5 | 0.5 | 1068 | 9.98 | 1673.40 | 4.55 |