Related papers: Percolation and Epidemic Processes in One-Dimensio…
The spread of viruses in biological networks, computer networks, and human contact networks can have devastating effects; developing and analyzing mathematical models of these systems can be insightful and lead to societal benefits. Prior…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
Networks and dynamical processes occurring on them have become a paradigmatic representation of complex systems. Studying the role of quenched disorder, both intrinsic to nodes and topological, is a key challenge. With this in mind, here we…
In this paper, we use a series of small world networks to simulate the epidemic spreading in the real world. To make our model more similar to the real world, we employ a parameter $p_{move}$ to denote its moving probability, which…
We propose a multistage version of the independent cascade model, which we call a multistage independent cascade (MIC) model, on networks. This model is parameterized by two probabilities: the probability $T_1$ that a node adopting a fad…
One-dependent first passage percolation is a spreading process on a graph where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the classical iid transmission time $L_{xy}$ is…
We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…
We study seasonal epidemic spreading in a susceptible-infected-removed-susceptible (SIRS) model on smallworld graphs. We derive a mean-field description that accurately captures the salient features of the model, most notably a phase…
This letter investigates the multiple routes transmitted epidemic process on multiplex networks. We propose detailed theoretical analysis that allows us to accurately calculate the epidemic threshold and outbreak size. It is found that the…
We study the effect of the connectivity pattern of complex networks on the propagation dynamics of epidemics. The growth time scale of outbreaks is inversely proportional to the network degree fluctuations, signaling that epidemics spread…
This paper considers the dynamics of edges in a network. The Dynamic Bond Percolation (DBP) process models, through stochastic local rules, the dependence of an edge $(a,b)$ in a network on the states of its neighboring edges. Unlike…
We study the spread of discrete-time epidemics over arbitrary networks for well-known propagation models, namely SIS (susceptible-infected-susceptible), SIR (susceptible-infected-recovered), SIRS (susceptible-infected-recovered-susceptible)…
Many dynamic processes on complex networks, from disease outbreaks to cascading failures, can rapidly accelerate once a critical threshold is exceeded, potentially leading to severe social and economic costs. Therefore, in order to develop…
Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network,…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
The bootstrap percolation (or threshold model) is a dynamic process modelling the propagation of an epidemic on a graph, where inactive vertices become active if their number of active neighbours reach some threshold. We study an…
Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…
We propose a model for epidemic spreading on a finite complex network with a restriction to at most one contamination per time step. Because of a highly discrete character of the process, the analysis cannot use the continous approximation,…
For fixed $r\geq 2$, we consider bootstrap percolation with threshold $r$ on the Erd\H{o}s-R\'enyi graph ${\cal G}_{n,p}$. We identify a threshold for $p$ above which there is with high probability a set of size $r$ which can infect the…
In the recent COVID-19 pandemic we assisted at a sequence of epidemic waves intertwined by anomalous fade-outs with periods of low but persistent epidemic prevalence. These long-living epidemic states complicate epidemic control and…