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.
Citation: Hosseini SMH, Hoeft F, Kesler SR (2012) GAT: A Graph-Theoretical Analysis Toolbox for Analyzing Between-Group Differences in Large-Scale Structural and Functional Brain Networks. PLoS ONE 7(7): e40709. doi:10.1371/journal.pone.0040709
Editor: Renaud Lambiotte, University of Namur, Belgium
Received: April 2, 2012; Accepted: June 12, 2012; Published: July 13, 2012
Copyright: © 2012 Hosseini et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: This work was supported by the National Institutes of Health Director’s New Innovator Award 1 DP2 OD004445-01 to SK and K23 HD054720 to FH and National Cancer Institute (K07 CA134639 to SK). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
Brain structural and functional connectivity plays an important role in neuroanatomy, neurodevelopment, electrophysiology, functional brain imaging, and neural basis of cognition . Brain networks, along with other biological networks, have been shown to follow a specific topology known as small-world. A small-world network architecture facilitates rapid synchronization and efficient information transfer with minimal wiring cost through an optimal balance between local processing and global interaction . Since small-world characteristics were described quantitatively for brain networks, there have been multiple graph-theoretical studies seeking to assess the organization of structural and functional brain networks in healthy individuals and patient population –.
The unique feature of graph-theoretical analysis, compared with the more traditional univariate neuroimaging approaches, is that it can directly test the differences in topological parameters of the brain network such as small-worldness, modularity, highly connected regions (hubs), and regional network parameters. ,  Additionally, graph theoretical analysis is potentially applicable to any modality, scale, or volume of neuroscientific data . Graph theoretical analyses have been applied to regional gray matter volume, cortical thickness, surface area, and diffusion weighted imaging data to analyze topology of structural brain networks and to resting state and task-related functional connectivity data to analyze the topology of functional brain networks. These studies have illustrated an alteration of arrangements in structural and functional brain networks associated with normal aging, multiple sclerosis, Alzheimer’s disease, schizophrenia, depression, and epilepsy , , , , , , , , .
In recent years, a number of freely available software packages have been introduced to apply graph theory for analyzing topology of brain networks (e.g. Brain Connectivity Toolbox ; eConnectome ; NetworkX (http://networkx.lanl.gov/overview.html); and Brainwaiver (http://cran.r-project.org/web/packages/brainwaver). The focus of these packages is mainly on extracting network measures and/or visualization of networks. However, the methodology of comparing network topologies of different groups (or systems) is challenging . In this report, we describe the development a graph analysis toolbox (GAT) that facilitates analysis and comparison of structural and functional brain networks. GAT is an open-source Matlab-based package with graphical user interface that integrates the Brain Connectivity Toolbox  for quantification of network measures and the REX toolbox (http://web.mit.edu/swg/software.htm) for region of interest extraction (REX). For structural network analysis, GAT accepts gray matter volume/surface area/cortical thickness data of groups, extracts structural correlation networks, applies different thresholding schemes for comparing networks between groups, calculates network measures for different thresholding schemes, estimates between-group differences in network measures using functional data analysis (FDA) ,  and area under the curve (AUC) analysis, tests the significance of between-group differences in global and regional network measures using nonparametric permutation testing, and performs hub analysis, random failure and targeted attack analysis and modularity analysis. For functional networks, GAT accepts the output from functional connectivity toolbox (http://www.nitrc.org/projects/conn), extracts the network measures, finds the range of network densities where individual networks are not fragmented, performs both parametric and non-parametric statistical tests to test the significance of between-group differences in global and regional network measures at each densities as well as on FDA and AUC estimates, and the above-mentioned analyses as for structural graphs.
To demonstrate the capabilities of GAT, we investigated the differences in organization of structural brain networks in survivors of acute lymphoblastic leukemia (ALL), the most common childhood cancer, and healthy matched controls. There are several lines of evidence suggesting that ALL may involve widespread neurobiologic injury. First, while the mechanism by which cancer and its treatments affect cognitive function are largely unknown, possible candidates include neurotoxic effects of chemotherapy, oxidative damage and cytokine dysregulation , . These candidate mechanisms might have diffuse effects on brain structure. Second, structural neuroimaging studies, including our own  have shown diffuse changes in white matter and gray matter structure associated with ALL –. Third, meta-analyses of neuropsychological studies on ALL survivors have indicated decline in a wide range of cognitive functions including executive functioning, processing speed and memory ,  (see ,  for a review). These functions are known to be subserved by distributed, integrated neural networks . We investigated whether topological properties of large-scale structural brain networks are altered in ALL survivors.
Materials and Methods
Overview of How to Use the GAT
GAT is an open-source Matlab (The MathWorks Inc., Natick) package that provides a GUI framework to facilitate the investigation of organization of brain networks. The GUI allows users to interact with the toolbox easily without requiring knowledge of Matlab or programming. GAT provides an interactive platform for conducting graph theoretical analysis on various types of data including morphometry, functional, diffusion weighted and behavioral data (Fig. 1). The main focus of the toolbox is on analyzing the between-group differences in brain network topology. The toolbox facilitates investigation of brain networks by constructing binary undirected graphs (i.e. two regions in brain network are either connected or not connected and the connection does not have any weight or direction). However, we are extending the toolbox to be able to analyze weighted and directed networks. In the following sections, we describe the detailed procedure for analyzing structural and functional network. The procedure for analyzing between-group differences in behavioral networks/white matter networks is quite similar to the procedure described for comparison of structural morphometry/functional networks.
The toolbox allows topological assessment of morphometry, functional, diffusion, and behavioral data.
Structural Graphs Based on Morphometry Data
Coordinated variations in brain morphology have been proposed as a valid measure to infer large-scale structural brain networks , –. This approach depends upon the assumption that positive correlations between morphometric parameters of different brain regions indicate connectivity . Previous study revealed that some of the tractography maps obtained from diffusion tensor imaging are strikingly similar to pattern of correlations in cortical thickness . In addition, the structural networks constructed from morphometric correlations of cortical volume, thickness, and surface data , – have been shown to follow small-world characteristics in healthy individuals , , , . The GUI panel for investigating structural correlation networks based on morphometry data is shown in Fig. 2.
The toolbox facilitates construction of structural correlation networks, extraction of network measures, statistical analysis, regional network analysis, network failure and attack analysis, modularity analysis, AUC and FDA analyses and visualization.
GAT accepts two types of morphometry data to investigate the organization of structural correlation networks: first, GAT accepts the gray matter images of individuals as input (e.g. modulated, normalized gray matter maps from voxel-based morphometry analysis). Having the gray matter images, the first step is to define the network nodes that are identified by the regional parcellation scheme that will be chosen. There are different nodal definition methods in brain network analysis. While the results might be affected by the choice of parcellation scheme, recent evidence indicates that the results of between-group comparison remain intact regardless of the applied parcellation scheme . The ROI scheme that is available in GAT is the 90 cortical and subcortical regions of interest (ROIs) from the Automated Anatomical Labeling (AAL) atlas, extracted using the WFU PickAtlas Toolbox . The ROIs are identical to those used in a previous graph analysis study of typical brain development by Fan and colleagues , , . Note that the gray matter images should be resliced to the same dimension as that of the provided AAL ROIs. The ROIs are subsequently used to mask the individual modulated, normalized gray matter images and extract the average volume within each ROI using the REX code (http://web.mit.edu/swg/software.htm). Alternatively, a customized ROI scheme can be implemented to extract the regional volume data. REX accepts predefined ROIs as NIFTI-1 image mask files (*.img or.nii formats) or text files (.tal format). In addition, user can input previously extracted regional morphometry data (e.g. surface area, cortical thickness, regional gray matter volume data) via spreadsheets (Microsoft Excel.xls files) into GAT.
Covariates of nuisance.
For between-group comparisons, the regional morphometry data might require correction for between-group differences in covariates of nuisance such as total brain volume, age and gender. GAT accepts the covariates of nuisance in a spreadsheet (Microsoft Excel.xls files ) and performs a linear regression analysis at every ROI to remove the effects of covariates. The residuals of this regression are then substituted for raw regional morphometry values , , .
Construction of structural correlation network.
GAT uses the extracted regional morphometry data (or residuals) of all the N ROIs for construction of structural correlation networks. For each group, an N×N association matrix R is generated with each entry rij defined as the Pearson correlation coefficient (or partial correlation coefficient) between regional values of regions i and j, across subjects. The user can specify what type of correlation analysis (Pearson vs. partial correlation) to be done on the data. From each association matrix, a binary adjacency matrix A is derived where aij is considered 1 if rij is greater than a specific threshold and zero otherwise. The diagonal elements of the constructed association matrix are set to zero. The resultant adjacency matrix represents a binary undirected graph G in which regions i and j are connected if gij is unity. Therefore, a graph is constructed with n nodes (ROIs), with a network degree of E equal to number of edges (links), and a network density (cost) of D = E/[(N×(N−1) )/2] representing the fraction of present connections to all possible connections.
Thresholding the association matrices of different groups at an absolute threshold results in networks with a different number of nodes (and degrees) that might influence the network measures and reduce interpretation of between group results . Two approaches are implemented for thresholding the constructed association matrices based on previous studies , , : 1) Thresholding the constructed association matrices at a minimum network density (Dmin) in which all nodes become fully connected in the brain networks of both groups (none of the networks are fragmented); 2) Thresholding the constructed association matrices at a range of network densities for comparing the network topologies across that range. The GAT allows the user to specify the range and the interval between densities. The specified range may include the density points prior to the network fragmentation point but the results should be interpreted carefully.
The small-worldness of a complex network, as described in the introduction, has two key metrics: the clustering coefficient C and the characteristic path length L of the network. The clustering coefficient of a node is a measure of the number of edges that exist between its nearest neighbors. The clustering coefficient of a network is thus the average of clustering coefficients across nodes and is a measure of network segregation. The characteristic path length of a network is the average shortest path length between all pairs of nodes in the network and is the most commonly used measure of network integration . To evaluate the topology of the brain network, these parameters must be compared to the corresponding mean values of a benchmark random graph , . Thus, the small-worldness index of a network is obtained as [C/Crand]/[L/Lrand] where Crand and Lrand are the mean clustering coefficient and the characteristic path length of the m random networks . m is the number of null networks generated for normalization of clustering and path length and is specified by the user (default value of 20). In a small-world network, the clustering coefficient is significantly higher than that of random networks (C/Crand ratio greater than 1) while the characteristic path length is comparable to random networks (L/Lrand ratio close to 1). The benchmark random networks are usually constructed using rewiring algorithms that preserves the topology of the graphs; i.e. random graphs with the same number of nodes, total edges and degree distribution as the network of interest , . However, recent evidence suggests that correlation networks are inherently more clustered and partial correlation networks are inherently less clustered than random networks of the same size and degree . Thus, alternative algorithms were proposed for constructing benchmark random networks that only annihilates intrinsic structure in the empirical data. For structural networks, two types of algorithms are implemented in the GAT for construction of benchmark null networks: 1) topology randomization that generates random networks with the same number of nodes, degree, and degree distribution as the network of interest and 2) correlation matrix randomization that generates null covariance matrices that are matched to the distributional properties of the observed covariance matrix . It should be noted that the choice of null network largely affects the small-world metrics for networks thresholded at lower densities (density <0.2) .
GAT extracts network measures using the codes developed in the Brain Connectivity Toolbox (BCT) . Several network metrics including measures of network segregation (e.g. clustering, transitivity), integration (e.g. path length, efficiency), centrality (e.g. nodal betweenness, edge betweenness), and resilience (e.g. assortativity) are quantified (see  for a list of network measures). These metrics are quantified at both the network and regional level. GAT generates the plots of changes in global network measures as a function of network density. It also creates the association and adjacency matrices (thresholded at Dmin) for each group network.
Comparing network measures between groups.
In order to test the statistical significance of the between-group differences in network topology and regional network measures, a non-parametric permutation test with 1000 (user defined) repetitions is used , , . In each repetition, the regional data (or residuals) of each participant are randomly reassigned to one of the two groups so that each randomized group had the same number of subjects as the original groups. Then, an association matrix is obtained for each randomized group. The binary adjacency matrices are then estimated by applying the same thresholding procedure as described above. The network measures are then calculated for all the networks at each density. The differences in network measures between randomized groups (at each network density) are then calculated resulting in a permutation distribution of difference under the null hypothesis. The actual between-group difference in network measures is then placed in the corresponding permutation distribution and a one/two-tailed p-value (user defined) is calculated based on its percentile position . For global network measures, GAT generates the plots of between-differences in network measures along with the quantified confidence intervals as a function of network density.
GAT also compares the areas under a curve (AUC) for each network measure , . For this purpose, the curves extracted from thresholding across a range of densities are used. Each of these curves depicts the changes in a specific network measure (for each group) as a function of network density. To test the significance of the between-group differences in AUC of each network measure, the actual between-group difference in AUC for each network measure is placed in the corresponding permutation distribution and p-value is calculated based on its percentile position. By performing AUC analysis, the comparison between network measures is less sensitive to the thresholding process. However, the result still depends on the selected minimum and maximum network densities. While the GAT uses user-defined range of network densities for AUC analysis, we strongly recommend using the calculated Dmin as the minimum density; specifically because the networks become fragmented below Dmin and the comparisons might be affected by group differences in the number of nodes and connections . A maximum network density of below 50% is suggested since structural networks with more than 50% connections are likely non-biological .
Although AUC analysis alleviates the sensitivity of the between group comparison to the thresholding process, it is too sensitive to the random structure present at higher network density values and is further insensitive to differences in the shape of the curves rather their mean. Thus, in addition to AUC analysis, GAT utilizes functional data analysis (FDA) which is a statistical method for comparing curves and overcomes these limitations , . In FDA, each network measure curve is treated as a function (y = f(x)) and the summation of differences in y-values (a graph metric) between groups are calculated at a range of density. A nonparametric permutation test is then applied (as for AUC analysis) to test the significance of the observed summation.
The same permutation procedure is used to test the significance of the between-group differences in regional network measures. However, for regional measures, GAT performs three separate comparisons: 1) Comparing regional networks measures for the networks thresholded at Dmin; 2) comparing the AUC of the regional network measures over the specified density range; 3) performing FDA on the regional network curves over the specified density range. GAT outputs both uncorrected and false discovery rate (FDR) corrected p-values as measures of significance of the regional measures comparisons. GAT also generates the plots of between-group differences in regional network measures along with the quantified confidence intervals as a function of network density.
Network hub analysis.
Hubs are crucial components for efficient communication in a network. Hubs are not only considered as important regulators of information flow but also play a key role in network resilience to insult . Previous studies demonstrated that the hubs in the human brain structural correlation networks tend to be the regions in highly connected association cortex  and that the distribution of hubs are altered in structural networks of patients with Schizophrenia, Alzheimer’s disease and multiple sclerosis , , . A node is considered as a hub if its regional degree/betweenness centrality is 1 (or 2) SD higher than the mean network degree/betweenness , . GAT quantifies the network hubs based on measures of degree, betweenness centrality, local efficiency or local clustering and a user-defined SD cutoff.
The same as for regional measures, three approaches are taken for quantification of hubs. 1) The hubs are quantified for networks thresholded at Dmin; 2) the hubs are quantified based on the AUC of the degree (or betweenness, etc.) in the specified density range; 3) the hubs are quantified from FDA of the degree (or betweenness, etc.) curves in the specified density range.
Random failure and targeted attack analysis.
To assess the resilience of brain networks to acute and focal damage, networks can be lesioned by random deletion of nodes, or by targeted attack on the highest-degree nodes in the network . In GAT, random failure of the networks is simulated by randomly removing one node from the network and then measuring changes in global network metrics (e.g. size, path length, etc.) of the remaining largest component. This process is repeated by incrementally removing additional nodes randomly until the size of the largest component is 1 , .
To assess the network behavior against targeted attack, the same procedure is applied. However, in this case, the nodes are removed in rank order of decreasing nodal measure (e.g. nodal betweenness, degree, etc.). Several global metrics like size, path length, mean local and global efficiency as well as a number of nodal metrics like nodal degree and betweenness have been suggested in the literature for assessing random failure and targeted attack analysis , , , , . In GAT, user may pick among several regional (e.g. degree, betweenness, clustering) and global metrics (e.g. size, mean local and global efficiency, path length) to investigate the effect of random failure and targeted attack on network behavior. The user can specify the density threshold at which random failure and targeted attack analysis are performed.
To test whether two group networks behave differently against random failure and targeted attack, a permutation analysis (same as the procedure mentioned for analyzing between-group differences in network measures) is performed. Then, the difference in network behavior is measured either at each attack (failure), through FDA or AUC analysis.
Network modularity analysis.
Modularity is a more sophisticated measure of network segregation and is quantified by subdividing the network into groups of regions that have maximal within group connections and minimal between-group links. A unique advantage of modular organization is that it can evolve one module at a time, without risking loss of function in other modules . Optimization algorithms are usually used to find such modular structures within a network. GAT uses the algorithms described in  and , and implemented in BCT, for quantification of modular structure. In order to characterize the degeneracy of the modularity structure adequately, the optimization algorithm runs several times (the number of iterations (default is 100) is specified by the user). Then, the community structure with highest maximized modularity value is used as the representative modular structure.
For visualization of networks on brain templates, GAT takes two approaches: first, GAT directly maps the network structure on an axial view of anatomical brain template (T1 image). Each ROI is represented by one node whose world coordinate has been extracted from AAL atlas. The brain networks are then mapped using these nodal dimensions. Second, GAT creates the node and edge files required by BrainNet Viewer (http://www.nitrc.org/projects/bnv/) in order to visualize the connectivity patterns. This way, you can use the files generated by GAT in BrainNet Viewer and visualize the networks and hub structures.
Pattern of distribution of nodal connectivity in a network (degree distribution) reveals specific characteristics of the network and its resilience to random failure and targeted attacks , , . Previous studies have demonstrated that the degree distribution of small-world structural brain networks follows an exponentially truncated power-law distribution , . Such distribution is formulated as P(d) ∼ [d(e−1) * exp(-d/dc)], where P(d) is the probability of network regional degree (d), dc is the cut-off degree above which there is an exponential decay in probability of hubs and e is the exponent, and indicates a scaling regimen, followed by an exponential decay in the probability of nodes with nodal degree greater than a cutoff value of dc; suggesting a network which mostly comprised of nodes with a nodal degree close to average network degree and also a number of nodes with higher number of connections (hubs). GAT examines whether the cumulative degree distribution of the constructed networks follows an exponentially truncated power-law distribution and returns the R-square, which is a measure of how successful the fit is (R-square value close to 1 represents a perfect fit). It also generates a figure showing the original and fitted degree distributions. The cumulative degree distribution is used to reduce the effects of noise on smaller data sets . There are also other forms of degree distribution observed in real-world networks including power law degree distribution (d−e) and exponential degree distribution (e−e*d). GAT also compares the R-square values for exponentially truncated power law fit model, power law fit model and exponential fit model.
Functional Graphs Based on Resting-state or Task-based fMRI Data
Temporal correlations in spontaneous low-frequency fluctuations in blood oxygen level dependent (BOLD) signal while subjects rest has been demonstrated as a reliable measure of brain connectivity –. The small-worldness of resting-state functional networks have been consistently demonstrated in several fMRI studies , , , , . In addition, resting state fMRI connectivity studies are sensitive to abnormal global network organization, revealing changes in several clinical populations with cognitive deficits including Alzheimer’s disease , , schizophrenia , , traumatic brain injury , temporal lobe epilepsy , depression ,  and attention-deficit hyperactivity disorder . On the other hand, task-based functional connectivity pattern, i.e. temporal correlations of low-frequency BOLD signal while a subject performs a task, has also been shown to reflect the pathologic conditions. Previous studies demonstrated alterations in topologies of task-based functional connectivity pattern during memory encoding and recognition in older adults  and during episodic memory performance in Schizophrenia . The GUI panel for investigating functional brain networks based on functional connectivity data is shown in Fig. 3.
The toolbox facilitates construction of functional networks, extraction of network measures, statistical analysis, regional network analysis, modularity analysis, AUC and FDA analyses and visualization.
GAT accepts two types of input data to investigate the organization of functional correlation networks: First, GAT accepts the output from functional connectivity toolbox (http://www.nitrc.org/projects/conn) as input and extract the individual correlation matrices (an N×N matrix) as well as the ROI names. The correlation outputs of functional connectivity toolbox are in the form of z-scores. Thus, the program first converts the z-scores to original correlation values. Network nodes are defined based on the same ROI scheme used for functional connectivity analysis within the functional connectivity toolbox. Alternatively, the user can input previously extracted correlation matrices, partial correlation values, coherence matrices, or mutual information matrices by putting them into an M×N×N Matlab array with M subjects and N ROIS.
Construction of functional network.
From the previous step, we have an N×N association matrix R for each individual with each entry rij represents the strength of functional connectivity between regions i and j. For each association matrix (individual), an N×N binary adjacency matrix A is derived where aij is considered 1 if rij is greater than a specific threshold and zero otherwise. The diagonal elements of the constructed association matrix are set to zero. The resultant adjacency matrix represents a binary undirected graph G in which regions i and j are connected if gij is unity. Therefore, a graph is constructed with n nodes (ROIs), with a network degree of E equal to number of edges (links), and a network density (cost) of D = E/[(N×(N−1) )/2] representing the fraction of present connections to all possible connections.
Thresholding the association matrices of different individuals at an absolute threshold results in networks with a different number of nodes (and degrees) that might influence the network measures and reduce interpretation of between group results . Thus, the individual association matrices are thresholded at a range of network densities.
The network analysis step is similar to analysis of structural networks. The only difference is that for functional networks, a set of network measures are quantified for each individual network, rather than each group. Therefore, normalized clustering coefficient (C/Crand), normalized path length (L/Lrand), and small world index are quantified for each individual network. Benchmark random networks generated for functional graphs include topology randomization and correlation matrix randomization .
Similarly, the regional network measures such as nodal clustering, transitivity, path length, local efficiency, nodal betweenness and assortativity are quantified for each individual network, as described above.
Covariates of nuisance.
For between-group comparisons, the individual network measures might require correction for between-group differences in covariates of nuisance such as age and gender. GAT accepts the covariates of nuisance in a spreadsheet (Microsoft Excel.xls files) and performs a linear regression analysis at every individual network measure to remove the effects of covariates. The residuals of this regression are then substituted for the raw individual network measures for further between-group comparison.
Comparing network measures between groups.
Before performing statistical testing, the density range in which network comparison is meaningful needs to be identified, i.e. the density range in which the networks are not fragmented. Therefore, the individual networks are tested for fragmentation to find the range of densities in which all the nodes are connected at least to one other node. After examining all the networks, the minimum network density at which no individual network is fragmented is identified. The maximum network density is indicated by the user by examining the small-worldness of the individual networks. All the further analyses are performed on the networks thresholded over this density range.
In order to test the statistical significance of the between-group differences in network topology and regional network measures, GAT performs a parametric t-test (e.g. 2-sample t-test for comparing two groups) as well as a non-parametric permutation test with 2000 (user defined) repetitions . For permutation testing, in each repetition, the network measures (or residuals) of each individual are randomly reassigned to one of the two groups so that each randomized group had the same number of subjects as the original groups. Then, the differences in network measures between randomized groups (at each network density) are then calculated resulting in a permutation distribution of difference under the null hypothesis. The actual between-group difference in network measures is then placed in the corresponding permutation distribution and a two-tailed p-value is calculated based on its percentile position. This results in a p-value of difference at each network density.
In addition to comparing global network measures at every density, FDA and AUC analyses are performed to make the between-group comparison less sensitive to the thresholding process. The FDA and AUC analyses are performed for each network measure at the specified density range. To test the significance of the between-group differences, either a nonparametric permutation test or a parametric t-test is performed.
The same procedure is used to compare the between-group differences in regional network measures. However, for the regional measures, comparison at every network density will result in a large number of comparisons (number of densities × number of ROIs). Therefore, the comparison is made on the AUC of regional network measures over the specified density range or on the FDA results. GAT outputs both uncorrected and false discovery rate (FDR) corrected p-values as measures of significance of regional measures comparisons. In the present study, the p-values reported for regional differences between groups are FDR corrected for multiple comparisons (90 comparisons).
Network hub analysis.
The same as for structural networks, network hubs for functional networks are quantified based on measures of degree, betweenness, local efficiency or local clustering and a user-defined SD cutoff. For functional networks, the AUC of the nodal measures over the specified density range or the FDA results are used for hub analysis. Alternatively, a user-specified density can be used for hub analysis.
Other procedures such as visualization and analysis of degree distribution are similar to the one described for structural networks.
To demonstrate the capabilities of GAT, we examined the differences in organization of structural brain networks in survivors of ALL, the most common child cancer, and healthy matched controls (CON). The detailed procedures of participants, data acquisition and preprocessing is published elsewhere . In summary, 28 children and adolescents with a history of ALL (age 5.0–19.8 years old) who had completed all anti-cancer treatments for at least 6 months as well as 31 healthy controls (age 4.1–18.4 years old), matched for age, gender, maternal education level and minority status, were recruited. The study was approved by the Stanford University Institutional Review Board and the Stanford Cancer Center’s Scientific Review Board and written informed consent was obtained from adult participants or from the parent/legal guardian of minor participants and assent was obtained from participants age 8 years and older per Stanford University’s regulations.
High resolution, 3D spoiled gradient recall MR images were obtained using a 3 Tesla GE Signa whole body scanner (GE Medical Systems, Milwaukee, WI) with the following parameters: repetition time = 6.436 ms, echo time = 2.064 ms, flip angle = 15°, number of excitation = 3, matrix size = 256×256 voxels, field of view = 220, slice thickness = 1.5 mm, 124 contiguous slices. To extract individual gray matter volumes, voxel-based morphometry analysis was conducted in Statistical Parametric Mapping (SPM8)  using the VBM8 toolbox (http://dbm.neuro.uni-jena.de/vbm). We utilized the optimized VBM process  which included 1) segmentation and extraction of the brain in native space, 2) normalization of the images to a standard space using a customized pediatric template, created via Template-O-Matic software  using images from all subjects, 3) segmentation and extraction of the normalized brain (extraction is repeated to ensure that no non-brain tissues remain), 4) modulation of the normalized images to correct for tissue volume differences due to the normalization procedure, and 5) inspection of the resulting gray matter images by expert raters, blinded to group assignment for quality, guided by boxplots and covariance matrices output by the VBM8 toolbox. The extracted gray matter volume maps were used as the input to GAT for construction and analysis of structural correlation networks.
Regional gray matter volumes of 90 cortical and subcortical ROIs were extracted by applying AAL parcellation scheme to the individual normalized gray matter images. The extracted regional gray matter volume data were corrected for between group differences in age, gender, total brain volume, and their interactions. For each group, a 90×90 association matrix was generated by performing Pearson correlation coefficient between regional gray matter volumes across subjects. Previous studies used Pearson correlation analysis to infer statistical associations in morphometry data between brain regions , , –, . An alternative measure is partial correlation that attempts to remove the effect of indirect paths . However, partial correlation is not suitable for studies with sample size smaller than the number of ROIs . Binary adjacency matrices were then derived by thresholding the association matrices at a range of densities (Dmin: 0.01∶0.45; Dmin = 0.22). The lower bound of the range is determined as the minimum density in which the networks of both groups are not fragmented (Dmin = 0.22). For densities above 0.45 the graphs becomes increasingly random (small-world index <1.5). Additionally, for anatomical networks, connections above this density are less likely biological . Each of the derived binary adjacency matrices represents a network with a specific density. The resultant association and binary adjacency matrices (thresholded at Dmin) are shown in Fig. 4. Consistent with previous studies –, , , the association matrices in both groups exhibited similar patterns of connectivity, with generally strong correlations between bilaterally homologous regions as well as between regions within the same lobe.
Association matrices for A) ALL and B) CON groups; the color-bar shows the strength of the connections. Binary adjacency matrices for C) ALL and D) CON groups; red color represents presence of connection. These matrices are the maps thresholded at Dmin (22%) in which all nodes became fully connected in the structural networks of both groups. For clarity, only the regions in the left hemisphere are labeled. Abbreviations are used as follow: L: left hemisphere; AMYG: amygdala; ANG: angular gyrus; CALC: calcarine fissure; CN: caudate nucleus; ACC: anterior cingulate; MCC: mid-cingulate; PCC: posterior cingulate; CUN: cuneus; IFOp: inferior frontal gyrus, opercular part; IFOr: inferior frontal gyrus, orbirtal part; IFTr: inferior frontal gyrus, triangular part; MedFOr: medial fronal gyrus, orbital part; MFG: middle frontal gyrus; MFOr: middle frontal gyrus, orbital part; SFG: superior frontal gyrus; MedSF: superior frontal gyrus, medial part; SFOr: superior frontal gyrus, orbital part; FG: fusiform gyrus; HSHL: heschl gyrus; HIPP: hippocampus; INS: insula; LNG: lingual gyrus; IOG: inferior occipital gyrus; MOG: middle occipital gyrus; SOG: superior occipital gyrus; OFB: olfactory cortex; PLD: lenticular nucleus, pallidum; PCL: paracentral lobule; PHIP: parahippocampal gyrus; IPL: inferior parietal lobule; SPL: superior parietal lobule; PoCG: postcentral gyrus; PrCG: precentral gyrus; PCUN: precuneus; PUT: putamen; REC: gyrus rectus; RLN: rolandic operculum; SMA: supplementary motor area; SMG: supramarginal gyrus; ITG: inferior temporal gyrus; MTG: middle temporal gyrus; MTP: middle temporal pole; STP: superior temporal pole; STG: superior temporal gyrus; THL: thalamus.
Within-group Global Network Measures
The minimum network density below which the networks are fragmented was Dmin = 0.22. To investigate changes in the network topology as a function of network density, GAT thresholds the constructed association matrices at a range of network densities. Changes in global network measures as a function of network cost are shown in Fig. 5. The networks of both groups followed a small-world organization across a wide range of network densities; both the networks had a path length slightly higher than random networks while having a clustering coefficient that was much higher than that in random networks. This pattern results in a small-world index of higher than one across the range of network densities.
Normalized clustering (top), normalized path length (middle), and small-world index (bottom) of both the ALL and CON networks. Both the networks follow a small-world organization, i.e. normalized clustering of greater than 1 and normalized path length of close to 1.
Between-group Differences in Global Network Measures
Differences across network densities.
We investigated between-group differences in global network measures on networks thresholded at a range of densities (0.22∶0.01∶0.45). Compared with CON, the ALL network showed smaller normalized clustering and larger normalized path length across the range of densities but the difference was not significant (p<0.05) (Fig. 6). This pattern led to a significantly smaller small-world index in the ALL network at several densities across the range (p<0.05) (Fig. 6).
The 95% confidence intervals and between-group differences in normalized clustering (top), normalized path length (middle) and small-world index (bottom). The + marker shows the difference between CON vs. ALL networks; the + signs falling out of the confidence intervals indicate the densities in which the difference is significant. The positive values indicate CON > ALL and negative values indicate CON < ALL. Relative to CON network, the small-world index in ALL network was significantly lower in various network densities. The AUC of the small-world index was also significantly lower in the ALL network.
FDA and AUC analysis on global network measures.
In addition to comparing networks at various densities, we compared the AUC for global network measure curves (density range of 0.22∶0.01∶0.45) between groups. Similar to the observed differences across densities, while the ALL network had non-significantly smaller AUC for normalized clustering (p = 0.079) and larger normalized path length (p = 0.352), it showed a significantly smaller small-worldness (p = 0.043) compared with CON network. The FDA results were also consistent with the AUC results; ALL network had non-significantly smaller normalized clustering (p = 0.080), larger normalized path length (p = 0.352), and significantly smaller small-world index (p = 0.041).
Between-group Differences in Regional Network Measures
Differences at Dmin.
[Thightest]We investigated between-group differences in regional network measures, specifically nodal betweenness, on networks thresholded at Dmin. Regions including left middle frontal gyrus, left medial superior frontal and right supramarginal gyrus showed significantly smaller betweenness in ALL network. Conversely, a number of regions including right insula, right inferior parietal and left supramarginal gyrus showed significant larger betweenness in ALL network. None of these regions survived after correction for multiple comparisons (P<0.05).
FDA and AUC analysis on regional network measures.
We also compared the AUC for regional network measure curves (density range of 0.22∶0.01∶0.45) between groups (Fig. 7). While some of the regions were common between AUC analysis and analysis of network differences at Dmin a number of different regions were also found. Specifically, left orbital inferior frontal, and right triangular inferior frontal regions showed significantly smaller betweenness in ALL while left insula showed significantly larger betweenness in ALL. None of these regions survived after correcting for multiple comparisons (p<0.05) so the regional results are considered exploratory. The FDA results were similar to AUC results.
Regions that showed significant between-group differences in nodal betweenness mapped on ICBM152 surface template. Hot color identifies the regions that have significantly higher nodal betweenness in CON compared to ALL while cold color identifies regions with significantly higher nodal betweenness in ALL compared to CON. The regional differences were quantified based on AUC analysis in the density range of 0.22∶0.01∶0.45.
We considered a node as a hub if its regional betweenness centrality is 2 SD higher than the mean network betweenness. Hubs were quantified for networks thresholded at Dmin as well as based on FDA and the AUC of nodal betweenness curves (density range of 0.22∶0.01∶0.45). For networks thresholded at Dmin, the ALL network hubs were found in the right inferior parietal lobule, left supramarginal gyrus, left postcentral gyrus and right rolandic operculum whereas the CON network hubs were found in the right cuneus, left middle frontal gyrus, left medial superior frontal gyrus, bilateral postcentral gyrus, and right supramarginal gyrus.
Hub quantification based on AUC analysis revealed ALL network hubs in the right insula, right inferior parietal, right rolandic operculum and left supramarginal gyrus and CON network hubs in the left middle frontal gyrus, left medial superior frontal gryus, right inferior parietal lobule and bilateral postcentral gyrus (Fig. 8). Hubs quantified using FDA were exactly the same as those obtained from AUC analysis.
Constructed networks and corresponding hubs for ALL (top) and CON (middle) groups. Nodes that are labeled represent network hubs (nodes with nodal betweenness of 2SD greater than network mean betweenness). The volume of the spheres represents the betweenness of the corresponding brain region. Green color highlights hubs specific to CON network; yellow color represents hubs specific to ALL network; Orange color represents hubs that are common in both groups; blue color represents non-hub regions. The hubs were quantified based on AUC analysis in the density range of 0.22∶0.01∶0.45.
Random Failure and Targeted Attack Analysis
In order to analyze the networks behavior in response to random failure, we calculated the size of the largest remaining component in response to successive removal of nodes, in random order. Changes in size of the remained largest component of the network as a function of fraction of randomly removed nodes are depicted in Fig. 9A. In most of the fractions of removed nodes, the resilience of the ALL network to random failure was significantly reduced compared to CON (p<0.05). The AUC of the curve was also significantly lower in the ALL network compared to CON (p = 0.043). The FDA results were also consistent with the AUC results showing significantly lower robustness to random failure in the ALL network (p = 0.042).
Changes in the size of the largest component of the networks after cascading random failure (A) and targeted attack (B). Stars show where the difference in the size of the largest remaining components between groups is significant. The ALL network shows less tolerance to random failure and targeted attack. The AUC analysis revealed a significantly lower tolerance to random failure in the ALL network compared to CON.
The same procedure was applied to analyze the networks behavior in response to targeted attack but removing the nodes in rank order of decreasing nodal betweenness centrality. The CON network was generally more robust to targeted attack compared to ALL network and the difference reached significance at a few fractions of attacked nodes (p<0.05) (Fig. 9B). The AUC for the CON network was larger than for the ALL but it was not significant (p = 0.175). The same results were observed using FDA.
Network Modularity Analysis
Global network modularity was significantly higher in the CON network compared with the ALL across several network densities (Fig. 10A). The FDA and AUC analysis also revealed a significantly higher modularity in the CON network in the density range of interest (0.22∶0.01∶0.45) (p = 0.023 for AUC analysis and p = 0.024 for FDA). Five modules were found in the networks of both groups as color-coded in Figure 10B.
The 95% confidence intervals and between-group differences in network modularity (A). The + marker shows the difference between CON vs. ALL networks; the + signs falling out of the confidence intervals indicate the densities in which the difference in global modularity is significant. The positive values indicate CON > ALL and negative values indicate CON < ALL. The modular structures of the CON and ALL networks are also shown (B). While both the networks had the same number of modules (five modules color-coded for each network separately), the degree of modularity is significantly lower in the ALL group in various network densities relative to CON group.
The degree distribution in both networks followed an exponentially truncated power-law distribution (P(d) ∼ [d(e−1) * exp(−d/dc)]) (Fig. 11). The exponent estimate (e) was 1.19 for ALL and 1.27 for CON networks. The cut-off degree (dc) was 2.65 for ALL network and 2.52 for the CON. The R-square value was 0.97 for both groups’ distributions fits. We also compared the goodness-of-fit for other forms of degree distribution. The R-square for BC group was 0.56 for power law fit and 0.91 for exponential fit. For the CON group, the R-square value was 0.50 for power law fit and 0.85 for exponential fit.
The log-log plot of cumulative degree distributions of ALL (A) and CON (B) networks thresholded at Dmin. The solid line indicates the exponentially truncated power-law curve fitted to the cumulative degree distribution of the networks (dotted line). The estimated exponent was 1.19 for ALL and 1.27 for CON, the cut-off degree was 2.65 for the ALL and 2.52 for the CON network. These parameters resulted in R-square value of 0.97 for both distributions (value close to one represents a good fit).
Graph theoretical analyses of neuroimaging data have increased our understanding of the organization of structural and functional brain networks in recent years. In this report, we describe the development of a graph analysis toolbox (GAT) that facilitates analysis and comparison of structural and functional brain networks. We demonstrated the capabilities of GAT by investigating the differences in organization of structural brain 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 structural networks in the ALL network; an observation that confirms our hypothesis suggesting widespread neurobiological injury in ALL survivors. This is the first report of altered large-scale structural brain networks in ALL survivors.
Large-scale Structural Networks in ALL
Global network measures.
Both the ALL and CON networks followed a small-world organization across a wide range of densities (Fig. 5). Such a network allows for efficient information processing by providing an optimal balance between segregation and integration . The results are in line with previous graph analysis studies that have consistently shown a small-world architecture in structural brain networks in healthy individuals , , .
Compared to the CON network, the ALL network showed smaller normalized clustering and larger normalized path length that led to a significant smaller small-world index across several densities in the ALL network. In addition, the area under the small-worldness curve was also significantly smaller in the ALL network suggesting the consistency of the findings irrespective of the threshold. These findings suggest that the structural networks of ALL patients tend to have a more regularized configuration relative to CON group; a configuration that is more segregated but less integrated compared to random networks. This configuration in the ALL network is thus less optimal for information processing compared to CON network. Our results corroborate previous structural neuroimaging findings that have demonstrated a diffuse pattern of atrophy in white matter and gray matter structure in ALL survivors –.
One potential mechanism underlying this network-level alteration is white matter damage. A large body of evidence suggests that global gray matter atrophy is associated with focal and global white matter damage due in part to the transection of axons and subsequent retrograde neuronal loss , . Animal studies show that chemotherapy suppresses neural progenitor cell proliferation responsible for white-matter tract integrity and cortico-cortical connections –. Thus, the observed network-level alteration in structural correlation network of ALL patients might arise from neurotoxic effects of chemotherapy on cortico-cortical connections. This idea is also supported by previous diffusion weighted imaging studies involving ALL survivors that reported a diffuse pattern of microstructural white matter damage , , .
Regional network measures.
The observed between-group differences in regional network measures did not survive after correction for multiple comparisons. However, the uncorrected results were in line with previous findings and thus we consider the following to be exploratory. Several regions in the prefrontal cortex showed smaller betweenness centrality in the ALL network compared to CON. Nodes with higher centrality in the network identify regions that have the potential to participate in a large number of functional interactions . A number of neuropsychological studies have shown a subtle long-term neurocognitive deficits, specifically in cognitive functions subserved by prefrontal cortex, in survivors of childhood ALL (see ,  for a review). Previous neuroimaging studies reported reduced white matter connectivity between frontal and occipital regions , , decreased white matter structure and volume in frontal regions , , , and reduced fractional anisotropy in frontal white matter structure  in ALL survivors. Decreased regional white matter volume in prefrontal regions was also associated with decreased performance on neuropsychological measures in this population . Paakko and colleagues  reported that ALL patients with white matter changes more often had impairment of attention and cognitive functions subserved by the frontal regions. These reports might explain the observed lack of centrality in prefrontal regions in the ALL network in our study suggesting an impaired functional interaction between frontal regions and the rest of the brain network.
The identified hubs in the CON network are consistent with the results of previous graph-theoretical analysis involving healthy subjects , . The CON network showed more number of central hubs located in the prefrontal cortex compared to ALL. The observed lack of highly central hubs in the prefrontal cortex in the ALL network is in line with the results of group-differences in regional network measures and suggests network alterations involving regions critical for the executive functions in ALL.
Random failure and targeted attack analysis.
The AUC of the random failure curve was significantly lower in the ALL network compared to CON suggesting the overall lower resilience of the ALL network in response to random failure. In addition, the resilience of the ALL network was lower in response to targeted attack but the overall between-group difference was not significant. This observation is consistent with the results of global network measures suggesting that the ALL network is more regularized relative to CON network. Networks with more regularization are less resilient to random failure and show reduced resilience to pathologies . A regularized network, compared with a small-world network, does not have highly connected hubs and thus fails to integrate various modules in the event of network fragmentation as a result of cascaded random failures.
While both the networks had the same number of modules, the degree of network modularity was significantly smaller in the ALL network. The smaller network modularity in the ALL network corroborates the observed higher path length and lower clustering in the ALL network and suggests a reduction in the balance between network segregation and integration in ALL.
The degree distribution of both networks followed an exponentially truncated power law distribution suggesting a network with many regions having small number of connections and a few regions having large number of connections (hubs). The cutoff degree was around 3 for both the networks, consistent with previous reports , .
GAT provides a GUI framework to facilitate the investigation of organization of brain networks without requiring the users to have knowledge of Matlab or programming. In addition, GAT has a number of unique features that other available graph-analysis packages lack. First, unlike other graph-analysis packages that mainly focused on extraction of network measures and/or visualization, the unique feature of the GAT is that it integrates the processes of ROI extraction, network construction, regional and global network analysis, network comparison, hub analysis, random failure and targeted attack simulation and network visualization. Second, GAT facilitates analyzing between-group differences in global network measures, regional network properties, and resilience to random failure and targeted attack using permutation analysis. Third, in addition to comparing networks at various densities, GAT compares the areas under a curve (AUC) for each network measure. By performing AUC analysis, the comparison between network measures is less sensitive to the thresholding process. GAT performs AUC analysis for comparing global networks measures, regional network measures, network hubs as well as random failure and targeted attack analysis. Fourth, GAT utilizes FDA which is more sensitive to differences in shape of the curves to complement the AUC results. Finally, GAT provides tools for testing network connectivity and analyze network degree distribution.
However, GAT mainly performs network comparison by converting the association matrices to binary undirected adjacency matrices, which result in loss of information. Comparing weighted and/or directed networks would be more informative but there are still some methodological challenges to analyze and compare weighted and directed networks . We are extending the toolbox to be able to analyze weighted and directed networks.
In summary, we described the development of GAT that facilitates analysis and comparison of structural and functional brain networks. Using GAT, we compared the organization of large-scale structural correlation networks between ALL survivors and matched healthy controls. We found an alteration in small-world characteristics of the structural correlation networks in ALL relative to healthy controls that corroborates our hypothesis suggesting widespread network-level neurobiological injury in ALL survivors. Compared to CON, the ALL network showed smaller clustering and longer path length that resulted in significantly smaller small-world index in ALL group; an observation that suggests a more regularized network structure in ALL relative to CON network. The ALL network is thus less optimal for information transfer and more vulnerable to network failures and attacks, supported by random failure and targeted attack analyses results.
Conceived and designed the experiments: HH SK. Performed the experiments: SK. Analyzed the data: HH FH SK. Contributed reagents/materials/analysis tools: HH SK. Wrote the paper: HH FH SK.
- 1. Sporns O (2011) Networks of the Brain. Cambridge: The MIT Press.
- 2. Stam CJ, Reijneveld JC (2007) Graph theoretical analysis of complex networks in the brain. Nonlinear Biomed Phys 1: 3.
- 3. Achard S, Salvador R, Whitcher B, Suckling J, Bullmore E (2006) A resilient, low-frequency, small-world human brain functional network with highly connected association cortical hubs. J Neurosci 26: 63–72.
- 4. Buckner RL, Sepulcre J, Talukdar T, Krienen FM, Liu H, et al. (2009) Cortical hubs revealed by intrinsic functional connectivity: mapping, assessment of stability, and relation to Alzheimer’s disease. J Neurosci 29: 1860–1873.
- 5. Supekar K, Menon V, Rubin D, Musen M, Greicius MD (2008) Network analysis of intrinsic functional brain connectivity in Alzheimer’s disease. PLoS Comput Biol 4: e1000100.
- 6. van den Heuvel MP, Stam CJ, Boersma M, Hulshoff Pol HE (2008) Small-world and scale-free organization of voxel-based resting-state functional connectivity in the human brain. Neuroimage 43: 528–539.
- 7. van den Heuvel MP, Mandl RC, Stam CJ, Kahn RS, Hulshoff Pol HE (2010) Aberrant frontal and temporal complex network structure in schizophrenia: a graph theoretical analysis. J Neurosci 30: 15915–15926.
- 8. Tian L, Wang J, Yan C, He Y (2011) Hemisphere- and gender-related differences in small-world brain networks: a resting-state functional MRI study. Neuroimage 54: 191–202.
- 9. Sanz-Arigita EJ, Schoonheim MM, Damoiseaux JS, Rombouts SA, Maris E, et al. (2010) Loss of ‘small-world’ networks in Alzheimer’s disease: graph analysis of FMRI resting-state functional connectivity. PLoS One 5: e13788.
- 10. Jin C, Gao C, Chen C, Ma S, Netra R, et al. (2011) A preliminary study of the dysregulation of the resting networks in first-episode medication-naive adolescent depression. Neurosci Lett 503: 105–109.
- 11. Bassett DS, Bullmore E (2006) Small-world brain networks. Neuroscientist 12: 512–523.
- 12. Bassett DS, Bullmore E, Verchinski BA, Mattay VS, Weinberger DR, et al. (2008) Hierarchical organization of human cortical networks in health and schizophrenia. J Neurosci 28: 9239–9248.
- 13. He Y, Chen ZJ, Evans AC (2007) Small-world anatomical networks in the human brain revealed by cortical thickness from MRI. Cereb Cortex 17: 2407–2419.
- 14. He Y, Chen Z, Evans A (2008) Structural insights into aberrant topological patterns of large-scale cortical networks in Alzheimer’s disease. J Neurosci 28: 4756–4766.
- 15. He Y, Dagher A, Chen Z, Charil A, Zijdenbos A, et al. (2009) Impaired small-world efficiency in structural cortical networks in multiple sclerosis associated with white matter lesion load. Brain 132: 3366–3379.
- 16. He Y, Wang J, Wang L, Chen ZJ, Yan C, et al. (2009) Uncovering intrinsic modular organization of spontaneous brain activity in humans. PLoS One 4: e5226.
- 17. Chen ZJ, He Y, Rosa-Neto P, Germann J, Evans AC (2008) Revealing modular architecture of human brain structural networks by using cortical thickness from MRI. Cereb Cortex 18: 2374–2381.
- 18. Chen ZJ, He Y, Rosa-Neto P, Gong G, Evans AC (2011) Age-related alterations in the modular organization of structural cortical network by using cortical thickness from MRI. Neuroimage 56: 235–245.
- 19. Fan Y, Shi F, Smith JK, Lin W, Gilmore JH, et al. (2011) Brain anatomical networks in early human brain development. Neuroimage 54: 1862–1871.
- 20. Bernhardt BC, Chen Z, He Y, Evans AC, Bernasconi N (2011) Graph-theoretical analysis reveals disrupted small-world organization of cortical thickness correlation networks in temporal lobe epilepsy. Cereb Cortex 21: 2147–2157.
- 21. Wen W, Zhu W, He Y, Kochan NA, Reppermund S, et al. (2011) Discrete neuroanatomical networks are associated with specific cognitive abilities in old age. J Neurosci 31: 1204–1212.
- 22. Wu K, Taki Y, Sato K, Kinomura S, Goto R, et al. (2012) Age-related changes in topological organization of structural brain networks in healthy individuals. Hum Brain Mapp 33: 552–568.
- 23. Petrella JR (2011) Use of graph theory to evaluate brain networks: a clinical tool for a small world? Radiology 259: 317–320.
- 24. Sporns O, Chialvo DR, Kaiser M, Hilgetag CC (2004) Organization, development and function of complex brain networks. Trends Cogn Sci 8: 418–425.
- 25. Bullmore ET, Bassett DS (2011) Brain graphs: graphical models of the human brain connectome. Annu Rev Clin Psychol 7: 113–140.
- 26. Zhang J, Wang J, Wu Q, Kuang W, Huang X, et al. (2011) Disrupted brain connectivity networks in drug-naive, first-episode major depressive disorder. Biological psychiatry 70: 334–342.
- 27. Rubinov M, Sporns O (2010) Complex network measures of brain connectivity: uses and interpretations. Neuroimage 52: 1059–1069.
- 28. He B, Dai Y, Astolfi L, Babiloni F, Yuan H, et al. (2011) eConnectome: A MATLAB toolbox for mapping and imaging of brain functional connectivity. J Neurosci Methods 195: 261–269.
- 29. van Wijk BC, Stam CJ, Daffertshofer A (2010) Comparing brain networks of different size and connectivity density using graph theory. PloS One 5: e13701.
- 30. Bassett DS, Nelson BG, Mueller BA, Camchong J, Lim KO (2012) Altered resting state complexity in schizophrenia. Neuroimage 59: 2196–2207.
- 31. Ramsay JO, Silverman BW (2005) Functional data analysis: Springer.
- 32. Ahles T, Saykin A (2007) Candidate mechanisms for chemotherapy-induced cognitive changes. Nature Reviews Cancer 7: 192–201.
- 33. Janelsins MC, Kohli S, Mohile SG, Usuki K, Ahles TA, et al. (2011) An update on cancer- and chemotherapy-related cognitive dysfunction: current status. Semin Oncol 38: 431–438.
- 34. Kesler SR, Tanaka H, Koovakkattu D (2010) Cognitive reserve and brain volumes in pediatric acute lymphoblastic leukemia. Brain imaging and behavior 4: 256–269.
- 35. Dellani PR, Eder S, Gawehn J, Vucurevic G, Fellgiebel A, et al. (2008) Late structural alterations of cerebral white matter in long-term survivors of childhood leukemia. J Magn Reson Imaging 27: 1250–1255.
- 36. Ficek K, Blamek S, Sygula D, Miszczyk L, Sonta-Jakimczyk D, et al. (2010) Evaluation of the late effects of CNS prophylactic treatment in childhood acute lymphoblastic leukemia (ALL) using magnetic resonance spectroscopy. Acta Neurochir. pp. 195–197.
- 37. Porto L, Preibisch C, Hattingen E, Bartels M, Lehrnbecher T, et al. (2008) Voxel-based morphometry and diffusion-tensor MR imaging of the brain in long-term survivors of childhood leukemia. Eur Radiol 18: 2691–2700.
- 38. Reddick WE, Glass JO, Johnson DP, Laningham FH, Pui CH (2009) Voxel-based analysis of T2 hyperintensities in white matter during treatment of childhood leukemia. AJNR Am J Neuroradiol 30: 1947–1954.
- 39. Peterson CC, Johnson CE, Ramirez LY, Huestis S, Pai AL, et al. (2008) A meta-analysis of the neuropsychological sequelae of chemotherapy-only treatment for pediatric acute lymphoblastic leukemia. Pediatr Blood Cancer 51: 99–104.
- 40. Campbell LK, Scaduto M, Sharp W, Dufton L, Van Slyke D, et al. (2007) A meta-analysis of the neurocognitive sequelae of treatment for childhood acute lymphocytic leukemia. Pediatr Blood Cancer 49: 65–73.
- 41. Buizer AI, de Sonneville LM, Veerman AJ (2009) Effects of chemotherapy on neurocognitive function in children with acute lymphoblastic leukemia: a critical review of the literature. Pediatr Blood Cancer 52: 447–454.
- 42. Temming P, Jenney ME (2010) The neurodevelopmental sequelae of childhood leukaemia and its treatment. Arch Dis Child 95: 936–940.
- 43. Leh SE, Petrides M, Strafella AP (2010) The neural circuitry of executive functions in healthy subjects and Parkinson’s disease. Neuropsychopharmacology 35: 70–85.
- 44. Lerch JP, Worsley K, Shaw WP, Greenstein DK, Lenroot RK, et al. (2006) Mapping anatomical correlations across cerebral cortex (MACACC) using cortical thickness from MRI. Neuroimage 31: 993–1003.
- 45. Bernhardt BC, Worsley KJ, Besson P, Concha L, Lerch JP, et al. (2008) Mapping limbic network organization in temporal lobe epilepsy using morphometric correlations: insights on the relation between mesiotemporal connectivity and cortical atrophy. Neuroimage 42: 515–524.
- 46. Sanabria-Diaz G, Melie-Garcia L, Iturria-Medina Y, Aleman-Gomez Y, Hernandez-Gonzalez G, et al. (2010) Surface area and cortical thickness descriptors reveal different attributes of the structural human brain networks. Neuroimage 50: 1497–1510.
- 47. He Y, Evans A (2010) Graph theoretical modeling of brain connectivity. Current Opinion in Neurology 23: 341–350.
- 48. Zalesky A, Fornito A, Bullmore ET (2010) Network-based statistic: identifying differences in brain networks. NeuroImage 53: 1197–1207.
- 49. Tzourio-Mazoyer N, Landeau B, Papathanassiou D, Crivello F, Etard O, et al. (2002) Automated anatomical labeling of activations in SPM using a macroscopic anatomical parcellation of the MNI MRI single-subject brain. Neuroimage 15: 273–289.
- 50. Yao Z, Zhang Y, Lin L, Zhou Y, Xu C (2010) Abnormal Cortical Networks in Mild Cognitive Impairment and Alzheimer’s Disease. PLoS Computational Biology 6(11): e1001006.
- 51. Maslov S, Sneppen K (2002) Specificity and stability in topology of protein networks. Science 296: 910–913.
- 52. Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, et al. (2002) Network motifs: simple building blocks of complex networks. Science 298: 824–827.
- 53. Zalesky A, Fornito A, Bullmore E (2012) On the use of correlation as a measure of network connectivity. Neuroimage 60: 2096–2106.
- 54. Ginestet CE, Nichols TE, Bullmore ET, Simmons A (2011) Brain network analysis: separating cost from topology using cost-integration. PLoS One 6: e21570.
- 55. Kaiser M, Hilgetag CC (2006) Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems. PLoS Comput Biol 2: e95.
- 56. Bullmore E, Sporns O (2009) Complex brain networks: graph theoretical analysis of structural and functional systems. Nat Rev Neurosci 10: 186–198.
- 57. Albert R, Barbasi AL (2002) Statistical mechanics of complex networks. Reviews of Modern Physics 74: 47–51.
- 58. Crucitti P, Latora V, Marchiori M (2003) Efficiency of scale-free networks: error and attack tolerance. Physica A 320: 622–642.
- 59. Meunier D, Achard S, Morcom A, Bullmore E (2009) Age-related changes in modular organization of human brain functional networks. NeuroImage 44: 715–723.
- 60. Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci U S A 103: 8577–8582.
- 61. Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. Jorurnal of Statistical Mechanics P10008.
- 62. Albert R, Jeong H, Barabasi AL (2000) Error and attack tolerance of complex networks. Nature 406: 378–382.
- 63. Iturria-Medina Y, Sotero RC, Canales-Rodriguez EJ, Aleman-Gomez Y, Melie-Garcia L (2008) Studying the human brain anatomical network via diffusion-weighted MRI and Graph Theory. Neuroimage 40: 1064–1076.
- 64. Strogatz SH (2001) Exploring complex networks. Nature 410: 268–276.
- 65. Greicius MD, Supekar K, Menon V, Dougherty RF (2009) Resting-state functional connectivity reflects structural connectivity in the default mode network. Cereb Cortex 19: 72–78.
- 66. Honey CJ, Sporns O, Cammoun L, Gigandet X, Thiran JP, et al. (2009) Predicting human resting-state functional connectivity from structural connectivity. Proc Natl Acad Sci U S A 106: 2035–2040.
- 67. Biswal BB, Van Kylen J, Hyde JS (1997) Simultaneous assessment of flow and BOLD signals in resting-state functional connectivity maps. NMR Biomed 10: 165–170.
- 68. Salvador R, Suckling J, Coleman MR, Pickard JD, Menon D, et al. (2005) Neurophysiological architecture of functional magnetic resonance images of human brain. Cereb Cortex 15: 1332–1342.
- 69. Eguiluz VM, Chialvo DR, Cecchi GA, Baliki M, Apkarian AV (2005) Scale-free brain functional networks. Phys Rev Lett 94: 018102.
- 70. Lynall ME, Bassett DS, Kerwin R, McKenna PJ, Kitzbichler M, et al. (2010) Functional connectivity and brain networks in schizophrenia. J Neurosci 30: 9477–9487.
- 71. Liu Y, Liang M, Zhou Y, He Y, Hao Y, et al. (2008) Disrupted small-world networks in schizophrenia. Brain 131: 945–961.
- 72. Nakamura T, Hillary FG, Biswal BB (2009) Resting network plasticity following brain injury. PLoS One 4: e8220.
- 73. Liao W, Zhang Z, Pan Z, Mantini D, Ding J, et al. (2010) Altered functional connectivity and small-world in mesial temporal lobe epilepsy. PLoS One 5: e8525.
- 74. Wang L, Zhu C, He Y, Zang Y, Cao Q, et al. (2009) Altered small-world brain functional networks in children with attention-deficit/hyperactivity disorder. Hum Brain Mapp 30: 638–649.
- 75. Wang L, Li Y, Metzak P, He Y, Woodward TS (2010) Age-related changes in topological patterns of large-scale brain functional networks during memory encoding and recognition. Neuroimage 50: 862–872.
- 76. Wang L, Metzak PD, Honer WG, Woodward TS (2010) Impaired efficiency of functional networks underlying episodic memory-for-context in schizophrenia. J Neurosci 30: 13171–13179.
- 77. Friston K, Ashburner J, Kiebel S, Nichols T, Penny W (2007) Statistical parametric mapping: The analysis of functional brain images. San Francisco: Elsevier Academic.
- 78. Good CD, Johnsrude IS, Ashburner J, Henson RN, Friston KJ, et al. (2001) A voxel-based morphometric study of ageing in 465 normal adult human brains. Neuroimage 14: 21–36.
- 79. Wilke M, Holland SK, Altaye M, Gaser C (2008) Template-O-Matic: a toolbox for creating customized pediatric templates. Neuroimage 41: 903–913.
- 80. Smith SM, Miller KL, Salimi-Khorshidi G, Webster M, Beckmann CF, et al. (2011) Network modelling methods for FMRI. Neuroimage 54: 875–891.
- 81. Kaiser M, Hilgetag CC (2006) Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems. PLoS Computational Biology 2: e95.
- 82. Sailer M, Fischl B, Salat D, Tempelmann C, Schoenfeld MA, et al. (2003) Focal thinning of the cerebral cortex in multiple sclerosis. Brain 126: 1734–1744.
- 83. Sepulcre J, Goni J, Masdeu JC, Bejarano B, Velez N, et al. (2009) Contribution of white matter lesions to gray matter atrophy in multiple sclerosis. Arch Neurol 66: 173–179.
- 84. Dietrich J, Han R, Yang Y, Mayer-Proschel M, Noble M (2006) CNS progenitor cells and oligodendrocytes are targets of chemotherapeutic agents in vitro and in vivo. J Biol 5: 22.
- 85. Seigers R, Schagen SB, Beerling W, Boogerd W, van Tellingen O, et al. (2008) Long-lasting suppression of hippocampal cell proliferation and impaired cognitive performance by methotrexate in the rat. Behav Brain Res 186: 168–175.
- 86. Winocur G, Vardy J, Binns MA, Kerr L, Tannock I (2006) The effects of the anti-cancer drugs, methotrexate and 5-fluorouracil, on cognitive function in mice. Pharmacology, biochemistry, and behavior 85: 66–75.
- 87. Han R, Yang YM, Dietrich J, Luebke A (2008) Systemic 5-fluorouracil treatment causes a syndrome of delayed myelin destruction in the central nervous system. Journal of Biology 7.
- 88. Seigers R, Schagen SB, Coppens CM, van der Most PJ, van Dam FS, et al. (2009) Methotrexate decreases hippocampal cell proliferation and induces memory deficits in rats. Behav Brain Res 201: 279–284.
- 89. Aukema EJ, Caan MW, Oudhuis N, Majoie CB, Vos FM, et al. (2009) White matter fractional anisotropy correlates with speed of processing and motor speed in young childhood cancer survivors. Int J Radiat Oncol Biol Phys 74: 837–843.
- 90. Sporns O (2011) The human connectome: a complex network. Annals of NewYork Academy of Sciences 1224: 109–125.
- 91. Carey ME, Haut MW, Reminger SL, Hutter JJ, Theilmann R, et al. (2008) Reduced frontal white matter volume in long-term childhood leukemia survivors: a voxel-based morphometry study. AJNR Am J Neuroradiol 29: 792–797.
- 92. Paakko E, Harila-Saari A, Vanionpaa L, Himanen S, Pyhtinen J, et al. (2000) White matter changes on MRI during treatment in children with acute lymphoblastic leukemia: correlation with neuropsychological findings. Med Pediatr Oncol 35: 456–461.
- 93. Rubinov M, Sporns O (2011) Weight-conserving characterization of complex functional brain networks. Neuroimage 56: 2068–2079.