A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models

We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure.     

Changes of Functional Brain Networks in Major Depressive Disorder: A Graph Theoretical Analysis of Resting-State fMRI

Recent developments in graph theory have heightened the need for investigating the disruptions in the topological structure of functional brain network in major depressive disorder (MDD). In this study, we employed resting-state functional magnetic resonance imaging (fMRI) and graph theory to examine the whole-brain functional networks among 42 MDD patients and 42 healthy controls. Our results showed that compared with healthy controls, MDD patients showed higher local efficiency and modularity. Furthermore, MDD patients showed altered nodal centralities of many brain regions, including hippocampus, temporal cortex, anterior cingulate gyrus and dorsolateral prefrontal gyrus, mainly located in default mode network and cognitive control network. Together, our results suggested that MDD was associated with disruptions in the topological structure of functional brain networks, and provided new insights concerning the pathophysiological mechanisms of MDD.     

Exploring biological network structure using exponential random graph models

MOTIVATION: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus on identifying simple, but prominent, structural components, as such components are easier to understand, and, once identified, can be used as building blocks to succinctly describe the network. RESULTS: In recent social network studies, exponential random graph models have been used extensively to model global social network structure as a function of their 'local features'. Starting from those studies, we describe the exponential random graph models and demonstrate their utility in modeling the architecture of biological networks as a function of the prominence of local features. We argue that the flexibility, in terms of the number of available local feature choices, and scalability, in terms of the network sizes, make this approach ideal for statistical modeling of biological networks. We illustrate the modeling on both genetic and metabolic networks and provide a novel way of classifying biological networks based on the prevalence of their local features.     

Context‐dependency and anthropogenic effects on individual plant–frugivore networks

Anthropogenic activities, such as grazing by domestic animals, are considered drivers of environmental changes that may influence the structure of interaction networks. The study of individual‐based networks allows testing how species‐level interaction patterns emerge from the pooled interaction modes of individuals within populations. Exponential random graph models (ERGMs) examine the global structure of networks by allowing the inclusion of specific node (i.e. interacting partners) properties as explanatory covariates. Here we assessed the structure of individual plant–frugivore interaction networks and the ecological variables that influence the mode of interactions under different land‐use (grazed versus ungrazed protected areas). We quantified the number of visits, the number of fruits removed per visit and the interaction strength of mammal frugivore species at each individual tree. Additionally we quantified ecological variables at the individual, microhabitat, neighborhood and habitat scales that generated interaction network structure under the different land uses. Individual plant–frugivore networks were significantly modular in both land uses but the number of modules was higher in the grazed areas. We found interaction networks for grazed and ungrazed lands were structured by phenotypic traits of individual trees, by the microhabitat beneath the tree canopy and were affected by habitat modifications of anthropogenic origin. The neighborhood surrounding each individual plant influenced plant–frugivore interactions only at the grazed‐land trees. We conclude that anthropogenic land uses influence the topological patterns of plant–frugivore networks and the frugivore visitation to trees through modification of both habitat complexity and the ecological traits underlying interactions between individual plants and frugivore species.     

Coevolution by different functional mechanisms modulates the structure and dynamics of antagonistic and mutualistic networks

A central problem in the study of species interactions is to understand the underlying ecological and evolutionary mechanisms that shape and are shaped by trait evolution in interacting assemblages. The patterns of interaction among species (i.e. network structure) provide the pathways for evolution and coevolution, which are modulated by how traits affect individual fitness (i.e. functional mechanisms). Functional mechanisms, in turn, also affect the likelihood of an ecological interaction, shaping the structure of interaction networks. Here, we build adaptive network models to explore the potential role of coevolution by two functional mechanisms, trait matching and exploitation barrier, in driving trait evolution and the structure of interaction networks. We use these models to explore how different scenarios of coevolution and functional mechanisms reproduce the empirical network patterns observed in antagonistic and mutualistic interactions and affect trait evolution. Scenarios assuming coevolutionary feedback with a strong effect of functional mechanism better reproduce the empirical structure of networks. Antagonistic and mutualistic networks, however, are better explained by different functional mechanisms and the structure of antagonisms is better reproduced than that of mutualisms. Scenarios assuming coevolution by strong trait matching between interacting partners better explain the structure of antagonistic networks, whereas those assuming strong barrier effects better reproduce the structure of mutualistic networks. The dynamics resulting from the feedback between strong functional mechanisms and coevolution favor the stability of antagonisms and mutualisms. Selection favoring trait matching reduces temporal trait fluctuation and the magnitude of arms races in antagonisms, whereas selection due to exploitation barriers reduces temporal trait fluctuations in mutualisms. Our results indicate that coevolutionary models better reproduce the network structure of antagonisms than those of mutualisms and that different functional mechanisms may favor the persistence of antagonistic and mutualistic interacting assemblages.     

