相关论文: Universal mean-field framework for SIS epidemics o…
We present a quenched mean-field (QMF) theory for the dynamics of the susceptible-infected-susceptible (SIS) epidemic model on complex networks where dynamical correlations between connected vertices are taken into account by means of a…
The epidemic spreading has been studied for years by applying the mean-field approach in both homogeneous case, where each node may get infected by an infected neighbor with the same rate, and heterogeneous case, where the infection rates…
Epidemic threshold is one of the most important features of the epidemic dynamics. Through a lot of numerical simulations in classic Susceptible-Infected-Recovered (SIR) and Susceptible-Infected-Susceptible (SIS) models on various types of…
We use the pair heterogeneous mean-field (PHMF) approximation for an asynchronous version of the susceptible-infected-removed (SIR) model to estimate the epidemic thresholds on complex quenched networks. Our results indicate an improvement…
We present a comparison between stochastic simulations and mean-field theories for the epidemic threshold of the susceptible-infected-susceptible (SIS) model on correlated networks (both assortative and disassortative) with power-law degree…
We study the evolution of a general class of stochastic processes (containing, e.g. SIS and SIR models) on large random networks, focusing on a particular general class of random graph models. To approximate the expected dynamics of these…
Exploiting the power of the expectation operator and indicator (or Bernoulli) random variables, we present the exact governing equations for both the SIR and SIS epidemic models on \emph{networks}. Although SIR and SIS are basic epidemic…
Recent work has shown that different theoretical approaches to the dynamics of the Susceptible-Infected-Susceptible (SIS) model for epidemics lead to qualitatively different estimates for the position of the epidemic threshold in networks.…
We provide error bounds for the N-intertwined mean-field approximation (NIMFA) for local density-dependent Markov population processes with a well-distributed underlying network structure showing NIMFA being accurate when a typical vertex…
Researchers have developed several theoretical methods for predicting epidemic thresholds, including the mean-field like (MFL) method, the quenched mean-field (QMF) method, and the dynamical message passing (DMP) method. When these methods…
Epidemic models are increasingly used in real-world networks to understand diffusion phenomena (such as the spread of diseases, emotions, innovations, failures) or the transport of information (such as news, memes in social on-line…
We study the Susceptible-Infectious-Susceptible (SIS) model on arbitrary networks. The well-established pair approximation treats neighboring pairs of nodes exactly while making a mean field approximation for the rest of the network. We…
Epidemic spreading has been intensively studied in SIS epidemic model. Although the mean-field theory of SIS model has been widely used in the research, there is a lack of comparative results between different theoretical calculations, and…
In network-based SIS models of infectious disease transmission, infection can only occur between directly connected individuals. This constraint naturally gives rise to spatial correlations between the states of neighboring nodes, as the…
We propose a generalization of the adaptive N-Intertwined Mean-Field Approximation (aNIMFA) model studied in Achterberg and Sensi (2023) to a heterogeneous network of communities. In particular, the multigroup aNIMFA model describes the…
We are investigating deterministic SIS dynamics on large networks starting from only a few infected individuals. Under mild assumptions we show that any two epidemic curves - on the same network and with the same parameters - are almost…
Many real-world phenomena can be modelled as dynamical processes on networks, a prominent example being the spread of infectious diseases such as COVID-19. Mean-field approximations are a widely used tool to analyse such dynamical processes…
The mean field algorithm is a widely used approximate inference algorithm for graphical models whose exact inference is intractable. In each iteration of mean field, the approximate marginals for each variable are updated by getting…
In this paper we use comparison theorems from classical ODE theory in order to rigorously show that the N-Intertwined Mean-Field Approximation (NIMFA) model provides an upper estimate on the exact stochastic process. The proof of the…
We study Markov processes on weighted directed hypergraphs where the state of at most one vertex can change at a time. Our setting is general enough to include simplicial epidemic processes, processes on multilayered networks or even the…