Understanding the large-scale structural network formed by neurons is a major challenge in system neuroscience. A detailed connectivity map covering the entire brain would therefore be of great value. Based on diffusion MRI, we propose an efficient methodology to generate large, comprehensive and individual white matter connectional datasets of the living or dead, human or animal brain. This non-invasive tool enables us to study the basic and potentially complex network properties of the entire brain. For two human subjects we find that their individual brain networks have an exponential node degree distribution and that their global organization is in the form of a small world.
Citation: Hagmann P, Kurant M, Gigandet X, Thiran P, Wedeen VJ, Meuli R, et al. (2007) Mapping Human Whole-Brain Structural Networks with Diffusion MRI. PLoS ONE 2(7): e597. https://doi.org/10.1371/journal.pone.0000597
Academic Editor: Olaf Sporns, Indiana University, United States of America
Received: May 11, 2007; Accepted: June 1, 2007; Published: July 4, 2007
Copyright: © 2007 Hagmann 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 Swiss National Science Foundation (SNSF), Professor Pierre Schnyder and Mr Yves Paternot as well as the Center for Biomedical Imaging (CIBM) of the Geneva-Lausanne Universities and the EPFL, the foundations Leenaards and Louis-Jeantet. The sponsors had no role in the design or analysis of the study.
Competing interests: The authors have declared that no competing interests exist.
Biological neuronal networks, and in particular the human brain, are remarkable natural systems capable of complicated patterns of behavior. This capability seems possible due to the combination of an enormous computational capacity given by a huge amount of neurons, and a highly evolved communication network . To understand the mechanisms behind higher-level brain functions, a detailed study of the individual neural cells is clearly insufficient ; global functional and structural properties of such a complex system need to be considered as well . This requires, first of all, a good knowledge of the network architecture of the entire brain. A graph representing the connectivity of the brain (henceforth called a ‘brain network’) can be analyzed at various scales. Probably the most obvious is at the neuronal level, where each neuron is a separate node in the graph and physical connections between neurons are reflected by the edges. This detailed view, however, is feasible only for the most primitive animals such as C. elegans with a brain made of 302 neurons . A graph of the human brain consisting of 1011 nodes and 1016 edges is not only impossible to obtain with current techniques, but it also would carry a great deal of information that is irrelevant from the global organization point of view. We must therefore resort to a different level of granularity, where a node represents thousands or millions of neurons grouped together. Unfortunately, such available graphs are today limited to small post-mortem datasets (only 50–70 nodes) of rat , cat ,  and monkey  brains, whereas larger datasets of animal and human brains are missing . In the coming years, an immense effort will be needed to map at various scales and to create a large database of reliable information on the brain connectivity of higher order animals, especially of the human , .
Crick and Jones stated that “Clearly what is needed for a modern human brain anatomy is the introduction of some radically new techniques” . In this paper we propose a methodology derived from diffusion MRI tractography – to map at a millimetric scale the structural white matter connectivity of the whole brain. The resulting network consists of nodes representing small areas of white matter–gray matter (WGM) interface, and weighted edges that capture long distance connection densities between these areas. The innovation it brings is fourfold. First, our methodology has a relatively high resolution; the resulting networks consist of thousands of nodes, which are 1–2 orders of magnitude larger than the networks currently available (thousands versus tens of nodes). This opens several innovative investigation possibilities. Mainly it allows us to study brain connectivity not only locally but also globally by characterizing the topological features of this large-scale network. Such global characterizations are essential for a better understanding of brain communication. Second, our approach is non-invasive. This allows us to study the topology not only of animal or post-mortem brains, but also, for the first time, of the living human brain. Third, for each subject we infer an individual network of the entire brain. This potentially allows us to compare individual subjects or groups of subjects, e.g., brains from healthy controls and from patients with clinical conditions. In contrast, the datasets available to date were collected part by part from a number of animals of the same species, and hence reflect a kind of “average” brain in the population. Fourth, our approach is efficient. It only requires performing an MRI scan on the subject (which takes about an hour or less depending on resolution and signal-to-noise ratio of the imaging system), and to process the data on a computer.
As an illustration of our approach, we analyze the basic brain graph properties of two healthy volunteers. In particular, we study a number of distributions derived for nodes (e.g., degree, strength) and edges (weight, length). We also answer some questions related to the topology, e.g., “Is the brain network a small world?”. With technology improvements, finer resolution and a better Signal-to Noise Ratio (SNR), or a deeper analysis of the network, more complex and accurate network characteristics will be accessible, thus potentially contributing to the answers of some key questions in neuroscience.
Material and Methods
The path from diffusion MRI to a graph mapping brain connectivity is a four step process: (1) diffusion MRI acquisition, (2) white matter tractography, (3) white matter-gray matter interface partition into Regions Of Interest (ROIs) and (4) network construction. We present a general scheme of our methodology in Figure 1. Below we first describe each step illustrated with intermediary results. In the next section, we investigate some fundamental properties of the brain network inferred with our approach.
First, Diffusion Spectrum MRI (DSI) is performed on a subject or sample. This acquisition provides a 3D diffusion function at every location in the brain. This data set is called a diffusion map. It is shaped by the local tissue characteristics, in particular by the orientation of axonal bundles existing in the brain. Second, based on this map we generate a number of 3D curves (called fibers) that follow the path laid by the white matter axonal bundles. Third, independently from the previous step, we use a heuristic that partitions the brain white matter-gray matter interface into small areas of equal surface (called Regions Of Interest-ROIs) covering the whole cortex and deep cerebral nuclei boundaries. Finally, in the fourth step, we combine the output of steps two and three: the ROIs become nodes and the fibers are transformed into edges in the resulting graph. This graph estimates the density of white matter connections between any two regions of gray matter.
Step 1: MRI acquisition
We use Diffusion Spectrum Imaging (DSI) ,  . It is a diffusion MRI method that images the 3-dimensional diffusion function in every brain voxel and results in a 6-dimensional image called a diffusion map. This new method has, contrary to Diffusion Tensor MRI (DTI) , sufficient angular resolution to map accurately the diffusion with a non-Gaussian behavior. Accordingly it can see intra-voxel diffusion heterogeneity caused by crossing neuronal tracts, which is essential for an accurate mapping of axonal trajectories.
In the present experiment, after having obtained the informed consent of two healthy volunteers, two data sets are acquired at 3T with an Achieva (Philips, Einthoven, The Netherlands) MRI scanner using a diffusion weighted spin echo EPI technique , . The timing parameters of the pulse sequence are TE/TR/Δ/δ = 154/3000/47.6/35 ms, maximum diffusion gradient intensity is 80 mT/m, yielding a maximal b value of 12000 s/mm2 . The matrix size is 128×128 and the slice number is 30. The field of view is 256×256 mm2 and the slice thickness 3 mm, which yields a voxel size of 2×2×3 mm3. The classical DSI scheme we use goes as follows: diffusion-weighted images covering the whole brain are acquired for 515 different values of diffusion sensitizing gradient intensity and direction (i.e., different q-vectors) , comprising in q-space the points of a cubic lattice within the sphere of 5 lattice units in radius. We take q = aqx+bqy+cqz, with a,b,c integers and , and qx, qy, qz denoting the unit diffusion sensitizing gradient vectors in the three respective coordinate directions. Next, we process these 515 images as follows. First, we reconstruct the 3D diffusion function, or Probability Density Function (PDF) at each brain location by taking the discrete 3D Fourier transformation of the signal modulus sampled in q-space. The signal is pre-multiplied by a Hanning window before the Fourier transformation in order to ensure a smooth attenuation of the signal at high |q| values. With this procedure and the above parameters, the PDF is sampled over an isotropic 3-dimensional field of view of 100 µm with a nominal isotropic resolution of 10 µm. The result, called a diffusion map, is a 6-dimensional image that associates a 3-dimensional diffusion function with every brain position voxel. From this map, at each voxel, we compute an Orientation Density Function (ODF) Φ(u), by projection of the PDF in the radial direction. If u is a 3D vector with |u| = 1, we define:(1)where p(.) is the 3D PDF, ρ is the radius, ρ 2dρ is the 3D volume element and the integral is evaluated as a discrete sum over the available range ρ∈[0,5]. The ODF Φ(u) is a function defined on a discrete sphere and captures the diffusion “intensity” in every direction. It is evaluated for a set of vectors ui that are the vertices of a tessellated sphere that has a mean nearest-neighbour separation about 10°.
In Figure 2 A and B we show a diffusion map, i.e., the ODF at every location in the brain. The ODFs are represented as deformed spheres with the radius proportional to Φ(u). The color-coding adds some more clarity, with blue codes for the cranio-caudal, red for left-right and green for antero-posterior direction.
A) The result of the “diffusion MRI acquisition” step. In every voxel of a coronal slide the Orientation Density Function (ODF) captures locally for every direction the diffusion “intensity”. B) Zoom in the centrum semi-ovale C) Each ODF is replaced by a set of vectors defining its local maxima. D) Fibers are computed following the local diffusion maxima; they are uniformly initiated over the whole brain white matter. See also Video S1 in Supporting Information.
Step 2: White matter tractography
Tractography is a post-processing method that based on the diffusion map, constructs 3-dimensional curves of maximal diffusion coherence. These curves, called fibers, are the estimates of the real white matter axonal bundle trajectories . We use a tractography algorithm specifically designed for DSI data to create a set of such fibers for the whole brain ,  which is summarized below:
- Detection of the directions of maximum diffusion. At each voxel, we define a set of directions of maximum diffusion as local maxima of Φ(u) (i.e., vectors Ui such that Φ(uj)<Φ(Ui) for all uj adjacent to Ui in the sampled tessellated sphere (Figure 2 C).
- Fiber computation. We initiate the same number of fibers for every direction of maximum diffusion in every white matter voxel. For example, in a voxel with 2 directions, we initiate 30 fibers along each direction, total 60. The starting points are chosen at random within the voxel. Next, from each such point we begin growing a fiber in two opposite directions with a fixed step of 1 mm. On entering a new voxel, the fiber growth continues along the direction of the vector Uj (in the new voxel) whose orientation is the closest to the current direction of the fiber. If this results in a change of direction sharper than 15°/mm, the fiber is stopped. The growth process of a valid fiber finishes when both its ends leave the white matter. The resulting fibers can be interpreted as an estimate of the white matter axonal bundle trajectories (see Figure 2 D); in this article we use about 3 million initialization points of which only about one half to two third connect the white-gray matter interface and are retained (See also Vie).
- Filtering the edges. In each of our data sets we have around 1.5 to 2 million fibers. For the graph of ∼1'000 nodes they translate into about 50'000 edges. The number of edges in the final network depends on the number of initialized fibers. To investigate network properties over a wider range of connection densities we devised two ways to filter edges by varying the number of initialized fibers or by taking into account the edge weight:
- Random fibers. Although for every data set we generate around 3 million fibers, this is not any special number. We could as well take 100 thousand or 10 million fibers. As presented in Figure S1 in Supporting Information, this would strongly affect the number of resulting edges. Therefore our first approach to limit the number of edges is to take a random subset of a given size out of our 3 million fibers, which boils down to reducing the number of fiber initialization. The study of the whole spectrum of fiber numbers gives us a better view than the study based on one, arbitrarily chosen number.
- Top-weight edges. In the second method we consider the edges built based on all fibers, and delete only the edges with the smallest weights (according to some threshold). The heavy-tailed distribution of edge weights guarantees that we always retain most of the “edge mass” and reject only the edges with very small weights that are possibly the result of noise. Indeed noise may create aberrant diffusion maxima that in turn produce thin aberrant diffusion coherence paths across the data resulting into artefactual edges of small weight.
Step 3: White matter-gray matter (WGM) boundary partition into ROIs
The goal of the third step is to partition the WGM interface in a number of areas that we call Regions Of Interest (ROIs). In this step we use exclusively the 3D mask of the brain WGM interface (i.e., the cortex and the thalamus for simplicity). The ROIs should be compact and of similar surface (counted in the number of voxels), which is a non-trivial task to achieve for the complex, strongly folded shape of the brain. For instance, a straightforward approach would be to partition this interface according to some 3D regular lattice . Unfortunately, this approach results in large differences in ROI sizes-up to two orders of magnitude. Furthermore we do not want to partition the WGM into predefined areas like for example Brodmann's as they are too coarse (only about 50 to 55 areas) to analyze large scale network properties at high resolution. We have therefore developed a two-phase partitioning heuristic, as follows. First, we choose a WGM interface voxel at random and iteratively connect it to the neighbouring WGM interface voxels until it reaches the desired size; this structure becomes our first ROI. Similarly, we grow other ROIs, one by one, always starting near the ones that have already been created. We repeat this procedure until all the WGM interface is covered with ROIs. This gives us already quite a good partition, however, it can be easily further improved. Therefore, in the second phase of our heuristic we restart the ROI growth process. This time we grow all the ROIs simultaneously, starting from the centres of gravity of the ROIs found in the first phase. This results in a much better compactness of the ROIs with surface variations of less than 10% (See Figure S2 of Supporting Information). An example of the final result is shown in step 3 of Figure 1 (see also Video S2 in Supporting Information).
Step 4: Network construction
Finally, in the fourth step, we combine the output of steps two and three and create the graph of brain connectivity. Every ROI constructed in step three becomes a node in the graph. We denote by ROI(v) the ROI that is associated with the node v. Two nodes v and u are connected with an edge e = (v, u) if there exists at least one fiber f with end-points in ROI(v) and ROI(u). For each edge e we define its length l(e) and weight w(e), as follows. Denote by Fe the set of all fibers connecting ROI(v) and ROI(u) and hence contributing to the edge e. The length l(e) of the edge e is the average over the lengths of all fibers in Fe, i.e., l(e) = 1/|Fe|⋅Σf∈Fel(f), where l(f) is the length of fiber f along its trajectory. The weight w(e) captures the connection density (number of connections per unit surface) between the end-nodes of the edge e, and is defined as w(e) = Σf∈Fe1/l(f). The correction term l(f) in the denominator is needed to eliminate the linear bias towards longer fibers introduced by the tractography algorithm. Indeed let us assume that an axonal bundle b exists in reality and has a length l(b). The tractography algorithm starts in some voxel of the white matter and follows the most probable direction of a bundle. If it happens to start in a voxel that is traversed by the bundle b, the algorithm follows b until it reaches the white matter boundary. As every voxel in the white matter is chosen as a starting point the same number of times, the longer the bundle b is, the more voxels it traverses and the more often it is followed by the tractography algorithm, introducing a linear bias that must be corrected.
ROI size is a parameter of our methodology. On the one hand, a natural lower limit for this size is one voxel of the WGM interface. However, we prefer to combine at least several voxels into one ROI to be sure to have a representative number of fibers connecting this ROI to the rest of the brain. On the other hand, taking ROIs that are too large results in a network of insufficient resolution and of trivially small size. In our simulations we set the ROI size to between 8 and 64 voxels of WGM interface. This results in a weighted network of between 500 to 4000 nodes representing small areas of WGM interface between ∼250 mm2 (64 voxels/ROI) and ∼30 mm2 (8 voxels/ROI), respectively. This graph has between 25'000 to 100'000 edges that represent axonal bundles of millimetric or centimetric diameter. For simplicity, in the remainder of this text we analyze graphs of about 1'000 nodes. In particular, |V1| = 1'013 nodes and |E1| = 47'217 edges for suject 1, and |V2| = 956 and |E2| = 50'199 for subject 2. The two graphs were built based on about |F| = 3 million fibers generated by the tractography algorithm. Results obtained for other granularities, from |V| = 500 to 4'000 nodes, are qualitatively similar (see Figure S3 of Supporting Information).
Results and Discussion
Once the network constructed, several graph statistics characterizing the architecture of the network can be computed and examined.
We first turn our attention to the nodes of our graph. A basic characteristic of a node v is its degree, i.e., the number of edges incident on v. Many complex networks such as the World Wide Web, Internet, protein networks, ecological networks or cellular networks, have been shown to follow a heavy-tailed node degree distribution . In other words, they have a very significant number of high degree nodes, called hubs. As such networks, also called “scale free”, are characterized by relatively short distances between any two nodes and by high robustness to random failures , they seem, at first sight, to be good candidates for brain topology. Surprisingly, we find in our dataset that this is not the case. In Figure 3, we plot the node degree distribution (a), and a closely related node strength distribution (b). (The strength s of a node v is the sum of weights of all edges incident on the node v, s(v) = Σe:v∈ew(e).) Although these distributions cover more than two decades, they are roughly linear in the log-lin scale, which indicates their exponential tail. This is probably the first time that a claim about the node degree distribution of cortical structural connectivity mapped at high spatial resolution can be made. The networks available and studied to date ,  are simply too small to judge if their node distribution is exponential, heavy tailed, or yet different. It is worth mentioning that in contrast to structural analyses, some functional brain networks have been described as scale-free .
P(d) [P(s)] is the probability that a randomly chosen node has the degree [strength] equal to d [s]. The node degree distribution (a) and node strength distribution (b) are lin-binned and plotted in log-lin scale. Color code: subject 1 (blue circles), subject 2 (green diamonds)
A closer look at node degrees suggests that, from a developmental and energy optimization point of view, hubs do not seem to be favored. This was suggested by  who modeled the development of frontal macaque cortex by a spatially embedded growing graph where preferential attachment occurs as an exponentially decaying function of spatial distance and growth limited in space. Amaral et al.  modeled network growth where the node degree expansion is attenuated through node aging and energy limitations. These two models, like our measurements, resulted in networks with an exponentially decaying distribution. Furthermore, it is quite unlikely to find hubs in the gray matter, because we know that the neuronal density does not change over orders of magnitude across the cortex , .
The edge length l distribution decays exponentially (Figure 4a), indicating that the number of long connections is small. The edge weight w distribution is much broader and close to heavy-tailed (Figure 4b). Therefore, there are a significant number of very strong connections that are predominantly short as demonstrated in Figure 4c. This observation is in agreement with the results of other complementary studies on the organization of the brain that suggest that brain favors, with some intriguing exceptions, locally dense communication and minimizes the number of long distance connections . For instance, by examining many alternative arrangements of macaque pre-frontal cortex,  showed that the layout of cortical areas minimizes the total lengths of the axons needed to join them. A similar observation was made by  about the intrinsic gray matter connectivity of mice where the volume fraction of axons and dendrites seems close to optimal. The work of  indicate that there is an evolutionary conserved scaling of the volume of the white matter as the 4/3 power of the volume of the gray matter, which can be explained by the fact that global geometry of the cortex minimizes the average length of the long-distance fibers while keeping the average connection density of long-distance connection fibers constant. However recent reports suggest the organization of neural networks is not only shaped by the minimization of total wiring length. Multiple constraints seem to be involved, not only wiring length but also the average number of processing steps (related to the average distance between node) .
(a) The distribution of edge lengths l in log-lin scale, lin-binned. (b) The distribution of edge weights w in log-log scale, log-binned. (c) Scatter plot of w vs l. The symbols are lin-binned average values for subject 1 (blue circles) and subject 2 (green diamonds).
Having examined separately the distributions of nodes and edges, we now discuss the topology of the graph itself. An interesting question one can ask is: “Is the brain a small world?”. The more formal definition of a small world graph involves two metrics, clustering coefficient c and average shortest path length <sp>. We follow , who define the clustering coefficient c as the probability that two randomly chosen neighbors of a node are also direct neighbors of each other, i.e., c = 1/|V|⋅Σv∈Vc(v), where c(v) is the number of edges interconnecting the neighbors of the node v divided by the number of all possible edges. The average shortest path length <sp> is the average distance between any two nodes in graph. If the graph is disconnected, only the largest connected component is considered. A graph is called a small world if it has (i) a clustering coefficient much greater than that of equivalent random graphs and (ii) the average shortest path length <sp> is comparable with that of a random graph with the same number of nodes and edges .
There are two issues that we have to address before we attempt to decide if our graph G of brain connectivity is a small world. First, G is weighted. As there exists no standard way of generalizing the clustering coefficient to weighted graphs [see e.g. , ] and it is not obvious how to interpret edge weights when computing the average shortest path length, we have decided to treat every edge equally and apply the classic unweighted approach . Second, the number of fibers that are initiated during tractography determines the density of graph G. In order to explore the effect of connection density on our results, we exclude some of the edges by applying the two filtering techniques described above.
We present the results in Figure 5. As a reference we take a random graph not only with the same number of nodes and edges (as proposed in ), but also with the same degree distribution as the brain graph. This graph was generated with the rewiring technique described in . Preserving the degree distribution allows us to rule out this factor from the set of possible reasons of observed differences between the brain and the reference topology. For any number |E'| of edges remaining after the filtering, the graph of brain connectivity has a much higher clustering coefficient than the corresponding random graph; this is especially well pronounced for the “Top-weight edges” graph. At the same time their average shortest path lengths <sp> are comparable. Hence our measurements suggest that the small-world model fits the brain network. Indeed, the small-world topology seems well suited for the neuronal network of the brain when thinking in evolutionary and developmental terms. This is because it is a good compromise between full connectivity, which would be very costly in terms of wiring (i.e., brain volume) and power supply , and a lattice topology that impairs massively long distance communication. Furthermore, the combination of high local clustering and small average shortest path length with efficient neural coding  allows for a distributed computing where only a small fraction of local intense computation needs to be transmitted to distant regions, which may be sufficient for synchronous brain activity . The small-worldness of the brain network was already advocated before, based on relatively small networks (50-70 nodes) resulting from post-mortem tracing studies in rat, macaque monkey and cat brain regions , , . In contrast, the approach presented in this article provides, for the first time, evidence for the presence of small-world topology in the structural connectivity of the human cerebral cortex. Moreover, the one to two orders of magnitude higher resolution resulting from our method (thousands vs. tens of nodes) increases the confidence we have in the derived statistics.
The edges are chosen from the set of all edges E either giving the priority to the edges with high weights (“Top-weight edges”, left column), or based on a random subset of fibers (“Random fibers”, right column). As a reference we take a random graph with the same number of nodes and edges, and the same degree distribution. Color code: subject 1 (blue circles), subject 2 (green diamonds), random graph reference (black filled circles). The results are averaged over 10 realizations of the “random fibers” filtering and random graphs; the confidence intervals (not shown) are comparable with the symbol size.
Intra- and inter-individual network differences
In order to test the robustness of our methodology and because of uncertainty about the ideal number of nodes for the presented methodology, we measured the brain network at 4 different node resolutions on data set 1 (see Figure S3 of Supporting Information). We notice that for scales varying between 500 and 4000 nodes and 25'000 and 100'000 edges respectively, the global network topology is preserved. This is a range of scales that matches the sensitivity of the method, as we do not expect to be able to accurately map tracts smaller than several milimeters in diameter, which is presently the size of our ROIs. Pushing the network “resolution” higher by increasing the number of nodes and reducing the surface area of the ROIs would increase the quantification noise (limiting the number of fibers per ROI), which ultimately would destroy the information contained in the network model. On the other hand, increasing the ROI size, limits the precision of the mapping, potentially grouping together pieces of gray matter that are functionally different. At the scale we use in this study, we expect that the chance that ROI overlaps several critically different cortices is not higher than the inaccuracy related to the matching of template atlas on our data. Notwithstanding the advantage with a fine grain method to always be able to group arbitrarily sets of nodes in order to study connectivity patterns between for example well known functional or anatomical areas like Brodmann's.
While basic connectivity parameters differed slightly for data sets 1 and 2 (see Table 1), the global properties are quite similar. The differences that we observe in Figures 3, 4, 5 may or may not reflect the individual properties of the subjects. Clearly, more experiments and studies are needed to be able to address the issue of between-subject variability with a high level of confidence. We plan to address these issues in our future work.
The question of investigating structural network deteriorations in diseased populations like schizophrenics or demented patients is challenging and should be addressed in the future , . The first issue is to decide on the most representative measure of tract degradation. Should we use the connection density as presented in this article? Or are differences in connectivity better captured through the use of the mean fractional anisotropy or the diffusion trace along a connection as is done in several DTI studies , ? If we want to capture the global network topology, the only requirements are to use the same MRI acquisition and simulation parameters, such as the number of nodes and the way fibers are initiated. The task becomes much more challenging if our goal is to perform an edge-by-edge comparison. The problem is twofold. First, we have to match the nodes across subjects. This requires precise cortical registration tools that work with a sub-centimetric precision. Second, identifying significant changes when testing thousands of edges at once will either require a large cohort or strong network changes, as the significance threshold needs to account for multiple testing.
Although our methodology yields promising results, we need to keep in mind that there are some steps prone to various kinds of noise and distortions whose effect is difficult to evaluate. First of all, we work at a given level of granularity. The spatial and angular resolution of our diffusion MRI experiment is limited, which makes it difficult to tell much about submillimetric fiber tracts and crossing axonal bundles separated with angles smaller than 20°. The ROIs have a given size, which automatically groups tens of thousands of neurons into a single node. Noise is also introduced during the MRI acquisition, and the tractography algorithm might not perfectly model the relationship between water diffusion and axonal orientation. Although all these points are constantly being improved, there will always remain a huge discrepancy between our constructed graph and the real neuronal network made of 1011 neurons and several orders more connections.
Nevertheless, diffusion MRI tractography is a widely used and accepted method to map axonal bundle trajectories. Furthermore it was validated experimentally to large extent in the case of DSI. First,  show that the ODFs produced by DSI match accurately the fiber orientations in a phantom and follow accurately the optic tracts in the rat. Second,  validate the method in the monkey by comparing DSI tractography with histological autoradiographic tracing over 10 association tracts. This study shows a remarkable agreement of results between two fundamentally different techniques. In addition to these general arguments, we have also tested our particular data set. Figure 6 presents a qualitative impression of the type of data revealed by our method, by showing the connectivity of part of the cortical visual system. More specifically we investigate the well-studied connections between areas V1, V2, V3, V5 and the lateral geniculate body –. The different visual areas were identified manually based on the gyral anatomy and consist each of a set of ROIs. A set of well known connections was identified for the purpose of illustrating the tractography method without claiming to be a detailed study of the visual system which would require a functional retinotopic mapping of the visual areas and an extensive search and study of the individual fiber bundles. Our data not only reveals intermediate length connections between V1 and V2 or between V2 and V3, but also the well known long range connections such as i) the optic radiation–linking the lateral geniculate body to V1 , ii) V1 homotopic callosal projections, which are connections that take actually their origin more at the junction between V1 and V2  and iii) V2–V5. Furthermore, the weights of these edges are by far higher than the corresponding median weights over the whole brain (see Figure S4 in Supporting Information). This gives a good level of confidence that the observed visual connections are not caused by some random effect.
White matter–gray matter interfaces: Magenta = posterior part of the thalamus, blue and gray = right and left V1, orange = V2, cyan = V3, red = V5. Fibers: yellow = homotopic V1, red = V1–V2, white = V2–V3, green = V2–V5, blue = lateral geniculate body–V1. See also Video S3 in Supporting Information.
In this article we have proposed a methodology for mapping networks of structural connectivity in the brain. Our approach is non-invasive, efficient, individual and of relatively high-resolution. For the first time we can globally characterize brain connectivity with individual tract properties or network statistics in an individual living subject. Based on the analysis of two healthy subjects we found that the graph of the human brain is a small world, but not a scale-free network. Large new areas of application are foreseen; in basic neuroscience our technique may contribute to the discovery of the general principles regulating communication, evolution and development of the brain; in clinical neuroscience it may shed new light into diseases of disorders that involve disruptions of anatomical brain connectivity.
The number of edges in the resulting graph as a function of the number of fibers connecting two points in the gray-white mater interface. The straight line represents the y = x relation.
(0.05 MB TIF)
Histograms of ROI sizes for the number of ROIs ranging from N = 506 to 4052 in subject 1. One voxel translates to about 4 mm2.
(0.94 MB TIF)
The results generated for all four considered scales in subject 1. The symbols in the last two rows are (as in the main paper): blue circles-“Top-weight edges”, red triangles-“Random fibers”, and black disks-“Random graph”.
(6.92 MB TIF)
Comparison of edge weights inside the visual system with the rest of the brain. Each box plot represents all edge weights in the brain of similar white matter length. The big black dot represents the weight of the considered connection, namely V1-V2, V2-V3, V2-V5, as well as the connections between the lateral geniculate body and V1 (LGB-V1), and between left and right V1 areas (V1left-V1right). Each connection is compared with the other connections in the brain of same white matter length as short connections are usually denser that long ones. The considered connections in the visual system are largely above their respective medians (horizontal line in within each box, whiskers represent 5th and 95th quantiles).
(0.39 MB TIF)
Whole brain tractography result in subject 1.
(5.23 MB MPG)
Partition of the white-gray matter interface in approximately 1000 ROIs.
(2.01 MB MPG)
Connections between different visual areas.
(1.65 MB MPG)
Conceived and designed the experiments: PH MK XG. Performed the experiments: PH MK XG. Analyzed the data: PH MK XG PT VW RM JT. Contributed reagents/materials/analysis tools: PH. Wrote the paper: PH MK.
- 1. Laughlin SB, Sejnowski TJ (2003) Communication in neuronal networks. Science 301: 1870–1874.
- 2. Koch C, Laurent G (1999) Complexity and the nervous system. SCIENCE 284: 96–98.
- 3. Tononi G, Edelman GM (1998) Consciousness and complexity. Science 282: 1846–1851.
- 4. Cherniak C (1994) Component placement optimization in the brain. J Neurosci 14: 2418–2427.
- 5. Burns GA, Young MP (2000) Analysis of the connectional organization of neural systems associated with the hippocampus in rats. Philos Trans R Soc Lond B Biol Sci 355: 55–70.
- 6. Scannell JW, Blakemore C, Young MP (1995) Analysis of connectivity in the cat cerebral cortex. J Neurosci 15: 1463–1483.
- 7. Scannell JW, Burns GA, Hilgetag CC, O'Neil MA, Young MP (1999) The connectional organization of the cortico-thalamic system of the cat. Cereb Cortex 9: 277–299.
- 8. Felleman DJ, Van Essen DC (1991) Distributed hierarchical processing in the primate cerebral cortex. Cereb Cortex 1: 1–47.
- 9. Crick F, Jones E (1993) Backwardness of human neuroanatomy. Nature 361: 109–110.
- 10. Sporns O, Tononi G, Kotter R (2005) The human connectome: a structural description of the human brain. PLoS Comput Biol 1: e42.
- 11. Bota M, Dong HW, Swanson LW (2003) From gene networks to brain networks. Nat Neurosci 6: 795–799.
- 12. Le Bihan D (2003) Looking into the functional architecture of the brain with diffusion MRI. NATURE REVIEWS NEUROSCIENCE 4: 469–480.
- 13. Tuch DS, Reese TG, Wiegell MR, Wedeen VJ (2003) Diffusion MRI of complex neural architecture. Neuron 40: 885–895.
- 14. Mori S, Zhang J (2006) Principles of diffusion tensor imaging and its applications to basic neuroscience research. Neuron 51: 527–539.
Hagmann P (2005) From diffusion MRI to brain connectomics [PhD Thesis]. Lausanne: Ecole Polytechnique Fédérale de Lausanne (EPFL).
- 16. Wedeen VJ, Hagmann P, Tseng WY, Reese TG, Weisskoff RM (2005) Mapping complex tissue architecture with diffusion spectrum magnetic resonance imaging. Magn Reson Med 54: 1377–1386.
- 17. Stejskal E, Tanner J (1965) Spin diffusion measurements-spin echoes in presence of a time-dependent field gradient. Journal of chemical physics 42: 288–&.
- 18. Le Bihan D (1991) Molecular diffusion nuclear magnetic resonance imaging. Magn Reson Q 7: 1–30.
Le Bihan D (1995) Diffusion and Perfusion Magnetic Resonance Imaging: Applications to Functional MRI:. Lippincott Williams&Wilkins.
Callaghan PT (1991) Principles of nuclear magnetic resonance microscopy. Oxford: Clarendon Press.
- 21. Lin CP, Wedeen VJ, Chen JH, Yao C, Tseng WY (2003) Validation of diffusion spectrum magnetic resonance imaging with manganese-enhanced rat optic tracts and ex vivo phantoms. Neuroimage 19: 482–495.
Hagmann P, Reese T, Tseng W, Meuli R, Thiran J, et al. Diffusion Spectrum Imaging Tractography in Complex Cerebral White Matter: An Investigation of the Centrum Semiovale; 2004 Jul; Kyoto.
- 23. Kim B (2004) Geographical coarse graining of complex networks. PHYSICAL REVIEW LETTERS 93: -:
- 24. Albert R, Barabasi A (2002) Statistical mechanics of complex networks. REVIEWS OF MODERN PHYSICS 74: 47–97.
- 25. Albert R, Jeong H, Barabasi A (2000) Error and attack tolerance of complex networks. NATURE 406: 378–382.
- 26. Barrat A, Barthelemy M, Pastor-Satorras R, Vespignani A (2004) The architecture of complex weighted networks. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA 101: 3747–3752.
- 27. Sporns O, Zwi J (2004) The small world of the cerebral cortex. NEUROINFORMATICS 2: 145–162.
- 28. Humphries M, Gurney K, Prescott T (2006) The brainstem reticular formation is a small-world, not scale-free, network. PROCEEDINGS OF THE ROYAL SOCIETY B-BIOLOGICAL SCIENCES 273: 503–511.
- 29. Eguiluz VM, Chialvo DR, Cecchi GA, Baliki M, Apkarian AV (2005) Scale-free brain functional networks. Phys Rev Lett 94: 018102.
- 30. Kaiser M, Hilgetag C (2004) Modelling the development of cortical systems networks. NEUROCOMPUTING 58-60: 297–302.
- 31. Amaral L, Scala A, Barthelemy M, Stanley H (2000) Classes of small-world networks. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA 97: 11149–11152.
- 32. Rockel AJ, Hiorns RW, Powell TP (1980) The basic uniformity in structure of the neocortex. Brain 103: 221–244.
- 33. Hilgetag CC, Barbas H (2005) Developmental mechanics of the primate cerebral cortex. Anat Embryol (Berl) 210: 411–417.
- 34. Chen BL, Hall DH, Chklovskii DB (2006) Wiring optimization can relate neuronal structure and function. Proc Natl Acad Sci U S A 103: 4723–4728.
- 35. Klyachko VA, Stevens CF (2003) Connectivity optimization and the positioning of cortical areas. Proc Natl Acad Sci U S A 100: 7937–7941.
- 36. Chklovskii DB, Schikorski T, Stevens CF (2002) Wiring optimization in cortical circuits. Neuron 34: 341–347.
- 37. Zhang K, Sejnowski TJ (2000) A universal scaling law between gray matter and white matter of cerebral cortex. Proc Natl Acad Sci U S A 97: 5621–5626.
- 38. 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.
- 39. Watts D, Strogatz S (1998) Collective dynamics of ‘small-world’ networks. NATURE 393: 440–442.
Kalna G, Higham D (2006) Clustering Coef□cients forWeighted Networks. University of Strathclyde Mathematics.
Saramaki J, Kivela M, Onnela J-P, Kaski K, Kertesz J (2006) Generalizations of the clustering coefficient to weighted complex networks. arXiv.org.
- 42. Maslov S, Sneppen K (2002) Specificity and stability in topology of protein networks. Science 296: 910–913.
- 43. Attwell D, Laughlin SB (2001) An energy budget for signaling in the grey matter of the brain. J Cereb Blood Flow Metab 21: 1133–1145.
- 44. Simoncelli EP, Olshausen BA (2001) Natural image statistics and neural representation. Annu Rev Neurosci 24: 1193–1216.
- 45. Gray CM, Konig P, Engel AK, Singer W (1989) Oscillatory responses in cat visual cortex exhibit inter-columnar synchronization which reflects global stimulus properties. Nature 338: 334–337.
- 46. Hilgetag CC, Burns GA, O'Neill MA, Scannell JW, Young MP (2000) Anatomical connectivity defines the organization of clusters of cortical areas in the macaque monkey and the cat. Philos Trans R Soc Lond B Biol Sci 355: 91–110.
- 47. Hilgetag C, Kaiser M (2004) Clustered organization of cortical connectivity. NEUROINFORMATICS 2: 353–360.
- 48. Bartzokis G (2002) Schizophrenia: breakdown in the well-regulated lifelong process of brain development and maturation. Neuropsychopharmacology 27: 672–683.
- 49. Stam CJ, Jones BF, Nolte G, Breakspear M, Scheltens P (2007) Small-world networks and functional connectivity in Alzheimer's disease. Cereb Cortex 17: 92–99.
- 50. Kubicki M, Westin CF, Nestor PG, Wible CG, Frumin M, et al. (2003) Cingulate fasciculus integrity disruption in schizophrenia: a magnetic resonance diffusion tensor imaging study. Biol Psychiatry 54: 1171–1180.
- 51. Rose SE, Chalk JB, Janke AL, Strudwick MW, Windus LC, et al. (2006) Evidence of altered prefrontal-thalamic circuitry in schizophrenia: an optimized diffusion MRI study. Neuroimage 32: 16–22.
- 52. Schmahmann JD, Pandya DN, Wang R, Dai G, D'Arceuil HE, et al. (2007) Association fibre pathways of the brain: parallel observations from diffusion spectrum imaging and autoradiography. Brain 130: 630–653.
- 53. Grill-Spector K, Malach R (2004) The human visual cortex. Annu Rev Neurosci 27: 649–677.
- 54. Born RT, Bradley DC (2005) Structure and function of visual area MT. Annu Rev Neurosci 28: 157–189.
- 55. Sincich LC, Horton JC (2005) The circuitry of V1 and V2: integration of color, form, and motion. Annu Rev Neurosci 28: 303–326.
- 56. Kennedy H, Dehay C, Bullier J (1986) Organization of the callosal connections of visual areas V1 and V2 in the macaque monkey. J Comp Neurol 247: 398–415.