GAT: a graph-theoretical analysis toolbox for analyzing between-group differences in large-scale structural and functional brain networks

In recent years, graph theoretical analyses of neuroimaging data have increased our understanding of the organization of large-scale structural and functional brain networks. However, tools for pipeline application of graph theory for analyzing topology of brain networks is still lacking. In this report, we describe the development of a graph-analysis toolbox (GAT) that facilitates analysis and comparison of structural and functional network brain networks. GAT provides a graphical user interface (GUI) that facilitates construction and analysis of brain networks, comparison of regional and global topological properties between networks, analysis of network hub and modules, and analysis of resilience of the networks to random failure and targeted attacks. Area under a curve (AUC) and functional data analyses (FDA), in conjunction with permutation testing, is employed for testing the differences in network topologies; analyses that are less sensitive to the thresholding process. We demonstrated the capabilities of GAT by investigating the differences in the organization of regional gray-matter correlation networks in survivors of acute lymphoblastic leukemia (ALL) and healthy matched Controls (CON). The results revealed an alteration in small-world characteristics of the brain networks in the ALL survivors; an observation that confirm our hypothesis suggesting widespread neurobiological injury in ALL survivors. Along with demonstration of the capabilities of the GAT, this is the first report of altered large-scale structural brain networks in ALL survivors.     

Robust Gaussian Graphical Modeling Via l1 Penalization

Summary Gaussian graphical models have been widely used as an effective method for studying the conditional independency structure among genes and for constructing genetic networks. However, gene expression data typically have heavier tails or more outlying observations than the standard Gaussian distribution. Such outliers in gene expression data can lead to wrong inference on the dependency structure among the genes. We propose a l₁ penalized estimation procedure for the sparse Gaussian graphical models that is robustified against possible outliers. The likelihood function is weighted according to how the observation is deviated, where the deviation of the observation is measured based on its own likelihood. An efficient computational algorithm based on the coordinate gradient descent method is developed to obtain the minimizer of the negative penalized robustified‐likelihood, where nonzero elements of the concentration matrix represents the graphical links among the genes. After the graphical structure is obtained, we re‐estimate the positive definite concentration matrix using an iterative proportional fitting algorithm. Through simulations, we demonstrate that the proposed robust method performs much better than the graphical Lasso for the Gaussian graphical models in terms of both graph structure selection and estimation when outliers are present. We apply the robust estimation procedure to an analysis of yeast gene expression data and show that the resulting graph has better biological interpretation than that obtained from the graphical Lasso.     

