Next Article in Journal
Semi-Implicit and Semi-Explicit Adams-Bashforth-Moulton Methods
Previous Article in Journal
Lower Bounds, and Exact Enumeration in Particular Cases, for the Probability of Existence of a Universal Cycle or a Universal Word for a Set of Words
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Evolutionary Perspective of Virus Propagation

by
J. A. Tenreiro Machado
Department of Electrical Engineering, Institute of Engineering, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 431, 4249-015 Porto, Portugal
Mathematics 2020, 8(5), 779; https://doi.org/10.3390/math8050779
Submission received: 16 April 2020 / Revised: 7 May 2020 / Accepted: 8 May 2020 / Published: 13 May 2020
(This article belongs to the Section Engineering Mathematics)

Abstract

:
This paper presents an evolutionary algorithm that simulates simplified scenarios of the diffusion of an infectious disease within a given population. The proposed evolutionary epidemic diffusion (EED) computational model has a limited number of variables and parameters, but is still able to simulate a variety of configurations that have a good adherence to real-world cases. The use of two space distances and the calculation of spatial 2-dimensional entropy are also examined. Several simulations demonstrate the feasibility of the EED for testing distinct social, logistic and economy risks. The performance of the system dynamics is assessed by several variables and indices. The global information is efficiently condensed and visualized by means of multidimensional scaling.

1. Introduction

The diffusion of a infectious disease within a given population during a short time period is called an epidemic. If the infection spreads to a large number of countries and to other continents it may be classified as a pandemic. Recent outbreaks are the 2003 severe acute respiratory syndrome (SARS), 2004 H5N1 (Avian flu), 2005 Zika fever, 2009 H1N1 and HIV/AIDS pandemics, just to name a few [1,2,3,4,5]. Presently the Coronavirus disease 2019 (COVID-19) is of utmost importance for the human species [6,7,8,9,10]. For controlling an outbreak, governments adopt basic containment, mitigation and suppression strategies. Containment is considered the early stages of the outbreak, for trying to stop the infection from being transmitted to the rest of the population. Mitigation is adopted to slow down the spread of the disease to moderate its effects on the population and the health care system. Suppression, attempts to reverse the pandemic by reducing the so-called basic reproduction number R 0 , to a value less than 1 [11,12].
The political and logistic management of an infectious outbreak is of key importance in order to decrease the epidemic peak, often called as ‘flattening the epidemic curve’. A second political issue is to handle the consequences in economy, with governments investing huge capitals to reduce the threats posed by the pandemics. In both cases, tools for estimating and foreseeing the evolution of the spread are an invaluable asset for decision makers. We find studies adopting a variety of approaches going from the use of models based on mathematical tools [13,14], such as systems of differential equations [15,16,17], or data fitting techniques and statistics, up to computer assisted strategies [18,19,20,21]. In the present days, artificial intelligence and soft computing are gaining importance and they lead to reliable methods to handle problems difficult to model and involving variables, either impossible to measure, or exhibiting unreliable values.
We find nowadays relevant initiatives involving political, academic and social organizations, trying to give a fast response to urgent problems based on data-driven and computational resources. For example, in the scope of the COVID-19 outbreak we can mention the daily update by the Italian Department of Civil Protection http://opendatadpc.maps.arcgis.com/apps/opsdashboard/index.html#/b0c68bce2cce478eaac82fe38d4138b1, the European Centre for Disease Prevention and Control https://www.ecdc.europa.eu/en/publications-data/download-todays-data-geographic-distribution-covid-19-cases-worldwide, the ‘Acción Matemática contra el Coronavirus’, http://matematicas.uclm.es/cemat/covid19/en/ by the Spanish Mathematics Committee, or the Global research on coronavirus disease (COVID-19) https://www.who.int/emergencies/diseases/novel-coronavirus-2019/global-research-on-novel-coronavirus-2019-ncov by the World Health Organization (WHO), just to name a few.
In this area of computer science, evolutionary computation provides a framework for optimization schemes inspired by biological evolution [22,23,24,25,26]. In general, evolutionary computation leads to a family of population-based optimization algorithms [27,28], with a numerical trial and error meta-heuristic and probabilistic behavior [29,30,31,32,33]. An initial set of elements in a population (often called candidate solutions) are generated and successively updated by means of some logical rules including some random variations. Probably the most well-known scheme is the ‘genetic algorithm’ [34], where a population is subjected to natural selection using mutation and crossover operations. The population gradually evolves to increase its performance according with a given fitness function chosen by the user.
In the last decades a large variety of Evolutionary algorithms (EA) were proposed. In 2013 Iztok Fister [35] presented a brief review of EA and found 74 algorithms that could be distributed in four classes, namely the families entitled swarm intelligence, biological inspired, or physics and chemistry based algorithms and miscellaneous schemes. A search in scientific and technical literature reveals a large number of proposed techniques for EA, demonstrating their popularity in the research community for dealing with real-world problems [36,37,38].
In the case of health care systems, machine learning algorithms have also been explored. Interested readers can find a review in Reference [39]. In what concerns specific diseases, we find, for example, the problem of distinguishing bacterial from viral meningitis through a machine learning using a data set [40]. Nonetheless, we must have in mind that in pervasive/ubiquitous computing environments, users may evaluate their trustworthiness by using historical data from their past interactions, and that some solution detecting unfair recommendations must be implemented [41].
The classical approach for compartmental models in epidemiology follows the so-called SIR model by Kermack et al. [13,42,43,44], described by a system of differential equations, where a fixed population of individuals that fit into three categories, namely the susceptible (but not yet infected), infectious and recovered (with immunity) individuals, that vary in time. The small number of variables and parameters limit its applicability and several improvements have been proposed [45,46,47]. Nonetheless, the additional degrees of freedom come at the cost of an extra complexity often requiring variables and parameters either not available in real world, or with a considerable noise and uncertainty due to a variety of factors. Therefore, we can question if a computational scheme following the concepts of EA can overcome those problems and represent a valid alternative for modeling purposes.
Having these ideas in mind, this paper develops an EA for mimicking a epidemic diffusion within a population. As usual with these computational schemes several simplifications will be adopted both to speed-up the computational processing and to clarify the role of the distinct parameters and variables. In fact, we can add extra degrees of sophistication and detail at the expense of building a logical scheme leading to results more difficult to interpret given the plethora of cross effects. In spite of the simplification, we shall have a considerable number of variables and scenarios which makes difficult to compare the results. In order to overcome this problem, we adopt the multidimensional scaling (MDS) technique [48,49,50,51]. The MDS is a data processing numerical technique that allows depicting in a low dimensional locus results from a high-dimensional space. This strategy leads to a computational visualization that unravels the most important aspects embedded in the data.
The paper is organized as follows. Section 2 discusses the main ideas and formulates the structure of the proposed evolutionary epidemic diffusion (EED). Section 3 and Section 4 discuss the results given by the EED and explore several possible configurations of the parameters and distinct scenarios. Section 5 analyses the results by means MDS. Finally, Section 6 summarizes the main conclusions.

