首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 484 毫秒
1.
The dynamical process of epidemic spreading has drawn much attention of the complex network community. In the network paradigm, diseases spread from one person to another through the social ties amongst the population. There are a variety of factors that govern the processes of disease spreading on the networks. A common but not negligible factor is people’s reaction to the outbreak of epidemics. Such reaction can be related information dissemination or self-protection. In this work, we explore the interactions between disease spreading and population response in terms of information diffusion and individuals’ alertness. We model the system by mapping multiplex networks into two-layer networks and incorporating individuals’ risk awareness, on the assumption that their response to the disease spreading depends on the size of the community they belong to. By comparing the final incidence of diseases in multiplex networks, we find that there is considerable mitigation of diseases spreading for full phase of spreading speed when individuals’ protection responses are introduced. Interestingly, the degree of community overlap between the two layers is found to be critical factor that affects the final incidence. We also analyze the consequences of the epidemic incidence in communities with different sizes and the impacts of community overlap between two layers. Specifically, as the diseases information makes individuals alert and take measures to prevent the diseases, the effective protection is more striking in small community. These phenomena can be explained by the multiplexity of the networked system and the competition between two spreading processes.  相似文献   

2.
We investigate how scale-free (SF) and Erd?s-Rényi (ER) topologies affect the interplay between evolvability and robustness of model gene regulatory networks with Boolean threshold dynamics. In agreement with Oikonomou and Cluzel (2006) we find that networks with SFin topologies, that is SF topology for incoming nodes and ER topology for outgoing nodes, are significantly more evolvable towards specific oscillatory targets than networks with ER topology for both incoming and outgoing nodes. Similar results are found for networks with SFboth and SFout topologies. The functionality of the SFout topology, which most closely resembles the structure of biological gene networks (Babu et al., 2004), is compared to the ER topology in further detail through an extension to multiple target outputs, with either an oscillatory or a non-oscillatory nature. For multiple oscillatory targets of the same length, the differences between SFout and ER networks are enhanced, but for non-oscillatory targets both types of networks show fairly similar evolvability. We find that SF networks generate oscillations much more easily than ER networks do, and this may explain why SF networks are more evolvable than ER networks are for oscillatory phenotypes. In spite of their greater evolvability, we find that networks with SFout topologies are also more robust to mutations (mutational robustness) than ER networks. Furthermore, the SFout topologies are more robust to changes in initial conditions (environmental robustness). For both topologies, we find that once a population of networks has reached the target state, further neutral evolution can lead to an increase in both the mutational robustness and the environmental robustness to changes in initial conditions.  相似文献   

3.
Dynamics and Control of Diseases in Networks with Community Structure   总被引:1,自引:0,他引:1  
The dynamics of infectious diseases spread via direct person-to-person transmission (such as influenza, smallpox, HIV/AIDS, etc.) depends on the underlying host contact network. Human contact networks exhibit strong community structure. Understanding how such community structure affects epidemics may provide insights for preventing the spread of disease between communities by changing the structure of the contact network through pharmaceutical or non-pharmaceutical interventions. We use empirical and simulated networks to investigate the spread of disease in networks with community structure. We find that community structure has a major impact on disease dynamics, and we show that in networks with strong community structure, immunization interventions targeted at individuals bridging communities are more effective than those simply targeting highly connected individuals. Because the structure of relevant contact networks is generally not known, and vaccine supply is often limited, there is great need for efficient vaccination algorithms that do not require full knowledge of the network. We developed an algorithm that acts only on locally available network information and is able to quickly identify targets for successful immunization intervention. The algorithm generally outperforms existing algorithms when vaccine supply is limited, particularly in networks with strong community structure. Understanding the spread of infectious diseases and designing optimal control strategies is a major goal of public health. Social networks show marked patterns of community structure, and our results, based on empirical and simulated data, demonstrate that community structure strongly affects disease dynamics. These results have implications for the design of control strategies.  相似文献   

4.
Hadidjojo J  Cheong SA 《PloS one》2011,6(7):e22124
Controlling severe outbreaks remains the most important problem in infectious disease area. With time, this problem will only become more severe as population density in urban centers grows. Social interactions play a very important role in determining how infectious diseases spread, and organization of people along social lines gives rise to non-spatial networks in which the infections spread. Infection networks are different for diseases with different transmission modes, but are likely to be identical or highly similar for diseases that spread the same way. Hence, infection networks estimated from common infections can be useful to contain epidemics of a more severe disease with the same transmission mode. Here we present a proof-of-concept study demonstrating the effectiveness of epidemic mitigation based on such estimated infection networks. We first generate artificial social networks of different sizes and average degrees, but with roughly the same clustering characteristic. We then start SIR epidemics on these networks, censor the simulated incidences, and use them to reconstruct the infection network. We then efficiently fragment the estimated network by removing the smallest number of nodes identified by a graph partitioning algorithm. Finally, we demonstrate the effectiveness of this targeted strategy, by comparing it against traditional untargeted strategies, in slowing down and reducing the size of advancing epidemics.  相似文献   

5.
Identification of communities in complex networks is an important topic and issue in many fields such as sociology, biology, and computer science. Communities are often defined as groups of related nodes or links that correspond to functional subunits in the corresponding complex systems. While most conventional approaches have focused on discovering communities of nodes, some recent studies start partitioning links to find overlapping communities straightforwardly. In this paper, we propose a new quantity function for link community identification in complex networks. Based on this quantity function we formulate the link community partition problem into an integer programming model which allows us to partition a complex network into overlapping communities. We further propose a genetic algorithm for link community detection which can partition a network into overlapping communities without knowing the number of communities. We test our model and algorithm on both artificial networks and real-world networks. The results demonstrate that the model and algorithm are efficient in detecting overlapping community structure in complex networks.  相似文献   

6.
Abstract

Complex network analysis has received increasing interest in recent years, which provides a remarkable tool to describe complex systems of interacting entities, particular for biological systems. In this paper, we propose a methodology for identifying the significant nodes of the networks, including core nodes, bridge nodes and high-influential nodes, based on the idea of community and two new ranking measures, InterRank and IntraRank. The results show the significant nodes form a small number in biological networks, and uncover the relative small number of which has advantage for reducing the dimensions of the network and possibly help to define new biological targets.  相似文献   

7.
Much recent modelling is focusing on epidemics in large-scale complex networks. Whether or not findings of these investigations also apply to networks of small size is still an open question. This is an important gap for many biological applications, including the spread of the oomycete pathogen Phytophthora ramorum in networks of plant nurseries. We use numerical simulations of disease spread and establishment in directed networks of 100 individual nodes at four levels of connectivity. Factors governing epidemic spread are network structure (local, small-world, random, scale-free) and the probabilities of infection persistence in a node and of infection transmission between connected nodes. Epidemic final size at equilibrium varies widely depending on the starting node of infection, although the latter does not affect the threshold condition for spread. The number of links from (out-degree) but not the number of links to (in-degree) the starting node of the epidemic explains a substantial amount of variation in final epidemic size at equilibrium irrespective of the structure of the network. The proportion of variance in epidemic size explained by the out-degree of the starting node increases with the level of connectivity. Targeting highly connected nodes is thus likely to make disease control more effective also in case of small-size populations, a result of relevance not just for the horticultural trade, but for epidemiology in general.  相似文献   

8.
A growing number of studies are investigating the effect of contact structure on the dynamics of epidemics in large-scale complex networks. Whether findings thus obtained apply also to networks of small size, and thus to many real-world biological applications, is still an open question. We use numerical simulations of disease spread in directed networks of 100 individual nodes with a constant number of links. We show that, no matter the type of network structure (local, small-world, random and scale-free), there is a linear threshold determined by the probability of infection transmission between connected nodes and the probability of infection persistence in an infected node. The threshold is significantly lower for scale-free networks compared to local, random and small-world ones only if super-connected nodes have a higher number of links both to and from other nodes. The starting point, the node at which the epidemic starts, does not affect the threshold conditions, but has a marked influence on the final size of the epidemic in all kinds of network. There is evidence that contact structure has an influence on the average final size of an epidemic across all starting nodes, with significantly lower values in scale-free networks at equilibrium. Simulations in scale-free networks show a distinctive time-series pattern, which, if found in a real epidemic, can be used to infer the underlying network structure. The findings have relevance also for meta-population ecology and species conservation.  相似文献   

9.
Jo HH  Pan RK  Kaski K 《PloS one》2011,6(8):e22687
Understanding the patterns of human dynamics and social interaction and the way they lead to the formation of an organized and functional society are important issues especially for techno-social development. Addressing these issues of social networks has recently become possible through large scale data analysis of mobile phone call records, which has revealed the existence of modular or community structure with many links between nodes of the same community and relatively few links between nodes of different communities. The weights of links, e.g., the number of calls between two users, and the network topology are found correlated such that intra-community links are stronger compared to the weak inter-community links. This feature is known as Granovetter's "The strength of weak ties" hypothesis. In addition to this inhomogeneous community structure, the temporal patterns of human dynamics turn out to be inhomogeneous or bursty, characterized by the heavy tailed distribution of time interval between two consecutive events, i.e., inter-event time. In this paper, we study how the community structure and the bursty dynamics emerge together in a simple evolving weighted network model. The principal mechanisms behind these patterns are social interaction by cyclic closure, i.e., links to friends of friends and the focal closure, links to individuals sharing similar attributes or interests, and human dynamics by task handling process. These three mechanisms have been implemented as a network model with local attachment, global attachment, and priority-based queuing processes. By comprehensive numerical simulations we show that the interplay of these mechanisms leads to the emergence of heavy tailed inter-event time distribution and the evolution of Granovetter-type community structure. Moreover, the numerical results are found to be in qualitative agreement with empirical analysis results from mobile phone call dataset.  相似文献   

10.
In this paper, we present algorithms to find near-optimal sets of epidemic spreaders in complex networks. We extend the notion of local-centrality, a centrality measure previously shown to correspond with a node''s ability to spread an epidemic, to sets of nodes by introducing combinatorial local centrality. Though we prove that finding a set of nodes that maximizes this new measure is NP-hard, good approximations are available. We show that a strictly greedy approach obtains the best approximation ratio unless P = NP and then formulate a modified version of this approach that leverages qualities of the network to achieve a faster runtime while maintaining this theoretical guarantee. We perform an experimental evaluation on samples from several different network structures which demonstrate that our algorithm maximizes combinatorial local centrality and consistently chooses the most effective set of nodes to spread infection under the SIR model, relative to selecting the top nodes using many common centrality measures. We also demonstrate that the optimized algorithm we develop scales effectively.  相似文献   

11.
Network frailty and the geometry of herd immunity   总被引:2,自引:0,他引:2  
The spread of infectious disease through communities depends fundamentally on the underlying patterns of contacts between individuals. Generally, the more contacts one individual has, the more vulnerable they are to infection during an epidemic. Thus, outbreaks disproportionately impact the most highly connected demographics. Epidemics can then lead, through immunization or removal of individuals, to sparser networks that are more resistant to future transmission of a given disease. Using several classes of contact networks-Poisson, scale-free and small-world-we characterize the structural evolution of a network due to an epidemic in terms of frailty (the degree to which highly connected individuals are more vulnerable to infection) and interference (the extent to which the epidemic cuts off connectivity among the susceptible population that remains following an epidemic). The evolution of the susceptible network over the course of an epidemic differs among the classes of networks; frailty, relative to interference, accounts for an increasing component of network evolution on networks with greater variance in contacts. The result is that immunization due to prior epidemics can provide greater community protection than random vaccination on networks with heterogeneous contact patterns, while the reverse is true for highly structured populations.  相似文献   

