Search

Vision provides the most important sensory information for spatial navigation. Recent technical advances allow new options to conduct more naturalistic experiments in virtual reality (VR) while additionally gather data of the viewing behavior with eye tracking investigations. Here, we propose a method that allows one to quantify characteristics of visual behavior by using graph-theoretical measures to abstract eye tracking data recorded in a 3D virtual urban environment.The analysis is based on eye tracking data of 20 participants, who freely explored the virtual city Seahaven for 90 minutes with an immersive VR headset with an inbuild eye tracker. To extract what participants looked at, we defined “gaze” events, from which we created gaze graphs. On these, we applied graph-theoretical measures to reveal the underlying structure of visual attention.Applying graph partitioning, we found that our virtual environment could be treated as one coherent city. To investigate the importance of houses in the city, we applied the node degree centrality measure. Our results revealed that 10 houses had a node degree that exceeded consistently two-sigma distance from the mean node degree of all other houses. The importance of these houses was supported by the hierarchy index, which showed a clear hierarchical structure of the gaze graphs. As these high node degree houses fulfilled several characteristics of landmarks, we named them “gaze-graph-defined landmarks”. Applying the rich club coefficient, we found that these gaze-graph-defined landmarks were preferentially connected to each other and that participants spend the majority of their experiment time in areas where at least two of those houses were visible.Our findings do not only provide new experimental evidence for the development of spatial knowledge, but also establish a new methodology to identify and assess the function of landmarks in spatial navigation based on eye tracking data.Author SummaryThe ability to navigate and orient ourselves in an unknown environment is important in everyday life. To better understand how we are able to learn about a new environment, it is important to study our behavior during the process of spatial navigation. New technical advances allow us to conduct studies in naturalistic virtual environments with participants wearing immersive VR-headsets. In addition, we can use eye trackers to observe the participant’s eye movements. This is interesting, because observing eye movements allows us to observe visual attention and, therefore, important cognitive processes. However, it can be difficult to analyze eye tracking data that was measured in a VR environment, as there is no established algorithm yet. Therefore, we propose a new method to analyze such eye tracking data. In addition, our method allows us to transform the eye tracking data into graphs which we can use to find new patterns in behavior that were not accessible before. Using this methodology, we found that participants who spend 90 min exploring a new virtual town, viewed some houses preferentially and we call them gaze-graph-defined landmarks. Our further analysis reveals also new characteristics of those houses that were not yet associated with landmarks.

Decision-making about pandemic mitigation often relies upon simulation modelling. Models of disease transmission through networks of contacts--between individuals or between population centres--are increasingly used for these purposes. Real-world contact networks are rich in structural features that influence infection transmission, such as tightly-knit local communities that are weakly connected to one another. In this paper, we propose a new flow-based edge-betweenness centrality method for detecting bottleneck edges that connect nodes in contact networks. In particular, we utilize convex optimization formulations based on the idea of diffusion with p-norm network flow. Using simulation models of COVID-19 transmission through real network data at both individual and county levels, we demonstrate that targeting bottleneck edges identified by the proposed method reduces the number of infected cases by up to 10% more than state-of-the-art edge-betweenness methods. Furthermore, the proposed method is orders of magnitude faster than existing methods., Comment: 38 pages, 21 figures

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., Author summary Large-scale intensive interventions in response to the COVID-19 pandemic have been implemented globally, significantly affecting human movement patterns. Mobility data provide an empirical measurement of UK travel within a spatially-explicit network, but it is not clear how the structure of that network changed in response to national or locally-targeted interventions. We use daily mobility data aggregated from Facebook users to quantify changes in the travel network in the UK during the national lockdown, and in response to local interventions. We identified changes in human behaviour in response to interventions and identified the community structure inherent in these networks. This approach can help quantify the extent of strongly connected communities of interaction and their relationship to the extent of spatially-explicit interventions. We show that spatial mobility data available in near real-time can give information on connectivity that can be used to understand the impact of geographically-targeted interventions and in the future, to inform these intervention strategies.

Disease epidemic outbreaks on human metapopulation networks are often driven by a small number of superspreader nodes, which are primarily responsible for spreading the disease throughout the network. Superspreader nodes typically are characterized either by their locations within the network, by their degree of connectivity and centrality, or by their habitat suitability for the disease, described by their reproduction number (R). Here we introduce a model that considers simultaneously the effects of network properties and R on superspreaders, as opposed to previous research which considered each factor separately. This type of model is applicable to diseases for which habitat suitability varies by climate or land cover, and for direct transmitted diseases for which population density and mitigation practices influences R. We present analytical models that quantify the superspreader capacity of a population node by two measures: probability-dependent superspreader capacity, the expected number of neighboring nodes to which the node in consideration will randomly spread the disease per epidemic generation, and time-dependent superspreader capacity, the rate at which the node spreads the disease to each of its neighbors. We validate our analytical models with a Monte Carlo analysis of repeated stochastic Susceptible-Infected-Recovered (SIR) simulations on randomly generated human population networks, and we use a random forest statistical model to relate superspreader risk to connectivity, R, centrality, clustering, and diffusion. We demonstrate that either degree of connectivity or R above a certain threshold are sufficient conditions for a node to have a moderate superspreader risk factor, but both are necessary for a node to have a high-risk factor. The statistical model presented in this article can be used to predict the location of superspreader events in future epidemics, and to predict the effectiveness of mitigation strategies that seek to reduce the value of R, alter host movements, or both., Author summary Infectious disease outbreaks on human mobility networks often are driven by a small number of superspreader individuals or communities, which are primarily responsible for propagating the disease throughout the network. In this paper, we introduce a model that considers how the properties of the network and spatial variance in disease transmission intensity (i.e., the reproduction number) due to social and ecological conditions interact to influence the occurrence of superspreaders. This type of model is applicable to diseases for which habitat suitability is influenced by climate or land cover, such as vector-borne diseases, and to directly transmitted diseases for which population density and practices to mitigate transmission may vary spatially. We present mathematical models that quantify the superspreader capacity of a population node, based on the extent area of the disease spread attributable to that node and the rate at which the disease spreads. We validate our models with a simulation of epidemic spread across randomly generated networks. The statistical model presented here can be used to predict the location of superspreader events in future epidemics and to predict the effectiveness of mitigation strategies that seek to reduce the disease reproduction rate, alter host movements, or both.

The SARS-CoV-2 pandemic of 2020 has mobilised scientists around the globe to research all aspects of the coronavirus virus and its infection. For fruitful and rapid investigation of viral pathomechanisms, a collaborative and interdisciplinary approach is required. Therefore, we have developed ViralLink: a systems biology workflow which reconstructs and analyses networks representing the effect of viruses on intracellular signalling. These networks trace the flow of signal from intracellular viral proteins through their human binding proteins and downstream signalling pathways, ending with transcription factors regulating genes differentially expressed upon viral exposure. In this way, the workflow provides a mechanistic insight from previously identified knowledge of virally infected cells. By default, the workflow is set up to analyse the intracellular effects of SARS-CoV-2, requiring only transcriptomics counts data as input from the user: thus, encouraging and enabling rapid multidisciplinary research. However, the wide-ranging applicability and modularity of the workflow facilitates customisation of viral context, a priori interactions and analysis methods. Through a case study of SARS-CoV-2 infected bronchial/tracheal epithelial cells, we evidence the functionality of the workflow and its ability to identify key pathways and proteins in the cellular response to infection. The application of ViralLink to different viral infections in a cell-type specific manner using different available transcriptomics datasets will uncover key mechanisms in viral pathogenesis. The workflow is available on GitHub (https://github.com/korcsmarosgroup/ViralLink) in an easily accessible Python wrapper script, or as customisable modular R and Python scripts.Author summaryCollaborative and multidisciplinary science provides increased value for experimental datasets and speeds the process of discovery. Such ways of working are especially important at present due to the urgency of the SARS-CoV-2 pandemic. Here, we present a systems biology workflow which models the effect of viral proteins on the infected host cell, to aid collaborative and multidisciplinary research. Through integration of gene expression datasets with context-specific and context-agnostic molecular interaction datasets, the workflow can be easily applied to different datasets as they are made available. Application to diverse SARS-CoV-2 datasets will increase our understanding of the mechanistic details of the infection at a cell type specific level, aid drug target discovery and help explain the variety of clinical manifestations of the infection.

Modelling the emergence of foodborne pathogens is a crucial step in the prediction and prevention of disease outbreaks. Unfortunately, the mechanisms that drive the evolution of such continuously adapting pathogens remain poorly understood. Here, we combine molecular genotyping with network science and Bayesian inference to infer directed genotype networks—and trace the emergence and evolutionary paths—of Salmonella Typhimurium (STM) from nine years of Australian disease surveillance data. We construct networks where nodes represent STM strains and directed edges represent evolutionary steps, presenting evidence that the structural (i.e., network-based) features are relevant to understanding the functional (i.e., fitness-based) progression of co-evolving STM strains. This is argued by showing that outbreak severity, i.e., prevalence, correlates to: (i) the network path length to the most prevalent node (r = −0.613, N = 690); and (ii) the network connected-component size (r = 0.739). Moreover, we uncover distinct exploration-exploitation pathways in the genetic space of STM, including a strong evolutionary drive through a transition region. This is examined via the 6,897 distinct evolutionary paths in the directed network, where we observe a dominant 66% of these paths decrease in network centrality, whilst increasing in prevalence. Furthermore, 72.4% of all paths originate in the transition region, with 64% of those following the dominant direction. Further, we find that the length of an evolutionary path strongly correlates to its increase in prevalence (r = 0.497). Combined, these findings indicate that longer evolutionary paths result in genetically rare and virulent strains, which mostly evolve from a single transition point. Our results not only validate our widely-applicable approach for inferring directed genotype networks from data, but also provide a unique insight into the elusive functional and structural drivers of STM bacteria., Author summary We study emergence and evolution of foodborne pathogens, and provide a new method for public health surveillance dealing with genetically diverse and spatiotemporally distributed epidemic scenarios. The proposed method interprets the surveillance data through genotype networks, and discovers how the most dominant strains of infection emerge and adapt. The approach allows us to correlate the strength of epidemics with genetic features of observed pathogens. This could open a way to predict and contain epidemics closer to their source, enabling more timely and precise allocations of public health resources, as well as efficient interventions during epidemics. This should make a significant economic and social impact, improving health of the population, while also safeguarding national and international supply chains.

Identifying important nodes for disease spreading is a central topic in network epidemiology. We investigate how well the position of a node, characterized by standard network measures, can predict its epidemiological importance in any graph of a given number of nodes. This is in contrast to other studies that deal with the easier prediction problem of ranking nodes by their epidemic importance in given graphs. As a benchmark for epidemic importance, we calculate the exact expected outbreak size given a node as the source. We study exhaustively all graphs of a given size, so do not restrict ourselves to certain generative models for graphs, nor to graph data sets. Due to the large number of possible nonisomorphic graphs of a fixed size, we are limited to ten-node graphs. We find that combinations of two or more centralities are predictive (R2 scores of 0.91 or higher) even for the most difficult parameter values of the epidemic simulation. Typically, these successful combinations include one normalized spectral centrality (such as PageRank or Katz centrality) and one measure that is sensitive to the number of edges in the graph., Author summary A central challenge in network epidemiology is to find nodes that are important for disease spreading. Usually, one starts from a certain graph, and tries to rank the nodes in a way that correlates as strongly as possible with measures of importance estimated using simulations of outbreaks. A more challenging prediction task, and the one we take, is to ask if one can guess, from measures of the network structure alone, the values of quantities describing the outbreak. Having this predictive power is important: one can then target nodes that are more important than a certain threshold, rather than just a top fraction of nodes. By exhaustively studying all small graphs, we show that such prediction is possible to achieve with high accuracy by combining standard network measures.

Accurately predicting essential genes using computational methods can greatly reduce the effort in finding them via wet experiments at both time and resource scales, and further accelerate the process of drug discovery. Several computational methods have been proposed for predicting essential genes in model organisms by integrating multiple biological data sources either via centrality measures or machine learning based methods. However, the methods aiming to predict human essential genes are still limited and the performance still need improve. In addition, most of the machine learning based essential gene prediction methods are lack of skills to handle the imbalanced learning issue inherent in the essential gene prediction problem, which might be one factor affecting their performance. We propose a deep learning based method, DeepHE, to predict human essential genes by integrating features derived from sequence data and protein-protein interaction (PPI) network. A deep learning based network embedding method is utilized to automatically learn features from PPI network. In addition, 89 sequence features were derived from DNA sequence and protein sequence for each gene. These two types of features are integrated to train a multilayer neural network. A cost-sensitive technique is used to address the imbalanced learning problem when training the deep neural network. The experimental results for predicting human essential genes show that our proposed method, DeepHE, can accurately predict human gene essentiality with an average performance of AUC higher than 94%, the area under precision-recall curve (AP) higher than 90%, and the accuracy higher than 90%. We also compare DeepHE with several widely used traditional machine learning models (SVM, Naïve Bayes, Random Forest, and Adaboost) using the same features and utilizing the same cost-sensitive technique to against the imbalanced learning issue. The experimental results show that DeepHE significantly outperforms the compared machine learning models. We have demonstrated that human essential genes can be accurately predicted by designing effective machine learning algorithm and integrating representative features captured from available biological data. The proposed deep learning framework is effective for such task., Author summary Essential genes are a subset of genes. They are indispensable to the survival or reproduction of a living organism and thus play a very important role in maintaining cellular life. The identification of gene essentiality is very important for understanding the minimal requirements of an organism, identifying disease genes, and finding new drug targets. Essential genes can be identified via several wet-lab experimental methods, but these methods are often time-consuming, laborious, and costly. As a complement to the experimental methods, some centrality measures and traditional machine learning based computational methods have been proposed which mainly focused on predicting essential genes on model organisms. Here, we show that human essential genes can be accurately predicted by exploring sequence data and protein interaction network based on deep learning techniques. The ability to accurately and efficiently predict essential genes by utilizing existing biological omics data accelerates the annotation and analysis of essential genes, advance our understanding of the mechanism of basic life, and boosts the drug development.

DNA methylation provides one of the most widely studied biomarkers of ageing. Since the methylation of CpG dinucleotides function as switches in cellular mechanisms, it is plausible to assume that by proper adjustment of these switches age may be tuned. Though, adjusting hundreds of CpG methylation levels coherently may never be feasible and changing just a few positions may lead to biologically unstable state. A prominent example of methylation-based age estimators is provided by Horvath’s clock, based on 353 CpG dinucleotides, showing a high correlation (not necessarily causation) with chronological age across multiple tissue types. On this small subset of CpG dinucleotides we demonstrate how the adjustment of one methylation level leads to a cascade of changes at other sites. Among the studied subset, we locate the most important CpGs (and related genes) that may have a large influence on the rest of the sub-system. According to our analysis, the structure of this network is way more hierarchical compared to what one would expect based on ensembles of uncorrelated connections. Therefore, only a handful of CpGs is enough to modify the system towards a desired state. When propagation of the change over the network is taken into account, the resulting modification in the predicted age can be significantly larger compared to the effect of isolated CpG perturbations. By adjusting the most influential single CpG site and following the propagation of methylation level changes we can reach up to 5.74 years in virtual age reduction, significantly larger than without taking into account of the network control. Extending our approach to the whole methylation network may identify key nodes that have controller role in the ageing process., Author summary Aging affects all living organisms. In humans, the chronological age correlates with the methylation level of some locations of the DNA. Here we extract an interaction network between these ageing related sites, which shows signs of hierarchical organisation. In addition, modifications in the methylation of single sites of the DNA can impose cascades of changes at other sites over this network. Based on “gedanken-experiments” in a small subset of CpG sites we show that by tuning appropriately selected methylation levels the estimated biological age can be changed. When modifying the most influential locations, the resulting cascades of changes can set back the estimated biological age by more than 5 years. Our study also shows that compared to single site methylation perturbations, the propagation of the change over the interaction network leads to methylation change profiles which are more aligned with the natural direction of ageing in a high dimensional representation of the methylation levels.

High-throughput multi-omics studies and corresponding network analyses of multi-omic data have rapidly expanded their impact over the last 10 years. As biological features of different types (e.g. transcripts, proteins, metabolites) interact within cellular systems, the greatest amount of knowledge can be gained from networks that incorporate multiple types of -omic data. However, biological and technical sources of variation diminish the ability to detect cross-type associations, yielding networks dominated by communities comprised of nodes of the same type. We describe here network building methods that can maximize edges between nodes of different data types leading to integrated networks, networks that have a large number of edges that link nodes of different–omic types (transcripts, proteins, lipids etc). We systematically rank several network inference methods and demonstrate that, in many cases, using a random forest method, GENIE3, produces the most integrated networks. This increase in integration does not come at the cost of accuracy as GENIE3 produces networks of approximately the same quality as the other network inference methods tested here. Using GENIE3, we also infer networks representing antibody-mediated Dengue virus cell invasion and receptor-mediated Dengue virus invasion. A number of functional pathways showed centrality differences between the two networks including genes responding to both GM-CSF and IL-4, which had a higher centrality value in an antibody-mediated vs. receptor-mediated Dengue network. Because a biological system involves the interplay of many different types of molecules, incorporating multiple data types into networks will improve their use as models of biological systems. The methods explored here are some of the first to specifically highlight and address the challenges associated with how such multi-omic networks can be assembled and how the greatest number of interactions can be inferred from different data types. The resulting networks can lead to the discovery of new host response patterns and interactions during viral infection, generate new hypotheses of pathogenic mechanisms and confirm mechanisms of disease., Author summary Inferring co-expression networks that combine multiple types of–omics data can lead to networks that are highly segregated with very few edges linking nodes of different–omics types. Here, we explored methods of improving integration in co-expression networks and found that a random forest approach, GENIE3, was, in many cases, the best method for inferring such networks. GENIE3 was approximately as accurate as other network inference methods so this improvement in integration did not come at the cost of network quality. We also used GENIE3 to infer several networks using data derived from infection of human cells with Dengue virus and interrogated them to better understand processes that may have higher importance when Dengue virus carries out antibody-mediated infection compared to receptor-mediated infection. Processes involved in GM-CSF and IL-4 were more central during antibody-mediated infection. Overall, these studies identify network inference methods that are particularly well suited to multi-omic networks and also demonstrate how these approaches can be used to better understand Dengue virus infection.

The brain is a network system in which excitatory and inhibitory neurons keep activity balanced in the highly non-random connectivity pattern of the microconnectome. It is well known that the relative percentage of inhibitory neurons is much smaller than excitatory neurons in the cortex. So, in general, how inhibitory neurons can keep the balance with the surrounding excitatory neurons is an important question. There is much accumulated knowledge about this fundamental question. This study quantitatively evaluated the relatively higher functional contribution of inhibitory neurons in terms of not only properties of individual neurons, such as firing rate, but also in terms of topological mechanisms and controlling ability on other excitatory neurons. We combined simultaneous electrical recording (~2.5 hours) of ~1000 neurons in vitro, and quantitative evaluation of neuronal interactions including excitatory-inhibitory categorization. This study accurately defined recording brain anatomical targets, such as brain regions and cortical layers, by inter-referring MRI and immunostaining recordings. The interaction networks enabled us to quantify topological influence of individual neurons, in terms of controlling ability to other neurons. Especially, the result indicated that highly influential inhibitory neurons show higher controlling ability of other neurons than excitatory neurons, and are relatively often distributed in deeper layers of the cortex. Furthermore, the neurons having high controlling ability are more effectively limited in number than central nodes of k-cores, and these neurons also participate in more clustered motifs. In summary, this study suggested that the high controlling ability of inhibitory neurons is a key mechanism to keep balance with a large number of other excitatory neurons beyond simple higher firing rate. Application of the selection method of limited important neurons would be also applicable for the ability to effectively and selectively stimulate E/I imbalanced disease states., 脳が安定して活動を続けられるメカニズムの一端を解明 --新皮質で、抑制性細胞は他細胞を制御しやすいトポロジカルな位置取りをする--. 京都大学プレスリリース. 2021-04-09.

Metabolic engineering in the post-genomic era is characterised by the development of new methods for metabolomics and fluxomics, supported by the integration of genetic engineering tools and mathematical modelling. Particularly, constraint-based stoichiometric models have been widely studied: (i) flux balance analysis (FBA) (in silico), and (ii) metabolic flux analysis (MFA) (in vivo). Recent studies have enabled the incorporation of thermodynamics and metabolomics data to improve the predictive capabilities of these approaches. However, an in-depth comparison and evaluation of these methods is lacking. This study presents a thorough analysis of two different in silico methods tested against experimental data (metabolomics and 13C-MFA) for the mesophile Escherichia coli. In particular, a modified version of the recently published matTFA toolbox was created, providing a broader range of physicochemical parameters. Validating against experimental data allowed the determination of the best physicochemical parameters to perform the TFA (Thermodynamics-based Flux Analysis). An analysis of flux pattern changes in the central carbon metabolism between 13C-MFA and TFA highlighted the limited capabilities of both approaches for elucidating the anaplerotic fluxes. In addition, a method based on centrality measures was suggested to identify important metabolites that (if quantified) would allow to further constrain the TFA. Finally, this study emphasised the need for standardisation in the fluxomics community: novel approaches are frequently released but a thorough comparison with currently accepted methods is not always performed., Author summary Biotechnology has benefitted from the development of high throughput methods characterising living systems at different levels (e.g. concerning genes or proteins), allowing the industrial production of chemical commodities. Recently, focus has been placed on determining reaction rates (or metabolic fluxes) in the metabolic network of certain microorganisms, in order to identify bottlenecks hindering their exploitation. Two main approaches are commonly used, termed metabolic flux analysis (MFA) and flux balance analysis (FBA), based on measuring and estimating fluxes, respectively. While the influence of thermodynamics in living systems was accepted several decades ago, its application to study biochemical networks has only recently been enabled. In this sense, a multitude of different approaches constraining well-established modelling methods with thermodynamics has been suggested. However, physicochemical parameters are generally not properly adjusted to the experimental conditions, which might affect their predictive capabilities. In this study, we have explored the reliability of currently available tools by investigating the impact of varying said parameters in the simulation of metabolic fluxes and metabolite concentration values. Additionally, our in-depth analysis allowed us to highlight limitations and potential solutions that should be considered in future studies.

Hippocampal damage results in profound retrograde, but no anterograde amnesia in contextual fear conditioning (CFC). Although the content learned in the latter have been discussed, alternative regions supporting CFC learning were seldom proposed and never empirically addressed. Here, we employed network analysis of pCREB expression quantified from brain slices of rats with dorsal hippocampal lesion (dHPC) after undergoing CFC session. Using inter-regional correlations of pCREB-positive nuclei between brain regions, we modelled functional networks using different thresholds. The dHPC network showed small-world topology, equivalent to SHAM (control) network. However, diverging hubs were identified in each network. In a direct comparison, hubs in both networks showed consistently higher centrality values compared to the other network. Further, the distribution of correlation coefficients was different between the groups, with most significantly stronger correlation coefficients belonging to the SHAM network. These results suggest that dHPC network engaged in CFC learning is partially different, and engage alternative hubs. We next tested if pre-training lesions of dHPC and one of the new dHPC network hubs (perirhinal, Per; or disgranular retrosplenial, RSC, cortices) would impair CFC. Only dHPC-RSC, but not dHPC-Per, impaired CFC. Interestingly, only RSC showed a consistently higher centrality in the dHPC network, suggesting that the increased centrality reflects an increased functional dependence on RSC. Our results provide evidence that, without hippocampus, the RSC, an anatomically central region in the medial temporal lobe memory system might support CFC learning and memory., Author summary When determined cognitive performances are not affected by brain lesions of regions generally involved in that performance, the interpretation is that the remaining regions can promote function despite of (or compensate) the damaged one. In contextual fear conditioning, a memory model largely used in laboratory rodents, hippocampal lesions produce amnesia for events occurred before, but not after the lesion, although the hippocampus is known to be important for new learning. Addressing how the brain can overcome lesion in animal models has always been challenging as it requires large-scale brain mapping. Here, we quantified 30 brain regions and used mathematical tools to model how a brain network can support contextual fear learning after hippocampal loss. We described that the damaged network preserved general interactivity characteristics, although different brain regions were identified as highly important for the network (e.g. highly connected). Further, we empirically validated our network model by performing double lesions of the hippocampus and the alternative hubs observed in the network models. We verified that double lesion of the hippocampus and retrosplenial cortex, one of the hubs, impaired contextual fear learning. We provide evidence that without hippocampus, the remaining network relies on alternative important regions from the memory system to coordinate contextual fear learning.

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf., Author summary The Influence Maximization Problem (IMP) has been applied in fields such as epidemiology and social network analysis. Here, we apply the method to biological networks, aiming to discover the set of regulatory genes with the greatest influence on network dynamics. Fundamentally, since gene regulation is linked to the flow of information, we framed the IMP as an information theoretic problem. Dynamics were encoded as edge weights using time lagged transfer entropy, a quantity that attempts to quantify information transfer across variables. The influential nodes act as critical sources of information flow, potentially affecting the global network state. Biological events that impact the influential nodes and thereby affecting normal information flow could have a strong effect on the network, potentially leading to disease.

Brain stimulation can modulate the activity of neural circuits impaired by Alzheimer’s disease (AD), having promising clinical benefit. However, all individuals with the same condition currently receive identical brain stimulation, with limited theoretical basis for this generic approach. In this study, we introduce a control theory framework for obtaining exogenous signals that revert pathological electroencephalographic activity in AD at a minimal energetic cost, while reflecting patients’ biological variability. We used anatomical networks obtained from diffusion magnetic resonance images acquired by the Alzheimer’s Disease Neuroimaging Initiative (ADNI) as mediators for the interaction between Duffing oscillators. The nonlinear nature of the brain dynamics is preserved, given that we extend the so-called state-dependent Riccati equation control to reflect the stimulation objective in the high-dimensional neural system. By considering nonlinearities in our model, we identified regions for which control inputs fail to correct abnormal activity. There are changes to the way stimulated regions are ranked in terms of the energetic cost of controlling the entire network, from a linear to a nonlinear approach. We also found that limbic system and basal ganglia structures constitute the top target locations for stimulation in AD. Patients with highly integrated anatomical networks–namely, networks having low average shortest path length, high global efficiency–are the most suitable candidates for the propagation of stimuli and consequent success on the control task. Other diseases associated with alterations in brain dynamics and the self-control mechanisms of the brain can be addressed through our framework., Author summary This work aims to close the knowledge gap between theory and experiment in brain stimulation. Previous modeling approaches for stimulation have overlooked the nonlinear dynamical nature of the brain and failed to shed light on efficient mechanisms for the exogenous control of the brain. Amid the current efforts for developing personalized medicine, we introduce a framework for producing tailored stimulation signals, based on individual neuroimaging data and innovative modeling. This is the first time, to our knowledge, that brain stimulation for the most common cause of dementia, Alzheimer’s disease, is theoretically addressed. Our approach leads to the identification of potential target regions and subjects to successfully respond to brain stimulation therapies and yields various disease-reverting signals. Although focused on Alzheimer’s in this study, our methodology could be applied to other clinical conditions characterized by abnormalities in brain dynamics, like epilepsy and Parkinson’s, the treatment of which can benefit from the use of optimal control strategies.

Viruses and bacteria are critical components of the human microbiome and play important roles in health and disease. Most previous work has relied on studying bacteria and viruses independently, thereby reducing them to two separate communities. Such approaches are unable to capture how these microbial communities interact, such as through processes that maintain community robustness or allow phage-host populations to co-evolve. We implemented a network-based analytical approach to describe phage-bacteria network diversity throughout the human body. We built these community networks using a machine learning algorithm to predict which phages could infect which bacteria in a given microbiome. Our algorithm was applied to paired viral and bacterial metagenomic sequence sets from three previously published human cohorts. We organized the predicted interactions into networks that allowed us to evaluate phage-bacteria connectedness across the human body. We observed evidence that gut and skin network structures were person-specific and not conserved among cohabitating family members. High-fat diets appeared to be associated with less connected networks. Network structure differed between skin sites, with those exposed to the external environment being less connected and likely more susceptible to network degradation by microbial extinction events. This study quantified and contrasted the diversity of virome-microbiome networks across the human body and illustrated how environmental factors may influence phage-bacteria interactive dynamics. This work provides a baseline for future studies to better understand system perturbations, such as disease states, through ecological networks., Author summary The human microbiome, the collection of microbial communities that colonize the human body, is a crucial component to health and disease. Two major components of the human microbiome are the bacterial and viral communities. These communities have primarily been studied separately using metrics of community composition and diversity. These approaches have failed to capture the complex dynamics of interacting bacteria and phage communities, which frequently share genetic information and work together to maintain ecosystem homestatsis (e.g. kill-the-winner dynamics). Removal of bacteria or phage can disrupt or even collapse those ecosystems. Relationship-based network approaches allow us to capture this interaction information. Using this network-based approach with three independent human cohorts, we were able to present an initial understanding of how phage-bacteria networks differ throughout the human body, so as to provide a baseline for future studies of how and why microbiome networks differ in disease states.

The primate connectome, possessing a characteristic global topology and specific regional connectivity profiles, is well organized to support both segregated and integrated brain function. However, the organization mechanisms shaping the characteristic connectivity and its relationship to functional requirements remain unclear. The primate brain connectome is shaped by metabolic economy as well as functional values. Here, we explored the influence of two competing factors and additional advanced functional requirements on the primate connectome employing an optimal trade-off model between neural wiring cost and the representative functional requirement of processing efficiency. Moreover, we compared this model with a generative model combining spatial distance and topological similarity, with the objective of statistically reproducing multiple topological features of the network. The primate connectome indeed displays a cost-efficiency trade-off and that up to 67% of the connections were recovered by optimal combination of the two basic factors of wiring economy and processing efficiency, clearly higher than the proportion of connections (56%) explained by the generative model. While not explicitly aimed for, the trade-off model captured several key topological features of the real connectome as the generative model, yet better explained the connectivity of most regions. The majority of the remaining 33% of connections unexplained by the best trade-off model were long-distance links, which are concentrated on few cortical areas, termed long-distance connectors (LDCs). The LDCs are mainly non-hubs, but form a densely connected group overlapping on spatially segregated functional modalities. LDCs are crucial for both functional segregation and integration across different scales. These organization features revealed by the optimization analysis provide evidence that the demands of advanced functional segregation and integration among spatially distributed regions may play a significant role in shaping the cortical connectome, in addition to the basic cost-efficiency trade-off. These findings also shed light on inherent vulnerabilities of brain networks in diseases., Author summary The intricate primate structural connectome, as the network substrate for distributed and integrated brain function, is shaped by fundamental physical factors and functional requirements. We addressed a trade-off between two competing basic factors of wiring cost and processing efficiency as well as additional requirements of functional segregation and integration on regional structural connectivity profiles by applying cost–efficiency trade-off model to reconstruct the macaque cortical network. We also compared this model with a generative model combining spatial distance and topological similarity. The trade-off model balancing the two basic factors recovered the main topological features that were explicitly specified as the objective functions in the generative model. Moreover, 67% of all connections and most regional connectivity profiles were recovered by the cost-efficiency trade-off, substantially outperforming the generative model. Most long-distance links, unexplained by the cost-efficiency trade-off, are concentrated on a few special regions constituting long-distance connectors (LDCs). Departing from previous findings, LDCs are mostly non-hubs, but are crucial for supporting functional integration and, counter-intuitively also for proper segregation across different hierarchical scales of the cortical network. The perspective of a trade-off between basic factors on brain structural organization sheds light on the organization principles and potential vulnerabilities of the cortical connectome.

Hospital networks, formed by patients visiting multiple hospitals, affect the spread of hospital-associated infections, resulting in differences in risks for hospitals depending on their network position. These networks are increasingly used to inform strategies to prevent and control the spread of hospital-associated pathogens. However, many studies only consider patients that are received directly from the initial hospital, without considering the effect of indirect trajectories through the network. We determine the optimal way to measure the distance between hospitals within the network, by reconstructing the English hospital network based on shared patients in 2014–2015, and simulating the spread of a hospital-associated pathogen between hospitals, taking into consideration that each intermediate hospital conveys a delay in the further spread of the pathogen. While the risk of transferring a hospital-associated pathogen between directly neighbouring hospitals is a direct reflection of the number of shared patients, the distance between two hospitals far-away in the network is determined largely by the number of intermediate hospitals in the network. Because the network is dense, most long distance transmission chains in fact involve only few intermediate steps, spreading along the many weak links. The dense connectivity of hospital networks, together with a strong regional structure, causes hospital-associated pathogens to spread from the initial outbreak in a two-step process: first, the directly surrounding hospitals are affected through the strong connections, second all other hospitals receive introductions through the multitude of weaker links. Although the strong connections matter for local spread, weak links in the network can offer ideal routes for hospital-associated pathogens to travel further faster. This hold important implications for infection prevention and control efforts: if a local outbreak is not controlled in time, colonised patients will appear in other regions, irrespective of the distance to the initial outbreak, making import screening ever more difficult., Author summary Shared patients can spread hospital-associated pathogens between hospitals, together forming a large network in which all hospitals are connected. We set out to measure the distance between hospitals in such a network, best reflecting the risk of a hospital-associated pathogen spreading from one to the other. The central problem is that this risk may not be a directly reflected by the weight of the direct connections between hospitals, because the pathogen could arrive through a longer indirect route, first causing a problem in an intermediate hospital. We determined the optimal balance between connection weights and path length, by testing different weighting factors between them against simulated spread of a pathogen. We found that while strong connections are important risk factor for a hospital’s direct neighbours, weak connections offer ideal indirect routes for hospital-associated pathogens to travel further faster. These routes should not be underestimated when designing control strategies.

Allosteric interactions in the Hsp70 proteins are linked with their regulatory mechanisms and cellular functions. Despite significant progress in structural and functional characterization of the Hsp70 proteins fundamental questions concerning modularity of the allosteric interaction networks and hierarchy of signaling pathways in the Hsp70 chaperones remained largely unexplored and poorly understood. In this work, we proposed an integrated computational strategy that combined atomistic and coarse-grained simulations with coevolutionary analysis and network modeling of the residue interactions. A novel aspect of this work is the incorporation of dynamic residue correlations and coevolutionary residue dependencies in the construction of allosteric interaction networks and signaling pathways. We found that functional sites involved in allosteric regulation of Hsp70 may be characterized by structural stability, proximity to global hinge centers and local structural environment that is enriched by highly coevolving flexible residues. These specific characteristics may be necessary for regulation of allosteric structural transitions and could distinguish regulatory sites from nonfunctional conserved residues. The observed confluence of dynamics correlations and coevolutionary residue couplings with global networking features may determine modular organization of allosteric interactions and dictate localization of key mediating sites. Community analysis of the residue interaction networks revealed that concerted rearrangements of local interacting modules at the inter-domain interface may be responsible for global structural changes and a population shift in the DnaK chaperone. The inter-domain communities in the Hsp70 structures harbor the majority of regulatory residues involved in allosteric signaling, suggesting that these sites could be integral to the network organization and coordination of structural changes. Using a network-based formalism of allostery, we introduced a community-hopping model of allosteric communication. Atomistic reconstruction of signaling pathways in the DnaK structures captured a direction-specific mechanism and molecular details of signal transmission that are fully consistent with the mutagenesis experiments. The results of our study reconciled structural and functional experiments from a network-centric perspective by showing that global properties of the residue interaction networks and coevolutionary signatures may be linked with specificity and diversity of allosteric regulation mechanisms., Author Summary The diversity of allosteric mechanisms in the Hsp70 proteins could range from modulation of the inter-domain interactions and conformational dynamics to fine-tuning of the Hsp70 interactions with co-chaperones. The goal of this study is to present a systematic computational analysis of the dynamic and evolutionary factors underlying allosteric structural transformations of the Hsp70 proteins. We investigated the relationship between functional dynamics, residue coevolution, and network organization of residue interactions in the Hsp70 proteins. The results of this study revealed that conformational dynamics of the Hsp70 proteins may be linked with coevolutionary propensities and mutual information dependencies of the protein residues. Modularity and connectivity of allosteric interactions in the Hsp70 chaperones are coordinated by stable functional sites that feature unique coevolutionary signatures and high network centrality. The emergence of the inter-domain communities that are coordinated by functional centers and include highly coevolving residues could facilitate structural transitions through cooperative reorganization of the local interacting modules. We determined that the differences in the modularity of the residue interactions and organization of coevolutionary networks in DnaK may be associated with variations in their allosteric mechanisms. The network signatures of the DnaK structures are characteristic of a population-shift allostery that allows for coordinated structural rearrangements of local communities. A dislocation of mediating centers and insufficient coevolutionary coupling between functional regions may render a reduced cooperativity and promote a limited entropy-driven allostery in the Sse1 chaperone that occurs without structural changes. The results of this study showed that a network-centric framework and a community-hopping model of allosteric communication pathways may provide novel insights into molecular and evolutionary principles of allosteric regulation in the Hsp70 proteins.

The dynamics of infectious diseases are greatly influenced by the movement of both susceptible and infected hosts. To accurately represent disease dynamics among a mobile host population, detailed movement models have been coupled with disease transmission models. However, a number of different host movement models have been proposed, each with their own set of assumptions and results that differ from the other models. Here, we compare two movement models coupled to the same disease transmission model using network analyses. This application of network analysis allows us to evaluate the fit and accuracy of the movement model in a multilevel modeling framework with more detail than established statistical modeling fitting methods. We used data that detailed mobile pastoralists’ movements as input for 100 stochastic simulations of a Spatio-Temporal Movement (STM) model and 100 stochastic simulations of an Individual Movement Model (IMM). Both models represent dynamic movement and subsequent contacts. We generated networks in which nodes represent camps and edges represent the distance between camps. We simulated pathogen transmission over these networks and tested five network metrics–strength, betweenness centrality, three-step reach, density, and transitivity–to determine which could predict disease simulation outcomes and thereby be used to correlate model simulation results with disease transmission simulations. We found that strength, network density, and three-step reach of movement model results correlated with the final epidemic size of outbreak simulations. Betweenness centrality only weakly correlated for the IMM model. Transitivity only weakly correlated for the STM model and time-varying IMM model metrics. We conclude that movement models coupled with disease transmission models can affect disease transmission results and should be carefully considered and vetted when modeling pathogen spread in mobile host populations. Strength, network density, and three-step reach can be used to evaluate movement models before disease simulations to predict final outbreak sizes. These findings can contribute to the analysis of multilevel models across systems., Author summary Epidemics of infectious disease vary geographically and vary through time. A large part of this variation is caused by movement of individuals who are susceptible to the disease or infected with the disease. To study how movement affects epidemics, researchers often combine movement models with transmission models. However, multiple movement models have been proposed, and their effect on infectious disease model output is not well understood. Here, we combine two different movement models that we developed to represent mobile pastoralists in the Far North Region, Cameroon, with the same disease transmission model. We use network metrics to test how different movement models can affect the output of the disease transmission model. We found that three metrics could be applied to movement model output in order to predict epidemic model output. We conclude that movement models coupled with disease transmission models can affect disease transmission results and should be carefully considered and vetted when modeling epidemics.

In this study, we investigate if phase-locking of fast oscillatory activity relies on the anatomical skeleton and if simple computational models informed by structural connectivity can help further to explain missing links in the structure-function relationship. We use diffusion tensor imaging data and alpha band-limited EEG signal recorded in a group of healthy individuals. Our results show that about 23.4% of the variance in empirical networks of resting-state functional connectivity is explained by the underlying white matter architecture. Simulating functional connectivity using a simple computational model based on the structural connectivity can increase the match to 45.4%. In a second step, we use our modeling framework to explore several technical alternatives along the modeling path. First, we find that an augmentation of homotopic connections in the structural connectivity matrix improves the link to functional connectivity while a correction for fiber distance slightly decreases the performance of the model. Second, a more complex computational model based on Kuramoto oscillators leads to a slight improvement of the model fit. Third, we show that the comparison of modeled and empirical functional connectivity at source level is much more specific for the underlying structural connectivity. However, different source reconstruction algorithms gave comparable results. Of note, as the fourth finding, the model fit was much better if zero-phase lag components were preserved in the empirical functional connectome, indicating a considerable amount of functionally relevant synchrony taking place with near zero or zero-phase lag. The combination of the best performing alternatives at each stage in the pipeline results in a model that explains 54.4% of the variance in the empirical EEG functional connectivity. Our study shows that large-scale brain circuits of fast neural network synchrony strongly rely upon the structural connectome and simple computational models of neural activity can explain missing links in the structure-function relationship., Author Summary Brain imaging techniques are broadly divided into the two categories of structural and functional imaging. Structural imaging provides information about the static physical connectivity within the brain, while functional imaging provides data about the dynamic ongoing activation of brain areas. Computational models allow to bridge the gap between these two modalities and allow to gain new insights. Specifically, in this study, we use structural data from diffusion tractography recordings to model functional brain connectivity obtained from fast EEG dynamics occurring at the alpha frequency. First, we present a simple reference procedure which consists of several steps to link the structural to the functional empirical data. Second, we systematically compare several alternative methods along the modeling path in order to assess their impact on the overall fit between simulations and empirical data. We explore preprocessing steps of the structural connectivity and different levels of complexity of the computational model. We highlight the importance of source reconstruction and compare commonly used source reconstruction algorithms and metrics to assess functional connectivity. Our results serve as an important orienting frame for the emerging field of brain network modeling.

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis of Saccharomyces cerevisiae.Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem on a diffusion network. Utilizing all regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using a variant of time lagged transfer entropy, a method for quantifying information transfer between variables. Influence, for a particular number of sources, was measured using a diffusion model based on Markov chains with absorbing states. By maximizing over different numbers of sources, an influence ranking on genes was produced.The influence ranking was compared to other metrics of network centrality. Although ‘top genes’ from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. This is quantified by computing node reachability between gene sets; on average, 59% of central genes can be reached when starting from the influential set, compared to 7% of influential genes when starting at another centrality measure.The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease.Code and example data can be found at: https://github.com/Gibbsdavidl/miergolfAuthor SummaryThe Influence Maximization Problem (IMP) is general and is applied in fields such as epidemiology, social network analysis, and as shown here, biological network analysis. The aim is to discover the set of regulatory genes with the greatest influence in the network dynamics. As gene regulation, fundamentally, is about the flow of information, the IMP was framed as an information theoretic problem. Dynamics were encoded as edge weights using time lagged transfer entropy, a quantity that defines information transfer across variables. The information flow was accomplished using a diffusion model based on Markov chains with absorbing states. Ant optimization was applied to solve the subset selection problem, recovering the most influential nodes.The influential nodes act as critical sources of information flow, potentially affecting the network state. Biological events that impact the influential nodes and thereby affecting normal information flow, could have a strong effect on the network, potentially leading to disease.

As infectious disease surveillance systems expand to include digital, crowd-sourced, and social network data, public health agencies are gaining unprecedented access to high-resolution data and have an opportunity to selectively monitor informative individuals. Contact networks, which are the webs of interaction through which diseases spread, determine whether and when individuals become infected, and thus who might serve as early and accurate surveillance sensors. Here, we evaluate three strategies for selecting sensors—sampling the most connected, random, and friends of random individuals—in three complex social networks—a simple scale-free network, an empirical Venezuelan college student network, and an empirical Montreal wireless hotspot usage network. Across five different surveillance goals—early and accurate detection of epidemic emergence and peak, and general situational awareness—we find that the optimal choice of sensors depends on the public health goal, the underlying network and the reproduction number of the disease (R0). For diseases with a low R0, the most connected individuals provide the earliest and most accurate information about both the onset and peak of an outbreak. However, identifying network hubs is often impractical, and they can be misleading if monitored for general situational awareness, if the underlying network has significant community structure, or if R0 is high or unknown. Taking a theoretical approach, we also derive the optimal surveillance system for early outbreak detection but find that real-world identification of such sensors would be nearly impossible. By contrast, the friends-of-random strategy offers a more practical and robust alternative. It can be readily implemented without prior knowledge of the network, and by identifying sensors with higher than average, but not the highest, epidemiological risk, it provides reasonably early and accurate information., Author Summary As public health agencies strive to harness big data to improve outbreak surveillance, they face the challenge of extracting meaningful information that can be directly used to improve public health, without incurring additional costs. In this article, we address the question: Which nodes in a social network should be selectively monitored to detect and monitor outbreaks as early and accurately as possible? We derive best-case performance scenarios, and show that a practical strategy for data collection–recruiting friends of randomly selected individuals–is expected to perform reasonably well, in terms of the timing and reliability of the epidemiological information collected.

Human gene regulatory networks (GRN) can be difficult to interpret due to a tangle of edges interconnecting thousands of genes. We constructed a general human GRN from extensive transcription factor and microRNA target data obtained from public databases. In a subnetwork of this GRN that is active during estrogen stimulation of MCF-7 breast cancer cells, we benchmarked automated algorithms for identifying core regulatory genes (transcription factors and microRNAs). Among these algorithms, we identified K-core decomposition, pagerank and betweenness centrality algorithms as the most effective for discovering core regulatory genes in the network evaluated based on previously known roles of these genes in MCF-7 biology as well as in their ability to explain the up or down expression status of up to 70% of the remaining genes. Finally, we validated the use of K-core algorithm for organizing the GRN in an easier to interpret layered hierarchy where more influential regulatory genes percolate towards the inner layers. The integrated human gene and miRNA network and software used in this study are provided as supplementary materials (S1 Data) accompanying this manuscript., Author Summary A gene regulatory network (GRN) represents how some genes encoding regulatory molecules such as transcription factors or microRNAs regulate the expression of other genes. Researchers commonly study GRNs involved in a specific biological process with the aim of identifying a few important regulatory genes. In higher organisms such as humans, a regulatory gene regulates multiple target genes and correspondingly any gene is regulated by multiple regulatory genes. Due to such multiplicity of interactions, a GRN usually resembles a tangled hairball wherein it is difficult to identify few most influential regulatory genes. In this study, we show that network analysis algorithms such as K-core, pagerank and betweenness centrality are useful for identifying a few important or core regulatory genes in a GRN, and the K-core algorithm is also useful for organizing regulatory genes in a hierarchical layered structure where the most influential genes in a GRN are found within the innermost layer or core. These few core regulatory genes determine to a large extent the expression status of the remaining genes in the network. We illustrate a pragmatic application of this technique to GRNs reconstructed from genome-wide gene expression measurements in the MCF-7 human breast cancer cell line.

In recent years, the field of network science has enabled researchers to represent the highly complex interactions in the brain in an approachable yet quantitative manner. One exciting finding since the advent of brain network research was that the brain network can withstand extensive damage, even to highly connected regions. However, these highly connected nodes may not be the most critical regions of the brain network, and it is unclear how the network dynamics are impacted by removal of these key nodes. This work seeks to further investigate the resilience of the human functional brain network. Network attack experiments were conducted on voxel-wise functional brain networks and region-of-interest (ROI) networks of 5 healthy volunteers. Networks were attacked at key nodes using several criteria for assessing node importance, and the impact on network structure and dynamics was evaluated. The findings presented here echo previous findings that the functional human brain network is highly resilient to targeted attacks, both in terms of network structure and dynamics., Author Summary Why can the brain endure numerous micro-strokes with seemingly no detrimental impact, until one cataclysmal stroke hinders the ability to perform essential functions such as speech and mobility? Perhaps various small regions or foci of the brain are highly important to information transfer, and the loss of such highly central foci would be severely injurious to brain function. Identification of such foci, via modeling of the functional brain using network theory, could lead to important advances with regard to brain disease and stroke. In this work, we utilized functional brain networks constructed from human volunteers to study how removing particular regions of the brain impacts brain network structure and information transfer properties. We sought to determine whether a particular measure of region importance may be able to identify highly critical regions, and whether targeting highly critical regions would have a more detrimental impact than removing regions at random. We found that, while in general targeted removal has a larger impact on network structure and dynamics, the human brain network is comparatively resilient against both targeted and random removal.