Preprint
Article

Stochastic Compartment Model With Mortality and Its Application to Epidemic Spreading in Complex Networks

Altmetrics

Downloads

74

Views

25

Comments

0

A peer-reviewed article of this preprint also exists.

Submitted:

18 March 2024

Posted:

22 March 2024

You are already at the latest version

Alerts
Abstract
We study epidemic spreading in complex networks by a multiple random walker approach. Each walker performs an independent simple Markovian random walk on a complex undirected (ergodic) random graph where we focus on Barabási-Albert (BA), Erdös-Rényi (ER) and Watts-Strogatz (WS) types. Both, walkers and nodes can be either susceptible (S) or infected and infectious (I) representing their states of health. Susceptible nodes may be infected by visits of infected walkers, and susceptible walkers may be infected by visiting infected nodes. No direct transmission of the disease among walkers (or among nodes) is possible. This model mimics a large class of diseases such as Dengue and Malaria with transmission of the disease via vectors (mosquitos). Infected walkers may die during the time span of their infection introducing an additional compartment D of dead walkers. Infected nodes never die and always recover from their infection after a random finite time. This assumption is based on the observation that infectious vectors (mosquitos) are not ill and do not die from the infection. The infectious time spans of nodes and walkers, and the survival times of infected walkers, are represented by independent random variables. We derive stochastic evolution equations for the mean-field compartmental populations with mortality of walkers and delayed transitions among the compartments. From linear stability analysis, we derive the basic reproduction numbers R M , R 0 with and without mortality, respectively, and prove that R M < R 0 . For R M , R 0 > 1 the healthy state is unstable whereas for zero mortality a stable endemic equilibrium exists (independent of the initial conditions) which we obtained explicitly. We observe that the solutions of the random walk simulations in the considered networks agree well with the mean-field solutions for strongly connected graph topologies, whereas less well for weakly connected structures and for diseases with high mortality. Our model has applications beyond epidemic dynamics, for instance in the kinetics of chemical reactions, the propagation of contaminants, wood fires, among many others.
Keywords: 
Subject: Physical Sciences  -   Other

1. Introduction

Sudden or recurrent emergence of epidemics has been an everlasting thread to humanity. Highly infectious and fatal diseases such as pestilence, typhus, cholera, and leprosy were among the main causes of death in medieval times in Europe and until 20th century a major scourge of humanity [1]. This permanent challenge has naturally driven interest in protective measures and predictive models.
The systematic mathematical study of epidemic spreading began only a century ago with the seminal work of Kermack and McKendrick [2]. They were the first to introduce what we call nowadays a “compartment model”. In their so called SIR-model the individuals are categorized in compartments susceptible - S, infected - I, recovered (immune) - R characterizing their states of their health. Whereas standard SIR type models are able to capture main features of a certain class of infectious diseases such as mumps, measles and rubella, they fail to describe persistent oscillatory behaviors and spontaneous outbursts which are observed in many epidemics.
A large amount of work still is devoted to compartmental models [3,4] where an impressive field has emerged [5,6] and the interest was again considerably enhanced by the context of COVID-19 pandemics [7]. Beside purely macroscopic models, the study of epidemic dynamics in complex networks has attracted considerable attention [9,10,11]. In these works the importance of the graph topology for spreading phenomena has been highlighted. In particular, Pastor-Satorras and Vespignani showed that for a wide range of scale free networks no critical threshold for epidemic spreading exists [10]. The topological features crucial for epidemic spreading include the small world property (short average network distances1) and a high clustering coefficient measuring the existence of redundant paths between pairs of nodes [25,27].
Further interesting directions are represented by combinations of network science and stochastic compartmental models [16,17,28,29,31]. Such models include Markovian and non-Markovian approaches [23,30,35,36,37] where non-Markovianity is introduced by non-exponentially distributed sojourn times in the compartments [33,34]. In these works explicit formulae for the endemic equilibrium in terms of mean compartmental sojourn times and the basic reproduction number are derived and numerically validated in random walk simulations. A further non-Markovian model appeared recently [12] where non-Markovianity comes into play by introducing an "age of infection" allowing individuals to recover when their infection period exceeds a certain threshold, generalizing the initial idea of Kermack and McKendrick.
Other recent works emphasize the importance of spatial heterogeneity effects of infection patterns in epidemic spreading phenomena [38] and the role of local clusters to generate periodic epidemic outbursts [39] and see [40] for a review of these effects. A cluster model to explain periodic behavior was introduced a long time ago [41]. The role of the complex interplay of retardation (delayed compartmental transitions) and fluctuations for oscillatory behavior has been investigated in one of our recent works [35].
The aim of the present paper is to study the spreading of a certain class of diseases in a population of individuals (random walkers) moving on complex graphs aiming to mimic human mobility patterns in complex environments such as cities, street, and transportation networks. Essential elements in our model are the account for the mortality of infected individuals (random walkers) and an indirect transmission pathway via vectors (detailed below).
The present paper is organized as follows. In Section 2 we establish a stochastic mean field model for the evolution of the compartmental populations. The special case of zero mortality is considered in Section 3 where we obtain an explicit formula for the endemic equilibrium (stationary constant compartmental populations for infinite time). In this way we identify a crucial parameter controlling the stability of the healthy state having the interpretation of the basic reproduction number R 0 (Section 4) where the healthy state is stable for R 0 < 1 and unstable for R 0 > 1 . A detailed proof of the stability of the endemic state for R 0 > 1 is provided in Appendix A.2. In Section 5 we analyze stability of the healthy state with mortality and derive the basic reproduction number R M and prove that R M < R 0 , i.e., mortality reduces the basic reproduction number. In Section 6 we test robustness of our mean field model under "complex real world conditions" by implementing its assumptions into multiple random random walkers simulations on Barabási-Albert (BA), Erdös-Rényi (ER) and Watts-Strogatz (WS) type graphs ([16,17,24] and Appendix A.3). These graph types have different complexity and connectivity features with impact on the spreading.

2. Compartmental Model with Mortality

The goal of this section is to develop a mean field model for a certain class of diseases with indirect infection transmission via vectors which includes Dengue, Malaria (transmission by mosquitos) or Pestilence (transmission by fleas) and others [8,9]. To that end we consider a population of Z random walkers navigating independently on a connected (ergodic) graph. Each walker performs independent steps from one to another connected node on the network (specified subsequently). We assume that walkers and nodes are in one of the compartments, S (susceptible) and I (infected). In addition, walkers can be in compartment D (dead) whereas nodes never die.
Let Z S ( t ) , Z I ( t ) ( N S ( t ) , N I ( t ) ) be the number of walkers (nodes) in compartments S and I, and Z D ( t ) the non-decreasing number of walkers (in compartment D) died from the disease up to time t. We consider Z = Z I ( t ) + Z S ( t ) + Z D ( t ) walkers (Z independent of time) and a constant number of nodes N = N I ( t ) + N S ( t ) . We assume at instant t = 0 the first spontaneous occurrence of the disease of a few infected walkers Z I ( 0 ) Z or nodes N I ( 0 ) N (and no dead walkers Z D ( 0 ) = 0 ). We introduce the compartmental fractions S w ( t ) = Z S ( t ) Z , J w ( t ) = Z I ( t ) Z , d w ( t ) = Z d ( t ) Z for the walkers (normalized with respect to Z) with S w ( t ) + J w ( t ) + d w ( t ) = 1 , and S n ( t ) = N S ( t ) N , J n ( t ) = N I ( t ) N with S n ( t ) + J n ( t ) = 1 . To limit the complexity of our model we do not consider the demographic evolution, i.e., there are no natural birth and dead processes. We denote with A w ( t ) , A n ( t ) the infection rates (rates of transitions S → I) of walkers and nodes, respectively. We assume the following simple bi-linear forms
A w ( t ) = A w [ S w ( t ) , J n ( t ) ] = β w S w ( t ) J n ( t ) A n ( t ) = A n [ S n ( t ) , J w ( t ) ] = β n S n ( t ) J w ( t )
with constant rate parameters β w , β n > 0 (independent of time). A w ( t ) indicates the infection rate of walkers where its dependence of S w , J n is telling us that susceptible walkers can be infected only by (visiting) infected nodes. A n ( t ) stands for the infection rate of nodes depending on S n ( t ) , J w ( t ) indicating that susceptible nodes can only be infected by (visits of) infected walkers. There are no direct transmissions among walkers and among nodes. Infections of walkers (nodes) take place with specific transmission probabilities in a contact of a node and a walker which are captured by (yet not identical with) the transmission rate constants β w , n .
The infection time spans t I w , n > 0 without mortality (waiting times in compartment I) of walkers and nodes are assumed to be independent random variables drawn from specific distributions specified hereafter. As only admitted dead process we assume that infected walkers may die within the time span of their infection. To capture this kind of mortality caused by the disease, we introduce a further independent random variable t M > 0 which indicates the life span of an infected walker. Both the infection and life time spans t I w , t M are counted from the time instant of the infection. A walker survives the disease if t M > t I w and dies from it for t M < t I w . With these assumptions, we give first a stochastic formulation of the evolution equations
d d t S w ( t ) = A w ( t ) + A w ( t t I w ) Θ ( t M t I w ) + J w ( 0 ) δ ( t t I w ) Θ ( t M t I w ) d d t J w ( t ) = A w ( t ) A w ( t t I w ) Θ ( t M t I w ) J w ( 0 ) δ ( t t I w ) Θ ( t M t I w ) d d t d w ( t ) d d t d w ( t ) = A w ( t t M ) Θ ( t I w t M ) + J w ( 0 ) δ ( t t M ) Θ ( t I w t M ) d d t S n ( t ) = A n ( t ) + A n ( t t I n ) + J n ( 0 ) δ ( t t I n ) d d t J n ( t ) = d d t S n ( t )
where d d t d w ( t ) indicates the (non-negative) mortality rate of walkers. We indicate with . . average over the contained (set of independent) random variables t I w , t I n , t M outlined hereafter and in Appendix A.1. Θ ( . . ) stands for the Heaviside function (A2), and δ ( . . ) for the Dirac’s δ -distribution. An epidemic always starts from “natural” initial conditions S w ( 0 ) = 1 , S n ( 0 ) = 1 (globally healthy state) where at t = 0 the first infections occur spontaneously and can be “generated” by adding the source terms J w , n ( 0 ) δ ( t ) to the infection rates of walkers and nodes, respectively. Equivalently, we introduce initial conditions S w , n ( 0 ) = 1 J w , n ( 0 ) ( d w ( 0 ) = 0 ) with J w , n ( 0 ) > 0 consisting typically of a few infected walkers and/or nodes in a large susceptible population without dead walkers d w ( 0 ) = 0 .
The interpretation of system (2) is as follows. The instantaneous infection rate A w ( t ) governs the transitions S → I of walkers (due to visits of infected nodes). The term A w ( t t I w ) Θ ( t M t I w ) describes the rate of walkers recovering at time t and infected at t t I w , i.e., their infection time span has elapsed and they survived as t M > t I w (indicated by Θ ( t M t I w ) = 1 ). Then A w ( t t M ) Θ ( t I w t M ) captures the rate of walkers infected at t t M dying at at time t during the infection time span (indicated by Θ ( t I w t M ) = 1 for t I w > t M ).

Remark I

The infection time span of a walker (sojourn time in compartment I) is m i n ( t I w , t M ) , i.e., t I w if t M > t I w (where the walker survives the disease), and is t M if the walker dies within the infectious time span ( t M < t I w ). t I w is the walker’s infection time span without mortality (retrieved for t M ). The probability of persistence of a walker’s infection at time t, given the infection starts at time 0 is Θ ( t I w t ) Θ ( t M t ) (see (7)). Note that Θ ( t I w t ) Θ ( t M t ) = 1 only if t < m i n ( t I w , t M ) , i.e., when the walker is in compartment I. As a crucial element of our model, we will analyze the statistics of the walker’s infection time span m i n ( t I w , t M ) .
The initially infected walkers and nodes are as well subjected to the transition pathways, i.e., walkers either recover (alive) with rate J w ( 0 ) δ ( t t I w ) Θ ( t M t I w ) or they die with rate J w ( 0 ) δ ( t t M ) Θ ( t I w t M ) , and nodes always recover with rate J n ( 0 ) δ ( t t I n ) . For t these terms are evanescent thus the initial conditions do not affect large time limits (endemic state for zero mortality). The importance of these terms can be seen by setting β w , n = 0 (no infections). Without these terms the initially infected walkers and nodes would stay infected forever, inconsistent with our assumptions.
The rate equations for the nodes can be interpreted in the same way as interplay of instantaneous infections and delayed recovery without mortality. We emphasize that the evolution equations of the nodes and walkers are non-linearly coupled by the implicit dependencies of the infection rates (1). In order to derive an explicit representation of system (2), we need to have a closer look on the averaging procedures and the involved distributions related to the independent random variables T = { t I w , t I n , t M } > 0 drawn from specific probability density functions (PDFs) which we define by
P r o b [ T [ τ , τ + d τ ] = K ( τ ) d τ ,
with their respective PDFs (kernels) K ( τ ) = { K I w , n ( τ ) , K M ( τ ) } which are normalized P r o b [ T > 0 ] = 0 K ( τ ) d τ = 1 . Then recall the averaging rule for (suitable) functions f ( T ) of the random variable T which we use throughout the paper
f ( T ) = 0 K ( τ ) f ( τ ) d τ ,
see also Appendix A.1. An important case is δ ( t T ) = K ( t ) . Then by applying (4) we introduce the persistence probabilities of walker’s (node’s) infection (without mortality)
Φ I w , n ( t ) = P r o b ( t I w , n > t ) = Θ ( t I w , n t ) = t K I w , n ( τ ) d τ
and the probability of walker’s survival up to time t (given t I w = )
Φ M ( t ) = P r o b ( t M > t ) = Θ ( t M t ) = t K M ( τ ) d τ .
The persistence probabilities fulfill the initial condition Φ M ( 0 ) = Φ I w , n ( 0 ) = 1 corresponding to the normalization of the waiting time PDFs K ( τ ) = { K I w , n ( τ ) , K M ( τ ) } and are vanishing at infinity Φ M ( ) = Φ I w , n ( ) = 0 . To evaluate the averages in (2) we will use the following quantities:
δ ( t T ) = K ( t ) , T = { t I w , t I n , t M } Θ ( t M t ) Θ ( t I w t ) = Θ ( t M t ) Θ ( t I w t ) = Φ I w ( t ) Φ M ( t ) b d ( t ) = δ ( t t M ) Θ ( t I w t M ) = δ ( t t M ) Θ ( t I w t ) = K M ( t ) Φ I w ( t ) b r ( t ) = δ ( t t I w ) Θ ( t M t I w ) = δ ( t t I w ) Θ ( t M t ) = K I w ( t ) Φ M ( t ) b d ( t ) + b r ( t ) = K I , M w ( t ) = d d t [ Θ ( t M t ) Θ ( t I w t ) ] = d d t Φ I w ( t ) Φ M ( t ) 0 K I , M w ( t ) d t = 1 R ( t ) = Θ ( t t I w ) Θ ( t M t I w ) = 0 t b r ( τ ) d τ = 0 t K I w ( τ ) Φ M ( τ ) d τ D ( t ) = Θ ( t t M ) Θ ( t I w t M ) = 0 t b d ( τ ) d τ = 0 t K M ( τ ) Φ I w ( τ ) d τ R ( t ) + D ( t ) = 0 t K I , M w ( τ ) d τ = 0 t [ b d ( τ ) + b r ( τ ) ] d τ = 1 Φ I w ( t ) Φ M ( t ) D ( ) + R ( ) = 1 A ( t t I ) Θ ( t M t I ) = A ( t t I ) Φ M ( t I ) = 0 t A ( t τ ) Φ M ( τ ) K I ( τ ) d τ A ( t t M Θ ( t I w t M ) = A ( t t M ) Φ I w ( t M ) = 0 t A ( t τ ) Φ I w ( τ ) K M ( τ ) d τ
In these averages we make use of the independence of the waiting times t M , t I w , n , and of causality of A ( τ ) and the kernels K ( τ ) (i.e., A ( τ ) , K ( τ ) = 0 for τ < 0 ). Of utmost importance are the "defective" PDFs (DPDFs) b d , r ( t ) of death and recovery. "Defective" means that b d , r ( t ) are no proper PDFs since they are not normalized to one, but rather to D ( ) , R ( ) < 1 , respectively. Consult [13] for a recent account of defective distributions and related stochastic processes. They have the following interpretation. b d ( t ) d t = K M ( t ) Φ I w ( t ) d t is the probability of transition I → D within [ t , t + d t ] of an infected walker (infected at t = 0 ). b r ( t ) d t = K I w ( t ) Φ M ( t ) d t is the probability of transition I → S within [ t , t + d t ] of a walker infected at t = 0 . Therefore,
K I , M w ( t ) = b r ( t ) + b d ( t ) = d d t Θ ( t M t ) Θ ( t I w t ) = d d t [ Φ I w ( t ) Φ M ( t ) ]
is non-negative (as are K I w = d d t Φ I w 0 , K M = d d t Φ M 0 ) and is a proper well-normalized PDF of all exits of walkers from compartment I (i.e., I → S + I → D). Without mortality ( Φ M ( t ) = 1 ) this PDF retrieves K I , M w ( t ) = K I w ( t ) .
The quantities R ( t ) , D ( t ) introduced in (7) have the following interpretation. R ( t ) is the probability that a walker infected at instant 0 is at time t in compartment S (i.e., recovered prior or up to time t). D ( t ) is the probability that a walker infected at instant 0 is at time t in compartment D (i.e., died prior and up to time t). Important are the infinite time limits: R ( ) has the interpretation of the overall probability that an infected walker survives the infection, and D ( ) is the overall probability for an infected walker to die from the disease. We refer D ( ) also to as "overall mortality". It must not be confused with the infinite time limit of dead walkers fraction d w ( ) which is different from D ( ) as we will see in details subsequently. A small value D ( ) may cause a high value of d w ( ) for instance for short infectious periods where walkers may be repeatedly infected.
In most cases not all infected walkers die from their disease (in an infinite observation time), hence D ( ) < 1 (as b d is defective). D ( ) 1 represents the limit of a fatal disease, and D ( ) 0 a disease without mortality. R ( ) < 1 (as b r is defective) is the complementary probability with D ( ) + R ( ) = 1 .
With these remarks, system (2) reads
d d t S w ( t ) = A w ( t ) + 0 t A w ( t τ ) K I w ( τ ) Φ M ( τ ) d τ + J w ( 0 ) K I w ( t ) Φ M ( t ) d d t J w ( t ) = d d t 0 t A w ( τ ) Φ M ( t τ ) Φ I w ( t τ ) d τ J w ( 0 ) K I w ( t ) Φ M ( t ) + K M ( t ) Φ I w ( t ) d d t S n ( t ) = A n ( t ) + 0 t A n ( t τ ) K I n ( τ ) d τ + J n ( 0 ) K I n ( t ) d d t J n ( t ) = d d t S n ( t ) .
The PDF (8) that a walker leaves compartment I (either by recovery or by death) allows to rewrite the second equation of (9) as
d d t J w ( t ) = A w ( t ) 0 t A w ( t τ ) K I , M w ( τ ) d τ J w ( 0 ) K I , M w ( t ) .
Worthy of closer consideration is the mortality rate of the infected walkers (representing the total mortality – entry rate into the D compartment)
d d t d w ( t ) = d d t ( S w ( t ) + J w ( t ) ) = A w ( t t M ) Θ ( t I w t M ) + J w ( 0 ) δ ( t t M ) Θ ( t I w t M ) = 0 t A w ( t τ ) K M ( τ ) Φ I w ( τ ) d τ + J w ( 0 ) K M ( t ) Φ I w ( t )
where clearly d d t d w ( t ) 0 . Integrating this relation yields the fraction d w ( t ) of dead walkers
d w ( t ) = 1 S w ( t ) J w ( t ) = 0 t A w ( t τ ) Θ ( τ t M ) Θ ( t I w t M ) d τ + J w ( 0 ) Θ ( t t M ) Θ ( t I w t M ) = 0 t A w ( t τ ) D ( τ ) d τ + J w ( 0 ) D ( t ) .
An interesting quantity is the cumulative recovery rate of walkers (integrated entry rates of walkers into the S compartment, see first equation in (2))
r w ( t ) = 0 t A w ( t τ ) Θ ( τ t I w ) Θ ( t M t I w ) d τ + J w ( 0 ) Θ ( t t I w ) Θ ( t M t I w ) = 0 t A w ( t τ ) R ( τ ) d τ + J w ( 0 ) R ( t ) .
The quantity r w ( t ) records all recovery events of walkers up to time t, where individual walkers may suffer repeated infections and recoveries. We observe that (see (7))
r w ( t ) + d w ( t ) = 0 t A w ( t τ ) [ 1 Φ I w ( τ ) Φ M ( τ ) ] d τ + J w ( 0 ) 1 Φ I w ( t ) Φ M ( t ) .
Relation (12) records all dead events of walkers up to time t. Since each walker may die only once, it follows indeed that d w ( t ) [ 0 , 1 ] . Contrarily, the quantity r w ( t ) is not restricted to this interval as walkers may be repeatedly infected and recovered but due to mortality eventually only a finite number of times ( r w ( ) < , see (18)). Mortality renders the chain of infection and recovery events transient (due to the defective feature of b r = K I w Φ M ). To shed more light on the behavior of r w ( t ) consider for a moment zero mortality ( R ( ) = 1 ) and t : We then have A w ( ) = β w S w e J n e > 0 (shown in Section 3) thus r w ( ) = coming along with an infinite chain of recurrent infection and recovery events (as b r ( t ) turns into the proper non-defective PDF b r = K I w ).
Using (7) we can rewrite (2) in equivalent integral form
S w ( t ) = 1 J w ( 0 ) Φ M ( t ) Φ I w ( t ) + D ( t ) 0 t A w ( τ ) [ Φ M ( t τ ) Φ I w ( t τ ) + D ( t τ ) ] d τ J w ( t ) = J w ( 0 ) Φ M ( t ) Φ I w ( t ) + 0 t A w ( τ ) Φ M ( t τ ) Φ I w ( t τ ) d τ S n ( t ) = 1 J n ( t ) J n ( t ) = J n ( 0 ) Φ I n ( t ) + 0 t A n ( τ ) Φ I n ( t τ ) d τ
and with (redundant) Equation (12) for the fraction of dead walkers. (15) is a self-consistent system since the infection rates are implicit functions of susceptible and infected population fractions A w ( t ) = A w [ S w ( t ) , J n ( t ) ] , A n ( t ) = A w [ S n ( t ) , J w ( t ) ] (see (1)). Explore now the infinite time limit of (15) where it is convenient to consider the Laplace transformed equations. We introduce the Laplace transform (LT, denoted with a hat) of a function g ( t ) as
g ^ ( λ ) = 0 g ( t ) e λ t d t
where λ denotes the (suitably chosen) Laplace variable. In order to retrieve infinite time limits we use the asymptotic feature
g ( ) = lim λ 0 λ g ^ ( λ ) = lim λ 0 0 g ( τ λ ) e τ d τ g ( ) 0 e τ d τ .
Observing that the LT of Φ I w ( t ) Φ M ( t ) is λ 1 [ 1 K ^ I , M ( λ ) ] and D ^ ( λ ) = λ 1 b ^ d ( λ ) where b ^ d ( 0 ) = D ( ) (see (7)), we arrive at
J w ( ) = lim λ 0 λ J ^ w ( λ ) = [ 1 K ^ I , M ( 0 ) ] [ J w ( 0 ) + A ^ w ( 0 ) ] = 0 J n ( ) = lim λ 0 λ J ^ n ( λ ) = [ 1 K ^ n ( 0 ) ] [ J n ( 0 ) + A ^ n ( 0 ) ] = 0 d w ( ) = lim λ 0 λ d ^ w ( λ ) = D ( ) [ J w ( 0 ) + A ^ w ( 0 ) ] , A ^ w ( 0 ) = β w 0 S w ( τ ) J n ( τ ) d τ S w ( ) = 1 d w ( ) S n ( ) = 1
where A ^ w , n ( 0 ) = 0 A w , n ( t ) d t < . In the same way one obtains
r w ( ) = R ( ) ( J w ( 0 ) + A ^ w ( 0 ) ) .
Since D ( ) is non-zero, the asymptotic values S w ( ) , d w ( ) depend on the initial condition J w ( 0 ) and the infection (rate) history. This is not any more true for zero mortality ( D ( ) = 0 ) and considered in Section 3. We define the overall probability P D that a walker dies ( P R survives) the disease
P D = d w ( ) r w ( ) + d w ( ) = D ( ) , P R = 1 P D = r w ( ) r w ( ) + d w ( ) = R ( )
consistent with our previous interpretation of D ( ) , R ( ) , and the ratio
d w ( ) r w ( ) = D ( ) R ( ) .
The quantities (19) and (20) depend only on the stochastic features of t I w and t M . They are independent of the infection rates and initial conditions and therefore of the topological properties of the network. In addition, they also do not depend on the stochastic features of the node’s infection time span t I n .

Markovian (memoryless) case

Generally the system (9) contains the history of the process (memory) which makes the process non-Markovian. The only exception is when all waiting times are exponentially distributed, namely Φ I w ( t ) = e ξ I w t , Φ M ( t ) = e ξ M t , Φ I n ( t ) = e ξ I n t ( t I w , n = ξ I w , n ) 1 , t M = ( ξ M ) 1 ). Then (9) takes with (15) the memoryless form
d d t S w ( t ) = β w S w ( t ) J n ( t ) + ξ I w J w ( t ) d d t J w ( t ) = β w S w ( t ) J n ( t ) ( ξ I w + ξ M ) J w ( t ) d d t d w ( t ) = ξ M J w ( t ) d d t S n ( t ) = β n S n ( t ) J w ( t ) + ξ I n J n ( t ) d d t J n ( t ) = β n S n ( t ) J w ( t ) ξ I n J n ( t ) .
Putting the left-hand sides to zero yields the stationary state
J w ( ) = J n ( ) = A w ( ) = A n ( ) = 0 S w ( ) = 1 d w ( ) , d w ( ) = ξ M 0 J w ( τ ) d τ S n ( ) = 1 .
Let us check whether this result is consistent with (17). To this end, we integrate the second equation in (21) knowing that J w ( ) = 0 leading to
0 = J w ( 0 ) + 0 A w ( t ) d t ( ξ I w + ξ M ) 0 J w ( t ) d t
thus 0 J w ( t ) d t = 1 ξ M + ξ I w ( J w ( 0 ) + A ^ w ( 0 ) ) . Plugging this relation into (22) and accounting for D ( ) = ξ M ξ I w + ξ M recovers indeed the representation of expression (17).
For zero mortality ξ M = 0 one can straight-forwardly obtain the constant endemic equilibrium values J w e , J n e by setting the left-hand side of (21) to zero leading to subsequent Equation (32) derived in Section 3 for general waiting time distributions with finite means.

A few more words on waiting time distributions

In our simulations we assume that the time spans t I w , t I n , t M are independent random variables drawn from specific Gamma distributions. The advantage to use Gamma distributions is that they may realize a large variety of shapes, see Figure 1 for a few examples. To generate Gamma distributed random numbers we employ the PYTHON random number generator (library numpy.random). Recall the Gamma distribution
K α , ξ ( t ) = ξ α t α 1 Γ ( α ) e ξ t , ξ , α > 0
where α is the so called `shape parameter’ and ξ the rate parameter (often is used the term ’scale parameter’ θ = ξ 1 ) and Γ ( α ) stands for the Gamma function. We also will subsequently use the LT of the Gamma PDF
K ^ α , ξ ( λ ) = 0 K α , ξ ( t ) e λ t d t = ξ α ( λ + ξ ) α
The Gamma PDF has finite mean t α , ξ = 0 t K α , ξ ( t ) d t = α ξ and for α < 1 the Gamma-PDF is weakly singular at t = 0 and α = 1 recovers exponential PDFs. For α 1 the Gamma PDF is completely monotonic (CM) (see Appendix, (A9) for a definition). For the range α > 1 the Gamma-PDF has a maximum at t m a x = α 1 ξ and becomes narrower the larger ξ (while keeping its mean α / ξ fixed), especially we can generate sharp waiting times using the feature
lim ξ K α = ξ T 0 , ξ ( t ) = δ ( t T 0 ) .
We also will use subsequently the persistence probability of the Gamma distribution (see right frame of Figure 1)
Φ α , ξ ( t ) = t ξ α t α 1 Γ ( α ) e ξ t d t = Γ ( α , ξ t ) Γ ( α )
where Γ ( α , x ) indicates the upper incomplete Gamma function with Γ ( α , 0 ) = Γ ( α ) . (27) fulfills necessarily the initial condition Φ α , ξ ( 0 ) = 1 and is vanishing at infinity Φ α , ξ ( ) = 0 .

3. Endemic Equilibrium for Zero Mortality

Here we consider the large time asymptotics of the compartment populations without mortality ( S w ( t ) + J w ( t ) = 1 ) where the self-consistent system (15) reads
J w ( t ) = J w ( 0 ) Φ I w ( t ) + 0 t A w ( t τ ) Φ I w ( τ ) d τ J n ( t ) = J n ( 0 ) Φ I n ( t ) + 0 t A n ( t τ ) Φ I n ( τ ) d τ
The endemic state emerging in the large time asymptotics does not depend on the initial conditions J w , n ( 0 ) as Φ I w , n ( t ) 0 . For what follows it is convenient to consider the LTs of (28) which read
J ^ w ( λ ) = J w ( 0 ) + A ^ w ( λ ) 1 K ^ I w ( λ ) λ J ^ n ( λ ) = J n ( 0 ) + A ^ n ( λ ) 1 K ^ I n ( λ ) λ
where Φ I w , n ( λ ) = 1 K ^ I w , n ( λ ) λ are the LTs of the persistence distributions, and S ^ w , n ( λ ) + J ^ w , n ( λ ) = 1 λ reflecting constant populations of walkers and nodes. In order to determine the endemic equilibrium, we assume that the mean infection time spans for the nodes and walkers exist
t I w , n = lim λ 0 1 K ^ I w , n ( λ ) λ = d d λ K ^ I w , n ( λ ) | λ = 0 = 0 Φ I w , n ( t ) d t = 0 τ K I w , n ( τ ) d τ <
thus the admissible range of the Laplace variable is λ 0 (if chosen real). Now using (16) we obtain the endemic equilibrium from J w , n ( ) = lim λ 0 λ J ^ w , n ( λ ) where the initial conditions are wiped out at infinity as K ^ w , n ( λ ) | λ = 0 = 1 . Assuming that the infection rates are constant in the endemic equilibrium we have A w , n ( λ ) A w , n ( ) / λ , ( λ 0 ) and arrive at
J w ( ) = A w ( ) t I w , ( A w ( ) = β w S w ( ) J n ( ) ) J n ( ) = A n ( ) t I n , ( A n ( ) = β n S n ( ) J w ( ) )
thus
J w ( ) 1 J w ( ) β w t I w J n ( ) = 0 J n ( ) 1 J n ( ) β n t I n J w ( ) = 0 .
One can see that the globally healthy state J w , n ( 0 ) = 0 is also a solution of this equation. Beside that, only solutions J n ( ) , J w ( ) ( 0 , 1 ) correspond to an endemic equilibrium. One gets
J w ( ) = J w e = β w β n t I w t I n 1 β n t I n [ 1 + β w t I w ] = R 0 1 R 0 β w t I w 1 + β w t I w J n ( ) = J n e = β w β n t I w t I n 1 β w t I w [ 1 + β n t I n ] = R 0 1 R 0 β n t I n 1 + β n t I n
for the endemic equilibrium which is independent of the initial conditions J w , n ( 0 ) . It depends only on the phenomenological rate constants β w , n and the mean infection time spans t I w , n . We point out that the endemic equilibrium (33) has exchange symmetry w n between walkers and nodes reflecting this feature in the system (2) of evolution equations without mortality. The endemic values J w , n e are within ( 0 , 1 ) , i.e., existing only if R 0 = β w β n t I w t I n > 1 . We interpret R 0 as the basic reproduction number (average number of new infections at t = 0 – nodes or walkers – due to one infected node or walker at t = 0 ). That this is really the appropriate interpretation can be seen by the following somewhat rough consideration of the infection rates at t = 0 . Assume we have initially one single infected node J n ( 0 ) = 1 / N and no infected walkers S w ( 0 ) = 1 . The expected number of walkers infected by this first infected node during its infectious period t I n is
Z I ( t I n ) Z A w ( 0 ) t I n = Z t I n β w / N Z J w ( t I w ) .
The number of nodes getting infected by these Z I ( t I n ) infected walkers during their infectious time t I w is
N I ( t I n + t I w ) N A n ( t I n ) t I w N β n J w ( t I w ) = β n β w t I n t I w = R 0 .
Hence R 0 is the average number of infected nodes caused by the first infected node (with zero initially infected walkers). Due to the exchange symmetry (nodes ↔ walkers) of the infection rates, this argumentation remains true when we start with one infected walker and no infected nodes.
We infer that the globally healthy state is unstable for R 0 > 1 where the endemic equilibrium (33) is a unique stable fixed point and attractor for all initial conditions J w , n ( 0 ) . We will confirm this in the next section by a linear stability analysis of the globally healthy state. The stability of the endemic state is demonstrated in the next section with Appendix A.2.
Remarkable is the limit β w t I w (while β n t I n are kept constant) where all walkers become infected J w e 1 but not all nodes J n e β n t I n 1 + β n t I n < 1 and vice versa. We plot the endemic state in Figure 2 versus R 0 where positive values for J w , n ( ) occur only for R 0 > 1 which correspond to endemic states. Next we perform a linear stability analysis of the endemic and healthy state where we will indeed identify R 0 as crucial control parameter.

4. Stability Analysis of Endemic and Healthy State without Mortality

Here we are interested in the condition of spreading for zero mortality, or equivalently in the condition for which the globally healthy state (endemic state) is unstable (stable). To check stability of the endemic fixed point S e w = 1 J e w , J e w , S e n = 1 J e n , J e n we set
S w ( t ) = S w e + u w e μ t , J w ( t ) = J w e u w e μ t S n ( t ) = S n e + u n e μ t , J n ( t ) = J n e u n e μ t
where u w , u n are `small’ constant amplitudes. This ansatz accounts for the constant populations of nodes and walkers. Then we have for the infection rates up to linear orders in the amplitudes
A w ( t ) = β w S w ( t ) J n ( t ) = β w S w e J n e + β w ( u w J n e u n S w e ) e μ t A n ( t ) = β n S n ( t ) J w ( t ) = β n S n e J w e + β n ( u n J w e u w S n e ) e μ t
Plugging these relations in our evolution equations (2) without mortality, omitting two redundant equations leads to the system
μ + β w J n e [ 1 K ^ I w ( μ ) ] ; β w S w e [ 1 K ^ I w ( μ ) ] β n S n e [ 1 K ^ I n ( μ ) ] ; μ + β n J w e [ 1 K ^ I n ( μ ) ] · u w u n = 0 0
where we have used e μ t I w , n = K ^ I w , n ( μ ) and the cases of δ -distributed t I w , n are contained for K ^ I w , n ( μ ) = e μ t I w , n . We point out that in ansatz (35) we relax causality i.e., we admit A w , n ( t τ ) 0 for t τ < 0 thus
e μ ( t t I w , n ) = e μ t e μ t I w , n = e μ t K ^ I w , n ( μ ) .
The solvability of this matrix equation requires the determinant to vanish leading to a transcendental characteristic equation for μ
μ 2 + μ β w J n e [ 1 K ^ I w ( μ ) ] + β n J w e [ 1 K ^ I n ( μ ) ] + β w β n [ 1 K ^ I w ( μ ) ] [ 1 K ^ I n ( μ ) ] ( J n e J w e S n e S w e ) = 0 .
Generally, a fixed point is unstable if solutions with positive real part of μ exist. Consider this first for the globally healthy state J n = 0 , J w = 0 for which Equation (38) reads
G ( μ ) = 1 β w β n [ 1 K ^ I w ( μ ) ] μ [ 1 K ^ I n ( μ ) ] μ = 1 β w β n Φ ^ I w ( μ ) Φ ^ I n ( μ ) = 0
where we notice that [ 1 K ^ I w , n ( μ ) ] μ = Φ ^ I w , n ( μ ) are the LTs of the persistence probabilities of the infection time spans. Consider this equation for μ 0 and take into account (30) we arrive at
G ( 0 ) = 1 β w β n t I w t I n .
We observe that G ( 0 ) < 0 for R 0 = β n β w t I w t I n > 1 . On the other hand, we have for μ that Φ ^ I w , n ( μ ) 0 and hence
G ( ) = 1 .
One can hence infer from complete monotony of Φ ^ I w , n ( μ ) and therefore of Φ ^ I w ( μ ) Φ ^ I n ( μ ) (see Appendix A.2, Equation (A9) for a precise definition), that d d μ G ( μ ) > 0 ( μ 0 ) thus G ( μ ) = 0 has one single positive zero only if G ( 0 ) < 0 , i.e., for R 0 > 1 which therefore is the condition of instability of the healthy state (spreading of the disease). Conversely, for R 0 < 1 the healthy state turns into a stable fixed point where there is no spreading of the disease. In particular, the healthy state is always unstable ( R 0 = ) if at least one of mean infection time spans t I w , n = . This is true for fat-tailed kernels scaling as K I w , n ( t ) t α 1 ( α ( 0 , 1 ) ) for t . We consider such a distribution briefly in subsequent section. We plot function G ( μ ) versus μ for different R 0 for Gamma-distributed t I w , n in Figure 3.
Now we consider the stability of the endemic state with G e ( μ ) = 0 where from (38) this function reads
G e ( μ ) = 1 β w β n Φ ^ I w ( μ ) Φ ^ I n ( μ ) + β w J n e Φ ^ I w ( μ ) + β n J w e Φ ^ I n ( μ ) + β w β n ( J w e + J n e ) Φ ^ I w ( μ ) Φ ^ I n ( μ )
with
G e ( 0 ) = 1 R 0 + β w t I w J n e + β n t I n J w e + ( J w e + J n e ) R 0 = R 0 1 .
On the other hand, G e ( ) = 1 (as Φ ^ I w , n ( ) = 0 ) and from monotony of G e ( μ ) follows that there is no positive solution of G e ( μ ) = 0 for R 0 > 1 . We plot G e ( μ ) in Figure 4 for different values of R 0 and Gamma distributed t I w , n . In Appendix A.2 we complete the analytical proof that G e ( μ ) > 0 for R 0 > 1 .

5. Stability Analysis of the Healthy State with Mortality

An important question is, how mortality does modify the instability of the healthy state and the basic reproduction number. To shed light on this question we perform a linear stability analysis of the healthy state S w , n = 1 where we set
S w ( t ) = 1 + a e μ t , J w ( t ) = b e μ t , d w ( t ) = ( a + b ) e μ t , S n ( t ) = 1 c e μ t , J n ( t ) = c e μ t
with A w ( t ) = β w c e μ t and A n ( t ) = β n b e μ t . Plugging this ansatz for μ 0 into three independent equation of (2), say the first, third and fourth one, and performing the averages (relaxing causality as previously) we arrive at
μ ; 0 ; β w [ 1 b ^ r ( μ ) ] ] μ ; μ ; β w b ^ d ( μ ) 0 β n [ 1 K ¯ I n ( μ ) ] ; μ · a b c = 0 0 0 .
Putting the determinant of the matrix to zero yields the condition
μ 2 β n β w [ 1 K ¯ I n ( μ ) ] [ 1 b ^ r ( μ ) b ^ d ( μ ) ] = 0
where the LTs b ^ r ( μ ) , b ^ d ( μ ) of the DPDFs b r , d ( t ) defined in (7) come into play. We are interested under which conditions there is a positive solution (instability of healthy state) of (46). Since b ^ r ( 0 ) = R ( ) and b ^ d ( 0 ) = D ( ) with R ( ) + D ( ) = 1 we see that μ = 0 is solution of (46). Recall from (7) that b d ( t ) + b r ( t ) = K I , M w ( t ) is the (properly normalized) PDF (8). Condition (46) then reads
G M ( μ ) = 1 β n β w [ 1 K ¯ I n ( μ ) ] μ [ 1 K ^ I , M w ( μ ) ] μ = 0
where [ 1 K ^ I , M w ( μ ) ] μ is the LT of the persistence probability Φ M ( t ) Φ I w ( t ) of the walker’s infection, i.e., the probability that t < m i n ( t I w , t M ) (see Remark I). For zero mortality we have K I , M w = K I w , ( b r = K I w and b d = 0 ) retrieving condition (39). The mean sojourn time in compartment I with mortality yields
m i n ( t I w , t M ) = t I M w = [ 1 K ^ I , M w ( μ ) ] μ | μ = 0 = 0 t K I , M w ( t ) d t = 0 Φ M ( t ) Φ I w ( t ) d t 0 Φ I w ( t ) d t = t I w
where we arrive at
G M ( 0 ) = 1 β n β w t I n t I M w .
Relation (48) shows that t I M w t I w (equality only for zero mortality). On the other hand we have G M ( ) = 1 , so there is a positive solution of G M ( μ ) = 0 only if
R M = β n β w t I n t I M w > 1
where R M is the basic reproduction number modified by mortality with R M R 0 (equality only for zero mortality). To visualize the effect of mortality on the instability of the healthy state we plot G M ( μ ) for a few values of R M in Figure 5. Increasing mortality turns an unstable healthy state into a stable one.
In the random walk simulations we deal with Gamma distributed t I w , n , t M where the persistence probabilities are then normalized incomplete Gamma functions (27). To explore the effect of mortality for such cases, we determine R M by numerical integration of (48) as a function of the mortality rate parameter ξ M and plot the result in Figure 6 where one can see that R M is monotonous decreasing with mortality rate ξ M . We also include a case of a fat-tailed (Mittag-Leffler) distributed t I w which we discuss hereafter. The parameters in Figure 6 are such that the zero mortality case occurs with R 0 = 1 as the upper bound. The essential feature is that R M decays monotonically with increasing mortality rate parameter ξ M approaching zero for ξ M . Diseases with high mortality stabilize the healthy state even for t I w .
Consider briefly the case where t M is exponentially distributed (i.e., α M = 1 in the Gamma distribution of t M ) with Φ M ( t ) = e ξ M t . Then we have t I M w = Φ ^ I w ( ξ M ) thus
R M = β w β n t I n Φ ^ I w ( ξ M ) .
The zero mortality case is recovered for ξ M = 0 with Φ ^ I w ( 0 ) = t I w . For Gamma distributed t I w , n this yields
R M = β w β n α I n ξ I n ξ M 1 ( ξ I w ) α I w ( ξ M + ξ I w ) α I w .
where α I w , n , ξ I w , n are the parameters of the respective Gamma distributions of the infection times of nodes and walkers. The Markovian case where all waiting times are exponentially distributed is covered for α I w , n = 1 and yields
R M = β w β n ξ I n ( ξ I w + ξ M )
containing the zero mortality case for ξ M = 0 .
Fat-tailed distributed t I w :
Finally, an interesting case emerges if t I w follows a fat-tailed distribution, i.e., Φ I w ( t ) t α for t large ( α ( 0 , 1 ) ) and t I w = , R 0 = . Let us have a look, how mortality is affecting this situation. Fat tailed t I w distributions describe diseases where the infectious periods are very long and the healthy state without mortality is extremely unstable ( R 0 = ). Infected walkers can infect many nodes during their long infection time spans. An important case of this class is constituted by the Mittag-Leffler (ML) distribution Φ I w ( t ) = E α ( ξ I w t α ) where E α ( τ ) indicates the Mittag-Leffler function, see [14,15] and references therein for representations and connections with fractional calculus. The ML function recovers the exponential for α = 1 ( E 1 ( τ ) = e τ ). Assuming exponential mortality Φ M ( t ) = e ξ M t one obtains with (51)
R M = β w β n t I n ( ξ M ) α 1 ξ I w + ( ξ M ) α , α ( 0 , 1 )
containing the LT of the ML persistence probability distribution Φ ^ I w ( λ ) = λ α 1 / ( ξ I w + λ α ) . The essential feature here is that R M is weakly singular at ξ M = 0 with a monotonously decreasing ξ M α 1 scaling law, where the healthy state becomes stable for mortality parameters larger as ξ M 1 . We depict this case in Figure 6 for α = ξ = 0.3 (violet curve).