12.
A relationship between people's mobility and their social networks is presented based on an analysis of calling and mobility traces for one year of anonymized call detail records of over one million mobile phone users in Portugal. We find that about 80% of places visited are within just 20 km of their nearest (geographical) social ties' locations. This figure rises to 90% at a 'geo-social radius' of 45 km. In terms of their travel scope, people are geographically closer to their weak ties than strong ties. Specifically, they are 15% more likely to be at some distance away from their weak ties than strong ties. The likelihood of being at some distance from social ties increases with the population density, and the rates of increase are higher for shorter geo-social radii. In addition, we find that area population density is indicative of geo-social radius where denser areas imply shorter radii. For example, in urban areas such as Lisbon and Porto, the geo-social radius is approximately 7 km and this increases to approximately 15 km for less densely populated areas such as Parades and Santa Maria da Feira.  相似文献   

13.
In social networks, it is conventionally thought that two individuals with more overlapped friends tend to establish a new friendship, which could be stated as homophily breeding new connections. While the recent hypothesis of maximum information entropy is presented as the possible origin of effective navigation in small-world networks. We find there exists a competition between information entropy maximization and homophily in local structure through both theoretical and experimental analysis. This competition suggests that a newly built relationship between two individuals with more common friends would lead to less information entropy gain for them. We demonstrate that in the evolution of the social network, both of the two assumptions coexist. The rule of maximum information entropy produces weak ties in the network, while the law of homophily makes the network highly clustered locally and the individuals would obtain strong and trust ties. A toy model is also presented to demonstrate the competition and evaluate the roles of different rules in the evolution of real networks. Our findings could shed light on the social network modeling from a new perspective.  相似文献   

14.
On March 23 2020, the UK enacted an intensive, nationwide lockdown to mitigate transmission of COVID-19. As restrictions began to ease, more localized interventions were used to target resurgences in transmission. Understanding the spatial scale of networks of human interaction, and how these networks change over time, is critical to targeting interventions at the most at-risk areas without unnecessarily restricting areas at low risk of resurgence. We use detailed human mobility data aggregated from Facebook users to determine how the spatially-explicit network of movements changed before and during the lockdown period, in response to the easing of restrictions, and to the introduction of locally-targeted interventions. We also apply community detection techniques to the weighted, directed network of movements to identify geographically-explicit movement communities and measure the evolution of these community structures through time. We found that the mobility network became more sparse and the number of mobility communities decreased under the national lockdown, a change that disproportionately affected long distance connections central to the mobility network. We also found that the community structure of areas in which locally-targeted interventions were implemented following epidemic resurgence did not show reorganization of community structure but did show small decreases in indicators of travel outside of local areas. We propose that communities detected using Facebook or other mobility data be used to assess the impact of spatially-targeted restrictions and may inform policymakers about the spatial extent of human movement patterns in the UK. These data are available in near real-time, allowing quantification of changes in the distribution of the population across the UK, as well as changes in travel patterns to inform our understanding of the impact of geographically-targeted interventions.  相似文献   

15.
Wu K  Taki Y  Sato K  Sassa Y  Inoue K  Goto R  Okada K  Kawashima R  He Y  Evans AC  Fukuda H 《PloS one》2011,6(5):e19608
Community structure is a universal and significant feature of many complex networks in biology, society, and economics. Community structure has also been revealed in human brain structural and functional networks in previous studies. However, communities overlap and share many edges and nodes. Uncovering the overlapping community structure of complex networks remains largely unknown in human brain networks. Here, using regional gray matter volume, we investigated the structural brain network among 90 brain regions (according to a predefined anatomical atlas) in 462 young, healthy individuals. Overlapped nodes between communities were defined by assuming that nodes (brain regions) can belong to more than one community. We demonstrated that 90 brain regions were organized into 5 overlapping communities associated with several well-known brain systems, such as the auditory/language, visuospatial, emotion, decision-making, social, control of action, memory/learning, and visual systems. The overlapped nodes were mostly involved in an inferior-posterior pattern and were primarily related to auditory and visual perception. The overlapped nodes were mainly attributed to brain regions with higher node degrees and nodal efficiency and played a pivotal role in the flow of information through the structural brain network. Our results revealed fuzzy boundaries between communities by identifying overlapped nodes and provided new insights into the understanding of the relationship between the structure and function of the human brain. This study provides the first report of the overlapping community structure of the structural network of the human brain.  相似文献   

