Abstract
We model an epidemic spread process involving nodes that (a) experience non-trivial asymptomatic infectious periods and (b) adapt by avoiding contacts with symptomatic infectious nodes. These modeling choices reflect ample evidence that infectious individuals are often mistakenly perceived as safe contacts due to lack of symptoms and that individuals adapt to an epidemic by avoiding contacts deemed to be of risk. We capture these choices in the
(Susceptible-Asymptomatic Infected-Symptomatic Infected-Susceptible) model, where we explicitly distinguish between asymptomatic and symptomatic infectious individuals. We adopt an individual-based mean-field epidemic modeling approach and formulate the system of differential equations via continuous-time Markov chain analysis. We first consider non-adaptive homogeneous and heterogeneous mixing scenarios over arbitrary static contact networks. We derive the expression for the basic reproduction number,
, and establish that under otherwise similar conditions the individual infection probabilities at the metastable state of
dominate those in the conventional SIS model. Then, we focus on a contact-adaptive setting, where nodes avoid interactions with known infectious neighbors or reconnect with neighbors who have recovered, to study how the time-varying contact network, asymptomatic infections and their combinations affect the epidemic spread dynamics. Overall, asymptomatic infections restrict nodes’ capacity to adapt (link breaking), resulting in higher link density and consequently higher epidemic prevalence. Besides, in their presence, the retarding effect of the link-breaking mechanism on epidemic prevalence is considerably mitigated. We numerically analyze how the effective link-breaking rate and the size of the asymptomatically infected population affect the link density and, ultimately, the epidemic prevalence. The epidemic threshold appears to scale inversely with the population of asymptomatic nodes, namely the epidemic starts to spread at lower infection rates when the number of asymptomatic infections is higher.
Subject terms: Infectious diseases, Applied physics, Applied mathematics, Computational science
Introduction
After the recent COVID-19 pandemic outbreak, research effort is globally invested anew in understanding disease spreading phenomena. One particular aspect of these phenomena that has drawn much attention in literature relates to the role of silent spreaders1 ; namely, individuals who are infectious yet “unobservable” because they do not exhibit disease symptoms. When individuals exhibit infection symptoms, people in their social surroundings may intentionally avoid contacts with them. This way the corresponding links in their social contact network are broken and the disease spread is decelerated. On the contrary, infected individuals without symptoms are perceived as healthy and neither can they self-isolate voluntarily nor can others avoid contacts with them. Without proper contact adaptation amongst the population, these individuals may inadvertently trigger new infection chains. Silent spreaders are relevant not only for biological diseases but also for other spreading processes such as botnets, malware and ransomware attacks, where infected nodes lay dormant prior to attack and infected victims are often unaware of their infection2–4. The interplay between (1) the effect of silent spreaders and (2) the contact adaptation process that occurs as a result of individual responses to the epidemic spread is complex: the spreading process changes the contact network structure, which in turn changes the spreading process, realizing a non-trivial feedback loop and highlighting a continuous interaction between the two. The literature has promptly identified the importance of these two factors, yet their impact has been routinely studied in isolation.
With respect to silent spreaders,5 extended the classic SIR epidemic model and proposed the SAIR model by introducing a new “Asymptomatic” state to study the emergence of drug resistance. This model has been more recently further investigated in6 in the context of population migration across geographic regions. On the other hand,7 proposed to split the “Infected” state in the SIR model into two sub-states (symptomatic and asymptomatic), introducing separate infection and recovery rates for each one. Recent work has also highlighted the importance of correctly recognizing and reacting to the infection risk. It is reported in8 that (a) the spread of the epidemic is larger as the fraction of population not responding to the infection threat increases; and (b) the structure of the social contact network affects the peak of hospitalization: the higher its modularity and heterogeneity, the lower the hospitalization peaks. In9, the authors applied a modified SIR model accounting for a large population of asymptomatic nodes to the early COVID-19 infection data in northern Italy and highlighted that models disregarding asymptomatic population seriously underestimate important epidemic parameters such as its prevalence. This is corroborated in10 working with COVID-19 data from two US cities. However, while coarse-grained aggregate data such as the number of infections and hospitalizations are more widely available, detailed node-level contact adaptation data is not easily obtained. In the absence of suitable behavioral data,11 numerically explore the effect of risk misperception and find that even in the presence of behavioral change in human contacts, the asymptomatic population increases the epidemic prevalence.
Meanwhile, there is a body of work on epidemic spreading over time-varying network structures. At a first level, we can distinguish between two types of temporal networks: (1) non-adaptive time-varying networks that change independently of the epidemic process and (2) adaptive time-varying networks, whereby the existence of links depends on the state of the nodes. Reference12 studied a variation of the SIS model 13 on a non-adaptive time-varying network, whose links are randomly activated/deleted, and questioned the value of basic reproduction number,
, as predictor of long-term outcomes in dynamic networks. In14, the authors compared time-varying contact networks, modeled after the fixed history of real human contacts, against static networks that aggregate contacts over time and fully connected networks. They found that removing temporal information leads to severe under- or over-estimation of outbreak characteristics and that long-term temporal structures are the most influential factors controlling the time to extinction and outbreak size. In15, the researchers combine Monte Carlo simulations with mean-field theory to analyze the epidemic threshold. Their analysis incorporates network correlations (reflecting the persistence of social contacts) but ignores dynamic correlations (where being near infected nodes increases infection likelihood). They demonstrate that when the time scales of network dynamics and epidemic propagation are similar, the epidemic threshold depends explicitly on the recovery rate, as opposed to only the ratio of spreading rate over recovery rate. The latter is the case for annealed contact networks (network changes are much faster than the spread dynamics) and static contact networks (network changes are much slower than the spread dynamics).
At a second level, the adaptive time-varying networks can be further categorized into two main groups depending on how the network structure dynamics are modeled.
Under the link rewiring approach, a node may randomly switch a link to an existing neighbor with a link to another node with certain probability conditioned upon the states of the neighbor node 16–18. Based on this approach,16 found that the network structure exhibits assortative degree correlation and results in a highly connected susceptible cluster. The spreading process exhibits bistability and oscillations that are not evidenced in static contact networks.
Under the link breaking/creating approach, a node either breaks or creates a link with its neighbor node with certain probability depending on the state of the neighbor node19,20. In contrast with the link rewiring approach, a node does not necessarily connect to another node after breaking a link. For instance,20 investigated different node response behaviors to epidemic and found that the relation between the epidemic threshold and the effective link-breaking rate could be linear or constant and in some cases, even unknown (i.e., the metastable state is not found). This is the approach we adopt in our work.
The combined effect of asymptomatic individuals and the time-varying contact network on the epidemic spread has only recently gained research attention. Using agent-based simulations,21 studied the phase transitions of epidemic spread caused by infectious individuals with pre-symptomatic, asymptomatic and symptomatic stages in small world networks that change under three schemes: (1) global social distancing with tunable probability of adherence, (2) probabilistic self-initiated social isolation and (3) reduction in viral shedding rate. The authors found that viral shedding rate is the most important driver in determining infection spreading. In22, the authors employed activity-driven networks, whereby nodes and links are randomly activated, to study epidemic spreading with both asymptomatic and symptomatic populations. Finally,23 investigated control measures for epidemic with asymptomatic carriers using a two-layer temporal network model. Whereas all these studies explicitly considered asymptomatic population and contact networks that change over time, the latter changes are routinely driven by tunable random processes rather than the state of linked nodes.
Contributions
Our work contributes to the long research thread on epidemic processes in three ways. First, we develop a novel epidemic model,
, that jointly captures the role of asymptomatic infected individuals in the epidemic spread and the counter effect of changes in the individual contact networks in response to this spread. In our model, which inherits from the simple yet widely used SIS model, we explicitly distinguish the infected individuals into symptomatic (
) and asymptomatic (
) compartments and, thus, can more naturally relate link creation and breaking to the status of the epidemic. This marks a clear line of separation from the body of current literature, which rarely looks into the combined effect of the two factors and, when it does, the contact network changes are driven by random processes rather than being dependent on the nodes’ state. We adopt the individual-based mean-field approach24, whereby input is the network topology and a continuous-time Markov chain models the coupling between the spreading process and the network evolution. The mean-field approximations reduce the overall analysis complexity from exponential to polynomial. Second, our model considers both static and adaptive contact networks. In the non-adaptive context, we derive key properties of the model. Under homogeneous mixing of the population, whereby all individuals are assumed to have direct contacts with each other, we obtain the expression for the basic reproduction number of our
model. In the heterogeneous mixing case, where the contact network is arbitrary and directly modulates the spreading process, we establish that the individual infection probabilities in our
model dominate those in the SIS model under similar conditions and derive an upper bound for the
epidemic threshold. From these, we further derive the infection probability of each individual at the meta-stable state as a function of the effective recovery rate. Finally, for adaptive contact networks, the dynamics of the system are more complex and harder to analyze theoretically. To gain insights, we numerically explore the exclusive and combined effects of link adaptations, network topology, and asymptomatic infections on the epidemic prevalence and link density letting the model parameters span wide value ranges.
Formulating the
model
We focus on the simplest non-trivial model that tracks whether a node is infected or not (rather than all different states it might go through) (e.g., exposed, quarantined, isolated, hospitalized, dead) 25,26 while letting us model the co-evolution of the disease spreading and the network topology as the population adapts its behavior. Table 1 summarizes the key mathematical notations used in this paper. We detail both aspects of the model next.
Table 1.
Key Mathematical Notations.
| Symbols | Descriptions |
|---|---|
| A, A(t) | Adjacency matrix representing the topology, time-dependent adjacency matrix |
, N
|
The set and number of nodes (or vertices) in the network respectively |
, L
|
The set and number of links (or edges) in the network respectively |
,
|
Infection and recovery rate respectively |
![]() |
Symptom development rate (transition from Asymptomatic to Symptomatic) |
![]() |
Proportion of infections that are asymptomatic |
![]() |
Proportion of asymptomatic nodes that recover without developing symptoms |
, ,
|
Probability that node n resides in the healthy, asymptomatic infected and symptomatic infected the state, respectively |
,
|
Link breaking and link creation rate respectively |
![]() |
Fraction of infected nodes in the network at time t |
![]() |
Infinitesimal generator of node n’s continuous Markov chain |
![]() |
Next generation matrix |
![]() |
Basic reproduction number |
![]() |
Epidemic threshold |
![]() |
Largest eigenvalue of matrix A |
The
model for static contact networks
In this section, we present the
model. We abstract the population using a graph whose nodes represent individuals and links denote contacts between them. Specifically, we consider an underlying undirected network,
with
the set of nodes (individuals) and
the set of links (contacts) where
and
.
is represented by A, the
symmetric adjacency matrix, with
if there exists a link between nodes n and m and
otherwise. We also assume that G is connected, i.e., there is a path between any pair of nodes in the network, so that A is irreducible.
We consider a disease that, at any point in time, partitions the population into three distinct groups:
Susceptible individuals who are disease-free but prone to infection. Susceptible individuals have a chance of getting infected when contacting infected individuals, regardless of whether those are symptomatic or asymptomatic.
Asymptomatic Infected individuals who are infected (and infectious) but do not exhibit any symptoms. These individuals appear to be healthy and do not trigger response from their contacts.
Symptomatic Infected individuals who have been infected, are infectious and exhibit symptoms. These individuals may trigger reaction from their contacts.
Since each node must be in one of the three states at any given point in time, it holds that
![]() |
1 |
and
![]() |
2 |
Figure 1(a) illustrates how an asymptomatic individual (node 1) may cause a new infection (node 2) as well as how contact adaptation (i.e., the break of the link between nodes 2 and 3) can prohibit further spread of the infection from node 2. Figure 1(b) then captures the state transition diagram of the proposed model. Both asymptomatic and symptomatic infected individuals infect a susceptible individual that contacts them at rate
. We use parameter
to control the proportion of infections that are asymptomatic. In fact, some asymptomatic cases eventually exhibit infection symptoms; we control their proportion with parameter
. In our model, an infected individual may exhibit symptoms with rate
prior to recovering (that occurs at rate
). Similarly, symptomatic individuals recover at rate
. Following the literature, we assume that this transition from the infected to susceptible state is a Poisson process (e.g.,27,28). Furthermore, without loss of generality and unless otherwise specified, we use
for the rest of the paper.
Figure 1.
The
model. (a) Illustration of contact adaptation: Node 1 is asymptomatic infectious. Node 2 continues to interact with node 1 due to unawareness and gets infected with symptoms. Node 3 avoids contact with node 2 once it detects the symptoms and thus avoids infection and remains susceptible. (b) the state transition diagram of the model.
The network state at any time t can be defined by the combination of the states each of the N nodes resides in. As a result, the infection process can be identified as a continuous-time Markov Chain (CTMC) with
states and be fully specified by a
infinitesimal generator, Q(t). The complexity of this CTMC becomes prohibitive even for small values of N, hence, we follow an important amount of literature in considering the individual node separately. When applying Markov theory at the node level, we obtain N instances of the infinitesimal generator,
, for the three-state CTMCs describing the transitions of each node:
![]() |
3 |
The recovery of infected node (i.e.,
and
) and the emergence of symptoms upon infection (i.e.,
) are modeled as Poisson processes. The state transitions from susceptibility to asymptomatic infection (probabilities
), and symptomatic infection (probabilities
) are dependent on the states of other nodes in the network. To account for this dependency, both
and
must be conditioned on all possible combinations of states of all other network nodes. Unfortunately, this points back to the exact Markov chain solution of exponential complexity, as discussed earlier.
Following28 and29 , we solve this problem by applying a mean-field approximation to the random variables
and
. Working with their expected rates, we reduce the complexity of the solution from exponential to polynomial.
With the mean-field approximation for
and
, the effective infinitesimal generator can be written as:
![]() |
4 |
In (4),
and
are the expected or effective infection rates of node,
, in the presence or absence of symptoms, respectively. They are functions of the infection rate,
and the states of
’s neighbors. The information about the nodes’ neighborhoods is encoded in the adjacency matrix, A. Node
is not immediately susceptible to infection until at least one of its neighbors is infected (with or without symptoms). The effective infection rates can then be written as:
![]() |
5 |
and
![]() |
6 |
Applying the Markov differential equation (see30, page 208), we obtain the following system of non-linear differential equations for 
![]() |
7 |
![]() |
8 |
![]() |
9 |
The spreading process is governed by this set of
differential equations, which can be reduced to
, using Eq. 1. Solving them yields the instantaneous partition of the population into the three states.
Adaptive contact networks: link adaptation and the network evolution process
In adaptive contact networks, the adjacency matrix, A, changes over time. We represent the temporally evolving network with A(t), whose element
equals 1 if a link between nodes
and
exists at time t, and it equals 0, otherwise. We assume that no new contacts are established in the course of the epidemics (i.e.,
, if
). The network topology evolves based on two independent processes as follows:
Link-breaking process – a node without symptoms, i.e., a node in either the susceptible or asymptomatic infected state, avoids contacts with a node exhibiting infection symptoms. Specifically, a non-symptomatic node
will break the existing link with a neighboring node
with Poisson rate
if
gets infected and develops symptoms.Link-creation process – conversely, if both end nodes of a link that broke earlier, because at least one of the two nodes got infected and developed symptoms, do not (any more) exhibit symptoms, the link between them is re-established with Poisson rate
.
We follow the methodology described in20 to model the link adaptation processes. Specifically, we define two functions,
and
, describing the link-breaking and link-creation mechanisms, respectively. The two link adaptation processes are solely dependent on the states of the two link end-point nodes. Since in our
model each node can be in one of three states at any point in time, there are six distinct combinations of states for each pair of nodes. Table 2 lists those six combinations and the associated actions. From the table, we note that susceptible and asymptomatic infected nodes induce the same actions and thus can be grouped together. Then, the link adaptation action is simply determined by whether the end nodes of a link are symptomatic infected. Let
be the Bernoulli random variable indicating whether node n is symptomatic infected at time t (
) or not (
)20. we obtain the following expressions:
![]() |
10 |
![]() |
11 |
Hence, a link between two nodes m, n breaks (with rate
) when either one of the two is symptomatic infected and is created (with rate
) when both of them lie in a state other than the Symptomatic Infected one.
Table 2.
Link breaking/creation rules by time t for two nodes
,
with
, depending on current
.
State
|
State
|
![]() |
Action |
|---|---|---|---|
| S | S | 0 | Create link |
| 1 | No action | ||
| S | ![]() |
0 | Create link |
| 1 | No action | ||
| S | ![]() |
1 | Break link |
| 0 | No action | ||
![]() |
![]() |
0 | Create link |
| 1 | No action | ||
![]() |
![]() |
1 | Break link |
| 0 | No action | ||
![]() |
![]() |
0, 1 | No action |
We apply a mean-field approximation by taking the expectation on both sides, with
. Following31, we assume that the random variables
and
are uncorrelated (i.e.,
) for all
. As a result, the equations that govern the evolution of link
are obtained as Eq. 12,
![]() |
12 |
where
,
and
denote the probabilities that node n resides in the susceptible (S), asymptomatic infected (
) and symptomatic infected (
) states at time t, respectively. Note that the interaction between the two end nodes of a link is assumed to be symmetric, thus preserving the symmetry of the adjacency matrix A(t).
Epidemic threshold and prevalence
One important quantity of interest when studying epidemic spreading is its prevalence (i.e., the fraction of infected population). We can compute the prevalence of the epidemic at time t in the network as follows:
![]() |
13 |
With our individualized modelling approach, we can also compute individual infection probabilities (i.e.,
and
). Thus, we do not only obtain the prevalence as an aggregate value for the entire network, but also gain insights into the susceptibility of individual nodes.
We are also interested in understanding the epidemic threshold, i.e., the point above which the epidemic will almost surely spread. For this purpose, in the following, we derive the basic reproduction number
of our
model, which indicates the expected number of secondary infections produced by a single infected individual in a completely susceptible population 32. When
, one infected node infects less than one node on average and the epidemic dies out. Conversely, when
, an infected node is capable of infecting more than one susceptible node on average and the epidemic escalates.
Numerical results and discussion
We first provide some insights into the
model in a non-adaptive setup, where the nodes do not adapt their connections with their neighbors (i.e.,
). By switching off the link adaptation mechanism, both symptomatic and asymptomatic nodes infect their neighbors in a similar manner since healthy neighbors are immediately susceptible to infection without the ability to avoid contacts. In this analysis, we draw parallels with the classical SIS model, to which our
model can be reduced to by setting
.
We first investigate the case of homogeneous mixing, as this results from the law of mass action. The contact graph is complete, i.e.,
and
so that each node is in direct and constant contact with all other nodes and the network topology does not affect the spreading process. We adopt the next generation matrix approach33 to compute
under homogeneous mixing. In the absence of adjacency matrix elements and for
, the system of differential equations (7)-(9) and (12) is simplified as follows:
![]() |
14 |
![]() |
15 |
![]() |
16 |
![]() |
17 |
In the
model, the transitions
and
mark new infections and both states
and
are states-at-infection, i.e., states that individuals occupy immediately upon their infection33. On the contrary, the transition
does not generate new infections but rather marks the progression of already infected nodes to a different infection state. The computation of the next generation matrix
and, eventually,
involve only the two states-at-infection. Linearizing equations (15) and (16) around the infection-free steady-state
, we can derive the linearized infection subsystem in matrix form
![]() |
18 |
where the
matrix on the right hand side of (18) is the Jacobian matrix of the original system of nonlinear equations (15) and (16). We can then write the Jacobian matrix as the sum of matrix F corresponding to transmission events (generation of new infections) and the matrix V corresponding to transitions between infected states and recovery to state S, where:
![]() |
where F is non-negative and V is a non-singular matrix. We can then compute the next generation matrix,
, in line with33
![]() |
19 |
where
denotes the inverse of matrix V. Then,
equals the largest eigenvalue of
, which can be computed out of the trace and the determinant of
:
![]() |
and since
, we get
![]() |
20 |
Note we can revert back to the original SIS model by setting
, i.e., eliminating the discrimination between the
and
states. For
,
reduces to the basic reproduction number
of the SIS model. Moreover, simple algebraic calculations yield that
, i.e., other things held constant, the higher the percentage of asymptomatic nodes that recover before developing symptoms, the smaller the reproduction number.
Heterogeneous mixing in non-adaptive networks
We, then, relax the homogeneous mixing assumption so that the underlying network graph is no longer complete. The nodes’ contacts are still fixed (
) but they can now be encoded in an arbitrary adjacency matrix A.
Similar to the classical N-intertwined SIS model28, the
model possesses the trivial solution
(no infected nodes in the network) in the asymptotic regime
since the Markov chain is finite and possesses an absorbing state that is reachable by all other states. In practice, for any network of realistic size, it has been found that the asymptotic solution may only be reached after a very long period during which the system converges exponentially fast to another stable state, often referred to as the “meta-stable state”, and remains there for most of the time28,34. The condition that determines whether the spreading process will indeed converge to this meta-stable state is related to the spectral radius of the adjacency matrix representing the network. Specifically for the N-intertwined SIS model, the spreading process evolves to epidemic and converges to the meta-stable state if
![]() |
21 |
where
is the largest eigenvalue of A and
the epidemic threshold of the model28,35,36. At the meta-stable state, the individual infection steady-state probabilities
satisfy the system of equations
![]() |
22 |
We can make two remarks regarding the way the
model compares to the N-intertwined SIS model, codified below as propositions for easier reference. Let
![]() |
23 |
be the overall infection probabilities of individuals, where the infected population is the sum of symptomatic and asymptomatic individuals. We can show that:
Proposition 1
For two spreading processes,
, evolving under the SIS and
models, respectively, sharing the same underlying graph and starting from the same initial conditions, i.e.,
, the infection probabilities of individuals in the two models satisfy
.
Refer to Supplementary Appendix A for the corresponding proof.
Following this, we can also state that:
Corollary 1
The SIS epidemic threshold serves as an upper bound for the
epidemic threshold, i.e.,
![]() |
24 |
Refer to Supplementary Appendix A for the corresponding proof.
In Fig. 2(a), we compare the epidemic prevalence of the
to the SIS model, for
and
. We see that higher proportion of asymptomatic nodes (i.e., higher
) leads to higher epidemic prevalence. We also see that the epidemic begins to spread at lower values of the
ratio (see inset of Fig. 2(a)), in line with (20). This is a result of the increased overall time a node spends in infection states thanks to the additional state transition from
to
. This also corroborates our statement above regarding the domination of
over SIS model.
Figure 2.
SIS vs
model in non-adaptive setting (
).
Proposition 2
The steady-state probabilities of individuals at the meta-stable state of the
model satisfy the equations:
![]() |
25 |
where
![]() |
26 |
Refer to Supplementary Appendix A for the corresponding proof.
Comparing (25) with its SIS counterpart in (22), the
model could be viewed as an SIS model, i.e., with a single infection state, the same infection rate
and recovery rate
, smaller than the original SIS recovery rate
.
Figure 2(b) compares the epidemic prevalence under the SIS and
models as
varies from 0 to 1. For
, the prevalence curves for the two models overlap since the
model reduces to the SIS one. As
varies from 1 down to 0, the spreading process takes off at lower
values (see inset) and the prevalence scores distinctly higher than under the SIS model.
Heterogeneous mixing in adaptive networks
We numerically explore the implications of different link adaptations, network topology features and the asymptomatic infected population on the epidemic dynamics. As our baseline scenario, we set
,
,
(i.e., we assume that 50% of new infections are asymptomatic),
(i.e., 50% of those asymptomatic cases developing symptoms),
,
. We vary the effective spreading rate by fixing
and changing
. Unless otherwise stated, we experiment with random graphs of
nodes and link probability
, which drives the probability that the graph is connected to 1 as N tends to infinity.
Impact of link adaptations
From our analysis for the case of heterogeneous mixing in non-adaptive networks, we established that, in non-adaptive setting,
sets an upper bound on the epidemic threshold for our
model. However, as soon as we consider link adaptiveness, i.e., nodes avoiding contacts with symptomatic infected nodes, the adjacency matrix changes over time, and consequently, its eigenvalues and corresponding eigenvectors are also time-dependent functions. Since there are no new link establishments, we have
. As A(t) is always a non-negative square matrix, it follows from the Perron-Frobenius theorem that
. From this, we can also conjecture that the upper bound of the
epidemic threshold is higher in the adaptive setting than it is in the non-adaptive setting.
In Fig. 3(a), we plot the epidemic prevalence and link density (inset) under four different link adaptation settings in the baseline scenario: (1) nodes do not adapt at all their contacts (
), (2) nodes break links with infected contacts but do not reconnect after recovering (
) (3) link breaking and creation rates are equal (
) and (4) the link breaking rate is twice the link creation rate (
). Clearly, a population without contact adaptation (i.e.,
) allows wider spread of the epidemic. Population that actively avoids contacts with symptomatic nodes inhibits the epidemic spreading and results in lower prevalence. However, this also isolates the population as it can be seen in the decrease of the link density.
Figure 3.
Impact of different link adaptation scenarios based on the
model.
To explore the epidemic threshold region, we define the effective link-breaking rate
(
implies that link adaptation is disabled). In Fig. 3(b) we show the co-evolution of the epidemic prevalence and link density around the threshold region. Interestingly, our
model portrays a fixed epidemic threshold, or bifurcation parameter, which is independent of the effective link-breaking rate,
. A similar observation is made in31 for the adaptive SIS (ASIS) model, first introduced in37 with complete original contact graph A(0): the transcritical bifurcation parameter they compute via the first-order mean-field approximation is fixed for different effective link-breaking rates,
. However,31 further reports that the epidemic threshold appears to scale linearly with
when the second-order mean-field approximation is considered, so that our experimental evidence here about the threshold invariance is definitely not conclusive. In general, we find that higher effective link-breaking rate,
, results in lower link density (i.e., more susceptible nodes break links with observable infected nodes) and prevalence (i.e., more link breaking inhibits the epidemic spreading).
Impact of network topology
In this section, we show how network topology affects the actual spreading dynamics. We first examine the influence of the initial density of the contact network. We generate ER graphs with three different link densities (i.e.,
,
and
). Figure 4(a) clearly suggests that higher link densities facilitate faster spreading and higher epidemic prevalence. The lower the parameter p value the slower the epidemic prevalence growth and the lower its value reached at steady-state. Likewise, for higher link probability p, the link density drops more drastically from its initial value towards its steady-state value, as shown in Fig. 4(b). This more dramatic change in the network topology as the original link density increases is also reflected in the comparison of the average node degrees between
and after the epidemic prevalence value stabilizes. As shown in Fig. 4(c), higher density networks experience higher decrease in average degree.
Figure 4.
Impact of link density.
Nevertheless, networks with identical link density at
, may also experience different epidemic dynamics. To illustrate this, we use two networks with the same number of links but different degree distributions. The first network follows the ER model38 with the binomial degree distribution whereas the second network follows the scale-free model39 featuring power-law degree distributions. (cf. Fig. 5(c) where the top row depicts the probability and cumulative density functions (pdf and cdf) of node degrees for a sample ER network and the bottom row depicts the same for a sample scale-free network). The hub nodes in the scale-free network, i.e., those nodes featuring many more direct neighbors than others and giving rise to the right heavy tail in the degree distribution, help the epidemic spread faster (see Fig. 5(a)). However, interestingly, the stable prevalence level is lower than that of the ER graph, and, as Fig. 5(b) suggests, so is the link density over time. As hub nodes enter the symptomatic infected state and their neighbors start avoiding contacts with them, the link breaking events are more frequent.
Figure 5.
Impact of degree distribution on prevalence and link density; experiments with ER and Scale-Free networks.
Impact of asymptomatic infections
The next set of results focus on the effect of asymptomatic nodes in an adaptive network. We return to our baseline scenario and control the asymptomatic infected population via parameter
. We consider four cases: (a)
: with symptomatic infected seed node, resulting in no asymptomatic nodes and reduces to the SIS model, (b)
: low generation rate of asymptomatic nodes upon infection, (c)
: equal probabilities to develop or not symptoms upon infection, and (d)
: all infections start without symptoms. Figure 6(a) plots the characteristic curves of
for the four cases and Fig. 6(b) compares the corresponding prevalence and link density (inset) trajectories over time. We see that higher numbers of asymptomatic infections restrict harder the nodes’ capacity to adapt to the ongoing epidemic (i.e., breaking links with infected nodes), resulting in higher link density even at the same effective link breaking rate,
, for all cases. Consequently, the epidemic prevalence grows hand-in-hand with the number of asymptomatic infected nodes , which catalyze the epidemic process in two ways: by lengthening the duration of infection (when
) and by reducing the effective link breaking rate.
Figure 6.
(a) Time evolution of
for the baseline scenario with asymptomatic infection rates,
; (b) Prevalence for the corresponding
values; (c) Prevalence and link density around the threshold region for the same
values.
In contrast to the the first order approximation results discussed in the Section on the Impact of Link Adaptations, which indicate that the epidemic threshold is insensitive to the effective link-breaking rate
(cf. Fig. 3(b)), the epidemic threshold appears to scale inversely with
. We show this in Fig. 6(c) zooming in on the
threshold region, where the epidemic threshold decreases for higher
values. Fig. 6(c)(inset) shows the link density for the four cases.
Modulated effects
We know that higher
values result in higher epidemic prevalence. From above, we also understand that the epidemic prevalence drops as the effective link-breaking rate,
, increases or asymptomatic infections get sparser (i.e., low
). Here, we investigate the modulated effect of these three parameters (
,
,
) producing three sets of contour maps, as shown in Fig. 7. In the first set of results, Fig. 7(a) and (d), we show the contour maps of prevalence and link density, respectively, under a range of (
,
) combinations (the remaining parameters follow the baseline scenario ). As we increase the two parameters, the prevalence and link density follow different paths: high effective link-breaking rate inhibits spreading (top-left corner of Fig. 7(a)), whereas high percentage of asymptomatic nodes favors it (bottom-right corner). Both the prevalence and link density increase diagonally from top-left towards the bottom-right corner in the contour maps under the opposite effect of
and
.
Figure 7.
Contour maps of epidemic prevalence (top row) and corresponding link density (bottom row) for three settings: (first column)
vs.
, (second column)
vs.
and (third column)
vs.
.
Fig. 7(b) and (e) plot the prevalence and link density contour maps for
value pairs. The two parameters have opposite impact on the prevalence but similar impact on the link density (i.e., prevalence (link density) increases (resp. decreases) as
increases and
decreases (resp. increases)). Comparing the link densities in Fig. 7(d) and (e), the contour map is ’flipped’ along the vertical axis. The highest link density is achieved at opposite bottom corners. As opposed to the
case, where prevalence and link density are strongly positively correlated as we vary
and
, in the
case, increasing either
or
strengthens the link breaking process. In this case, we witness (very) low prevalence scores coupled with high link density values (left side of contour maps) or high prevalence coupled with (very) low link density (top-right corner of contour maps).
In the last set of contour maps, in Fig. 7(c) and (f), we look into the
vs.
relation. Both parameters are positively correlated with prevalence, whereas they differ with respect to link density:
is negatively correlated while
is positively correlated with it. As a result, the highest prevalence is obtained at the top-right corner of the contour map in Fig. 7(c), whereas the lowest link density appears at the bottom-right corner of the contour map, when the
is highest and
is lowest. Analyzing across the three sets of results, we observe that
is the dominant determinant for low prevalence with
and
having little effect at this region. However,
emerges to be the main contributing factor at high epidemic prevalence. The neutralizing effect from tuning
fails at high prevalence region with high number of asymptomatic silent spreaders.
Conclusions
We study the spreading process involving (a) nodes who may not exhibit symptoms themselves when they get infected; and, (b) may break contacts with other nodes in their social network when those exhibit infection symptoms. Our goal is to study the dynamics of the diffusion processes that emerge when undetectable infectious nodes hamper the network’s ability to defend against the epidemic spread by breaking contacts. Our compartmental
model breaks down the network population into three distinct compartments (i.e., Susceptible, Asymptomatic infected and Symptomatic infected). We employ CTMC analysis to model the spreading process by taking into account the state transitions of individual nodes rather than the aggregate behavior of all nodes. We apply a mean-field approximation to reduce the complexity of the solution from exponential (exact solution) to polynomial.
We pursue our goal by working in three stages of progressively higher analysis complexity. In the first stage, we consider a homogeneous mixing network whereby all nodes have direct contacts with each other that do not change in the course of the spreading process. For this network, we draw on the next generation matrix approach to derive its basic reproduction number,
(i.e., Eq. 20). Then, we consider a non-adaptive heterogeneous mixing setup with the contact network represented by an adjacency matrix. Here, we contrast our
model against the classical N-intertwined SIS model28. We find that our model dominates the N-intertwined SIS model in terms of individual infection probabilities and obtain an upper bound for its epidemic threshold. We derive the effective recovery rate from the two infectious states in our model, which is shown to be smaller than the one of the SIS model and formulate a system of equations for the individual infection probabilities at the metastable state that is reminiscent of the one for the original SIS model.
Finally, we explore our model in the contact-adaptive setting, investigating how individual parameters and their combinations affect the trajectories of epidemic prevalence and link density of the network over time. We find that the retarding effect of the link-breaking mechanism upon the spreading process is far less effective in the presence of asymptomatic infected nodes who cannot be detected and avoided by healthy nodes. Our analysis and results further corroborate recent empirical observations that epidemics with an asymptomatic infectious period feature higher epidemic prevalence even when counter-measures such as isolation and quarantine are in effect. This serves as a strong indication of how even such a general model can offer insights not captured by classical epidemic models and could inform the formulation of policies and/or counter-measure design based specific application context. Such implications for policy design would apparently be more detailed and precise if the model is extended to account for other states such as exposed (analogous to SEIR model32), quarantined, hospitalized, but in all cases, the additional detail would need to be traded with extra complexity and weaker approximations of exact solutions. On a more technical front, our work here has drawn heavily on first order mean-field approximations of the CTMC. While this has offered various insights into the spreading dynamics under different mix of asymptomatic population and link-breaking rates, we conjecture that better estimates of the epidemic threshold could be obtained with higher-order approximations. For instance,31 and19 reported good qualitative approximation for the basic SIS model in contact adaptive setting using second-order mean-field approximations.
Supplementary Information
Author contributions
W.K.C conceived the model and experiments. Both authors performed the model development, result analysis and writing of the manuscript.
Data Availability
Data generated during the current study are available from the corresponding author on reasonable request.
Declarations
Competing interests
The authors declare no competing interests.
Footnotes
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
The online version contains supplementary material available at 10.1038/s41598-026-36212-y.
References
- 1.Coronavirus: The mystery of asymptomatic ’silent spreaders’. https://www.bbc.co.uk/news/uk-52840763. Accessed: 13-02-2025.
- 2.Kolias, C., Kambourakis, G., Stavrou, A. & Voas, J. DDoS in the IoT: Mirai and other botnets. IEEE Comput. Soc.50, 80–84 (2017). [Google Scholar]
- 3.Scaife, N., Traynor, P. & Butler, K. Making sense of the ransomware mess (and planning a sensible path forward). IEEE Potentials36, 28–31. 10.1109/MPOT.2017.2737201 (2017). [Google Scholar]
- 4.Acarali, D., Rajarajan, M., Komninos, N. & Zarpelao, B. B. Modelling the spread of botnet malware in IoT-based wireless sensor networks. Secur. Commun. Netw.10.1155/2019/3745619 (2019). [Google Scholar]
- 5.Robinson, M. & Stilianakis, N. I. A model for the emergence of drug resistance in the presence of asymptomatic infections. Math. Biosci.243, 163–177. 10.1016/j.mbs.2013.03.003 (2013). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 6.Ansumali, S., Kaushal, S., Kumar, M. K., Prakash, A. & Vidyasagar, M. Modelling a pandemic with asymptomatic patients, impact of lockdown and herd immunity, with applications to SARS-CoV-2. Ann. Rev. Control50, 432–447 (2020). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 7.Chen, Y.-C., Lu, P.-E., Chang, C.-S. & Liu, T.-H. A time-dependent sir model for COVID-19 with undetectable infected persons. IEEE Trans. Netw. Sci. Eng.7 (2020). [DOI] [PMC free article] [PubMed]
- 8.D’Andrea, V., Gallotti, R., Castaldo, N. & De Domenico, M. Individual risk perception and empirical social structures shape the dynamics of infectious disease outbreaks. PLoS Comput. Biol.18(2), e1009760 (2022). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 9.Gaeta, G. A simple SIR model with a large set of asymptomatic infectives. Math. Eng.3, 1–39 (2020). [Google Scholar]
- 10.Dobrovolny, H. M. Modeling the role of asymptomatics in infection spread with application to SARS-CoV-2. PLoS ONE15(8), e0236976 (2020). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 11.Espinoza, B., Marathe, M., Swarup, S. & Thakur, M. Asymptomatic individuals can increase the final epidemic size under adaptive human behavior. Nat. Sci. Rep.11, 19744 (2021). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 12.Taylor, M., Taylor, T. J. & Kiss, I. Z. Epidemic threshold and control in a dynamic network. Phys. Rev. E10.1103/physreve.85.016103 (2012). [DOI] [PubMed] [Google Scholar]
- 13.Kermack, W. O. & McKendrick, A. G. A contribution to the mathematical theory of epidemics. Proc. Royal Society A: Mathematical, Physical and Engineering Sciences115 (1927).
- 14.Holme, P. Temporal network structures controlling disease spreading. Phys. Rev. E10.1103/PhysRevE.94.022305 (2016). [DOI] [PubMed] [Google Scholar]
- 15.Cai, C.-R., Nie, Y.-Y. & Holme, P. Epidemic criticality in temporal networks. Phys. Rev. Res.6, L022017. 10.1103/PhysRevResearch.6.L022017 (2024). [Google Scholar]
- 16.Gross, T., Dommar, C. & Blasius, B. Epidemic dynamics on an adaptive network. Phys. Rev. Lett.96, 208701. 10.1103/PhysRevLett.96.208701 (2006). [DOI] [PubMed] [Google Scholar]
- 17.Bodó, A. & Simon, P. Analytic study of bifurcations of the pairwise model for sis epidemic propagation on an adaptive network. Differ. Equ. Dyn. Syst.28, 807–826 (2020). [Google Scholar]
- 18.Liu, C., Zhou, N., Zhan, X., Sun, G. & Zhang, Z. Markov-based solution for information diffusion on adaptive social networks. Appl. Math. Comput.380, 125286 (2020). [Google Scholar]
- 19.Kiss, I. Z., Berthouze, L., Taylor, T. J. & Simon, P. L. Modelling approaches for simple dynamic networks and applications to disease transmission models. Proc. Royal Soc. A468, 1332–1355 (2012). [Google Scholar]
- 20.Achterberg, M. A., Dubbeldam, J. L. A., Stam, C. J. & Van Mieghem, P. Classification of link-breaking and link-creation updating rules in susceptible-infected-susceptible epidemics on adaptive networks. Phys Rev E101 (2020). [DOI] [PubMed]
- 21.Braun, B., Taraktaş, B., Beckage, B. & Molofsky, J. Simulating phase transitions and control measures for network epidemics caused by infections with presymptomatic, asymptomatic, and symptomatic stages. PLOS ONE15, 1–14. 10.1371/journal.pone.0238412 (2020). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 22.Hota, A. R. & Gupta, K. A generalized sis epidemic model on temporal networks with asymptomatic carriers and comments on decay ratio. In 2021 American Control Conference (ACC), 3176–3181, 10.23919/ACC50511.2021.9483218 (2021).
- 23.Moradian, M., Dadlani, A., Kairgeldin, R. & Khonsari, A. Cost-effective activity control of asymptomatic carriers in layered temporal social networks. IEEE Trans. Comput. Soc. Syst.12, 1969–1982. 10.1109/TCSS.2024.3392715 (2025). [Google Scholar]
- 24.Pastor-Satorras, R., Castellano, C., Van Mieghem, P. & Vespignani, A. Epidemic processes in complex networks. Review of Modern Physics87 (2015).
- 25.Van den Driessche, P. & Watmough, J. Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission. Math. Biosci.180, 29–48 (2002). [DOI] [PubMed] [Google Scholar]
- 26.Van den Driessche, P. & Watmough, J. Further notes on the basic reproduction number. Mathematical Epidemiology, Lecture Notes in Mathematics159–178, 2008. 10.1007/978-3-540-78911-6_6 (1945). [Google Scholar]
- 27.Chai, W. K. & Pavlou, G. Path-based epidemic spreading in networks. IEEE/ACM Trans. Netw.25, 565–578 (2017). [Google Scholar]
- 28.Van Mieghem, P., Omic, J. & Kooij, R. Virus spread in networks. IEEE/ACM Trans. Netw.17 (2009).
- 29.Van Mieghem, P. The -intertwined sis epidemic network model. Computing93, 147–169 (2011). [Google Scholar]
- 30.Van Mieghem, P. Performance analysis of Complex networks and systems (Cambridge University Press, 2014).
- 31.Achterberg, M. A. & Van Mieghem, P. Moment closure approximations of susceptible-infected-susceptible epidemics on adaptive networks. Phys Rev E106 (2022). [DOI] [PubMed]
- 32.Anderson, R. M. & May, R. M. Infectious Diseases of Humans (Oxford University Press, 1991).
- 33.Diekmann, O., Heesterbeek, J. & Roberts, M. The construction of next-generation matrices for compartmental epidemic models. J R Soc Interface7(47), 873–85. 10.1098/rsif.2009.0386 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 34.Ganesh, A., Massoulié, L. & Towsley, D. The effect of network topology on the spread of epidemics. IEEE 24th Annu. Joint Conf. IEEE Comput. Commun. Soc. 1455–1466 (2005).
- 35.Wang, Y., Chakrabarti, D., Wang, C. & Faloutsos, C. Epidemic spreading in real networks: an eigenvalue viewpoint. Int’l. Symp. Reliable Distributed Systems (SRDS) 25–34 (2003).
- 36.Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J. & Faloutsos, C. Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Security10, 1–26 (2008). [Google Scholar]
- 37.Guo, D., Trajanovski, S., Van de Bovenkamp, R., Wang, H. & Van Mieghem, P. Epidemic threshold and topological structure of susceptible-infectious-susceptible epidemics in adaptive networks. Phys Rev E88 (2013). [DOI] [PubMed]
- 38.Erdős, P. & Rényi, A. On random graphs I. Publicationes Mathematicae6, 290–297 (1959). [Google Scholar]
- 39.Barabasi, A. L. & Albert, R. Emergence of scaling in random networks. Science286(5439), 509–512 (1999). [DOI] [PubMed] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Supplementary Materials
Data Availability Statement
Data generated during the current study are available from the corresponding author on reasonable request.
































































