Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2010 Apr 22;6(4):e1000748.
doi: 10.1371/journal.pcbi.1000748.

Efficient physical embedding of topologically complex information processing networks in brains and computer circuits

Affiliations

Efficient physical embedding of topologically complex information processing networks in brains and computer circuits

Danielle S Bassett et al. PLoS Comput Biol. .

Abstract

Nervous systems are information processing networks that evolved by natural selection, whereas very large scale integrated (VLSI) computer circuits have evolved by commercially driven technology development. Here we follow historic intuition that all physical information processing systems will share key organizational properties, such as modularity, that generally confer adaptivity of function. It has long been observed that modular VLSI circuits demonstrate an isometric scaling relationship between the number of processing elements and the number of connections, known as Rent's rule, which is related to the dimensionality of the circuit's interconnect topology and its logical capacity. We show that human brain structural networks, and the nervous system of the nematode C. elegans, also obey Rent's rule, and exhibit some degree of hierarchical modularity. We further show that the estimated Rent exponent of human brain networks, derived from MRI data, can explain the allometric scaling relations between gray and white matter volumes across a wide range of mammalian species, again suggesting that these principles of nervous system design are highly conserved. For each of these fractal modular networks, the dimensionality of the interconnect topology was greater than the 2 or 3 Euclidean dimensions of the space in which it was embedded. This relatively high complexity entailed extra cost in physical wiring: although all networks were economically or cost-efficiently wired they did not strictly minimize wiring costs. Artificial and biological information processing systems both may evolve to optimize a trade-off between physical cost and topological complexity, resulting in the emergence of homologous principles of economical, fractal and modular design across many different kinds of nervous and computational networks.

PubMed Disclaimer

Conflict of interest statement

The authors have declared that no competing interests exist.

Figures

