arXiv subjects

Mario Pellicoro

Publications and source records attributed to Mario Pellicoro.

At least 19 recordsLinked to original sources

arXiv2020

Synergistic information in a dynamical model implemented on the human structural connectome reveals spatially distinct associations with age

We implement the dynamical Ising model on the large scale architecture of white matter connections of healthy subjects in the age range 4-85 years, and analyze the dynamics in terms of the synergy, a quantity measuring the extent to which the joint state of pairs of variables is projected onto the dynamics of a target one. We find that the amount of synergy in explaining the dynamics of the hubs of the structural connectivity (in terms of degree strength) peaks before the critical temperature, and can thus be considered as a precursor of a critical transition. Conversely the greatest amount of synergy goes into explaining the dynamics of more central nodes. We also find that the aging of the structural connectivity is associated to significant changes in the simulated dynamics: there are brain regions whose synergy decreases with age, in particular the frontal pole, the Subcallosal area and the Supplementary Motor area; these areas could then be more likely to show a decline in terms of the capability to perform higher order computation (if structural connectivity was the sole variable). On the other hand, several regions in the temporal cortex show a positive correlation with age in the first 30 years of life, i.e. during brain maturation.

q-bio.NC↗

arXiv2019

Synergy as a warning sign of transitions: the case of the two-dimensional Ising model

We consider the formalism of information decomposition of target effects from multi-source interactions, i.e. the problem of defining redundant and synergistic components of the information that a set of source variables provides about a target, and apply it to the two-dimensional Ising model as a paradigm of a critically transitioning system. Intuitively, synergy is the information about the target variable that is uniquely obtained taking the sources together, but not considering them alone; redundancy is the information which is shared by the sources. To disentangle the components of the information both at the static level and at the dynamical one, the decomposition is applied respectively to the mutual information and to the transfer entropy between a given spin, the target, and a pair of neighbouring spins (taken as the drivers). We show that a key signature of an impending phase transition (approached from the disordered size) is the fact that the synergy peaks in the disordered phase, both in the static and in the dynamic case: the synergy can thus be considered a precursor of the transition. The redundancy, instead, reaches its maximum at the critical temperature. The peak of the synergy of the transfer entropy is far more pronounced than those of the static mutual information. We show that these results are robust w.r.t. the details of the information decomposition approach, as we find the same results using two different methods; moreover, w.r.t. previous literature rooted on the notion of Global Transfer Entropy, our results demonstrate that considering as few as three variables is sufficient to construct a precursor of the transition, and provide a paradigm for the investigation of a variety of systems prone to crisis, like financial markets, social media, or epileptic seizures.

cond-mat.stat-mech↗

arXiv2017

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.

q-bio.NC↗

arXiv2017

Conserved Ising Model on the Human Connectome

Dynamical models implemented on the large scale architecture of the human brain may shed light on how function arises from the underlying structure. This is the case notably for simple abstract models, such as the Ising model. We compare the spin correlations of the Ising model and the empirical functional brain correlations, both at the single link level and at the modular level, and show that their match increases at the modular level in anesthesia, in line with recent results and theories. Moreover, we show that at the peak of the specific heat (the \it{critical state}) the spin correlations are minimally shaped by the underlying structural network, explaining how the best match between structure and function is obtained at the onset of criticality, as previously observed. These findings confirm that brain dynamics under anesthesia shows a departure from criticality and could open the way to novel perspectives when the conserved magnetization is interpreted in terms of an homeostatic principle imposed to neural activity.

q-bio.NC↗

arXiv2013

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.

q-bio.NC↗

arXiv2012

Information flow in a network model and the law of diminishing marginal returns

We analyze a simple dynamical network model which describes the limited capacity of nodes to process the input information. For a suitable choice of the parameters, the information flow pattern is characterized by exponential distribution of the incoming information and a fat-tailed distribution of the outgoing information, as a signature of the law of diminishing marginal returns. The analysis of a real EEG data-set shows that similar phenomena may be relevant for brain signals.

physics.data-an↗

arXiv2012

Causal information approach to partial conditioning in multivariate data sets

When evaluating causal influence from one time series to another in a multivariate dataset it is necessary to take into account the conditioning effect of the other variables. In the presence of many variables, and possibly of a reduced number of samples, full conditioning can lead to computational and numerical problems. In this paper we address the problem of partial conditioning to a limited subset of variables, in the framework of information theory. The proposed approach is tested on simulated datasets and on an example of intracranial EEG recording from an epileptic subject. We show that, in many instances, conditioning on a small number of variables, chosen as the most informative ones for the driver node, leads to results very close to those obtained with a fully multivariate analysis, and even better in the presence of a small number of samples. This is particularly relevant when the pattern of causalities is sparse.

physics.data-an↗

arXiv2011

Abnormal effective connectivity in migraine with aura under photic stimulation

Migraine patients with aura show a peculiar pattern of visual reactivity compared with those of migraine patients without aura: an increased effective connectivity, connected to a reduced synchronization among EEG channels, for frequencies in the beta band. The effective connectivity is evaluated in terms of the Granger causality. This anomalous response to visual stimuli may play a crucial role in the progression of spreading depression and clinical evidences of aura symptoms.

q-bio.NC↗

arXiv2010

Grouping time series by pairwise measures of redundancy