2. The Evolutionary Epidemic Diffusion Algorithm

The EED adopts a 2-dimensional squared small-world (SW) with a population of N elements, so that the i-th individual is positioned on the coordinates ( x i , y i ) , i = 1 , , N , inside the square. The population will evolve in time t and in the 2-dimensional space according with the rules defined in the sequel. Two exceptions outside the coordinates of the SW are considered consisting of the ‘hospital and house’ (hereafter simply denoted as hospital) and ‘cemetery’. These two additional repositories are allocated to the elements of the population that are found by health care system as infected or that passed away due to the action of the virus. The population is distributed along five categories: ‘healthy’, ‘infected’ (but not in hospital or confined in house) and ‘immunized’ that move in time and space, the ‘hospitalized’ corresponding to infected people that are taken to the hospital or that are confined to some part of his house in case the health state is not too serious, and ‘dead’ that are positioned in the ‘cemetery’.
The population is initialized in 2 categories ‘healthy’ and ‘infected’ with percentages 1 p 1 and p 1 , respectively. Let us suppose that two individuals in the SW can be randomly selected. If they are in a distance range inferior to a given threshold limit, that may be called ‘social neighborhood’, D, and if one is healthy and the other is infected, then the healthy became infected with a probability p 2 , otherwise he stays in the previous state. Therefore, if ( x i , y i ) and ( x j , y j ) are the coordinates of the i-th and j-th individuals ( i , j = 1 , , N ) and one is infected, then infection of the other will occur with probability p 2 if d < D , where the spatial distance d is defined as [52]:
d = x i x j α + y i y j α 1 α , α 1 .
An infected individual can remain as ‘infected’ with probability p 3 if not detected by the health care system (either due to logistic limitations, or because of being asymptomatic). Nonetheless, an ‘infected’ individual can change to the categories ‘hospitalized’, ‘dead’, or ‘immunized’ as described in the follow-up. The hospital has limited capacity of N h places. Therefore, an infected individual that is detected by the health care system, can enter in the hospital if, and only if, the number of patients n h does not surpass the limit, that is n h N h . Moreover, infected and hospitalized individuals can change to the category ‘dead’ with probabilities p 4 and p 5 , respectively. The infected or hospitalized i-th individual changes to ‘immunized’ after being in that state for the period of time t i T ± Δ T , where Δ T stands for some random variation with a uniform probability distribution. Individuals ‘immunized’ re-enter the SW with randomly generated coordinates and cannot be infected again. Moreover, dead or immunized do not transmit infection to others.
The population located in the SW (i.e., ‘healthy’, ‘infected’ and ‘immunized’) changes position in space with a small increment ( δ x , δ y ) generated randomly and independently with uniform distribution and zero mean. Therefore, the ith individual evolves in space ( x i , y i ) ( x i + δ x , y i + δ y ) between two successive time iterations t and t + 1 . In the follow-up, we consider that the maximum displacement values are identical (i.e., max | δ x | = max | δ y | = δ ). Therefore, two independent values δ δ x δ and δ δ y δ are generated, as long as the new coordinates ( x i + δ x , y i + δ y ) remain in the SW, otherwise a new set of random displacements is generated.
The Minkowski distance d leads to the Manhattan (or city), Euclidean and Chebyshev distances [53] for α = 1 , 2 , . In particular, we can simulate different environments in the SW, such with and without buildings for α = 1 and α = 2 , respectively.
Several issues must be considered:
  • The SW is considered to have an isotropic structure, that is, without a special architectural or geophysical structure. Therefore, the choice for max | δ x | = max | δ y | = δ seems intuitive.
  • The uniform probability distribution is often adopted in the scope of EA, merely for the sake of simplification. The adoption of other distributions, such as the Gaussian, or the use of conditional probabilities, for example, would imply further assumptions that imply adding an extra complexity to the EED. Section 4 will discuss further this preliminary assumption.
  • The Manhattan and Euclidean attempt to model distinct behaviors of the individuals moving in the SW, but not the propagation of the virus. In fact, individuals have a macroscopic nature in opposition to virus that has a microscopic dimension and can propagate in a variety of ways, such as in air by the wind or in the clothes and shoes of the host individuals. So, the city distance reflects the adoption of social attitudes such as passing for the other side of the street when another individual appears in the same direction.
In summary, the EA (i) starts with two categories ‘healthy’ and ‘infected’, (ii) evolves in time and space with five categories ‘healthy’, ‘infected’, ‘hospitalized’, ‘immunized’ and ‘dead’, and (iii) at the end the SW includes only three categories, specifically the ‘healthy’, ‘immunized’ and ‘dead’. Obviously, during the simulation the number of active individuals in the SW (i.e., those that are not ‘hospitalized’, or ‘dead’) decreases.
The overall description and assignment of variables and parameters is represented in the diagram of Figure 1.
Some of the simplifications may be a matter of criticism, such as:
  • A 2-dimensional SW with fixed Cartesian boundaries is considered
  • The SW has a uniform structure, without including rivers, hills or other structures
  • The rules of the EA are fixed in time
  • Some additional modeling of the hospital, such as staff burnout or equipment limitation, is absent
  • The effect of different clinical conditions and age are identical for all population
  • The total population decreases along time since no births or incoming visitors are included
  • Hospitalized individuals can infect others, but no such case is considered
  • No ‘dead’ individuals due to other causes
Indeed we can include extra rules and answer these issues. However, we must have in mind that EA are usually a simplification of the real-world. This allows a faster calculation and a simpler and more assertive interpretation of the meaning of each parameter.

3. Exploring the Evolutionary Algorithm: A First Set of Experiments