Inferring general relations between network characteristics from specific network ensembles

Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their ability to generate networks with large structural variability. In particular, we consider the statistical constraints which the respective construction scheme imposes on the generated networks. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This makes it possible to infer global features from local ones using regression models trained on networks with high generalization power. Our results confirm and extend previous findings regarding the synchronization properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks in good approximation. Finally, we demonstrate on three different data sets (C. elegans neuronal network, R. prowazekii metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models.     

Whole-brain Functional Networks in Cognitively Normal,Mild Cognitive Impairment,and Alzheimer’s Disease

The conceptual significance of understanding functional brain alterations and cognitive deficits associated with Alzheimer’s disease (AD) process has been widely established. However, the whole-brain functional networks of AD and its prodromal stage, mild cognitive impairment (MCI), are not well clarified yet. In this study, we compared the characteristics of the whole-brain functional networks among cognitively normal (CN), MCI, and AD individuals by applying graph theoretical analyses to [¹⁸F] fluorodeoxyglucose positron emission tomography (FDG-PET) data. Ninety-four CN elderly, 183 with MCI, and 216 with AD underwent clinical evaluation and FDG-PET scan. The overall small-world property as seen in the CN whole-brain network was preserved in MCI and AD. In contrast, individual parameters of the network were altered with the following patterns of changes: local clustering of networks was lower in both MCI and AD compared to CN, while path length was not different among the three groups. Then, MCI had a lower level of local clustering than AD. Subgroup analyses for AD also revealed that very mild AD had lower local clustering and shorter path length compared to mild AD. Regarding the local properties of the whole-brain networks, MCI and AD had significantly decreased normalized betweenness centrality in several hubs regionally associated with the default mode network compared to CN. Our results suggest that the functional integration in whole-brain network progressively declines due to the AD process. On the other hand, functional relatedness between neighboring brain regions may not gradually decrease, but be the most severely altered in MCI stage and gradually re-increase in clinical AD stages.     

Probabilistic inference in general graphical models through sampling in stochastic networks of spiking neurons

An important open problem of computational neuroscience is the generic organization of computations in networks of neurons in the brain. We show here through rigorous theoretical analysis that inherent stochastic features of spiking neurons, in combination with simple nonlinear computational operations in specific network motifs and dendritic arbors, enable networks of spiking neurons to carry out probabilistic inference through sampling in general graphical models. In particular, it enables them to carry out probabilistic inference in Bayesian networks with converging arrows ("explaining away") and with undirected loops, that occur in many real-world tasks. Ubiquitous stochastic features of networks of spiking neurons, such as trial-to-trial variability and spontaneous activity, are necessary ingredients of the underlying computational organization. We demonstrate through computer simulations that this approach can be scaled up to neural emulations of probabilistic inference in fairly large graphical models, yielding some of the most complex computations that have been carried out so far in networks of spiking neurons.     

A Network-based Analysis of the 1861 Hagelloch Measles Data

Summary In this article, we demonstrate a statistical method for fitting the parameters of a sophisticated network and epidemic model to disease data. The pattern of contacts between hosts is described by a class of dyadic independence exponential-family random graph models (ERGMs), whereas the transmission process that runs over the network is modeled as a stochastic susceptible-exposed-infectious-removed (SEIR) epidemic. We fit these models to very detailed data from the 1861 measles outbreak in Hagelloch, Germany. The network models include parameters for all recorded host covariates including age, sex, household, and classroom membership and household location whereas the SEIR epidemic model has exponentially distributed transmission times with gamma-distributed latent and infective periods. This approach allows us to make meaningful statements about the structure of the population-separate from the transmission process-as well as to provide estimates of various biological quantities of interest, such as the effective reproductive number, R. Using reversible jump Markov chain Monte Carlo, we produce samples from the joint posterior distribution of all the parameters of this model-the network, transmission tree, network parameters, and SEIR parameters-and perform Bayesian model selection to find the best-fitting network model. We compare our results with those of previous analyses and show that the ERGM network model better fits the data than a Bernoulli network model previously used. We also provide a software package, written in R, that performs this type of analysis.     

neuroConstruct: a tool for modeling networks of neurons in 3D space

Conductance-based neuronal network models can help us understand how synaptic and cellular mechanisms underlie brain function. However, these complex models are difficult to develop and are inaccessible to most neuroscientists. Moreover, even the most biologically realistic network models disregard many 3D anatomical features of the brain. Here, we describe a new software application, neuroConstruct, that facilitates the creation, visualization, and analysis of networks of multicompartmental neurons in 3D space. A graphical user interface allows model generation and modification without programming. Models within neuroConstruct are based on new simulator-independent NeuroML standards, allowing automatic generation of code for NEURON or GENESIS simulators. neuroConstruct was tested by reproducing published models and its simulator independence verified by comparing the same model on two simulators. We show how more anatomically realistic network models can be created and their properties compared with experimental measurements by extending a published 1D cerebellar granule cell layer model to 3D.     

Selection of Statistical Thresholds in Graphical Models

Reconstruction of gene regulatory networks based on experimental data usually relies on statistical evidence, necessitating the choice of a statistical threshold which defines a significant biological effect. Approaches to this problem found in the literature range from rigorous multiple testing procedures to ad hoc P-value cut-off points. However, when the data implies graphical structure, it should be possible to exploit this feature in the threshold selection process. In this article we propose a procedure based on this principle. Using coding theory we devise a measure of graphical structure, for example, highly connected nodes or chain structure. The measure for a particular graph can be compared to that of a random graph and structure inferred on that basis. By varying the statistical threshold the maximum deviation from random structure can be estimated, and the threshold is then chosen on that basis. A global test for graph structure follows naturally.     

WLPVG approach to the analysis of EEG-based functional brain network under manual acupuncture

Functional brain network, one of the main methods for brain functional studies, can provide the connectivity information among brain regions. In this research, EEG-based functional brain network is built and analyzed through a new wavelet limited penetrable visibility graph (WLPVG) approach. This approach first decompose EEG into δ, θ, α, β sub-bands, then extracting nonlinear features from single channel signal, in addition forming a functional brain network for each sub-band. Manual acupuncture (MA) as a stimulation to the human nerve system, may evoke varied modulating effects in brain activities. To investigating whether and how this happens, WLPVG approach is used to analyze the EEGs of 15 healthy subjects with MA at acupoint ST36 on the right leg. It is found that MA can influence the complexity of EEG sub-bands in different ways and lead the functional brain networks to obtain higher efficiency and stronger small-world property compared with pre-acupuncture control state.     

A Spectral Graph Regression Model for Learning Brain Connectivity of Alzheimer’s Disease

Understanding network features of brain pathology is essential to reveal underpinnings of neurodegenerative diseases. In this paper, we introduce a novel graph regression model (GRM) for learning structural brain connectivity of Alzheimer''s disease (AD) measured by amyloid-β deposits. The proposed GRM regards ¹¹C-labeled Pittsburgh Compound-B (PiB) positron emission tomography (PET) imaging data as smooth signals defined on an unknown graph. This graph is then estimated through an optimization framework, which fits the graph to the data with an adjustable level of uniformity of the connection weights. Under the assumed data model, results based on simulated data illustrate that our approach can accurately reconstruct the underlying network, often with better reconstruction than those obtained by both sample correlation and ℓ1-regularized partial correlation estimation. Evaluations performed upon PiB-PET imaging data of 30 AD and 40 elderly normal control (NC) subjects demonstrate that the connectivity patterns revealed by the GRM are easy to interpret and consistent with known pathology. Moreover, the hubs of the reconstructed networks match the cortical hubs given by functional MRI. The discriminative network features including both global connectivity measurements and degree statistics of specific nodes discovered from the AD and NC amyloid-beta networks provide new potential biomarkers for preclinical and clinical AD.     

Loss of 'small-world' networks in Alzheimer's disease: graph analysis of FMRI resting-state functional connectivity

Background

Local network connectivity disruptions in Alzheimer''s disease patients have been found using graph analysis in BOLD fMRI. Other studies using MEG and cortical thickness measures, however, show more global long distance connectivity changes, both in functional and structural imaging data. The form and role of functional connectivity changes thus remains ambiguous. The current study shows more conclusive data on connectivity changes in early AD using graph analysis on resting-state condition fMRI data.

Methodology/Principal Findings

18 mild AD patients and 21 healthy age-matched control subjects without memory complaints were investigated in resting-state condition with MRI at 1.5 Tesla. Functional coupling between brain regions was calculated on the basis of pair-wise synchronizations between regional time-series. Local (cluster coefficient) and global (path length) network measures were quantitatively defined. Compared to controls, the characteristic path length of AD functional networks is closer to the theoretical values of random networks, while no significant differences were found in cluster coefficient. The whole-brain average synchronization does not differ between Alzheimer and healthy control groups. Post-hoc analysis of the regional synchronization reveals increased AD synchronization involving the frontal cortices and generalized decreases located at the parietal and occipital regions. This effectively translates in a global reduction of functional long-distance links between frontal and caudal brain regions.

Conclusions/Significance

We present evidence of AD-induced changes in global brain functional connectivity specifically affecting long-distance connectivity. This finding is highly relevant for it supports the anterior-posterior disconnection theory and its role in AD. Our results can be interpreted as reflecting the randomization of the brain functional networks in AD, further suggesting a loss of global information integration in disease.     

An empirical Bayes approach to inferring large-scale gene association networks

MOTIVATION: Genetic networks are often described statistically using graphical models (e.g. Bayesian networks). However, inferring the network structure offers a serious challenge in microarray analysis where the sample size is small compared to the number of considered genes. This renders many standard algorithms for graphical models inapplicable, and inferring genetic networks an 'ill-posed' inverse problem. METHODS: We introduce a novel framework for small-sample inference of graphical models from gene expression data. Specifically, we focus on the so-called graphical Gaussian models (GGMs) that are now frequently used to describe gene association networks and to detect conditionally dependent genes. Our new approach is based on (1) improved (regularized) small-sample point estimates of partial correlation, (2) an exact test of edge inclusion with adaptive estimation of the degree of freedom and (3) a heuristic network search based on false discovery rate multiple testing. Steps (2) and (3) correspond to an empirical Bayes estimate of the network topology. RESULTS: Using computer simulations, we investigate the sensitivity (power) and specificity (true negative rate) of the proposed framework to estimate GGMs from microarray data. This shows that it is possible to recover the true network topology with high accuracy even for small-sample datasets. Subsequently, we analyze gene expression data from a breast cancer tumor study and illustrate our approach by inferring a corresponding large-scale gene association network for 3883 genes.     

Effects of different correlation metrics and preprocessing factors on small-world brain functional networks: a resting-state functional MRI study

Graph theoretical analysis of brain networks based on resting-state functional MRI (R-fMRI) has attracted a great deal of attention in recent years. These analyses often involve the selection of correlation metrics and specific preprocessing steps. However, the influence of these factors on the topological properties of functional brain networks has not been systematically examined. Here, we investigated the influences of correlation metric choice (Pearson's correlation versus partial correlation), global signal presence (regressed or not) and frequency band selection [slow-5 (0.01-0.027 Hz) versus slow-4 (0.027-0.073 Hz)] on the topological properties of both binary and weighted brain networks derived from them, and we employed test-retest (TRT) analyses for further guidance on how to choose the "best" network modeling strategy from the reliability perspective. Our results show significant differences in global network metrics associated with both correlation metrics and global signals. Analysis of nodal degree revealed differing hub distributions for brain networks derived from Pearson's correlation versus partial correlation. TRT analysis revealed that the reliability of both global and local topological properties are modulated by correlation metrics and the global signal, with the highest reliability observed for Pearson's-correlation-based brain networks without global signal removal (WOGR-PEAR). The nodal reliability exhibited a spatially heterogeneous distribution wherein regions in association and limbic/paralimbic cortices showed moderate TRT reliability in Pearson's-correlation-based brain networks. Moreover, we found that there were significant frequency-related differences in topological properties of WOGR-PEAR networks, and brain networks derived in the 0.027-0.073 Hz band exhibited greater reliability than those in the 0.01-0.027 Hz band. Taken together, our results provide direct evidence regarding the influences of correlation metrics and specific preprocessing choices on both the global and nodal topological properties of functional brain networks. This study also has important implications for how to choose reliable analytical schemes in brain network studies.     

Driving and driven architectures of directed small-world human brain functional networks

Recently, increasing attention has been focused on the investigation of the human brain connectome that describes the patterns of structural and functional connectivity networks of the human brain. Many studies of the human connectome have demonstrated that the brain network follows a small-world topology with an intrinsically cohesive modular structure and includes several network hubs in the medial parietal regions. However, most of these studies have only focused on undirected connections between regions in which the directions of information flow are not taken into account. How the brain regions causally influence each other and how the directed network of human brain is topologically organized remain largely unknown. Here, we applied linear multivariate Granger causality analysis (GCA) and graph theoretical approaches to a resting-state functional MRI dataset with a large cohort of young healthy participants (n = 86) to explore connectivity patterns of the population-based whole-brain functional directed network. This directed brain network exhibited prominent small-world properties, which obviously improved previous results of functional MRI studies showing weak small-world properties in the directed brain networks in terms of a kernel-based GCA and individual analysis. This brain network also showed significant modular structures associated with 5 well known subsystems: fronto-parietal, visual, paralimbic/limbic, subcortical and primary systems. Importantly, we identified several driving hubs predominantly located in the components of the attentional network (e.g., the inferior frontal gyrus, supplementary motor area, insula and fusiform gyrus) and several driven hubs predominantly located in the components of the default mode network (e.g., the precuneus, posterior cingulate gyrus, medial prefrontal cortex and inferior parietal lobule). Further split-half analyses indicated that our results were highly reproducible between two independent subgroups. The current study demonstrated the directions of spontaneous information flow and causal influences in the directed brain networks, thus providing new insights into our understanding of human brain functional connectome.