6. Random Walk Simulations

The remainder of our paper is devoted to test the mean field model under "real world conditions" which we mimic by Z = Z S ( t ) + Z I ( t ) + Z D ( t ) random walkers navigating independently on an undirected connected (ergodic) graph. In our simulations we focused on Barabási-Albert (BA), Erdös-Rényi (ER) and Watts-Strogatz (WS) graphs [29,42,43] (see Appendix A.3 for a brief recap) and implemented the compartments and transmission pathway for walkers and nodes outlined in Section 2. A susceptible walker gets infected with probability p w by visiting an infected node, and a susceptible node gets infected with probability p n at a visit of an infectious walker. We assume that the infection probabilities p n , w are constant for all nodes and walkers, respectively. They are related yet not identical with the macroscopic rate constants β w , n . A critical issue is whether the simple bi-linear forms for the mean field infection rates (1) still capture well the complexity of the spreading in such "real world" networks. One goal of the subsequent case study is to explore this question.
We characterize the network topology by i = 1 , N nodes with the N × N adjacency matrix ( A i j ) where A i j = 1 if the pair of nodes i , j is connected by an edge, and A i j = 0 if the pair is disconnected. Further, we assume A i i = 0 to avoid self-connections of nodes. We confine us to undirected networks where the edges have no direction and the adjacency matrix is symmetric. The degree k i of a node i counts the number of neighbor nodes (edges) of this node. Each walker z = 1 , . . , Z performs simultaneous independent random steps at discrete time instants t = Δ t , 2 Δ t , from one to another connected node. The steps from a node i to one of the neighbor nodes are chosen with probability 1 / k i , following for all walkers the same transition matrix
Π ( i j ) = A i j k i , z = 1 , , Z , i , j = 1 , , N
which is normalized j = 1 N Π ( i j ) = 1 . This is a common way to connect the network topology with simple Markovian random walks [24,42]. In the simulations the departure nodes at t = 0 of the walkers are randomly chosen. The path of each walker is independent and not affected by contacts with other walkers or by transition events from one to another compartment.