Let us consider a population of N = 500 individuals with p 1 = 0.1 and 1 p 1 = 0.9 for infected and healthy, respectively, and simulate the SW during τ = 30 iterations. Therefore, the EED simulation starts with n i = 50 ‘infected’ and N n i = 450 ‘healthy’ individuals. The SW is delimited by the coordinates ( x , y ) = ( 0 , 0 ) and ( x , y ) = ( 1 , 1 ) , the infection distance is set to D = 0.07 , and the maximum step in space ( x , y ) between two consecutive time iterations is δ = 0.1 . Other parameters are set to p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 and α = 2 . The infection incubation period is set to T = 15 days with a variation Δ T = ± 2 days, and the hospital capacity N h is considered unlimited. We consider low values for the mortality, such as the common flu or the COVID19, but not others such as Ebola or Marburg [2,4]. Nonetheless, the adoption of such numerical values does not precludes the use of higher values for such probabilities. Moreover, it is considered p 4 > p 5 to describe the positive influence of the medical health care. Figure 2 shows the time evolution of the 5 state variables during the period of t = 1 , , τ iterations for this first scenario S 1 .
We verify a fast decrease of the number of ‘hospitalized’ and an increase in the ‘immunized’. The number of ‘infected’ (not in hospital) has a slow but continuous reduction and the ‘dead’ increase linearly until the ‘immunized’ reach the steady-state. Varying the value of T changes the delay period for starting the emergence of the variable ‘immunized’. On the other hand, the main effect of increasing Δ T is to smooth the curve at the start and end of the immunization transient.
The value of α = 2 represents a free space. Therefore, we consider a second scenario S 2 of a SW described by a distance with α = 1 , while the rest of the parameters remain identical. Figure 3 depicts the time evolution of the 5 state variables. Comparing the two scenarios we conclude that for α = 1 we have a larger number of ‘healthy’ and a smaller value for the ‘dead’.
In a third scenario S 3 we limit the hospital capacity (and house confinement capacity) to N h = 100 , that is, to 20% of the total population. The other parameters remain identical to first scenario. Figure 4 shows clearly the effect of saturation in the ‘hospitalized’ time evolution and a clear increase in the final number of ‘dead’.
In a 4th scenario S 4 we evaluate the influence of confining the individuals by reducing the distance threshold limit to D = 0.05 while the rest of the parameters remain identical to scenario S 1 . Figure 5 shows the strong effect of the limitation that leads to the increasing of ‘healthy’, and the diminishing of ‘immunized’ and ‘dead’.
Let us consider four cost indices consisting of:
  • I 1 , the integral in time of the number of ‘hospitalized’ divided by the maximum value (i.e., N × τ )
  • I 2 , the maximum number of ‘hospitalized’ divided by the population maximum number (i.e., N)
  • I 3 , the number of ‘dead’ divided by the population maximum number (i.e., N)
  • I 4 , the integral in time of the total number ‘healthy’ and ‘immunized’ divided by the maximum value (i.e., N × τ ).
The indices I 1 and I 2 assess social and logistic issues, I 3 addresses mainly a social aspect and I 4 focuses in economic matters. Table 1 lists the parameters and the obtained values of the indices for the proposed scenarios.
In all scenarios we find 4 phases
  • P 1 starting from two categories only, namely ‘healthy’ and ‘infected’, an initial transient with a fast diminishing in the number of ‘healthy’ and an inverse behavior with the ‘infected’, ‘hospitalized’ and ‘dead’
  • P 2 a slow diminishing or even a steady-state in the ‘healthy’ and a moderate increase with the ‘infected’, ‘hospitalized’ and ‘dead’
  • P 3 a fast increase of the ‘immunized’ and slow decrease of ‘infected’, ‘hospitalized’ and ‘dead’,
  • P 4 a steady-state with individuals in there categories only, namely ‘healthy’, ‘dead’ and ‘immunized’.
Let us now consider the influence of the control strategy based on the social neighborhood D upon the cost indices. Therefore, we simulate the EED for 0 D 0.1 and we consider the effect of the social neighborhood for the cases of α = 1 and α = 2 . The rest of the parameters remain identical to those adopted in scenario S 1 .
Figure 6, Figure 7, Figure 8 and Figure 9 show the evolution of the four indices versus D for the two values of α . In all cases we verify that the cost increases significantly for D > 0.02 and stabilizes at an high value for D > 0.06 . Furthermore, the value of α has some influence and we verify that a SW with α = 1 limits slightly the propagation of the infection in relation with the case of a SW with α = 2 .
The spatial distribution of the elements in the SW can also be measured. Let us adopt the Shannon entropy of the ( x , y ) space occupation by any type of individual, that is, ‘healthy’, ‘infected’ and ‘immunized’, since the ‘hospitalized’ and and ‘dead’ are located outside the SW namely at the ‘hospital’ and ‘cemetery’, respectively. The SW is subdivided into an array of r × r matrix and the number of individuals in each cell in counted for obtaining a 2-dimensional histogram. The statistics of the spatial distribution versus time t is obtained my means of the 2-dimensional space entropy H x y given by [54,55,56,57,58]:
H x y = i = 1 r j = 1 r p x i , y j log p x i , y j ,
where p x i , y j is the probability obtained for the i , j -cell of the r × r matrix, at a given time instant t.
Figure 10 illustrates the evolution of the individuals in the SW for t = 1 , 5 , 10 , 20 and Figure 11 depicts the evolution of H x y versus time t, for r = 20 and α = 1 , 2 . In all cases it is considered N = 500 , D = 0.05 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 and p 5 = 0.02 . We observe clearly (i) the diminishing of the ‘healthy’ and the increase of the ‘infected’ when passing from t = 1 to t = 5 , (ii) the disappearance to the ‘infected’ and the emergence of the ‘immunized’ when going to t = 17 and (iii) the steady-state at t = 25 with ‘healthy’ and ‘immunized’. The space entropy H x y reflects also clearly the transient and the difference between the initial condition and the steady-state.

4. Exploring the Evolutionary Algorithm: A Second Set of Experiments

