Predicting the evolution of spreading on complex networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Chen DB
PROVIDER: S-EPMC4135329 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:As an important type of dynamics on complex networks, spreading is widely used to model many real processes such as the epidemic contagion and information propagation. One of the most significant research questions in spreading is to rank the spreading ability of nodes in the network. To this end, substantial effort has been made and a variety of effective methods have been proposed. These methods usually define the spreading ability of a node as the number of finally infected nodes given that the spreading is initialized from the node. However, in many real cases such as advertising and news propagation, the spreading only aims to cover a specific group of nodes. Therefore, it is necessary to study the spreading ability of nodes towards localized targets in complex networks. In this paper, we propose a reversed local path algorithm for this problem. Simulation results show that our method outperforms the existing methods in identifying the influential nodes with respect to these localized targets. Moreover, the influential spreaders identified by our method can effectively avoid infecting the non-target nodes in the spreading process.
| S-EPMC5155210 | biostudies-literature
Project description:The spread of disease through a physical-contact network and the spread of information about the disease on a communication network are two intimately related dynamical processes. We investigate the asymmetrical interplay between the two types of spreading dynamics, each occurring on its own layer, by focusing on the two fundamental quantities underlying any spreading process: epidemic threshold and the final infection ratio. We find that an epidemic outbreak on the contact layer can induce an outbreak on the communication layer, and information spreading can effectively raise the epidemic threshold. When structural correlation exists between the two layers, the information threshold remains unchanged but the epidemic threshold can be enhanced, making the contact layer more resilient to epidemic outbreak. We develop a physical theory to understand the intricate interplay between the two types of spreading dynamics.
| S-EPMC4037715 | biostudies-literature
Project description:Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees. These models show that community structure is an important determinant of the behavior of percolation processes on networks, such as information diffusion or virus spreading: the community structure can both enforce as well as inhibit diffusion processes. Our models further show that it is the mesoscopic set of communities that matters. The exact internal structures of communities barely influence the behavior of percolation processes across networks. This insensitivity is likely due to the relative denseness of the communities.
| S-EPMC4954979 | biostudies-literature
Project description:In our daily lives, we rely on the proper functioning of supply networks, from power grids to water transmission systems. A single failure in these critical infrastructures can lead to a complete collapse through a cascading failure mechanism. Counteracting strategies are thus heavily sought after. In this article, we introduce a general framework to analyse the spreading of failures in complex networks and demostrate that not only decreasing but also increasing the connectivity of the network can be an effective method to contain damages. We rigorously prove the existence of certain subgraphs, called network isolators, that can completely inhibit any failure spreading, and we show how to create such isolators in synthetic and real-world networks. The addition of selected links can thus prevent large scale outages as demonstrated for power transmission grids.
| S-EPMC8149673 | biostudies-literature
Project description:A central and perhaps insurmountable challenge of invasion ecology is to predict which combinations of species and habitats most effectively promote and prevent biological invasions. Here, we integrate models of network structure and nonlinear population dynamics to search for potential generalities among trophic factors that may drive invasion success and failure. We simulate invasions where 100 different species attempt to invade 150 different food webs with 15-26 species and a wide range (0.06-0.32) of connectance. These simulations yield 11 438 invasion attempts by non-basal species, 47 per cent of which are successful. At the time of introduction, whether or not the invader is a generalist best predicts final invasion success; however, once the invader establishes itself, it is best distinguished from unsuccessful invaders by occupying a lower trophic position and being relatively invulnerable to predation. In general, variables that reflect the interaction between an invading species and its new community, such as generality and trophic position, best predict invasion success; however, for some trophic categories of invaders, fundamental species traits, such as having the centre of the feeding range low on the theoretical niche axis (for non-omnivorous and omnivorous herbivores), or the topology of the food web (for tertiary carnivores), best predict invasion success. Across all invasion scenarios, a discriminant analysis model predicted successful and failed invasions with 76.5 per cent accuracy for properties at the time of introduction or 100 per cent accuracy for properties at the time of establishment. More generally, our results suggest that tackling the challenge of predicting the properties of species and habitats that promote or inhibit invasions from food web perspective may aid ecologists in identifying rules that govern invasions in natural ecosystems.
| S-EPMC2685429 | biostudies-other
Project description:A common theme among previously proposed models for network epidemics is the assumption that the propagating object (e.g., a pathogen [in the context of infectious disease propagation] or a piece of information [in the context of information propagation]) is transferred across network nodes without going through any modification or evolutionary adaptations. However, in real-life spreading processes, pathogens often evolve in response to changing environments and medical interventions, and information is often modified by individuals before being forwarded. In this article, we investigate the effects of evolutionary adaptations on spreading processes in complex networks with the aim of 1) revealing the role of evolutionary adaptations on the threshold, probability, and final size of epidemics and 2) exploring the interplay between the structural properties of the network and the evolutionary adaptations of the spreading process.
| S-EPMC7084153 | biostudies-literature
Project description:Biological networks have evolved to be highly functional within uncertain environments while remaining extremely adaptable. One of the main contributors to the robustness and evolvability of biological networks is believed to be their modularity of function, with modules defined as sets of genes that are strongly interconnected but whose function is separable from those of other modules. Here, we investigate the in silico evolution of modularity and robustness in complex artificial metabolic networks that encode an increasing amount of information about their environment while acquiring ubiquitous features of biological, social, and engineering networks, such as scale-free edge distribution, small-world property, and fault-tolerance. These networks evolve in environments that differ in their predictability, and allow us to study modularity from topological, information-theoretic, and gene-epistatic points of view using new tools that do not depend on any preconceived notion of modularity. We find that for our evolved complex networks as well as for the yeast protein-protein interaction network, synthetic lethal gene pairs consist mostly of redundant genes that lie close to each other and therefore within modules, while knockdown suppressor gene pairs are farther apart and often straddle modules, suggesting that knockdown rescue is mediated by alternative pathways or modules. The combination of network modularity tools together with genetic interaction data constitutes a powerful approach to study and dissect the role of modularity in the evolution and function of biological networks.
| S-EPMC2233666 | biostudies-literature
Project description:Information diffusion and disease spreading in communication-contact layered network are typically asymmetrically coupled with each other, in which disease spreading can be significantly affected by the way an individual being aware of disease responds to the disease. Many recent studies have demonstrated that human behavioral adoption is a complex and non-Markovian process, where the probability of behavior adoption is dependent on the cumulative times of information received and the social reinforcement effect of the cumulative information. In this paper, the impacts of such a non-Markovian vaccination adoption behavior on the epidemic dynamics and the control effects are explored. It is found that this complex adoption behavior in the communication layer can significantly enhance the epidemic threshold and reduce the final infection rate. By defining the social cost as the total cost of vaccination and treatment, it can be seen that there exists an optimal social reinforcement effect and optimal information transmission rate allowing the minimal social cost. Moreover, a mean-field theory is developed to verify the correctness of simulation results.
| S-EPMC4860576 | biostudies-literature
Project description:Numerous concise models such as preferential attachment have been put forward to reveal the evolution mechanisms of real-world networks, which show that real-world networks are usually jointly driven by a hybrid mechanism of multiplex features instead of a single pure mechanism. To get an accurate simulation for real networks, some researchers proposed a few hybrid models by mixing multiple evolution mechanisms. Nevertheless, how a hybrid mechanism of multiplex features jointly influence the network evolution is not very clear. In this study, we introduce two methods (link prediction and likelihood analysis) to measure multiple evolution mechanisms of complex networks. Through tremendous experiments on artificial networks, which can be controlled to follow multiple mechanisms with different weights, we find the method based on likelihood analysis performs much better and gives very accurate estimations. At last, we apply this method to some real-world networks which are from different domains (including technology networks and social networks) and different countries (e.g., USA and China), to see how popularity and clustering co-evolve. We find most of them are affected by both popularity and clustering, but with quite different weights.
| S-EPMC4464182 | biostudies-literature
Project description:An intriguing question in evolution is what would happen if one could "replay" life's tape. Here, we explore the following hypothesis: when replaying the tape, the details ("decorations") of the outcomes would vary but certain "invariants" might emerge across different life-tapes sharing similar initial conditions. We use large-scale simulations of an in silico model of pre-biotic evolution called GARD (Graded Autocatalysis Replication Domain) to test this hypothesis. GARD models the temporal evolution of molecular assemblies, governed by a rates matrix (i.e. network) that biases different molecules' likelihood of joining or leaving a dynamically growing and splitting assembly. Previous studies have shown the emergence of so called compotypes, i.e., species capable of replication and selection response. Here, we apply networks' science to ascertain the degree to which invariants emerge across different life-tapes under GARD dynamics and whether one can predict these invariant from the chemistry specification alone (i.e. GARD's rates network representing initial conditions). We analysed the (complex) rates' network communities and asked whether communities are related (and how) to the emerging species under GARD's dynamic, and found that the communities correspond to the species emerging from the simulations. Importantly, we show how to use the set of communities detected to predict species emergence without performing any simulations. The analysis developed here may impact complex systems simulations in general.
| S-EPMC5813963 | biostudies-literature