Causal interactions and delays in a neuronal ensemble

We analyze a neural system which mimics a sensorial cortex, with different input characteristics, in presence of transmission delays. We propose a new measure to characterize collective behavior, based on the nonlinear extension of the concept of Granger causality, and an interpretation is given of the variation of the percentage of the causally relevant interactions with transmission delays.Comment: 7 pages, 3 figures. To appear in the AIP seminar notes of 9th Granada seminar on Computational Physics: Computational and Mathematical Modeling of Cooperative Behavior in Neural System

Consensus clustering approach to group brain connectivity matrices

A novel approach rooted on the notion of consensus clustering, a strategy developed for community detection in complex networks, is proposed to cope with the heterogeneity that characterizes connectivity matrices in health and disease. The method can be summarized as follows: (i) define, for each node, a distance matrix for the set of subjects by comparing the connectivity pattern of that node in all pairs of subjects; (ii) cluster the distance matrix for each node; (iii) build the consensus network from the corresponding partitions; (iv) extract groups of subjects by finding the communities of the consensus network thus obtained. Differently from the previous implementations of consensus clustering, we thus propose to use the consensus strategy to combine the information arising from the connectivity patterns of each node. The proposed approach may be seen either as an exploratory technique or as an unsupervised pre-training step to help the subsequent construction of a supervised classifier. Applications on a toy model and two real data sets, show the effectiveness of the proposed methodology, which represents heterogeneity of a set of subjects in terms of a weighted network, the consensus matrix

Information transfer of an Ising model on a brain network

We implement the Ising model on a structural connectivity matrix describing the brain at a coarse scale. Tuning the model temperature to its critical value, i.e. at the susceptibility peak, we find a maximal amount of total information transfer between the spin variables. At this point the amount of information that can be redistributed by some nodes reaches a limit and the net dynamics exhibits signature of the law of diminishing marginal returns, a fundamental principle connected to saturated levels of production. Our results extend the recent analysis of dynamical oscillators models on the connectome structure, taking into account lagged and directional influences, focusing only on the nodes that are more prone to became bottlenecks of information. The ratio between the outgoing and the incoming information at each node is related to the number of incoming links

Natural clustering: the modularity approach

We show that modularity, a quantity introduced in the study of networked systems, can be generalized and used in the clustering problem as an indicator for the quality of the solution. The introduction of this measure arises very naturally in the case of clustering algorithms that are rooted in Statistical Mechanics and use the analogy with a physical system.Comment: 11 pages, 5 figure enlarged versio

Leave-one-out prediction error of systolic arterial pressure time series under paced breathing

In this paper we show that different physiological states and pathological conditions may be characterized in terms of predictability of time series signals from the underlying biological system. In particular we consider systolic arterial pressure time series from healthy subjects and Chronic Heart Failure patients, undergoing paced respiration. We model time series by the regularized least squares approach and quantify predictability by the leave-one-out error. We find that the entrainment mechanism connected to paced breath, that renders the arterial blood pressure signal more regular, thus more predictable, is less effective in patients, and this effect correlates with the seriousness of the heart failure. The leave-one-out error separates controls from patients and, when all orders of nonlinearity are taken into account, alive patients from patients for which cardiac death occurred

Identification of network modules by optimization of ratio association

We introduce a novel method for identifying the modular structures of a network based on the maximization of an objective function: the ratio association. This cost function arises when the communities detection problem is described in the probabilistic autoencoder frame. An analogy with kernel k-means methods allows to develop an efficient optimization algorithm, based on the deterministic annealing scheme. The performance of the proposed method is shown on a real data set and on simulated networks