A novel approach is proposed to group redundant time series in the frame of causality. It assumes that (i) the dynamics of the system can be described using just a small number of characteristic modes, and that (ii) a pairwise measure of redundancy is sufficient to elicit the presence of correlated degrees of freedom. We show the application of the proposed approach on fMRI data from a resting human brain and gene expression profiles from HeLa cell culture.

q-bio.NC↗

arXiv2010

Granger causality and the inverse Ising problem

We study Ising models for describing data and show that autoregressive methods may be used to learn their connections, also in the case of asymmetric connections and for multi-spin interactions. For each link the linear Granger causality is two times the corresponding transfer entropy (i.e. the information flow on that link) in the weak coupling limit. For sparse connections and a low number of samples, the L1 regularized least squares method is used to detect the interacting pairs of spins. Nonlinear Granger causality is related to multispin interactions.

q-bio.NC↗

arXiv2009

Granger causality for circular variables

In this letter we discuss use of Granger causality to the analyze systems of coupled circular variables, by modifying a recently proposed method for multivariate analysis of causality. We show the application of the proposed approach on several Kuramoto systems, in particular one living on networks built by preferential attachment and a model for the transition from deeply to lightly anaesthetized states. Granger causalities describe the flow of information among variables.

cond-mat.dis-nn↗

arXiv2008

Kernel Granger causality and the analysis of dynamical networks

We propose a method of analysis of dynamical networks based on a recent measure of Granger causality between time series, based on kernel methods. The generalization of kernel Granger causality to the multivariate case, here presented, shares the following features with the bivariate measures: (i) the nonlinearity of the regression model can be controlled by choosing the kernel function and (ii) the problem of false-causalities, arising as the complexity of the model increases, is addressed by a selection strategy of the eigenvectors of a reduced Gram matrix whose range represents the additional features due to the second time series. Moreover, there is no {\it a priori} assumption that the network must be a directed acyclic graph. We apply the proposed approach to a network of chaotic maps and to a simulated genetic regulatory network: it is shown that the underlying topology of the network can be reconstructed from time series of node's dynamics, provided that a sufficient number of samples is available. Considering a linear dynamical network, built by preferential attachment scheme, we show that for limited data use of bivariate Granger causality is a better choice w.r.t methods using $L1$ minimization. Finally we consider real expression data from HeLa cells, 94 genes and 48 time points. The analysis of static correlations between genes reveals two modules corresponding to well known transcription factors; Granger analysis puts in evidence nineteen causal relationships, all involving genes related to tumor development.

cond-mat.dis-nn↗

arXiv2008

Kernel method for nonlinear Granger causality

Important information on the structure of complex systems, consisting of more than one component, can be obtained by measuring to which extent the individual components exchange information among each other. Such knowledge is needed to reach a deeper comprehension of phenomena ranging from turbulent fluids to neural networks, as well as complex physiological signals. The linear Granger approach, to detect cause-effect relationships between time series, has emerged in recent years as a leading statistical technique to accomplish this task. Here we generalize Granger causality to the nonlinear case using the theory of reproducing kernel Hilbert spaces. Our method performs linear Granger causality in the feature space of suitable kernel functions, assuming arbitrary degree of nonlinearity. We develop a new strategy to cope with the problem of overfitting, based on the geometry of reproducing kernel Hilbert spaces. Applications to coupled chaotic maps and physiological data sets are presented.

cond-mat.dis-nn↗

arXiv2007

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.

cond-mat.dis-nn↗

arXiv2006

Semi-supervised learning by search of optimal target vector

We introduce a semi-supervised learning estimator which tends to the first kernel principal component as the number of labelled points vanishes. Our approach is based on the notion of optimal target vector, which is defined as follows. Given an input data-set of ${\bf x}$ values, the optimal target vector $\mathbf{y}$ is such that treating it as the target and using kernel ridge regression to model the dependency of $y$ on ${\bf x}$, the training error achieves its minimum value. For an unlabeled data set, the first kernel principal component is the optimal vector. In the case one is given a partially labeled data set, still one may look for the optimal target vector minimizing the training error. We use this new estimator in two directions. As a substitute of kernel principal component analysis, in the case one has some labeled data, to produce dimensionality reduction. Second, to develop a semi-supervised regression and classification algorithm for transductive inference. We show application of the proposed method in both directions.

cond-mat.dis-nn↗

arXiv2006

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.

cond-mat.dis-nn↗

arXiv2006

Nonlinear parametric model for Granger causality of time series

We generalize a previously proposed approach for nonlinear Granger causality of time series, based on radial basis function. The proposed model is not constrained to be additive in variables from the two time series and can approximate any function of these variables, still being suitable to evaluate causality. Usefulness of this measure of causality is shown in a physiological example and in the study of the feed-back loop in a model of excitatory and inhibitory neurons.

cond-mat.dis-nn↗

arXiv2005

Kernel method for clustering based on optimal target vector

We introduce the notion of optimal target vector, and describe how it creates a link between supervised and unsupervised learning. We exploit this notion to construct Ising models, for dichotomic clustering, whose couplings are (i) both ferro- and anti-ferromagnetic (ii) depending on the whole data-set and not only on pairs of samples. The effectiveness of the method is shown in the case of the well known iris data-set and in benchmarks of gene expression levels.

cond-mat.dis-nn↗