اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCommunity-based Immunization Strategies for Epidemic Control
158
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Understanding the epidemic dynamics, and finding out efficient techniques to control it, is a challenging issue. A lot of research has been done on targeted immunization strategies, exploiting various global network topological properties. However, in practice, information about the global structure of the contact network may not be available. Therefore, immunization strategies that can deal with a limited knowledge of the network structure are required. In this paper, we propose targeted immunization strategies that require information only at the community level. Results of our investigations on the SIR epidemiological model, using a realistic synthetic benchmark with controlled community structure, show that the community structure plays an important role in the epidemic dynamics. An extensive comparative evaluation demonstrates that the proposed strategies are as efficient as the most influential global centrality based immunization strategies, despite the fact that they use a limited amount of information. Furthermore, they outperform alternative local strategies, which are agnostic about the network structure, and make decisions based on random walks.
قيم البحث
اقرأ أيضاً
Network-based interventions against epidemic spread are most powerful when the full network structure is known. However, in practice, resource constraints require decisions to be made based on partial network information. We investigated how the accu
racy of network data available at individual and village levels affected network-based vaccination effectiveness. We simulated a Susceptible-Infected-Recovered process on empirical social networks from 75 villages. First, we used regression to predict the percentage of individuals ever infected based on village-level network. Second, we simulated vaccinating 10 percent of each of the 75 empirical village networks at baseline, selecting vaccinees through one of five network-based approaches: random individuals; random contacts of random individuals; random high-degree individuals; highest degree individuals; or most central individuals. The first three approaches require only sample data; the latter two require full network data. We also simulated imposing a limit on how many contacts an individual can nominate (Fixed Choice Design, FCD), which reduces the data collection burden but generates only partially observed networks. We found mean and standard deviation of the degree distribution to strongly predict cumulative incidence. In simulations, the Nomination method reduced cumulative incidence by one-sixth compared to Random vaccination; full network methods reduced infection by two-thirds. The High Degree approach had intermediate effectiveness. Surprisingly, FCD truncating individuals degrees at three was as effective as using complete networks. Using even partial network information to prioritize vaccines at either the village or individual level substantially improved epidemic outcomes. Such approaches may be feasible and effective in outbreak settings, and full ascertainment of network structure may not be required.
We apply spectral clustering and multislice modularity optimization to a Los Angeles Police Department field interview card data set. To detect communities (i.e., cohesive groups of vertices), we use both geographic and social information about stops
involving street gang members in the LAPD district of Hollenbeck. We then compare the algorithmically detected communities with known gang identifications and argue that discrepancies are due to sparsity of social connections in the data as well as complex underlying sociological factors that blur distinctions between communities.
In this paper, we propose two novel immunization strategies, i.e., combined immunization and duplex immunization, for SIS model in directed scale-free networks, and obtain the epidemic thresholds for them with linear and nonlinear infectivities. With
the suggested two new strategies, the epidemic thresholds after immunization are greatly increased. For duplex immunization, we demonstrate that its performance is the best among all usual immunization schemes with respect to degree distribution. And for combined immunization scheme, we show that it is more effective than active immunization. Besides, we give a comprehensive theoretical analysis on applying targeted immunization to directed networks. For targeted immunization strategy, we prove that immunizing nodes with large out-degrees are more effective than immunizing nodes with large in-degrees, and nodes with both large out-degrees and large in-degrees are more worthy to be immunized than nodes with only large out-degrees or large in-degrees. Finally, some numerical analysis are performed to verify and complement our theoretical results. This work is the first to divide the whole population into different types and embed appropriate immunization scheme according to the characteristics of the population, and it will benefit the study of immunization and control of infectious diseases on complex networks.
Heterogeneous networks are networks consisting of different types of nodes and multiple types of edges linking such nodes. While community detection has been extensively developed as a useful technique for analyzing networks that contain only one typ
e of nodes, very few community detection techniques have been developed for heterogeneous networks. In this paper, we propose a modularity based community detection framework for heterogeneous networks. Unlike existing methods, the proposed approach has the flexibility to treat the number of communities as an unknown quantity. We describe a Louvain type maximization method for finding the community structure that maximizes the modularity function. Our simulation results show the advantages of the proposed method over existing methods. Moreover, the proposed modularity function is shown to be consistent under a heterogeneous stochastic blockmodel framework. Analyses of the DBLP four-area dataset and a MovieLens dataset demonstrate the usefulness of the proposed method.
Understanding the network structure, and finding out the influential nodes is a challenging issue in the large networks. Identifying the most influential nodes in the network can be useful in many applications like immunization of nodes in case of ep
idemic spreading, during intentional attacks on complex networks. A lot of research is done to devise centrality measures which could efficiently identify the most influential nodes in the network. There are two major approaches to the problem: On one hand, deterministic strategies that exploit knowledge about the overall network topology in order to find the influential nodes, while on the other end, random strategies are completely agnostic about the network structure. Centrality measures that can deal with a limited knowledge of the network structure are required. Indeed, in practice, information about the global structure of the overall network is rarely available or hard to acquire. Even if available, the structure of the network might be too large that it is too much computationally expensive to calculate global centrality measures. To that end, a centrality measure is proposed that requires information only at the community level to identify the influential nodes in the network. Indeed, most of the real-world networks exhibit a community structure that can be exploited efficiently to discover the influential nodes. We performed a comparative evaluation of prominent global deterministic strategies together with stochastic strategies with an available and the proposed deterministic community-based strategy. Effectiveness of the proposed method is evaluated by performing experiments on synthetic and real-world networks with community structure in the case of immunization of nodes for epidemic control.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
