Related papers: A note on the cooperative two-type SIR processes o…
We show existence of a non-trivial phase transition for the contact process, a simple model for infection without immunity, on a network which reacts dynamically to the infection trying to prevent an epidemic. This network initially has the…
In this paper we are concerned with the SIR (Susceptible-Infective-Removed) epidemic on open clusters of bond percolation on the squared lattice. For the SIR model, a susceptible vertex is infected at rate proportional to the number of…
We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k\leq n^{\epsilon}$, where $n$ is the number of vertices in the random graph, and $\epsilon$…
In this paper, we propose a modified susceptible-infected-recovered (SIR) model, in which each node is assigned with an identical capability of active contacts, $A$, at each time step. In contrast to the previous studies, we find that on…
We study two simple mathematical models of the epidemic. At first, we study the repetitive infection spreading in a simplified SIRS model including the effect of the decay of the acquired immune. The model is an intermediate model of the…
Infectious diseases spread through human networks. Susceptible-Infected-Removed (SIR) model is one of the epidemic models to describe infection dynamics on a complex network connecting individuals. In the metapopulation SIR model, each node…
Multiple viruses are widely studied because of their negative effect on the health of host as well as on whole population. The dynamics of coinfection is important in this case. We formulated a SIR model that describes the coinfection of…
We study SIR type epidemics on graphs in two scenarios: (i) when the initial infections start from a well connected central region, (ii) when initial infections are distributed uniformly. Previously, \'Odor et al. demonstrated on a few…
In a collection of particles performing independent random walks on $\mathbb Z^d$ we study the spread of an infection with SIR dynamics. Susceptible particles become infected when they meet an infected particle. Infected particles heal and…
We study a susceptible-infected-removed (SIR) model with multiple seeds on a regular random graph. Many researchers have studied the epidemic threshold of epidemic models above which a global outbreak can occur, starting from an…
We study the classic Susceptible-Infected-Recovered (SIR) model for the spread of an infectious disease. In this stochastic process, there are two competing mechanism: infection and recovery. Susceptible individuals may contract the disease…
An epidemic model where disease transmission can occur either through global contacts or through local, nearest neighbor interactions is considered. The classical SIR--model describing the global interactions is extended by adding…
In this paper, we study the trajectory of a classic SIR epidemic on a family of dynamic random graphs of fixed size, whose set of edges continuously evolves over time. We set general infection and recovery times, and start the epidemic from…
We couple a multi-type stochastic epidemic process with a directed random graph, where edges have random lengths. This random graph representation is used to characterise the fractions of individuals infected by the different types of…
The spread of an infectious disease can, in some cases, promote the propagation of other pathogens favouring violent outbreaks, which cause a discontinuous transition to an endemic state. The topology of the contact network plays a crucial…
We analyze the Susceptible-Infected-Recovered-Susceptible (SIRS) process, a continuous-time Markov chain frequently employed in epidemiology to model the spread of infections on networks. In this framework, infections spread as infected…
We consider the Susceptible-Infected-Recovered (SIR) epidemic model on a Euclidean network in one dimension in which nodes at a distance $l$ are connected with probability $P(l) \propto l^{-\delta}$ in addition to nearest neighbors. The…
To simplify mathematical models of disease spread, we often assume equal contact rates among hosts, but real-world scenarios differ. Network-based frameworks help capture these complexities and structural variations in actual systems. We…
In this paper, we study the spread of a classical SIR process on a two-layer random network, where the first layer represents the households, while the second layer models the contacts outside the households by a random scale-free graph. We…
We propose a new paradigm to design a network-based self-adaptive epidemic model that relies on the interplay between the network and its line graph. We implement this proposal on a Susceptible-Infected-Susceptible model in which both nodes…