In the previous scenarios no available vaccine or treatment is considered. Therefore, the ‘immunized’ variable is an important issue against any new surge of infection. To illustrate this problem let us consider the 5th and 6th scenarios, S 5 and S 6 , with a disturbance of 50 recently ‘infected’ visitors entering in the SW at t = 25 with coordinates ( x , y ) generated randomly. Scenarios S 5 and S 6 follow the conditions of scenarios S 1 and S 4 (i.e., D = 0.07 and D = 0.05 ), respectively, for the rest of the parameters, with exception of the simulation period that is extended to τ = 50 .
Figure 12 and Figure 13 show the immediate effect in all variables. However, in scenario S 6 the number of ‘immunized’ is lower at t = 25 and, consequently, the propagation of the perturbation is much superior.
The public feeling of risk as a consequence of known critical cases is a variable that we can consider and implement in the EED. Therefore, we consider a scenario S 7 where a disturbance is simulated by reducing the social neighborhood to D = 0.01 for t 4 . Figure 14 shows clearly the reduction of ‘hospitalized’, ‘dead’ and ‘immunized’ and, correspondingly, the improvement in the cost functions.
During the outbreak of the virus spread some medical drug for an efficient treatment may be discovered and administrated to all population, both hospitalized and non-hospitalized. To simulate this scenario S 8 we consider a disturbance at t 6 , where the probabilities of death are set to the values p 4 = p 5 = 0.01 . Figure 15 shows again a remarkable improvement.
Another issue to consider is the initialization of the EED. In the scenarios adopted so far, the simulation starts with a considerable number of ‘infected’, namely with 50 individuals in a total of 500. To evaluate the effect of starting with a smaller number, we consider 5, 10 and 20 ‘infected’ (see Figure 16, Figure 17 and Figure 18) corresponding to the scenarios S 9 , S 10 and S 11 , respectively. We verify clearly a smother variation of the curves and the improvement in the cost indices, demonstrating the importance of an early detection of the ‘infected’.
Table 2 lists the parameters and the obtained values of the indices for the seven new scenarios.

5. Multidimensional Scaling Analysis of the Evolutionary Algorithm

The results given by the EED have a probabilistic nature and vary slightly in each run. Moreover, we have a large number of variables which makes difficult to compare the results. In order to overcome these problems we adopt the multidimensional scaling (MDS) technique [48,49,50,51] to condense the results in a single representation. In short, the MDS represents in a low dimensional space (i.e., with dimension q) data sets from an higher dimensional space (i.e., with dimension p > q ), while preserving its main characteristics and highlighting the key issues. For achieving that goal the MDS computational algorithms requires two phases. In a first phase the user defines a given distance d comparing the set of M N items in a p-dimensional space [52,53]. Then, all items are compared by calculating a matrix Δ = d i j , i , j = 1 , , M , with d i j = d j i and d i i = 0 , of item-to-item distances in the p-dimensional space. In a second phase, the MDS performs successive iterations trying to find a configuration of items in the q-dimensional space that mimic approximately the original distances. Usually the MDS adopts a numerical strategy for minimizing some kind of least squares index, often called stress. Several distinct types of distances can be used. Also, since we are dealing with relative measurements (i.e., distances), the representation in the q-dimensional space is read in terms of clusters and can be rotated, magnified or shifted since the axis have no physical interpretation. Often the dimensions q = 2 or q = 3 are adopted since they allow a straightforward visualization [59,60,61].
We consider data sets produced by the EED with vectors v i ( n , t ) , n = 1 , , 5 and t = 1 , , 30 , for the five variables and time of simulation, respectively. For calculating the distances between items we adopt the Canberra and Lorentzian metrics, d C and d L , to assess the dissimilarity between pairs:
d t i , t j C = n = 1 5 v n , t i v n , t j v n , t i + v j n , t j ,
d t i , t j L = n = 1 5 log 1 + v n , t i v n , t j ,
where t i and t j denote two time instants, so that t i , t j 1 , , 30 . Therefore, in this case the matrices Δ have dimension 30 × 30 , for both distances.
Additionally, we consider 10 runs to evaluate the probabilistic effect and 3 scenarios for the social neighborhood D = 0.025 , 0.05 , 0.075 . We overlap the 10 MDS loci using the Procrustes technique [62,63]. The Procrustes processing between two matrices Δ 1 and Δ 2 of identical dimension determines a linear transformation (i.e., a translation, reflection, orthogonal rotation, and scaling) of the points in matrix Δ 2 to best conform them to the points in matrix Δ 1 .
Figure 19 and Figure 20 show the resulting MDS loci for q = 3 and the Canberra (3) and Lorentzian (4) distances, respectively. The numerical parameters are N = 500 , D = 0.025 , 0.05 , 0.075 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and α = 2 . The initial time instants, corresponding to t = 1 , are marked with small circles.
We verify clearly the emergence of the phase P i , i = 1 , , 4 , observed in the first group of experiments. Nonetheless, as usual with MDS, the two distances capture slightly distinct aspects of the time series in what concerns the three distinct scenarios for D. The Canberra distance highlights the distinct initial transients, while the crossover instants ( t 5 and t 13 ) between phases and the steady state have close characteristics. On the other hand, the Lorentzian distance considers that the three scenarios have similar topological form, having merely a distinct scale factor.
We test also the EED for the collection of scenarios S i , i = 12 , , 20 , corresponding to the combination of three values of the social neighborhood D = 0.025 , 0.05 , 0.075 and three values of the hospital capacity N h = 200 , 50 , 20 . The average of the cost indices a v ( I j ) , j = 1 , , 6 , for 10 independent runs of each scenario, are listed in Table 3. We can also use the MDS to visualize the information using the Canberra and Lorentzian metrics, d C and d L , that in this case are written as:
d s i , s j C = m = 1 4 u m , s i u m , s j u m , s i + u j m , s j ,
d s i , s j L = m = 1 4 log 1 + u m , s i u m , s j ,
where the vectors u i ( m , t ) , m = 1 , , 4 , and s = 1 , , 90 , include the values of the 4 cost indices for the nine scenarios with 10 runs each. Therefore, in this case each matrix Δ has dimension 90 × 90 .
Figure 21 and Figure 22 show the MDS loci for q = 3 and the Canberra (5) and Lorentzian (6), respectively. The loci reveal clearly that the pairs of scenarios S 12 , S 15 , S 16 , S 17 and S 19 , S 20 have some similarities. On the other hand, the scenarios S 13 , S 14 and S 18 have, each one, a very distinct behavior. These results show that the combination of the parameters D and N h are of utmost importance.

6. Conclusions

This paper presented an EA that simulates the propagation of a virus infection in a SW. The EED includes a limited number of variables and parameters, but characterizes a large number of possible scenarios and allows a fast computational simulation. In fact, the extension of the EED to include additional factors present in the real world is reasonably straightforward, but the limitation of the EED complexity follows the usual strategy of developing EA with focus on the most important variables and parameters. Several scenarios were tested and the results follow the common intuition about the diffusion of infectious diseases. The system, involving several variables and parameters, was assessed by several tools and performance indices. The MDS technique proved to be a valuable tool to condense the multidimensional nature of the information. In fact, this technique takes also advantage of present day computational resources and allows unraveling patterns embedded in complex data and tracing conclusions that otherwise would require laborious schemes to highlight the main conclusions. In summary, the EED represents a valuable computational tool for the development of strategies for simulating, controlling and foreseeing future results of virus outbreaks.