Figure 1
Figure 1. Schematic of some key methods.
A hierarchical modular network, A(i), is made up of modules, A(ii) green, which are made up of sub-modules, A(ii) yellow, and sub-sub-modules, A(ii) red, which are collectively visualized by a co-classification matrix, A(iii), where hierarchical modularity is evident by layers of color located along the diagonal . To estimate the topological Rent exponent and dimension of a network, B(i), we first cover the network with a single box large enough to cover it entirely; then we recursively partition the box (B(ii) and B(iii)) into halves, quarters, and so on using a partition algorithm that minimizes the number of edges cut by each partition. For each iteration of this process, we count the number of nodes within a partition (formula image), and the number of edges (formula image) crossing the partitions; a linear relationship between these two variables plotted on logarithmic axes indicates topological Rentian scaling of network connectivity and provides an estimator of the topological dimension formula image of the network, . To estimate the physical Rent exponent, we randomly place 5000 randomly sized boxes on the physically embedded network, e.g., the human brain network in anatomical space C(i). Then we count the number of nodes formula image and the number of boundary-crossing edges formula image for each box C(ii) and estimate the physical Rent exponent formula image by the linear relationship between these two variables on logarithmic axes, C(iii).
Figure 2
Figure 2. Hierarchical modularity in nervous and computational systems.
Dendrograms displaying significant modular and sub-modular structure for (A) a very large scale integrated circuit, (B) the nematode worm C. elegans, (C) the human cortical anatomical network estimated using conventional MRI in 259 normal volunteers and (D) the human cortical anatomical network estimated using diffusion spectrum imaging (DSI) from an independent sample of 5 normal volunteers. The modularity, formula image, of each of these matrices was estimated using the Louvain community detection algorithm ; 1-tailed t-tests were performed to determine where the modularity of the observed network was higher than the modularity of a functional random (p-value, formula image), and pure random (p-value, formula image) network. The matrices were decomposed into their sub-modules, and each sub-module was tested for modularity, formula image, greater than functional and pure random networks (formula image, formula image) of the same size as the module being tested. This process was iteratively performed: sub-modules were tested for non-random modularity, and if sub-sub-modules were identified in this way then each of them was in turn tested for non-random modularity. All modules shown in the decomposition had formula image, formula image except for those few indicated in gray (formula image) and blue (formula image). Complete decompositions are shown for the VLSI and human brain MRI network; both the C. elegans and human brain DSI networks continue to deeper hierarchical levels, here not shown due to space constraints (see supplementary Text S1 for full decompositions). Insets The inset panels give a visual depiction of the hierarchical modularity of each system, which has been represented by a co-classification matrix where red/brown colors highlight modules or clusters of nodes with high local interconnectivity and relatively sparse connectivity to nodes in other modules ; see also Figure 1 for a schematic.
Figure 3
Figure 3. Topological and physical Rentian scaling in nervous and computational systems.
Physical Rentian scaling in (A) a very large scale integrated circuit, (B) the nematode worm C. elegans, (C) the human cortical anatomical network estimated using conventional MRI in 259 normal volunteers and (D) the human cortical anatomical network estimated using diffusion spectrum imaging (DSI) from an independent sample of 5 normal volunteers, is shown by a power law scaling of the number of connections or edges (formula image) and number of processing elements (formula image) in a physical box; data points for each physical box are shown by black stars. The Rent exponents for each system were estimated by the gradients of the fitted red lines (see Table 1). Note: Data and linear shown in D are for a single subject. Insets Topological Rentian scaling in nervous and computational systems is shown by a power law scaling of the number of nodes (formula image) in a topological partition and the number of edges crossing the boundary of that partition (formula image); data points for each topological partition are shown by black circles. The network topology of each system was iteratively partitioned in topological space. All networks contained a linear scaling regime (so-called Region I, filled black circles) and a regime at larger partition sizes where linear scaling broke down due to boundary effects (so-called Region II, empty black circles). The slope, formula image, of the line through points within Region I was estimated using a weighted linear regression (red line); see Table 1. Note: Data and linear fits for all six DSI scans are shown in D.
Figure 4
Figure 4. Allometric and Rentian scaling of VLSI circuits and mammalian brains.
In computer circuits (A), the number of connections at the boundary of a chip scales in a Rentian power law with the number of processing elements; the Rent exponent formula image is greater for high performance computers (shown in blue) than for simpler dynamic memory circuits (shown in red); see pp. 416–421 in for data values plotted here. In the cerebral hemispheres of mammalian brains (B), there is an allometric scaling relationship between white matter volume (related to connectivity of elements) and gray matter volume (related to number of processing elements); see Table 1 in for data values plotted here. The exponent of this volume scaling relationship over species, formula image, is simply related to the Rent exponent of mammalian cerebral connectivity, formula image. Lines fitted through the intercept of the data show the allometric scaling relationship predicted by the Rent exponent estimated for neuroimaging data on a single species (Homo sapiens), using MRI (cyan, formula image) and DSI (blue, formula image) (Table 1). Errors in the fits are smaller than the line width.
Figure 5
Figure 5. Minimally rewired networks.
Wiring costs of nervous and computational networks are lower than expected in a random network, but can be reduced by a rewiring algorithm designed to minimize connection distance between elements (A); see Table 1. However, the fractal dimension of network topology, while lower than expected in a randomly rewired network, is also reduced by rewiring for cost minimization (B). Rentian scaling is either destroyed or disrupted by minimally rewiring the C. elegans connectome (C) or the human MRI network (D). The inset panels in (C,D) show the hierarchical modularity of each minimally wired system, which has been represented by a co-classification matrix as in Figure 2.

Similar articles

Cited by

References

    1. Watts DJ, Strogatz SH. Collective dynamics of ‘small-world’ networks. Nature. 1998;393:440–442. - PubMed
    1. Ozik J, Hunt BR, Ott E. Growing networks with geographical attachment preference: emergence of small worlds. Phys Rev E. 2004;69:026108. - PubMed
    1. Masuda N, Miwa H, Konno N. Geographical threshold graphs with small-world and scale-free properties. Phys Rev E. 2005;71:036108. - PubMed
    1. Christie P, Stroobandt D. The interpretation and application of Rent's Rule. IEEE Trans VLSI Syst. 2000;8:639–648.
    1. Ozaktas HM. Paradigms of connectivity for computer circuits and networks. Opt Eng. 1992;31:1563–1567.

Publication types