16.
This paper is devoted to the analysis of the early dynamics of an SIS epidemic model defined on networks. The model, introduced by Gross et al. (Phys Rev Lett 96:208701, 2006), is based on the pair-approximation formalism and assumes that, at a given rewiring rate, susceptible nodes replace an infected neighbour by a new susceptible neighbour randomly selected among the pool of susceptible nodes in the population. The analysis uses a triple closure that improves the widely assumed in epidemic models defined on regular and homogeneous networks, and applies it to better understand the early epidemic spread on Poisson, exponential, and scale-free networks. Two extinction scenarios, one dominated by transmission and the other one by rewiring, are characterized by considering the limit system of the model equations close to the beginning of the epidemic. Moreover, an analytical condition for the occurrence of a bistability region is obtained.  相似文献   

17.
The characteristics of the host contact network over which a pathogen is transmitted affect both epidemic spread and the projected effectiveness of control strategies. Given the importance of understanding these contact networks, it is unfortunate that they are very difficult to measure directly. This challenge has led to an interest in methods to infer information about host contact networks from pathogen phylogenies, because in shaping a pathogen''s opportunities for reproduction, contact networks also shape pathogen evolution. Host networks influence pathogen phylogenies both directly, through governing opportunities for evolution, and indirectly by changing the prevalence and incidence. Here, we aim to separate these two effects by comparing pathogen evolution on different host networks that share similar epidemic trajectories. This approach allows use to examine the direct effects of network structure on pathogen phylogenies, largely controlling for confounding differences arising from population dynamics. We find that networks with more heterogeneous degree distributions yield pathogen phylogenies with more variable cluster numbers, smaller mean cluster sizes, shorter mean branch lengths, and somewhat higher tree imbalance than networks with relatively homogeneous degree distributions. However, in particular for dynamic networks, we find that these direct effects are relatively modest. These findings suggest that the role of the epidemic trajectory, the dynamics of the network and the inherent variability of metrics such as cluster size must each be taken into account when trying to use pathogen phylogenies to understand characteristics about the underlying host contact network.  相似文献   

18.
Contact structure is believed to have a large impact on epidemic spreading and consequently using networks to model such contact structure continues to gain interest in epidemiology. However, detailed knowledge of the exact contact structure underlying real epidemics is limited. Here we address the question whether the structure of the contact network leaves a detectable genetic fingerprint in the pathogen population. To this end we compare phylogenies generated by disease outbreaks in simulated populations with different types of contact networks. We find that the shape of these phylogenies strongly depends on contact structure. In particular, measures of tree imbalance allow us to quantify to what extent the contact structure underlying an epidemic deviates from a null model contact network and illustrate this in the case of random mixing. Using a phylogeny from the Swiss HIV epidemic, we show that this epidemic has a significantly more unbalanced tree than would be expected from random mixing.  相似文献   

19.
20.
This paper studied the cluster synchronization of directed complex networks with time delays. It is different from undirected networks, the coupling configuration matrix of directed networks cannot be assumed as symmetric or irreducible. In order to achieve cluster synchronization, this paper uses an adaptive controller on each node and an adaptive feedback strategy on the nodes which in-degree is zero. Numerical example is provided to show the effectiveness of main theory. This method is also effective when the number of clusters is unknown. Thus, it can be used in the community recognizing of directed complex networks.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号