Funding

This research received no external funding.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Cox, C.M.; Blanton, L.; Dhara, R.; Brammer, L.; Finelli, L. 2009 Pandemic Influenza A (H1N1) Deaths among Children—United States, 2009–2010. Clin. Infect. Dis. 2011, 52, S69–S74. [Google Scholar] [CrossRef] [Green Version]
  2. Lopes, A.M.; Andrade, J.P.; Machado, J.T. Multidimensional scaling analysis of virus diseases. Comput. Methods Programs Biomed. 2016, 131, 97–110. [Google Scholar] [CrossRef]
  3. Kibona, I.; Yang, C. SIR Model of Spread of Zika Virus Infections: ZIKV Linked to Microcephaly Simulations. Health 2017, 9, 1190–1210. [Google Scholar] [CrossRef] [Green Version]
  4. Lopes, A.M.; Machado, J.A.T.; Galhano, A.M. Computational Comparison and Visualization of Viruses in the Perspective of Clinical Information. Interdiscip. Sci. Comput. Life Sci. 2017, 11, 86–94. [Google Scholar] [CrossRef]
  5. Yu, P.; Zhang, W. Complex Dynamics in a Unified SIR and HIV Disease Model: A Bifurcation Theory Approach. J. Nonlinear Sci. 2019, 29, 2447–2500. [Google Scholar] [CrossRef]
  6. Zhu, N.; Zhang, D.; Wang, W.; Li, X.; Yang, B.; Song, J.; Zhao, X.; Huang, B.; Shi, W.; Lu, R.; et al. A Novel Coronavirus from Patients with Pneumonia in China, 2019. N. Engl. J. Med. 2020, 382, 727–733. [Google Scholar] [CrossRef]
  7. Chinazzi, M.; Davis, J.T.; Ajelli, M.; Gioannini, C.; Litvinova, M.; Merler, S.; y Piontti, A.P.; Mu, K.; Rossi, L.; Sun, K.; et al. The effect of travel restrictions on the spread of the 2019 novel coronavirus (COVID-19) outbreak. Science 2020, 368, 395–400. [Google Scholar] [CrossRef] [Green Version]
  8. Li, C.; Yang, Y.; Ren, L. Genetic evolution analysis of 2019 novel coronavirus and coronavirus from other species. Infect. Genet. Evol. 2020, 82, 104285. [Google Scholar] [CrossRef]
  9. Chen, S.; Yang, J.; Yang, W.; Wang, C.; Bärnighausen, T. COVID-19 control in China during mass population movements at New Year. Lancet 2020, 395, 764–766. [Google Scholar] [CrossRef] [Green Version]
  10. Kissler, S.M.; Tedijanto, C.; Goldstein, E.; Grad, Y.H.; Lipsitch, M. Projecting the transmission dynamics of SARS-CoV-2 through the postpandemic period. Science 2020, 368, eabb5793. [Google Scholar] [CrossRef]
  11. Jones, J.H. Notes on 0; Technical Report; Stanford University: Stanford, CA, USA, 2007. [Google Scholar]
  12. Fraser, C.; Donnelly, C.A.; Cauchemez, S.; Hanage, W.P.; Kerkhove, M.D.V.; Hollingsworth, T.D.; Griffin, J.; Baggaley, R.F.; Jenkins, H.E.; Lyons, E.J.; et al. Pandemic Potential of a Strain of Influenza A (H1N1): Early Findings. Science 2009, 324, 1557–1561. [Google Scholar] [CrossRef] [Green Version]
  13. Kermack, W.O.; McKendrick, A.G. A contribution to the mathematical theory of epidemics. Proc. R. Soc. Lond. Ser. A Contain. Pap. A Math. Phys. Character 1927, 115, 700–721. [Google Scholar] [CrossRef] [Green Version]
  14. Kucharski, A.J.; Russell, T.W.; Diamond, C.; Liu, Y.; Edmunds, J.; Funk, S.; Eggo, R.M.; Sun, F.; Jit, M.; Munday, J.D.; et al. Early dynamics of transmission and control of COVID-19: A mathematical modelling study. Lancet Infect. Dis. 2020, 20, 553–558. [Google Scholar] [CrossRef] [Green Version]
  15. Grenfell, B.T.; Bjørnstad, O.N.; Finkenstädt, B.F. Dynamics of Measles Epidemics: Scaling Noise, Determinism, and Predictability with the TSIR Model. Ecol. Monogr. 2002, 72, 185–202. [Google Scholar] [CrossRef]
  16. Huang, Z.; Yang, Q.; Cao, J. Complex dynamics in a stochastic internal HIV model. Chaos Solitons Fractals 2011, 44, 954–963. [Google Scholar] [CrossRef]
  17. Hassouna, M.; Ouhadan, A.; Kinani, E.E. On the solution of fractional order SIS epidemic model. Chaos Solitons Fractals 2018, 117, 168–174. [Google Scholar] [CrossRef]
  18. Kao, P.; Yang, R. Virus diffusion in isolation rooms. J. Hosp. Infect. 2006, 62, 338–345. [Google Scholar] [CrossRef]
  19. Balcan, D.; Gonçalves, B.; Hu, H.; Ramasco, J.J.; Colizza, V.; Vespignani, A. Modeling the spatial spread of infectious diseases: The GLobal Epidemic and Mobility computational model. J. Comput. Sci. 2010, 1, 132–145. [Google Scholar] [CrossRef] [Green Version]
  20. Immonen, T.; Gibson, R.; Leitner, T.; Miller, M.A.; Arts, E.J.; Somersalo, E.; Calvetti, D. A hybrid stochastic–deterministic computational model accurately describes spatial dynamics and virus diffusion in HIV-1 growth competition assay. J. Theor. Biol. 2012, 312, 120–132. [Google Scholar] [CrossRef]
  21. Britt, B.C. Modeling viral diffusion using quantum computational network simulation. Quantum Eng. 2020, 2, e29. [Google Scholar] [CrossRef] [Green Version]
  22. Goldberg, D.E. Genetic Algorithms in Search Optimization, and Machine Learning; Addison-Wesley: Reading, MA, USA, 1989. [Google Scholar]
  23. Koza, J.R. Genetic Programming: On the Programming of Computers by Means of Natural Selection; MIT Press: Cambridge, MA, USA, 1992. [Google Scholar]
  24. Michalewicz, Z. Genetic Algorithms + Data Structures = Evolution Programs; Springer: Berlin, Germany, 1996. [Google Scholar]
  25. Bäck, T.; Hammel, U.; Schwefel, H.P. Evolutionary computation: Comments on the history and current state. IEEE Trans. Evol. Comput. 1997, 1, 3–17. [Google Scholar] [CrossRef] [Green Version]
  26. Ashlock, D. Evolutionary Computation for Modeling and Optimization; Springer: New York, NY, USA, 2006. [Google Scholar]
  27. Jensen, H.J. Self-Organized Criticality: Emergent Complex Behavior in Physical and Biological System; Cambridge University Press: New York, NY, USA, 1998. [Google Scholar]
  28. Simon, D. Evolutionary Optimization Algorithms; Wiley: Hoboken, NJ, USA, 2013. [Google Scholar]
  29. Machado, J.A.T. Optimal tuning of fractional controllers using genetic algorithms. Nonlinear Dyn. 2010, 62, 447–452. [Google Scholar] [CrossRef] [Green Version]
  30. Pires, E.J.S.; Machado, J.A.T.; de Moura Oliveira, P.B.; Cunha, J.B.; Mendes, L. Particle swarm optimization with fractional-order velocity. Nonlinear Dyn. 2010, 61, 295–301. [Google Scholar] [CrossRef] [Green Version]
  31. Machado, J.T. Complex evolution of a multi-particle system. Appl. Math. Model. 2013, 37, 9203–9214. [Google Scholar] [CrossRef] [Green Version]
  32. Pires, E.J.S.; Machado, J.A.T.; de Moura Oliveira, P.B. Dynamic Shannon Performance in a Multiobjective Particle Swarm Optimization. Entropy 2019, 21, 827. [Google Scholar] [CrossRef] [Green Version]
  33. Jansen, T. Analyzing Evolutionary Algorithms: The Computer Science Perspective; Springer: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  34. Holland, J.H. Adaptation in Natural and Artificial Systems; The University of Michigan Press: Ann Arbor, MI, USA, 1975. [Google Scholar]
  35. Fister, I.; Yang, X.S.; Brest, J.; Fister, D. A Brief Review of Nature-Inspired Algorithms for Optimization. arXiv 2013, arXiv:1307.4186. [Google Scholar]
  36. Brownlee, J. Clever Algorithms: Nature-Inspired Programming Recipes; lulu.com: Morrisville, NC, USA, 2012. [Google Scholar]
  37. Câmara, D. Bio-Inspired Networking; ISTE Press: London, UK, 2015. [Google Scholar]
  38. Reynolds, R.G. Culture on the Edge of Chaos: Cultural Algorithms and the Foundations of Social Intelligence; Springer: Berlin/Heidelberg, Germany, 2018. [Google Scholar]
  39. Shailaja, K.; Seetharamulu, B.; Jabbar, M.A. Machine Learning in Healthcare: A Review. In Proceedings of the 2018 Second International Conference on Electronics, Communication and Aerospace Technology (ICECA), Coimbatore, India, 29–31 March 2018. [Google Scholar] [CrossRef]
  40. D’Angelo, G.; Pilla, R.; Tascini, C.; Rampone, S. A proposal for distinguishing between bacterial and viral meningitis using genetic programming and decision trees. Soft Comput. 2019, 23, 11775–11791. [Google Scholar] [CrossRef]
  41. D’Angelo, G.; Palmieri, F.; Rampone, S. Detecting unfair recommendations in trust-based pervasive environments. Inf. Sci. 2019, 486, 31–51. [Google Scholar] [CrossRef]
  42. Kermack, W.O.; McKendrick, A.G. Contributions to the mathematical theory of epidemics—I. Bull. Math. Biol. 1991, 53, 33–55. [Google Scholar] [CrossRef]
  43. Kermack, W.O.; McKendrick, A.G. Contributions to the mathematical theory of epidemics—II. The problem of endemicity. Bull. Math. Biol. 1991, 53, 57–87. [Google Scholar] [CrossRef]
  44. Kermack, W.O.; McKendrick, A.G. Contributions to the mathematical theory of epidemics—III. Further studies of the problem of endemicity. Bull. Math. Biol. 1991, 53, 89–118. [Google Scholar] [CrossRef]
  45. Keeling, M.J.; Rohani, P. Modeling Infectious Diseases in Humans and Animals; Princeton University Press: Princeton, NJ, USA, 2007. [Google Scholar]
  46. Hernandez-Vargas, E.A. Modeling and Control of Infectious Diseases in the Host: With MATLAB and R; Academic Press: San Diego, CA, USA, 2019. [Google Scholar]
  47. Liang, K. Mathematical model of infection kinetics and its analysis for COVID-19, SARS and MERS. Infect. Genet. Evol. 2020, 82, 104306. [Google Scholar] [CrossRef]
  48. Torgerson, W. Theory and Methods of Scaling; Wiley: New York, NY, USA, 1958. [Google Scholar]
  49. Sammon, J. A nonlinear mapping for data structure analysis. IEEE Trans. Comput. 1969, 18, 401–409. [Google Scholar] [CrossRef]
  50. Kruskal, J.B.; Wish, M. Multidimensional Scaling; Sage Publications: Newbury Park, CA, USA, 1978. [Google Scholar]
  51. Borg, I.; Groenen, P.J. Modern Multidimensional Scaling-Theory and Applications; Springer: New York, NY, USA, 2005. [Google Scholar]
  52. Cha, S. Taxonomy of Nominal Type Histogram Distance Measures. In Proceedings of the American Conference on Applied Mathematics, Tenerife, Spain, 15–17 December 2008; pp. 325–330. [Google Scholar]
  53. Deza, M.M.; Deza, E. Encyclopedia of Distances; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  54. Shannon, C.E. A mathematical theory of communication. Bell Syst. Tech. J. 1948, 27, 379–423, 623–656. [Google Scholar] [CrossRef] [Green Version]
  55. Jaynes, E.T. Information Theory and Statistical Mechanics. Phys. Rev. 1957, 106, 620–630. [Google Scholar] [CrossRef]
  56. Beck, C. Generalised information and entropy measures in physics. Contemp. Phys. 2009, 50, 495–510. [Google Scholar] [CrossRef]
  57. Gray, R.M. Entropy and Information Theory; Springer: New York, NY, USA, 2009. [Google Scholar]
  58. Machado, J.A.T. Fractional Order Generalized Information. Entropy 2014, 16, 2350–2361. [Google Scholar] [CrossRef] [Green Version]
  59. Machado, J.T. Multidimensional scaling analysis of fractional systems. Comput. Math. Appl. 2012, 64, 2966–2972. [Google Scholar] [CrossRef]
  60. Machado, J.A.T. Relativistic Time Effects in Financial Dynamics. Nonlinear Dyn. 2014, 75, 735–744. [Google Scholar] [CrossRef] [Green Version]
  61. Mata, M.; Machado, J. Entropy Analysis of Monetary Unions. Entropy 2017, 19, 245. [Google Scholar] [CrossRef]
  62. Kendall, D.G. A Survey of the Statistical Theory of Shape. Stat. Sci. 1989, 4, 87–99. [Google Scholar] [CrossRef]
  63. Gower, J.C.; Dijksterhuis, G.B. Procrustes Problems; OUP Oxford: Oxford, UK, 2004. [Google Scholar]
Figure 1. Diagram of the evolutionary epidemic diffusion (EED) involving the five state variables ‘healthy’, ‘infected’, ‘hospitalized’, ‘immunized’ and ‘dead’ and the three locations small world (SW), hospital and cemetery.
Figure 1. Diagram of the evolutionary epidemic diffusion (EED) involving the five state variables ‘healthy’, ‘infected’, ‘hospitalized’, ‘immunized’ and ‘dead’ and the three locations small world (SW), hospital and cemetery.
Mathematics 08 00779 g001
Figure 2. Scenario S 1 : Time evolution of the 5 state variables, for N = 500 , n i = 50 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h .
Figure 2. Scenario S 1 : Time evolution of the 5 state variables, for N = 500 , n i = 50 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h .
Mathematics 08 00779 g002
Figure 3. Scenario S 2 : Time evolution of the 5 state variables for α = 1 ( N = 500 , n i = 50 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Figure 3. Scenario S 2 : Time evolution of the 5 state variables for α = 1 ( N = 500 , n i = 50 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Mathematics 08 00779 g003
Figure 4. Scenario S 3 : Time evolution of the 5 state variables for N h = 100 ( N = 500 , n i = 50 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and α = 2 ).
Figure 4. Scenario S 3 : Time evolution of the 5 state variables for N h = 100 ( N = 500 , n i = 50 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and α = 2 ).
Mathematics 08 00779 g004
Figure 5. Scenario S 4 : Time evolution of the 5 state variables for D = 0.05 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Figure 5. Scenario S 4 : Time evolution of the 5 state variables for D = 0.05 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Mathematics 08 00779 g005
Figure 6. Variation of the integral in time of the number of hospitalized ( I 1 ) versus the social neighborhood D for α = 1 , 2 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Figure 6. Variation of the integral in time of the number of hospitalized ( I 1 ) versus the social neighborhood D for α = 1 , 2 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Mathematics 08 00779 g006
Figure 7. Variation of the maximum number of hospitalized ( I 2 ) versus the social neighborhood D for α = 1 , 2 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Figure 7. Variation of the maximum number of hospitalized ( I 2 ) versus the social neighborhood D for α = 1 , 2 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Mathematics 08 00779 g007
Figure 8. Variation of the number of dead ( I 3 ) versus the social neighborhood D for α = 1 , 2 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Figure 8. Variation of the number of dead ( I 3 ) versus the social neighborhood D for α = 1 , 2 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Mathematics 08 00779 g008
Figure 9. Variation of the integral in time of the number of healthy and ‘immunized’ ( I 4 ) versus the social neighborhood D for α = 1 , 2 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Figure 9. Variation of the integral in time of the number of healthy and ‘immunized’ ( I 4 ) versus the social neighborhood D for α = 1 , 2 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Mathematics 08 00779 g009
Figure 10. State of the SW space occupation by ‘healthy’, ‘infected’ and ‘immunized’ individuals for: (a) t = 1 , (b) t = 5 , (c) t = 10 , (d) t = 20 ( N = 500 , n i = 50 , D = 0.05 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Figure 10. State of the SW space occupation by ‘healthy’, ‘infected’ and ‘immunized’ individuals for: (a) t = 1 , (b) t = 5 , (c) t = 10 , (d) t = 20 ( N = 500 , n i = 50 , D = 0.05 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Mathematics 08 00779 g010
Figure 11. Space entropy H x y versus time t, for r = 20 and α = 1 , 2 ( N = 500 , D = 0.05 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Figure 11. Space entropy H x y versus time t, for r = 20 and α = 1 , 2 ( N = 500 , D = 0.05 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 and N h ).
Mathematics 08 00779 g011
Figure 12. Scenario S 5 : Time evolution of the 5 state variables for D = 0.07 and a disturbance in the SW with the input of 50 new ‘infected’ visitors at t = 25 ( N = 500 , n i = 50 at t = 1 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Figure 12. Scenario S 5 : Time evolution of the 5 state variables for D = 0.07 and a disturbance in the SW with the input of 50 new ‘infected’ visitors at t = 25 ( N = 500 , n i = 50 at t = 1 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Mathematics 08 00779 g012
Figure 13. Scenario S 6 : Time evolution of the 5 state variables for D = 0.05 and a disturbance in the SW with the input of 50 new ‘infected’ visitors at t = 25 ( N = 500 , n i = 50 at t = 1 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Figure 13. Scenario S 6 : Time evolution of the 5 state variables for D = 0.05 and a disturbance in the SW with the input of 50 new ‘infected’ visitors at t = 25 ( N = 500 , n i = 50 at t = 1 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Mathematics 08 00779 g013
Figure 14. Scenario S 7 : Time evolution of the 5 state variables for a disturbance in the SW so that D = 0.07 for t 3 , and D = 0.01 for t 4 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Figure 14. Scenario S 7 : Time evolution of the 5 state variables for a disturbance in the SW so that D = 0.07 for t 3 , and D = 0.01 for t 4 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Mathematics 08 00779 g014
Figure 15. Scenario S 8 : Time evolution of the 5 state variables for a disturbance in the SW so that p 4 = 0.05 and p 5 = 0.02 for t 5 , and p 4 = 0.01 and p 5 = 0.01 for t 6 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , α = 2 and N h ).
Figure 15. Scenario S 8 : Time evolution of the 5 state variables for a disturbance in the SW so that p 4 = 0.05 and p 5 = 0.02 for t 5 , and p 4 = 0.01 and p 5 = 0.01 for t 6 ( N = 500 , n i = 50 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , α = 2 and N h ).
Mathematics 08 00779 g015
Figure 16. Scenario S 9 : Time evolution of the 5 state variables for n i = 5 ( N = 500 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , α = 2 and N h ).
Figure 16. Scenario S 9 : Time evolution of the 5 state variables for n i = 5 ( N = 500 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , α = 2 and N h ).
Mathematics 08 00779 g016
Figure 17. Scenario S 10 : Time evolution of the 5 state variables for n i = 10 ( N = 500 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , α = 2 and N h ).
Figure 17. Scenario S 10 : Time evolution of the 5 state variables for n i = 10 ( N = 500 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , α = 2 and N h ).
Mathematics 08 00779 g017
Figure 18. Scenario S 11 : Time evolution of the 5 state variables for n i = 20 ( N = 500 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , α = 2 and N h ).
Figure 18. Scenario S 11 : Time evolution of the 5 state variables for n i = 20 ( N = 500 , D = 0.07 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , α = 2 and N h ).
Mathematics 08 00779 g018
Figure 19. The 3-dimensional multidimensional scaling (MDS) locus, using the Canberra distance (3), t 1 , , 30 , for D = 0.025 , 0.05 , 0.075 ( N = 500 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Figure 19. The 3-dimensional multidimensional scaling (MDS) locus, using the Canberra distance (3), t 1 , , 30 , for D = 0.025 , 0.05 , 0.075 ( N = 500 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Mathematics 08 00779 g019
Figure 20. The 3-dimensional MDS locus, using the Lorentzian distance (4), t 1 , , 30 , for D = 0.025 , 0.05 , 0.075 ( N = 500 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Figure 20. The 3-dimensional MDS locus, using the Lorentzian distance (4), t 1 , , 30 , for D = 0.025 , 0.05 , 0.075 ( N = 500 , δ = 0.1 , p 1 = 0.1 , p 2 = 0.9 , p 3 = 0.7 , p 4 = 0.05 , p 5 = 0.02 , α = 2 and N h ).
Mathematics 08 00779 g020
Figure 21. The 3-dimensional MDS locus, using the Canberra distance (5), for 10 runs of each scenario S i , i = 12 , , 20 , with performance captured by the cost indices I j , j = 1 , , 4 .
Figure 21. The 3-dimensional MDS locus, using the Canberra distance (5), for 10 runs of each scenario S i , i = 12 , , 20 , with performance captured by the cost indices I j , j = 1 , , 4 .
Mathematics 08 00779 g021
Figure 22. The 3-dimensional MDS locus, using the Lorentzian distance (6), for 10 runs of each scenario S i , i = 12 , , 20 , with performance captured by the cost indices I j , j = 1 , , 4 .
Figure 22. The 3-dimensional MDS locus, using the Lorentzian distance (6), for 10 runs of each scenario S i , i = 12 , , 20 , with performance captured by the cost indices I j , j = 1 , , 4 .
Mathematics 08 00779 g022
Table 1. Numerical values of the EED parameters for scenarios S i , i = 1 , , 4 , and the cost indices I j , j = 1 , , 4 .
Table 1. Numerical values of the EED parameters for scenarios S i , i = 1 , , 4 , and the cost indices I j , j = 1 , , 4 .
ScenarioN n i D δ p 1 p 2 p 3 p 4 p 5 N h α τ I 1 I 2 I 3 I 4
S 1 500500.070.10.10.90.70.050.022300.2900.6760.3600.367
S 2 500500.070.10.10.90.70.050.021300.2560.5880.2860.476
S 3 500500.070.10.10.90.70.050.021002300.1070.2000.4480.321
S 4 500500.050.10.10.90.70.050.022300.2200.5160.2440.544
Table 2. Numerical values of the EED parameters for scenarios S i , i = 5 , , 11 , and the cost indices I j , j = 1 , , 4 .
Table 2. Numerical values of the EED parameters for scenarios S i , i = 5 , , 11 , and the cost indices I j , j = 1 , , 4 .
S i N n i D δ p 1 p 2 p 3 p 4 p 5 N h α τ I 1 I 2 I 3 I 4
S 5 500 50 t = 1 50 t = 25 0.070.10.10.90.70.050.022500.1840.5890.3560.453
S 6 500 50 t = 1 50 t = 25 0.050.10.10.90.70.050.022500.1640.3950.2860.562
S 7 50050 0.07 t 3 0.01 t 4 0.10.10.90.70.050.022300.23800.56000.25600.5007
S 8 500500.050.10.10.90.7 0.05 t 5 0.01 t 6 0.02 t 5 0.01 t 6 2300.33410.76600.20600.4360
S 9 50050.070.10.10.90.70.050.022300.1960.4300.2380.608
S 10 500100.070.10.10.90.70.050.022300.2840.6080.3040.449
S 11 500200.070.10.10.90.70.050.022300.3070.6960.2900.424
Table 3. Numerical values of the EED parameters for scenarios S i , i = 12 , , 20 , and the average of the cost indices a v ( I j ) , j = 1 , , 4 , for 10 independent runs.
Table 3. Numerical values of the EED parameters for scenarios S i , i = 12 , , 20 , and the average of the cost indices a v ( I j ) , j = 1 , , 4 , for 10 independent runs.
ScenarioND δ p 1 p 2 p 3 p 4 p 5 N h α τ a v ( I 1 ) a v ( I 2 ) a v ( I 3 ) a v ( I 4 )
S 12 2000.0250.10.10.90.70.050.022002300.0620.1500.0690.868
S 13 2000.0500.10.10.90.70.050.022002300.1910.4000.2580.545
S 14 2000.0750.10.10.90.70.050.022002300.1990.4000.4160.328
S 15 2000.0250.10.10.90.70.050.02502300.0460.1000.0770.867
S 16 2000.0500.10.10.90.70.050.02502300.0630.1000.3760.467
S 17 2000.0750.10.10.90.70.050.02502300.0560.1000.5040.284
S 18 2000.0250.10.10.90.70.050.02202300.0210.0400.1000.848
S 19 2000.0500.10.10.90.70.050.02202300.0270.0400.4250.411
S 20 2000.0750.10.10.90.70.050.02202300.0230.0400.5310.271

Share and Cite

MDPI and ACS Style

Tenreiro Machado, J.A. An Evolutionary Perspective of Virus Propagation. Mathematics 2020, 8, 779. https://doi.org/10.3390/math8050779

AMA Style

Tenreiro Machado JA. An Evolutionary Perspective of Virus Propagation. Mathematics. 2020; 8(5):779. https://doi.org/10.3390/math8050779

Chicago/Turabian Style

Tenreiro Machado, J. A. 2020. "An Evolutionary Perspective of Virus Propagation" Mathematics 8, no. 5: 779. https://doi.org/10.3390/math8050779

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop