State-dependent changes of connectivity patterns and functional brain network topology in Autism Spectrum Disorder

Anatomical and functional brain studies have converged to the hypothesis that Autism Spectrum Disorders (ASD) are associated with atypical connectivity. Using a modified resting-state paradigm to drive subjects' attention, we provide evidence of a very marked interaction between ASD brain functional connectivity and cognitive state. We show that functional connectivity changes in opposite ways in ASD and typicals as attention shifts from external world towards one's body generated information. Furthermore, ASD subject alter more markedly than typicals their connectivity across cognitive states. Using differences in brain connectivity across conditions, we classified ASD subjects at a performance around 80% while classification based on the connectivity patterns in any given cognitive state were close to chance. Connectivity between the Anterior Insula and dorsal-anterior Cingulate Cortex showed the highest classification accuracy and its strength increased with ASD severity. These results pave the path for diagnosis of mental pathologies based on functional brain networks obtained from a library of mental states

Developmental time windows for axon growth influence neuronal network topology

Early brain connectivity development consists of multiple stages: birth of neurons, their migration and the subsequent growth of axons and dendrites. Each stage occurs within a certain period of time depending on types of neurons and cortical layers. Forming synapses between neurons either by growing axons starting at similar times for all neurons (much-overlapped time windows) or at different time points (less-overlapped) may affect the topological and spatial properties of neuronal networks. Here, we explore the extreme cases of axon formation especially concerning short-distance connectivity during early development, either starting at the same time for all neurons (parallel, i.e. maximally-overlapped time windows) or occurring for each neuron separately one neuron after another (serial, i.e. no overlaps in time windows). For both cases, the number of potential and established synapses remained comparable. Topological and spatial properties, however, differed: neurons that started axon growth early on in serial growth achieved higher out-degrees, higher local efficiency, and longer axon lengths while neurons demonstrated more homogeneous connectivity patterns for parallel growth. Second, connection probability decreased more rapidly with distance between neurons for parallel growth than for serial growth. Third, bidirectional connections were more numerous for parallel growth. Finally, we tested our predictions with C. elegans data. Together, this indicates that time windows for axon growth influence the topological and spatial properties of neuronal networks opening the possibility to a posteriori estimate developmental mechanisms based on network properties of a developed network.Comment: Biol Cybern. 2015 Jan 30. [Epub ahead of print

A statistical model for brain networks inferred from large-scale electrophysiological signals

Network science has been extensively developed to characterize structural properties of complex systems, including brain networks inferred from neuroimaging data. As a result of the inference process, networks estimated from experimentally obtained biological data, represent one instance of a larger number of realizations with similar intrinsic topology. A modeling approach is therefore needed to support statistical inference on the bottom-up local connectivity mechanisms influencing the formation of the estimated brain networks. We adopted a statistical model based on exponential random graphs (ERGM) to reproduce brain networks, or connectomes, estimated by spectral coherence between high-density electroencephalographic (EEG) signals. We validated this approach in a dataset of 108 healthy subjects during eyes-open (EO) and eyes-closed (EC) resting-state conditions. Results showed that the tendency to form triangles and stars, reflecting clustering and node centrality, better explained the global properties of the EEG connectomes as compared to other combinations of graph metrics. Synthetic networks generated by this model configuration replicated the characteristic differences found in brain networks, with EO eliciting significantly higher segregation in the alpha frequency band (8-13 Hz) as compared to EC. Furthermore, the fitted ERGM parameter values provided complementary information showing that clustering connections are significantly more represented from EC to EO in the alpha range, but also in the beta band (14-29 Hz), which is known to play a crucial role in cortical processing of visual input and externally oriented attention. These findings support the current view of the brain functional segregation and integration in terms of modules and hubs, and provide a statistical approach to extract new information on the (re)organizational mechanisms in healthy and diseased brains.Comment: Due to the limitation "The abstract field cannot be longer than 1,920 characters", the abstract appearing here is slightly shorter than that in the PDF fil

Distributed Edge Connectivity in Sublinear Time

We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity $\lambda$ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes $\tilde O(n^{1-1/353}D^{1/353}+n^{1-1/706})$ time to compute $\lambda$ and a cut of cardinality $\lambda$ with high probability, where $n$ and $D$ are the number of nodes and the diameter of the network, respectively, and $\tilde O$ hides polylogarithmic factors. This running time is sublinear in $n$ (i.e. $\tilde O(n^{1-\epsilon})$) whenever $D$ is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when $\lambda=O(n^{1/8-\epsilon})$ [Thurimella PODC'95; Pritchard, Thurimella, ACM Trans. Algorithms'11; Nanongkai, Su, DISC'14] or (ii) approximately [Ghaffari, Kuhn, DISC'13; Nanongkai, Su, DISC'14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a $k$-edge connectivity certificate for any $k=O(n^{1-\epsilon})$ in time $\tilde O(\sqrt{nk}+D)$. Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA'19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC'15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the `trivial' ones). Finally, by extending the tree packing technique from [Karger STOC'96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an $\tilde O(n)$-time algorithm for computing exact minimum cut for weighted graphs.Comment: Accepted at 51st ACM Symposium on Theory of Computing (STOC 2019

A Message Passing Strategy for Decentralized Connectivity Maintenance in Agent Removal

In a multi-agent system, agents coordinate to achieve global tasks through local communications. Coordination usually requires sufficient information flow, which is usually depicted by the connectivity of the communication network. In a networked system, removal of some agents may cause a disconnection. In order to maintain connectivity in agent removal, one can design a robust network topology that tolerates a finite number of agent losses, and/or develop a control strategy that recovers connectivity. This paper proposes a decentralized control scheme based on a sequence of replacements, each of which occurs between an agent and one of its immediate neighbors. The replacements always end with an agent, whose relocation does not cause a disconnection. We show that such an agent can be reached by a local rule utilizing only some local information available in agents' immediate neighborhoods. As such, the proposed message passing strategy guarantees the connectivity maintenance in arbitrary agent removal. Furthermore, we significantly improve the optimality of the proposed scheme by incorporating $\delta$-criticality (i.e. the criticality of an agent in its $\delta$-neighborhood).Comment: 9 pages, 9 figure