ترغب بنشر مسار تعليمي؟ اضغط هنا

Resilience of epidemics on networks

103   0   0.0 ( 0 )
 نشر من قبل Dan Lu
 تاريخ النشر 2016
والبحث باللغة English
 تأليف Dan Lu




اسأل ChatGPT حول البحث

Epidemic propagation on complex networks has been widely investigated, mostly with invariant parameters. However, the process of epidemic propagation is not always constant. Epidemics can be affected by various perturbations, and may bounce back to its original state, which is considered resilient. Here, we study the resilience of epidemics on networks, by introducing a different infection rate ${lambda_{2}}$ during SIS (susceptible-infected-susceptible) epidemic propagation to model perturbations (control state), whereas the infection rate is ${lambda_{1}}$ in the rest of time. Through simulations and theoretical analysis, we find that even for ${lambda_{2}<lambda_{c}}$, epidemics eventually could bounce back if control duration is below a threshold. This critical control time for epidemic resilience, i.e., ${cd_{max}}$ can be predicted by the diameter (${d}$) of the underlying network, with the quantitative relation ${cd_{max}sim d^{alpha}}$. Our findings can help to design a better mitigation strategy for epidemics.



قيم البحث

اقرأ أيضاً

390 - Liubov Tupikina 2017
Here we developed a new conceptual, stochastic Heterogeneous Opinion-Status model (HOpS model), which is adaptive network model. The HOpS model admits to identify the main attributes of dynamics on networks and to study analytically the relation betw een topological network properties and processes taking place on a network. Another key point of the HOpS model is the possibility to study network dynamics via the novel parameter of heterogeneity. We show that not only clear topological network properties, such as node degree, but also, the nodes status distribution (the factor of network heterogeneity) play an important role in so-called opinion spreading and information diffusion on a network. This model can be potentially used for studying the co-evolution of globally aggregated or averaged key observables of the earth system. These include natural variables such as atmospheric, oceanic and land carbon stocks, as well as socio-economic quantities such as global human population, economic production or wellbeing.
We use the information present in a bipartite network to detect cores of communities of each set of the bipartite system. Cores of communities are found by investigating statistically validated projected networks obtained using information present in the bipartite network. Cores of communities are highly informative and robust with respect to the presence of errors or missing entries in the bipartite network. We assess the statistical robustness of cores by investigating an artificial benchmark network, the co-authorship network, and the actor-movie network. The accuracy and precision of the partition obtained with respect to the reference partition are measured in terms of the adjusted Rand index and of the adjusted Wallace index respectively. The detection of cores is highly precise although the accuracy of the methodology can be limited in some cases.
The spread of an infection on a real-world social network is determined by the interplay of two processes: the dynamics of the network, whose structure changes over time according to the encounters between individuals, and the dynamics on the network , whose nodes can infect each other after an encounter. Physical encounter is the most common vehicle for the spread of infectious diseases, but detailed information about encounters is often unavailable because expensive, unpractical to collect or privacy sensitive. We asks whether the friendship ties between the individuals in a social network successfully predict who is at risk. Using a dataset from a popular online review service, we build a time-varying network that is a proxy of physical encounter between users and a static network based on reported friendship. Through computer simulations, we compare infection processes on the resulting networks and show that, whereas distance on the friendship network is correlated to epidemic risk, friendship provides a poor identification of the individuals at risk if the infection is driven by physical encounter. Such limit is not due to the randomness of the infection, but to the structural differences of the two networks. In contrast to the macroscopic similarity between processes spreading on different networks, the differences in local connectivity determined by the two definitions of edges result in striking differences between the dynamics at a microscopic level. Despite the limits highlighted, we show that periodical and relatively infrequent monitoring of the real infection on the encounter network allows to correct the predicted infection on the friendship network and to achieve satisfactory prediction accuracy. In addition, the friendship network contains valuable information to effectively contain epidemic outbreaks when a limited budget is available for immunization.
Modern world builds on the resilience of interdependent infrastructures characterized as complex networks. Recently, a framework for analysis of interdependent networks has been developed to explain the mechanism of resilience in interdependent netwo rks. Here we extend this interdependent network model by considering flows in the networks and study the systems resilience under different attack strategies. In our model, nodes may fail due to either overload or loss of interdependency. Under the interaction between these two failure mechanisms, it is shown that interdependent scale-free networks show extreme vulnerability. The resilience of interdependent SF networks is found in our simulation much smaller than single SF network or interdependent SF networks without flows.
We bring rigor to the vibrant activity of detecting power laws in empirical degree distributions in real-world networks. We first provide a rigorous definition of power-law distributions, equivalent to the definition of regularly varying distribution s that are widely used in statistics and other fields. This definition allows the distribution to deviate from a pure power law arbitrarily but without affecting the power-law tail exponent. We then identify three estimators of these exponents that are proven to be statistically consistent -- that is, converging to the true value of the exponent for any regularly varying distribution -- and that satisfy some additional niceness requirements. In contrast to estimators that are currently popular in network science, the estimators considered here are based on fundamental results in extreme value theory, and so are the proofs of their consistency. Finally, we apply these estimators to a representative collection of synthetic and real-world data. According to their estimates, real-world scale-free networks are definitely not as rare as one would conclude based on the popular but unrealistic assumption that real-world data comes from power laws of pristine purity, void of noise and deviations.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا