Search

Communication models describe the flow of signals among nodes of a network. In neural systems, communication models are increasingly applied to investigate network dynamics across the whole brain, with the ultimate aim to understand how signal flow gives rise to brain function. Communication models range from diffusion-like processes to those related to infectious disease transmission and those inspired by engineered communication systems like the internet. This Focus Feature brings together novel investigations of a diverse range of mechanisms and strategies that could shape communication in mammal whole-brain networks.

Medical imaging, a key component in clinical diagnosis of and research on numerous medical conditions, is very costly and can generate massive datasets. For instance, a single scanned subject produces hundreds of thousands of images and millions of key-value metadata pairs that must be verified to ensure instrument and research protocol compliance. Many projects lack funds to reacquire images if data quality issues are detected later. Data quality assurance (QA) requires continuous involvement by all stakeholders and use of specific quality control (QC) methods to identify data issues likely to require post-processing correction or real-time re-acquisition. While many useful QC methods exist, they are often designed for specific use-cases with limited scope and documentation, making integration with other setups difficult. We present the Scalable Quality Assurance for Neuroimaging (SQAN), an open-source software suite developed by Indiana University for protocol quality control and instrumental validation on medical imaging data. SQAN includes a comprehensive QC Engine that ensures adherence to a research study’s protocol. A modern, intuitive web portal serves a wide range of users including researchers, scanner technologists and data scientists, each of whom approach QC with unique priorities, expertise, insights and expectations. Since Fall 2017, a fully operational SQAN instance has supported 50+ research projects, and has QC’d ∼3.5 million images and over 700 million metadata tags. SQAN is designed to scale to any imaging center’s QC needs, and to extend beyond protocol QC toward image-level QC and integration with pipeline and non-imaging database systems.

Neuronal signalling and communication underpin virtually all aspects of brain activity and function. Network science approaches to modelling and analysing the dynamics of communication on networks have proved useful for simulating functional brain connectivity and predicting emergent network states. This Review surveys important aspects of communication dynamics in brain networks. We begin by sketching a conceptual framework that views communication dynamics as a necessary link between the empirical domains of structural and functional connectivity. We then consider how different local and global topological attributes of structural networks support potential patterns of network communication, and how the interactions between network topology and dynamic models can provide additional insights and constraints. We end by proposing that communication dynamics may act as potential generative models of effective connectivity and can offer insight into the mechanisms by which brain networks transform and process information.

Stochastic resonance is a phenomenon in which noise enhances the response of a system to an input signal. The brain is an example of a system that has to detect and transmit signals in a noisy environment, suggesting that it is a good candidate to take advantage of stochastic resonance. In this work, we aim to identify the optimal levels of noise that promote signal transmission through a simple network model of the human brain. Specifically, using a dynamic model implemented on an anatomical brain network (connectome), we investigate the similarity between an input signal and a signal that has traveled across the network while the system is subject to different noise levels. We find that non-zero levels of noise enhance the similarity between the input signal and the signal that has traveled through the system. The optimal noise level is not unique; rather, there is a set of parameter values at which the information is transmitted with greater precision, this set corresponds to the parameter values that place the system in a critical regime. The multiplicity of critical points in our model allows it to adapt to different noise situations and remain at criticality.

Functional connectivity (FC) analysis has revealed stable and reproducible features of brain network organization, as well as their variations across individuals. Here, we localize network markers of individual variability in FC and track their dynamical expression across time. First, we determine the minimal set of network components required to identify individual subjects. Among specific resting-state networks, we find that the FC pattern of the frontoparietal network allows for the most reliable identification of individuals. Looking across the whole brain, an optimization approach designed to identify a minimal node set converges on distributed portions of the frontoparietal system. Second, we track the expression of these network markers across time. We find that the FC fingerprint is most clearly expressed at times when FC patterns exhibit low modularity. In summary, our study reveals distributed network markers of individual variability that are localized in both space and time.

We propose a information theoretical framework to capture transition and information costs of network navigation models. Based on the minimum description length principle and the Markov decision process, we demonstrate that efficient global navigation can be achieved with only partial information. Additionally, we derived a scalable algorithm for optimal solutions under certain conditions. The proposed algorithm can be interpreted as a dynamical process on network, making it a useful tool for analysing and understanding navigation strategies on real world networks., To appear in the Proceedings of the 2020 IEEE International Conference on Networking, Sensing and Control (ICNSC2020)

Alzheimer's disease is considered a disconnection syndrome, motivating the use of brain network measures to detect changes in whole-brain resting-state functional connectivity (FC). We investigated changes in FC within and among resting state networks (RSN) across four different stages in the Alzheimer's disease continuum, and examining two independent cohorts of individuals (84 and 58 individuals, respectively) each comprising control, subjective cognitive decline, mild cognitive impairment and Alzheimer's dementia groups. For each participant, FC was computed as a matrix of Pearson correlations between pairs of time series from 278 gray matter brain regions. We determined significant differences in FC modular organization with two distinct approaches, network contingency analysis and multiresolution consensus clustering. Network contingency analysis identified RSN sub-blocks that differed significantly across clinical groups. Multiresolution consensus clustering identified differences in the stability of modules across multiple spatial scales. Significant modules were further test for statistical association with average memory and executive function cognitive scores. Across both analysis approaches in both participant cohorts the findings converged on a pattern of FC that varied systematically with diagnosis within the frontoparietal network (FP) and between the FP network and default mode network (DMN). Disturbances of modular organization were manifest as greater internal coherence of the FP network and stronger coupling between FP and DMN, resulting in less segregation of these two networks. Our findings suggest that the pattern of interactions within and between specific RSNs holds potential as a new biomarker predictive of clinical progression along the Alzheimer's disease spectrum.

Various hypotheses exist about the paths used for communication between the nodes of complex networks. Most studies simply suppose that communication goes via shortest paths, while others have more explicit assumptions about how routing (alternatively navigation or search) works or should work in real networks. However, these assumptions are rarely checked against real data. Here we directly analyze the structure of operational paths using real measurements. For this purpose we use existing and newly created datasets having both the topology of the network and a sufficient number of empirically-determined paths over it. Such datasets are processed for air transportation networks, the human brain, the Internet and the fit-fat-cat word ladder game. Our results suggest that from the great number of possible paths, nature seems to pick according to some simple rules, which we will refer to as routing policies. First we confirm, that the preference of short paths is an inevitable policy element, however the observed stretch of the paths suggests that there are other policies at work simultaneously. We identify two additional policies common in our networks: the "conform hierarchy", meaning that the paths should obey the structural hierarchy of the network, and the "prefer downstream" policy which promotes avoiding the network core if possible. Building upon these simple policies, we propose a synthetic routing policy which can recover the basic statistical properties of the operational paths in networks. Our results can be helpful in estimating the reaction of complex systems for stress coming from the outside more accurately than the shortest path assumption permits., 8 pages 5 figures

The human connectome has been widely studied over the past decade. A principal finding is that it can be decomposed into communities of densely interconnected brain regions. This result, however, may be limited methodologically. Past studies have often used a flawed modularity measure in order to infer the connectome's community structure. Also, these studies relied on the intuition that community structure is best defined in terms of a network's static topology as opposed to a more dynamical definition. In this report we used the partition stability framework, which defines communities in terms of a Markov process (random walk), to infer the connectome's multi-scale community structure. Comparing the community structure to observed resting-state functional connectivity revealed communities across a broad range of dynamical scales that were closely related to functional connectivity. This result suggests a mapping between communities in structural networks, models of communication processes, and brain function. It further suggests that communication in the brain is not limited to a single characteristic scale, leading us to posit a heuristic for scale-selective communication in the cerebral cortex., Comment: Corrected small typographical mistakes, changed order of authors and funding information, and also chose a more efficient compression for figures

The complex relationship between structural and functional connectivity, as measured by noninvasive imaging of the human brain, poses many unresolved challenges and open questions. Here, we apply analytic measures of network communication to the structural connectivity of the human brain and explore the capacity of these measures to predict resting-state functional connectivity across three independently acquired datasets. We focus on the layout of shortest paths across the network and on two communication measures-search information and path transitivity- which account for how these paths are embedded in the rest of the network. Search information is an existing measure of information needed to access or trace shortest paths; we introduce path transitivity to measure the density of local detours along the shortest path. We find that both search information and path transitivity predict the strength of functional connectivity among both connected and unconnected node pairs. They do so at levels that match or significantly exceed path length measures, Euclidean distance, as well as computational models of neural dynamics. This capacity suggests that dynamic couplings due to interactions among neural elements in brain networks are substantially influenced by the broader network context adjacent to the shortest communication pathways.

Computational analysis of communication efficiency of brain networks often relies on graph-theoretic measures based on the shortest paths between network nodes. Here, we explore a communication scheme that relaxes the assumption that information travels exclusively through optimally short paths. The scheme assumes that communication between a pair of brain regions may take place through a path ensemble comprising the k-shortest paths between those regions. To explore this approach, we map path ensembles in a set of anatomical brain networks derived from diffusion imaging and tractography. We show that while considering optimally short paths excludes a significant fraction of network connections from participating in communication, considering k-shortest path ensembles allows all connections in the network to contribute. Path ensembles enable us to assess the resilience of communication pathways between brain regions, by measuring the number of alternative, disjoint paths within the ensemble, and to compare generalized measures of path length and betweenness centrality to those that result when considering only the single shortest path between node pairs. Furthermore, we find a significant correlation, indicative of a trade-off, between communication efficiency and resilience of communication pathways in structural brain networks. Finally, we use k-shortest path ensembles to demonstrate hemispherical lateralization of efficiency and resilience.

Published by the Royal Society under the terms of the Creative Commons Attribution License, The structure of complex networks has attracted much attention in recent years. It has been noted that many real-world examples of networked systems share a set of common architectural features. This raises important questions about their origin, for example whether such network attributes reflect common design principles or constraints imposed by selectional forces that have shaped the evolution of network topology. Is it possible to place the many patterns and forms of complex networks into a common space that reveals their relations, and what are the main rules and driving forces that determine which positions in such a space are occupied by systems that have actually evolved? We suggest that these questions can be addressed by combining concepts from two currently relatively unconnected fields. One is theoretical morphology, which has conceptualized the relations between morphological traits defined by mathematical models of biological form. The second is network science, which provides numerous quantitative tools to measure and classify different patterns of local and global network architecture across disparate types of systems. Here, we explore a new theoretical concept that lies at the intersection between both fields, the 'network morphospace'. Defined by axes that represent specific network traits, each point within such a space represents a location occupied by networks that share a set of common 'morphological' characteristics related to aspects of their connectivity. Mapping a network morphospace reveals the extent to which the space is filled by existing networks, thus allowing a distinction between actual and impossible designs and highlighting the generative potential of rules and constraints that pervade the evolution of complex systems. © 2014 The Authors.