It has been suggested that neural systems across several scales of organization show optimal component placement, in which any spatial rearrangement of the components would lead to an increase of total wiring. Using extensive connectivity datasets for diverse neural networks combined with spatial coordinates for network nodes, we applied an optimization algorithm to the network layouts, in order to search for wire-saving component rearrangements. We found that optimized component rearrangements could substantially reduce total wiring length in all tested neural networks. Specifically, total wiring among 95 primate (Macaque) cortical areas could be decreased by 32%, and wiring of neuronal networks in the nematode Caenorhabditis elegans could be reduced by 48% on the global level, and by 49% for neurons within frontal ganglia. Wiring length reductions were possible due to the existence of long-distance projections in neural networks. We explored the role of these projections by comparing the original networks with minimally rewired networks of the same size, which possessed only the shortest possible connections. In the minimally rewired networks, the number of processing steps along the shortest paths between components was significantly increased compared to the original networks. Additional benchmark comparisons also indicated that neural networks are more similar to network layouts that minimize the length of processing paths, rather than wiring length. These findings suggest that neural systems are not exclusively optimized for minimal global wiring, but for a variety of factors including the minimization of processing steps. What constraints shape the organization and spatial layout of neural networks? One influential idea in theoretical neuroscience has been that the overall wiring of neural networks should be as short as possible. Wire-saving could be achieved, for instance, through an optimal spatial arrangement of the connected network components. The authors evaluated this concept of component placement optimization in two representative systems, the neuronal network of the Caenorhabditis elegans worm and the long-range cortical connections of the primate brain. Contrary to previous results, they found many network layouts with substantially shorter total wiring than that of the original biological networks. This nonoptimal component placement arose from the existence of long-distance connections in the networks. Such connections may come at a developmental and metabolic cost; however, as the analyses reported in this article show, they also help to reduce the number of signal processing steps across the networks. Therefore, the organization of neural networks is shaped by trade-offs from multiple constraints, among them total wiring length and the average number of processing steps.

See Eissa and Schevon (doi:10.1093/aww332) for a scientific commentary on this article. Surgery can be a last resort for patients with intractable, medically refractory epilepsy. For many of these patients, however, there is substantial risk that the surgery will be ineffective. The prediction of who is likely to benefit from a surgical approach is crucial for being able to inform patients better, conduct principled prospective clinical trials, and ultimately tailor therapeutic approaches to these patients more effectively. Dynamical computational models, informed with patient data, can be used to make predictions and give mechanistic insight. In this study, we develop patient-specific dynamical network models of epileptogenic cortex. We infer the network connectivity matrix from non-seizure electrographic recordings of patients and use these connectivity matrices as the network structure in our model. The model simulates the dynamics of a bi-stable switch at every node in this network, meaning that every node starts in a background state, but has the ability to transit to a co-existing seizure state. Whether a transition happens in a node is partly determined by the stochastic nature of the input to the node, but also by the input the node receives from other connected nodes in the network. By conducting simulations with such a model, we can detect the average transition time for nodes in a given network, and therefore define nodes with a short transition time as highly epileptogenic. In a retrospective study, we found that in some patients the regions with high epileptogenicity in the model overlap with those identified clinically as the seizure onset zone. Moreover, it was found that the resection of these regions in the model reduces the overall likelihood of a seizure. Following removal of these regions in the model, we predicted surgical outcomes and compared these to actual patient outcomes. Our predictions were found to be 81.3% accurate on a dataset of 16 patients with intractable epilepsy. Intriguingly, in patients with unsuccessful outcomes, the proposed computational approach is able to suggest alternative resection sites. The model presented here gives mechanistic insight as to why surgery may be unsuccessful in some patients. This may aid clinicians in presurgical evaluation by providing a tool to explore various surgical options, offering complementary information to existing clinical techniques.