Related papers: The contact process with semi-infected state on th…
We consider contact processes on the hierarchical group, where sites infect other sites at a rate depending on their hierarchical distance, and sites become healthy with a constant recovery rate. If the infection rates decay too fast as a…
In this paper a new parameter for hypergraphs called hypergraph infection is defined. This concept generalizes zero forcing in graphs to hypergraphs. The exact value of the infection number of complete and complete bipartite hypergraphs is…
The contact process is a simple infection spreading model showcasing an out-of-equilibrium phase transition between a macroscopically active and an inactive phase. Such absorbing state phase transitions are often sensitive to the presence…
We study the effects of local and distance interactions in the unidimensional contact process (CP). In the model, each site of a lattice is occupied by an individual, which can be healthy or infected. As in the standard CP, each infected…
In this paper, we are concerned with the stochastic susceptible-infectious-susceptible (SIS) epidemic model on the complete graph with $n$ vertices. This model has two parameters, which are the infection rate and the recovery rate. By…
We study the diffusion of epidemics on networks that are partitioned into local communities. The gross structure of hierarchical networks of this kind can be described by a quotient graph. The rationale of this approach is that individuals…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
One of the popular dynamics on complex networks is the epidemic spreading. An epidemic model describes how infections spread throughout a network. Among the compartmental models used to describe epidemics, the…
The history of infections and epidemics holds famous examples where understanding, containing and ultimately treating an outbreak began with understanding its mode of spread. Influenza, HIV and most computer viruses, spread person to…
Our study is devoted to a four-compartment epidemic model of a constant population of independent random walkers. Each walker is in one of four compartments (S-susceptible, C-infected but not infectious (period of incubation), I-infected…
For rapidly spreading diseases where many cases show no symptoms, swift and effective contact tracing is essential. While exposure notification applications provide alerts on potential exposures, a fully automated system is needed to track…
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…
We examine how the behaviour of high degree vertices in a network affects whether an infection spreads through communities or jumps between them. We study two stochastic susceptible-infected-recovered (SIR) processes and represent our…
We study the activation process in undirected graphs known as bootstrap percolation: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it had at least r active neighbors, for a threshold r…
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{\'e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a…
The spread of an infection, a contagion, meme, emotion, message and various other spreadable objects have been discussed in several works. Burning and firefighting have been discussed in particular on static graphs. Graph burning simulates…
We formulate and analyze a novel hypothesis testing problem for inferring the edge structure of an infection graph. In our model, a disease spreads over a network via contagion or random infection, where the random variables governing the…
We introduce the discrete-time treatment number of a graph, in which each vertex is in exactly one of three states at any given time-step: compromised, vulnerable, or treated. Our treatment number is distinct from other graph searching…
We construct graphs (trees of bounded degree) on which the contact process has critical rate (which will be the same for both global and local survival) equal to any prescribed value between zero and $\lambda_c(\mathbb{Z})$, the critical…
We study the spreading of an infection within an SIS epidemiological model on a network. Susceptible agents are given the opportunity of breaking their links with infected agents, and reconnecting those links with the rest of the…