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

Epidemic Spreading on Activity-Driven Networks with Attractiveness

86   0   0.0 ( 0 )
 نشر من قبل Nicola Perra
 تاريخ النشر 2017
والبحث باللغة English




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

We study SIS epidemic spreading processes unfolding on a recent generalisation of the activity-driven modelling framework. In this model of time-varying networks each node is described by two variables: activity and attractiveness. The first, describes the propensity to form connections. The second, defines the propensity to attract them. We derive analytically the epidemic threshold considering the timescale driving the evolution of contacts and the contagion as comparable. The solutions are general and hold for any joint distribution of activity and attractiveness. The theoretical picture is confirmed via large-scale numerical simulations performed considering heterogeneous distributions and different correlations between the two variables. We find that heterogeneous distributions of attractiveness alter the contagion process. In particular, in case of uncorrelated and positive correlations between the two variables, heterogeneous attractiveness facilitates the spreading. On the contrary, negative correlations between activity and attractiveness hamper the spreading. The results presented contribute to the understanding of the dynamical properties of time-varying networks and their effects on contagion phenomena unfolding on their fabric.



قيم البحث

اقرأ أيضاً

164 - Han-Xin Yang , Ming Tang , 2015
In spite of the extensive previous efforts on traffic dynamics and epidemic spreading in complex networks, the problem of traffic-driven epidemic spreading on {em correlated} networks has not been addressed. Interestingly, we find that the epidemic t hreshold, a fundamental quantity underlying the spreading dynamics, exhibits a non-monotonic behavior in that it can be minimized for some critical value of the assortativity coefficient, a parameter characterizing the network correlation. To understand this phenomenon, we use the degree-based mean-field theory to calculate the traffic-driven epidemic threshold for correlated networks. The theory predicts that the threshold is inversely proportional to the packet-generation rate and the largest eigenvalue of the betweenness matrix. We obtain consistency between theory and numerics. Our results may provide insights into the important problem of controlling/harnessing real-world epidemic spreading dynamics driven by traffic flows.
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously distributed. Here, we present a time-varying network model where each node and the dynamical formation of ties are characterised by these two features. We study how these properties affect random walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable. We derive analytical solutions for the stationary state and the mean first passage time of the process and we study cases informed by empirical observations of social networks. Our work shows that previously disregarded properties of real social systems such heterogeneous distributions of activity and attractiveness as well as the correlations between them, substantially affect the dynamical process unfolding on the network.
Social interactions are stratified in multiple contexts and are subject to complex temporal dynamics. The systematic study of these two features of social systems has started only very recently mainly thanks to the development of multiplex and time-v arying networks. However, these two advancements have progressed almost in parallel with very little overlap. Thus, the interplay between multiplexity and the temporal nature of connectivity patterns is poorly understood. Here, we aim to tackle this limitation by introducing a time-varying model of multiplex networks. We are interested in characterizing how these two properties affect contagion processes. To this end, we study SIS epidemic models unfolding at comparable time-scale respect to the evolution of the multiplex network. We study both analytically and numerically the epidemic threshold as a function of the overlap between, and the features of, each layer. We found that, the overlap between layers significantly reduces the epidemic threshold especially when the temporal activation patterns of overlapping nodes are positively correlated. Furthermore, when the average connectivity across layers is very different, the contagion dynamics are driven by the features of the more densely connected layer. Here, the epidemic threshold is equivalent to that of a single layered graph and the impact of the disease, in the layer driving the contagion, is independent of the overlap. However, this is not the case in the other layers where the spreading dynamics are sharply influenced by it. The results presented provide another step towards the characterization of the properties of real networks and their effects on contagion phenomena
We consider an epidemic process on adaptive activity-driven temporal networks, with adaptive behaviour modelled as a change in activity and attractiveness due to infection. By using a mean-field approach, we derive an analytical estimate of the epide mic threshold for SIS and SIR epidemic models for a general adaptive strategy, which strongly depends on the correlations between activity and attractiveness in the susceptible and infected states. We focus on strong social distancing, implementing two types of quarantine inspired by recent real case studies: an active quarantine, in which the population compensates the loss of links rewiring the ineffective connections towards non-quarantining nodes, and an inactive quarantine, in which the links with quarantined nodes are not rewired. Both strategies feature the same epidemic threshold but they strongly differ in the dynamics of active phase. We show that the active quarantine is extremely less effective in reducing the impact of the epidemic in the active phase compared to the inactive one, and that in SIR model a late adoption of measures requires inactive quarantine to reach containment.
Time-varying network topologies can deeply influence dynamical processes mediated by them. Memory effects in the pattern of interactions among individuals are also known to affect how diffusive and spreading phenomena take place. In this paper we ana lyze the combined effect of these two ingredients on epidemic dynamics on networks. We study the susceptible-infected-susceptible (SIS) and the susceptible-infected-removed (SIR) models on the recently introduced activity-driven networks with memory. By means of an activity-based mean-field approach we derive, in the long time limit, analytical predictions for the epidemic threshold as a function of the parameters describing the distribution of activities and the strength of the memory effects. Our results show that memory reduces the threshold, which is the same for SIS and SIR dynamics, therefore favouring epidemic spreading. The theoretical approach perfectly agrees with numerical simulations in the long time asymptotic regime. Strong aging effects are present in the preasymptotic regime and the epidemic threshold is deeply affected by the starting time of the epidemics. We discuss in detail the origin of the model-dependent preasymptotic corrections, whose understanding could potentially allow for epidemic control on correlated temporal networks.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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