Case study and discussion

In order to compare the epidemic dynamics of the mean field model and random walk simulations we integrate the stochastic evolution Eqs. (2) numerically as follows. We average the increments of the compartmental fractions in a generalized Monte-Carlo sense converging towards the convolutions of the right hand side of (9) where we use the Monte-Carlo convergence feature
lim n 1 n k = 1 n A ( t T k ) = 0 t A ( t τ ) K ( τ ) d τ
for random variables T drawn from PDFs K ( τ ) . We perform this average for any time increment d t with respect to all involved independent random time spans t I w , n , t M (see Appendix A.1) and integrate the averaged compartmental increments in a fourth order Runge-Kutta scheme (RK4). We use in the random walk simulations and the Monte-Carlo (mean field) integration exactly the same (Gamma distributed) random values (PYTHON seeds) for the t I w , n , t M . The values of the infection rate parameters β w , n used in the mean field integration are determined from Equation (32) by plugging in the large time asymptotic values of the random walk simulation with identical parameters (without mortality). The compartmental fractions in the random walk simulations are determined by simply counting the compartmental populations at each time increment Δ t of walker’s steps. The so determined rate parameters β w , n plugged into the mean field integration depend in a complex manner on the infection probabilities p w , n and topology of the network. In this way this information is also contained in the basic reproduction numbers with and without mortality.
We explore the spreading in random graphs of different complexity such as represented in Figure 7. The BA graph is small world with power law distributed degree (Appendix A.3) which means that there are many nodes having a few connections, and a few (hub) nodes with a huge number of connections. The average distance between nodes becomes small, as it is sufficient that almost every node is only a few links away from a hub node. The ER graph is small world due to a broad degree distribution. The WS graph with the choice of connectivity parameter m = 2 in Figure 7 has long average distances and is large world. Intuitively, one infers that a small world structure is favorable for spreading processes, a feature which was already demonstrated in the literature [9,10]. In our simulations spreading in network architectures with increased connectivity comes along with increased values of R 0 and R M , respectively.
We identify the starting time instant ( t = 0 ) of the evolution in the mean field model with the time instant of the first infection of a walker in the random walk simulations. In all cases we start with a small number of randomly chosen initially infected nodes N I ( 0 ) = 10 N ( N I ( 0 ) 10 ) and no infected or dead walkers. To reduce the numbers of parameters and to concentrate on topological effects we have put in all simulations the transmission probabilities p w = p n = 1 . We refer to [46] for the PYTHON codes2 and animated simulation videos related to the present study. In order to visualize a typical spreading process, we depict in Figure 8 a few snapshots in a Watt-Strogatz graph with rather high overall mortality probability of D ( ) 16 % . In this case a single infection wave emerges where a large part of walkers gets repeatedly infected increasing their probability to die. This leads to a very high fraction of eventually dead walkers d w ( ) 99 % and small fraction S w ( ) 1 % of surviving walkers corresponding to the stationary state (17) which is taken as soon as the disease gets extinct J w = J n = 0 . Figure 8 shows that first the infection gains large parts of the network consistent to the large value of R M observed in this case. After the first wave the disease gets extinct by the high mortality of the walkers. A disease with a similar high mortality characteristics is for instance Pestilence. The process of Figure 8 is visualized in an animated video. Figure 9 and Figure 10 show the evolution in WS graphs with identical parameters and Gamma distributions of t I w , n , t M as in Figure 8 but with different mortality rate parameter ξ M and a much smaller overall mortality D ( ) 1 % . The different network connectivity leads to different values of β w , n and mean field solutions in Figure 9 and Figure 10. In addition, the networks of Figure 9 and Figure 10 have different connectivity features. The graph of Figure 9 is small world (highly connected) whereas the WS graph in Figure 10 is weakly connected and large world. One observes in Figure 9 that the infection numbers exhibit strong and immediate increases followed by attenuated oscillations around the endemic equilibrium (for zero mortality) with high values J w e 0.9 and J n e 0.95 . The basic reproduction numbers with mortality are in both graphs only slightly smaller as R 0 . This is due to a rather small overall mortality of D ( ) 0.01 . This effect can also be seen in the small overlap of the Gamma distributions of t I w and t M in the histogram. Recall that a small value of D ( ) does not necessarily mean small d w ( ) as this quantity depends also on the infection rates and network topology (see (17)) and is sensitive to repeated infections. repeated infections may indeed play an important role here as t I w = 8 is rather small.
In Figure 10 the infections of the random walk simulations are increasing slower (red curves) compared to Figure 9. The structure with higher connectivity Figure 9 shows excellent quantitative agreement of random walk and mean field solutions for the walkers and nodes capturing well the attenuated oscillations, especially for zero mortality. In the network with smaller connectivity of Figure 10 the increase of the infections is delayed compared to the mean field. On the other hand, for non-zero mortality the mean field and random walk dynamics for the walkers diverge slightly with time. We infer that mortality may deviate the infection rates from (1).
The comparison of the spreading in Figure 9 and Figure 10 shows clearly the role of the connectivity: The mean field model captures better the spreading in networks with higher connectivity (short average distances between nodes) and with low mortality. The following cases give further evidence for these observations.
Next we explore the spreading on an ER graph in Figure 11. The agreement of random walk simulations and mean field model is impressive where this holds for both with and without mortality. One can see by the degree distribution in Figure 7 that for these connectivity parameters the graph is well connected and small world giving strong evidence that the mean field approach is here well capturing the spreading dynamics.
Finally we explore in Figure 12 the dynamics on a BA network. In the right frame we have high overall mortality of D ( ) 10 % probability for a walker to die from an infection. In this example the disease is starting to spread as R M 3.48 > 1 where only a single infection wave emerges which is extinct by the high mortality. Recall that that R M > 1 is only telling us that the healthy state is unstable, i.e., that the disease is starting to spread. It does not contain the information whether the spreading is persistent or whether the disease is eventually extinct. To explore the role of topological features such as average distances between nodes we perform the same simulation experiment with identical parameters and less ( N = 2100 ) nodes, i.e., higher density of walkers (Figure 13).
The accordance of mean field model and random walk simulation is also in Figure 13 indeed excellent. We explain this by the fact that the BA network is a strongly connected structure with pronounced small world property. The higher density of walkers lead to increased R M and R 0 compared to Figure 12. There is also only a single infection wave occurring with a higher maximum value compared to Figure 12. In both cases (Figure 12 and Figure 13, right frames) the infection waves are extinct by the high mortality of walkers where stationary states (17) with d w ( ) 80 % of dead walkers are taken. When we switch off mortality (left frames), stable endemic states emerge more rapidly in Figure 13 (case with higher density of walkers).
Further simulation experiments (not shown here) reveal that the mean field model and random walk simulations exhibit excellent accordance when we further increase the attachment parameters m or the density of walkers with otherwise identical parameters. For higher mortality the agreement becomes less well and diverges with increasing observation time. This observation suggests that mortality modifies the infection rates in the network for larger observation times. We leave this issue for future research.
Our overall finding from this case study is that the mean field approach (with infection rates (1)) is particularly well suited to mimic spreading in strongly connected environments with pronounced small world feature, but is less well for higher mortality.

7. Conclusions

We studied epidemic spreading in complex graphs where we focused on transmission pathway via vectors mimicking the spreading of a certain class of diseases such as Dengue, Malaria or Pestilence and others. We developed a stochastic compartment model for the walkers and nodes with mortality for the walkers. For zero mortality we obtained the endemic equilibrium in explicit form (Equations (33)). Stability analysis of the endemic and healthy states reveal the crucial control parameter for spreading, the basic reproduction number. We obtained the basic reproduction numbers R M and R 0 with and without mortality, respectively, where we proved that R M R 0 , (relations (50) with (48)). For R M , R 0 > 1 the healthy state is an unstable fixed point where the endemic equilibrium exists for zero mortality as a unique stable fixed point independent of the initial conditions. The basic reproduction numbers depend on the means of the compartmental sojourn times in compartment I of the nodes and walkers and on the topology of the network captured by the mean field rate constants β w , n .
Our model has applications beyond epidemic dynamics, for instance in chemical reaction models [45]. An interesting question to explore in a follow-up project is whether our class of compartment models with indirect transmission pathways may exhibit (for zero mortality) persistent oscillations (Hopf instabilities) (See our brief discussion at the end of Appendix A.2.). An open problem also remains how large world network topology may be included into such a mean field model, modifying the infection rates. Further promising directions include an account for immune and incubation compartments, effects of mitigation measures, vaccination among many others.

Acknowledgments

T.G. gratefully acknowledges to have been hosted at the Institut Jean le Rond d’Alembert in the framework of an internship (stage M1 Physique n o 28281 ) for the development of the PYTHON simulation codes and participation in the present study.

Appendix A

Appendix A.1. Some Basic Notions

Here we recall briefly some basic notions used in the paper. The infection rates are a causal functions
A ( t ) = A ( t ) Θ ( t )
where Θ ( t ) indicates the Heaviside step function defined by
Θ ( ζ ) = 1 , ζ 0 0 , ζ < 0
with Θ ( ζ ) + Θ ( ζ ) = 1 and in or definition Θ ( 0 ) = 1 . Its derivative yields the Dirac δ -distribution d d ζ Θ ( ζ ) = δ ( ζ ) . We use throughout the paper mutually independent strictly positive random variables T 1 , , T n R + The random variables T j are assumed to follow their specific PDFs
P r o b [ T j [ u , u + d u ] ] = δ ( u T j ) = K j ( u ) d u
where the PDFs K j are causal functions as a consequence of the positiveness of the T j . Then applies the averaging rule
f ( t ; T 1 , T 2 , , T n ) = 0 0 d t 1 d t n f ( t ; t 1 , t 2 , , t n ) K 1 ( t 1 ) K n ( t n )
for suitable functions f. For f ( t ; T 1 , T 2 , , T n ) = g 1 ( T 1 ) g n ( T n ) using independence of the T j this yields
g 1 ( T 1 ) g n ( T n ) = g 1 ( T 1 ) , g n ( T n ) .
Important cases emerge by applying (A4) to exponentials
e λ ( T 1 + + T n ) = 0 e λ t δ ( t T 1 T n ) d t = K ^ 1 ( λ ) K ^ n ( λ ) , { λ } 0
In this relation the LTs of the PDFs come into play
K ^ j ( λ ) = 0 e λ t K j ( t ) d t
where K ^ j ( λ ) | λ = 0 = 1 reflects the normalization of PDFs (A3). A further observation is
δ ( t T 1 T n ) = ( K 1 K n ) ( t )
where ★ stands for convolution ( K 1 K 2 ) ( t ) = 0 t K 1 ( τ ) K 2 ( t τ ) d τ of the causal PDFs.

Appendix A.2. Proof of Stability of the Endemic Equilibrium

Here we develop the rest of the proof stability of the endemic equilibrium, i.e., we show that the function (42) is strictly positive for μ > 0 with R 0 1 > 0 . First, we observe that Φ ^ I w , n ( μ ) t I w , n with Φ ^ I w , n ( 0 ) = t I w , n and Φ ^ I w , n ( ) = 0 . For our convenience, we introduce the functions
λ w , n ( μ ) = Φ ^ I w , n ( μ ) t I w , n ( 0 , 1 ]
which the LTs of the normalized Φ I w , n ( t ) / t I w , n and which are by virtue of Bernstein’s theorem [44] completely monotonic (CM) with respect to μ , i.e.,
( 1 ) n d n d μ n λ w , n ( μ ) 0 , μ ( 0 , )
inheriting this feature from the exponential e μ τ ( t > 0 ). Therefore,
d d μ λ w , n ( μ ) = 1 t I w , n 0 e μ t t Φ I w , n ( t ) d t < 0
(as Φ I n , w ( t ) ( 0 , 1 ] ) exists thus λ w , n ( μ ) is monotonously decreasing with μ with λ w , n ( 0 ) = 1 λ w , n ( μ ) > 0 . Further we observe in Eqs. (33) that J n e β w t I w = R 0 1 1 + β n t I n , J w e β n t I n = R 0 1 1 + β w t I w thus
R 0 ( J n e + J w e ) = ( R 0 1 ) β n t I n 1 + β n t I n + β w t I w 1 + β w t I w
Then G e ( μ ) reads
G e ( μ ) = 1 + λ w ( μ ) λ n ( μ ) R 0 + ( R 0 1 ) β n t I n 1 + β n t I n + β w t I w 1 + β w t I w + ( R 0 1 ) λ w ( μ ) 1 + β n t I n + λ n ( μ ) 1 + β w t I w
Now we observe that λ w ( μ ) λ n ( μ ) λ w , n ( μ ) thus a lower bound function H ( μ ) G e ( μ ) is generated by replacing λ w , n ( μ ) λ w ( μ ) λ n ( μ ) in the second line. Now it is sufficient to prove that 0 < H ( μ ) . We hence get for this lower bound function
H ( μ ) = 1 + λ w ( μ ) λ n ( μ ) R 0 + ( R 0 1 ) β n t I n 1 + β n t I n + β w t I w 1 + β w t I w + ( R 0 1 ) 1 1 + β n t I n + 1 1 + β w t I w = 1 + λ w ( μ ) λ n ( μ ) ( R 0 2 ) = 1 λ w ( μ ) λ n ( μ ) + ( R 0 1 ) λ w ( μ ) λ n ( μ )
and with 1 λ w ( μ ) λ n ( μ ) 0 and ( R 0 1 ) λ w ( μ ) λ n ( μ ) > 0 it follows that 0 < H ( μ ) < G e ( μ ) concluding the proof of stability of the endemic equilibrium.

A few remarks on the possibility of oscillatory (Hopf) instabilities of the endemic equilibrium

Let us briefly explore whether an oscillatory (Hopf) instability of the endemic equilibrium is possible. To that end we write G e ( μ ) as
G e ( μ ) = 1 + σ g ^ ( μ ) 1 g ^ ( μ )
where σ = ± 1 and g ^ ( μ ) is a non-negative CM function (see Figure 4) with maximum value g ^ ( 0 ) = | R 0 2 | . Then the following two cases may occur.
  • Case (i) σ = 1 ; 0 < G e ( 0 ) = R 0 1 < 1 ( 1 < R 0 < 2 ):
Then g ^ ( μ ) can be represented as LT of a non-negative function g ( t ) and consider now μ = μ 1 + i μ 2 with μ 1 0 thus the real part of g ^ ( μ 1 + i μ 2 ) can be written as
g ( μ 1 + i μ 2 ) = 0 g ( t ) e μ 1 t cos ( μ 2 t ) d t , μ 1 0
with g ^ ( 0 ) = 2 R 0 and clearly g ^ ( μ 1 ) g ( μ 1 + i μ 2 ) g ^ ( μ 1 ) . Therefore,
G e ( μ 1 + i μ 2 ) = 1 g ( μ 1 + i μ 2 ) 1 g ^ ( μ 1 ) 1 g ^ ( 0 ) = R 0 1 > 0 .
Hence in the range of case (i) 1 < R 0 < 2 there is no oscillatory (Hopf) instability of the endemic state possible3.
  • Case (ii) σ = + 1 ; R 0 1 > 1 :
Here we have two pertinent ranges of R 0 . The first is the range (a) g ^ ( 0 ) = R 0 2 < 1 (i.e., R 0 < 3 ) and the second one (b) is g ^ ( 0 ) = R 0 2 > 1 . Clearly in the range (a) (A14) remains true and G e ( μ 1 + i μ 2 ) strictly positive. Hence for 1 < R 0 < 3 no Hopf instability is possible.
This changes in the range (b) since g ^ ( 0 ) = R 0 2 > 1 thus G e ( μ 1 + i μ 2 ) = 1 + g ( μ 1 + i μ 2 ) may become negative. Therefore, for R 0 > 3 a Hopf instability of the endemic state becomes possible. However, the possibility that G e ( μ 1 + i μ 2 ) = 0 is only necessary but not sufficient for a Hopf instability. One also needs simultaneously that the imaginary part G e ( μ 1 + i μ 2 ) = 0 is vanishing for the same μ = μ 1 + i μ 2 . In the simulations performed for this paper, we did not observe persistent oscillations. We leave the exploration of this issue for future research in a follow-up project.

Appendix A.3. A Very Brief Recap of Random Graphs

Here we recall briefly some essential features of the three classes of random graphs, which we use in the random walk simulations. For an extended outline, consult e.g., [18]. The three classes of random graph models depicted herafter are motivated by the observation that complex random network structures are encountered ubiquitously and crucially determine human and animal mobility patterns including epidemic propagation.
(i)
Erdös and Rényi (ER) graph
The ER graph is one of the most basic variants of a random graph, which was introduced in 1959 by Erdös and Rényi [20]. We use is the so-called G ( N , p ) variant of random ER graph model (which is actually due to Gilbert [22]) which is generated as follows [16,25]. Given are N labeled nodes. Any pair of nodes is connected independently by an edge with uniform probability p. The probability P N ( k ) that a node has 0 k N 1 connections is given by a binomial distribution
P N ( k ) = N 1 k p k ( 1 p ) N 1 k k k k ! e k
where k = ( N 1 ) p N p denotes the average degree. For N (while N p is kept constant) the degree distribution P N ( k ) converges to a Poisson distribution representing the infinite graph limit of the ER G ( N , p ) -model. Therefore, P N ( k ) is rapidly decaying with degree k, so the number of nodes with a high number of connections is very small. In order to obtain in the G ( N , p ) -model a connected graph, it is necessary that p > p c = l o g N N is above the percolation limit [20,24].
(ii)
Watts-Strogatz (WS) network
The WS graph model [21,25,26] starts with a ring of N nodes where each node is connected symmetrically with a number m < < N to left and right neighbor nodes by an edge such that each node has 2 m connections. In the second step, each of the connections i , j of node i is replaced with probability p by a randomly chosen connection i , k uniformly among other nodes avoiding self-connections and link duplication, so that each connection i , k is chosen only once. There are two noteworthy limits for a WS graph. For p = 0 (no rewiring of links) we have a regular ring with constant degree 2 m for all nodes. In the limit p = 1 an ER graph is emerging with probability 2 m / ( N 1 ) for a link. The WS graph has the small-world property (short average distances between pairs of nodes) and a high tendency to develop clusters of nodes [26].
(iii)
Barabási-Albert (BA) graph
The BA graph is generated by a preferential attachment mechanism for newly added nodes [16,17,18,19]. One starts with m 0 nodes and adds new nodes. Any newly added node is connected with m m 0 existing nodes (m is referred to as the attachment parameter) where most likely with nodes of high degrees. In this way nodes with high degree receive further links. This leads to an asymptotically scale-free network with a power law degree-distribution
P ( k ) k 2 μ , μ 1 .
As the decrease in this power law is relatively slow, there might exist quite a few nodes with many links (hub nodes) and many nodes with few links. BA graphs are believed to mimic a large class of real-world networks including the world wide web, citation-, social-, and metabolic networks.
Realizations of these three types of random graph types used in our multiple random walkers simulations are shown in Figure 7.

References

  1. Rhodes, P.; Bryant, J.H. Public Health. Encycl. Br. 2024. Available online: https://www.britannica.com/topic/public-health.
  2. Kermack, W.O.; McKendrick, A.G. A contribution to the mathematical theory of epidemics. Proc. Roy. Soc. A 1927, 115, 700–721. [Google Scholar]
  3. Liu, W.M.; Levin, H.W.H.H.W.S.A. Dynamical behavior of epidemiological models with non-linear incidence rate. J. Math. Biol. 1987, 25, 359–380. [Google Scholar] [CrossRef]
  4. Li, M.Y.; Graef, J.R.; Wang, L.; Karsai, J. Global dynamics of a SEIR model with varying total population size. Math. Biosci. 1999, 160, 191–213. [Google Scholar] [CrossRef]
  5. Anderson, R.M.; May, R.M. Infectious Diseases in Humans; Oxford University Press: Oxford, 1992. [Google Scholar]
  6. Martcheva, M. An Introduction to Mathematical Epidemiology; Springer, 2015. [Google Scholar]
  7. Harris, J.E. Population-Based Model of the Fraction of Incidental COVID-19 Hospitalizations during the Omicron BA.1 Wave in the United States. COVID 2023, 3, 728–743. [Google Scholar] [CrossRef]
  8. Whitehead, S.S.; Blaney, J.E.; Durbin, A.P.; Murphy, B.R. Prospects for a dengue virus vaccine. Nat Rev Microbiol 2017, 5, 518–528. [Google Scholar] [CrossRef] [PubMed]
  9. Pastor-Satorras, R.; Castellano, C.; Mieghem, P.V.; Vespignani, A. Epidemic processes in complex networks. Rev. Mod. Phys. 2015, 87, 925–979. [Google Scholar] [CrossRef]
  10. Pastor-Satorras, R.; Vespignani, A. Epidemic dynamics and endemic states in complex networks. Phys. Rev. E 2001, 63, 066117. [Google Scholar] [CrossRef]
  11. Shudo, Y.O.Y.A. Microscopic Numerical Simulations of Epidemic Models on Networks. Mathematics 2021, 9, 932. [Google Scholar]
  12. Basnarkov, L.; Tomovski, I.; Sandev, T.; Kocarev, L. on-Markovian SIR epidemic spreading model of COVID-19. Chaos, Solitons and Fractals 2022, 160, 112286. [Google Scholar] [CrossRef]
  13. d’Onofrio, G.; Michelitsch, T.M.; Polito, F.; Riascos, A.P. On discrete-time arrival processes and related random motions. arXiv 2024, arXiv:2403.06821. [Google Scholar]
  14. Metzler, R.; Klafter, J. The random walk’s guide to anomalous diffusion : A fractional dynamics approach. Phys. Rep. 2000, 339, 1–77. [Google Scholar] [CrossRef]
  15. Mainardi, F.; Gorenflo, R.; Scalas, E. A fractional generalization of the Poisson processes. Vietnam J. Math. 2004, 32, 53–64. [Google Scholar]
  16. Barabási, A.-L. Network Science; Cambridge University Press: Cambridge, 2016. [Google Scholar]
  17. Barabási, A.-L.; Albert, R. Emergence of Scaling in Random Networks. Science 1999, 286, 509. [Google Scholar] [CrossRef] [PubMed]
  18. Barabási; Albert, R. ; Jeong, H. Mean-field theory for scale-free random networks. Physica A 1999, 272, 173–187. [Google Scholar] [CrossRef]
  19. Jeong, H.; Tombor, B.; Albert, R.; Oltvai, Z.N.; Barabási, A.L. The large-scale organization of metabolic networks. Nature 2000, 407, 651–4. [Google Scholar] [CrossRef]
  20. Erdös, P.; Rényi, A. On Random Graphs I. Publ. Math. 1959, 6, 290–297. [Google Scholar] [CrossRef]
  21. Erdös, P.; Rényi, P. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 1960, 5, 17. [Google Scholar]
  22. Gilbert, E.N. Random Graphs. Annals Math. Sci. 1959, 30, 1141–1144. [Google Scholar] [CrossRef]
  23. Ross, S.M. Stochastic Processes; John Wiley & Sons: New York, 1996. [Google Scholar]
  24. Newman, M.E.J. Networks: An Introduction; Oxford University Press: Oxford, 2010. [Google Scholar]
  25. Newman, M.E.J.; Watts, D.J.; Strogatz, S.H. Random graph models of social networks. PNAS 2002, 99, 2566–2572. [Google Scholar] [CrossRef]
  26. Watts, D.J.; Strogatz, S.H. Collective dynamics of ‘small-world’ networks. Nature 1998, 393, 440. [Google Scholar] [CrossRef]
  27. Eraso-Hernandez, L.K.; Riascos, A.P.; Michelitsch, T.M.; Wang-Michelitsch, J. Evolution of transport under cumulative damage in metro systems. Int. J. Mod. Phys. C 2023, 2450037. [Google Scholar] [CrossRef]
  28. Barrat, A.; Barthélemy, M.; Vespignani, A. Epidemic spreading in population networks. In Dynamic Processes on Complex Networks; Cambridge University Press, 2008; pp. 180–215. [Google Scholar] [CrossRef]
  29. Riascos, A.P.; Sanders, D.P. Mean encounter times for multiple random walkers on networks. Phys. Rev. E 2021, 103, 042312. [Google Scholar] [CrossRef] [PubMed]
  30. Bestehorn, M.; Riascos, A.P.; Michelitsch, T.M.; Collet, B.A. A Markovian random walk model of epidemic spreading. Continuum Mech. Thermodyn. 2021, 33, 1207–1221. [Google Scholar] [CrossRef] [PubMed]
  31. Michelitsch, T.M.; Riascos, A.P.; Collet, B.A.; Nowakowski, A.F.; Nicolleau, F.C.G.A. Fractional Dynamics on Networks and Lattices; ISTE/Wiley: London, 2019. [Google Scholar]
  32. Riascos, A.P.; Mateos, J.L. Long-range navigation on complex networks using Lévy random walks. Phys. Rev. E 2012, 86, 056110. [Google Scholar] [CrossRef] [PubMed]
  33. Bestehorn, M.; Michelitsch, T.M.; Collet, B.A.; Riascos, A.P.; Nowakowski, A.A.F. Simple model of epidemic dynamics with memory effects. Phys. Rev. E 2022, 105, 024205. [Google Scholar] [CrossRef] [PubMed]
  34. Granger, T.; Michelitsch, T.M.; Bestehorn, M.; Riascos, A.P.; Collet, B.A. Four-compartment epidemic model with retarded transition rates. Phys. Rev. E 2023, 107, 044207. [Google Scholar] [CrossRef]
  35. Bestehorn, M.; Michelitsch, T.M. Oscillating Behavior of a Compartmental Model with Retarded Noisy Dynamic Infection Rate. Int. J. Bifurcation Chaos 2023, 33, 2350056. [Google Scholar] [CrossRef]
  36. van Kampen, N.G. Stochastic processes in chemistry and physics; North Holland: Amsterdam, 1981. [Google Scholar]
  37. Mieghem, P.V. Exact Markovian SIR and SIS epidemics on networks and an upper bound for the epidemic threshold. arXiv 2014, arXiv:1402.1731. [Google Scholar]
  38. Zhu, Y.; Shen, R.; Dong, H.; Wang, W. Spatial heterogeneity and infection patterns on epidemic transmission disclosed by a combined contact-dependent dynamics and compartmental model. PLoS ONE 2023, 18, e0286558. [Google Scholar] [CrossRef]
  39. Gostiaux, L.; Bos, W.J.T.; Bertoglio, J.-P. Periodic epidemic outbursts explained by local saturation of clusters. Phys. Rev. E 2023, 107, L012201. [Google Scholar] [CrossRef]
  40. Peyrard, M. What can we learn from the dynamics of the Covid-19 epidemic? arXiv 2023, arXiv:2308.14090. [Google Scholar] [CrossRef] [PubMed]
  41. Soper, H.E. The interpretation of periodicity in disease prevalence. J. Royal Statistical Society 1929, 92, 34–61. [Google Scholar] [CrossRef]
  42. Noh, J.-D.; Rieger, H. Random walks on complex networks. Phys. Rev. Lett. 2004, 92. [Google Scholar] [CrossRef] [PubMed]
  43. Michelitsch, T.; Riascos, A.P.; Collet, B.A.; Nowakowski, A.; Nicolleau, F. Fractional Dynamics on Networks and Lattices; ISTE-Wiley: London, 2019. [Google Scholar]
  44. Schilling, R.; Song, R.; Vondraček, Z. Bernstein functions. In Theory and Applications, Studies in Mathematics, 37; de Gruyter: Berlin, 2010. [Google Scholar]
  45. Simon, C.M. The SIR dynamic model of infectious disease transmission and its analogy with chemical kinetics. PeerJ Physical Chemistry 2020. [Google Scholar] [CrossRef]
  46. Supplementary materials: PYTHON codes (© Téo Granger 2023) and animated films. Available online: https://sites.google.com/view/scirs-model-supplementaries/accueil.
1
The network `distance’ of two nodes is the number of edges of the shortest path connecting them.
2
Free to download and non-commercial use.
3
A similar consideration of function G ( μ ) of (39) shows as well that the healthy state for R 0 < 1 does not exhibit an oscillatory instability.
Figure 1. Left frame: Gamma distribution for four different cases: Weakly singular (at t = 0 ) [ t = 0.5 , ξ = 0.7 ], exponential [ t = 2 , ξ = 0.5 ], broad [ t = 1.5 , ξ = 4 ], and narrow [ t = 1.5 , ξ = 30 ]. Right frame: Their Persistence (survival) probability distributions of Equation (27) where the same color code is used.
Figure 1. Left frame: Gamma distribution for four different cases: Weakly singular (at t = 0 ) [ t = 0.5 , ξ = 0.7 ], exponential [ t = 2 , ξ = 0.5 ], broad [ t = 1.5 , ξ = 4 ], and narrow [ t = 1.5 , ξ = 30 ]. Right frame: Their Persistence (survival) probability distributions of Equation (27) where the same color code is used.
Preprints 101632 g001
Figure 2. Endemic states of infected walkers/nodes J w , n ( ) = ( R 0 1 ) / ( R 0 + r ) versus R 0 for various values of parameter r which has to be read r = β n t I n ( r = β w t I w ) for the walker’s (node’s) endemic states.
Figure 2. Endemic states of infected walkers/nodes J w , n ( ) = ( R 0 1 ) / ( R 0 + r ) versus R 0 for various values of parameter r which has to be read r = β n t I n ( r = β w t I w ) for the walker’s (node’s) endemic states.
Preprints 101632 g002
Figure 3. G ( μ ) of (39) for a some Gamma distributed t I w , n . Positive zeros of G ( μ ) exist only for R 0 > 1 (instability of globally healthy state).
Figure 3. G ( μ ) of (39) for a some Gamma distributed t I w , n . Positive zeros of G ( μ ) exist only for R 0 > 1 (instability of globally healthy state).
Preprints 101632 g003
Figure 4. G e ( μ ) of (42) for different values of R 0 where G e ( μ ) > 0 for R 0 > 1 (stability of the endemic state).
Figure 4. G e ( μ ) of (42) for different values of R 0 where G e ( μ ) > 0 for R 0 > 1 (stability of the endemic state).
Preprints 101632 g004
Figure 5. We depict function G M of Equation (47) for a few values of R M for exponentially distributed t I w , n , t M . The basic reproduction number R M is monotonously decreasing with increasing mortality parameter ξ M (see Figure 6). The parameters are β w , n = 1 , α I w = 1 , ξ I w = 1 , α n = 1 , ξ I n = 0.5 with R 0 = 2 where here t I , M = R 0 / ( 1 + ξ M ) .
Figure 5. We depict function G M of Equation (47) for a few values of R M for exponentially distributed t I w , n , t M . The basic reproduction number R M is monotonously decreasing with increasing mortality parameter ξ M (see Figure 6). The parameters are β w , n = 1 , α I w = 1 , ξ I w = 1 , α n = 1 , ξ I n = 0.5 with R 0 = 2 where here t I , M = R 0 / ( 1 + ξ M ) .
Preprints 101632 g005
Figure 6. Basic reproduction number R M of Equation (50) versus mortality rate parameter ξ M for Gamma distributed t I w , n , t M for various α M where we have set β n = β w = t I w = t I n = 1 , ( α I w = ξ I w = 0.3 ) and α M = 1 , α w = ξ I w = 1 for the Markovian case which is recovered by Equation (53).
Figure 6. Basic reproduction number R M of Equation (50) versus mortality rate parameter ξ M for Gamma distributed t I w , n , t M for various α M where we have set β n = β w = t I w = t I n = 1 , ( α I w = ξ I w = 0.3 ) and α M = 1 , α w = ξ I w = 1 for the Markovian case which is recovered by Equation (53).
Preprints 101632 g006
Figure 7. Barabási-Albert, Erdös-Renyi and Watts-Strogatz types with 300 nodes and connectivity parameters used in some of the simulations. The WS graph for connectivity parameter m = 2 lacks the small world property resembling a complex real world structure. The ER network has a broad degree distribution and the small world property. The BA graph is for N asymptotically scale-free with a power law degree distribution and the small world feature where a large number of nodes have small degrees and a few (hub) nodes with very large degrees. Almost all nodes are only a few links away from hub nodes.
Figure 7. Barabási-Albert, Erdös-Renyi and Watts-Strogatz types with 300 nodes and connectivity parameters used in some of the simulations. The WS graph for connectivity parameter m = 2 lacks the small world property resembling a complex real world structure. The ER network has a broad degree distribution and the small world property. The BA graph is for N asymptotically scale-free with a power law degree distribution and the small world feature where a large number of nodes have small degrees and a few (hub) nodes with very large degrees. Almost all nodes are only a few links away from hub nodes.
Preprints 101632 g007
Figure 8. Snapshots of spreading in a WS graph ( Z = 2000 walkers, N = 2000 nodes, connectivity parameter m = 2 ) and mortality parameter ξ M = 0.4 with D ( ) 16 % . The remaining parameters are the same as in Figure 10. One observes d w ( ) 0.99 and S w ( ) 1 % with only about 20 surviving walkers after extinction of the disease. S walkers are in cyan color, I walkers red, D walkers invisible and nodes without walkers are represented in black. Consult here an animated video of this process.
Figure 8. Snapshots of spreading in a WS graph ( Z = 2000 walkers, N = 2000 nodes, connectivity parameter m = 2 ) and mortality parameter ξ M = 0.4 with D ( ) 16 % . The remaining parameters are the same as in Figure 10. One observes d w ( ) 0.99 and S w ( ) 1 % with only about 20 surviving walkers after extinction of the disease. S walkers are in cyan color, I walkers red, D walkers invisible and nodes without walkers are represented in black. Consult here an animated video of this process.
Preprints 101632 g008
Figure 9. The plots show the evolution on WS graph with Z = 1000 walkers for connectivity parameter m = 8 and rewiring probability p = 0.7 ( n x . c o n n e c t e d _ w a t t s _ s t r o g a t z _ g r a p h ( N = 1000 , m = 8 , p = 0.7 , s e e d = s e e d ) ) without mortality (left frame) and with mortality (right frame). t I w , n , t M are Gamma distributed with the parameters t M = 14 , ξ M = 2 , t I w = 8 , ξ I w = 10 , and t I n = 15 , ξ n = 10 5 , see histogram. D ( ) 0.01 and is determined by numerical integration of (7).
Figure 9. The plots show the evolution on WS graph with Z = 1000 walkers for connectivity parameter m = 8 and rewiring probability p = 0.7 ( n x . c o n n e c t e d _ w a t t s _ s t r o g a t z _ g r a p h ( N = 1000 , m = 8 , p = 0.7 , s e e d = s e e d ) ) without mortality (left frame) and with mortality (right frame). t I w , n , t M are Gamma distributed with the parameters t M = 14 , ξ M = 2 , t I w = 8 , ξ I w = 10 , and t I n = 15 , ξ n = 10 5 , see histogram. D ( ) 0.01 and is determined by numerical integration of (7).
Preprints 101632 g009
Figure 10. Evolution on WS graph with Z = 1000 walkers and N = 1000 nodes for the same parameters as in Figure 9 but with reduced connectivity parameter m = 2 . The upper frame shows a snapshot ( t = 15 ) of the spreading in one random walk realization (susceptible walkers green, susceptible nodes black, infected nodes red).
Figure 10. Evolution on WS graph with Z = 1000 walkers and N = 1000 nodes for the same parameters as in Figure 9 but with reduced connectivity parameter m = 2 . The upper frame shows a snapshot ( t = 15 ) of the spreading in one random walk realization (susceptible walkers green, susceptible nodes black, infected nodes red).
Preprints 101632 g010
Figure 11. Evolution on ER graph ( n x . e r d o s _ r e n y i _ g r a p h ( N = 1000 , p = 0.1 , s e e d = s e e d ) ) with Z = 1000 walkers and small rewiring probability p = 0.1 (above the percolation limit p c = 0.01 to ensure a connected structure). The parameters are t I n = 5 , ξ I n = 10 , t I w = 10 , ξ I w = 0.05 , t M = 65 , ξ M = 1 . The left upper frame shows a snapshot of the evolution (same color code as in Figure 10).
Figure 11. Evolution on ER graph ( n x . e r d o s _ r e n y i _ g r a p h ( N = 1000 , p = 0.1 , s e e d = s e e d ) ) with Z = 1000 walkers and small rewiring probability p = 0.1 (above the percolation limit p c = 0.01 to ensure a connected structure). The parameters are t I n = 5 , ξ I n = 10 , t I w = 10 , ξ I w = 0.05 , t M = 65 , ξ M = 1 . The left upper frame shows a snapshot of the evolution (same color code as in Figure 10).
Preprints 101632 g011
Figure 12. Evolution on BA graph with Z = 50 walkers and N = 5000 nodes ( n x . b a r a b a s i _ a l b e r t _ g r a p h ( N = 5000 , m = 5 , s e e d = s e e d ) ) with parameters t I n = 32 , ξ I n = 10 4 , t I w = 8 , ξ I w = 10 4 (sharp t I w , n ), t M = 500 , ξ M = 10 3 . The basic reproduction number R M is here only slightly smaller than R 0 without mortality. The left upper frame shows a snapshot of the evolution (same color code as in Figure 11).
Figure 12. Evolution on BA graph with Z = 50 walkers and N = 5000 nodes ( n x . b a r a b a s i _ a l b e r t _ g r a p h ( N = 5000 , m = 5 , s e e d = s e e d ) ) with parameters t I n = 32 , ξ I n = 10 4 , t I w = 8 , ξ I w = 10 4 (sharp t I w , n ), t M = 500 , ξ M = 10 3 . The basic reproduction number R M is here only slightly smaller than R 0 without mortality. The left upper frame shows a snapshot of the evolution (same color code as in Figure 11).
Preprints 101632 g012
Figure 13. Evolution with the same parameters and number of walkers ( Z = 50 ) as in Figure 12 but less nodes ( N = 2100 ) for one random walk realization. We interpret the increase of R M and R 0 due to more frequent passages of susceptible walkers on infected nodes (higher infection rates).
Figure 13. Evolution with the same parameters and number of walkers ( Z = 50 ) as in Figure 12 but less nodes ( N = 2100 ) for one random walk realization. We interpret the increase of R M and R 0 due to more frequent passages of susceptible walkers on infected nodes (higher infection rates).
Preprints 101632 g013
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated