SearcharxivSearch

arXiv subjects

Takamitsu Watanabe

Publications and source records attributed to Takamitsu Watanabe.

8 recordsLinked to original sources

Energy landscape analysis based on the Ising model: Tutorial review

We review a class of energy landscape analysis method that uses the Ising model and takes multivariate time series data as input. The method allows one to capture dynamics of the data as trajectories of a ball from one basin to a different basin to yet another, constrained on the energy landscape specified by the estimated Ising model. While this energy landscape analysis has mostly been applied to functional magnetic resonance imaging (fMRI) data from the brain for historical reasons, there are emerging applications outside fMRI data and neuroscience. To inform such applications in various research fields, this review paper provides a detailed tutorial on each step of the analysis, terminologies, concepts underlying the method, and validation, as well as recent developments of extended and related methods.

cond-mat.dis-nn

Reliability of energy landscape analysis of resting-state functional MRI data

Energy landscape analysis is a data-driven method to analyze multidimensional time series, including functional magnetic resonance imaging (fMRI) data. It has been shown to be a useful characterization of fMRI data in health and disease. It fits an Ising model to the data and captures the dynamics of the data as movement of a noisy ball constrained on the energy landscape derived from the estimated Ising model. In the present study, we examine test-retest reliability of the energy landscape analysis. To this end, we construct a permutation test that assesses whether or not indices characterizing the energy landscape are more consistent across different sets of scanning sessions from the same participant (i.e., within-participant reliability) than across different sets of sessions from different participants (i.e., between-participant reliability). We show that the energy landscape analysis has significantly higher within-participant than between-participant test-retest reliability with respect to four commonly used indices. We also show that a variational Bayesian method, which enables us to estimate energy landscapes tailored to each participant, displays comparable test-retest reliability to that using the conventional likelihood maximization method. The proposed methodology paves the way to perform individual-level energy landscape analysis for given data sets with a statistically controlled reliability.

q-bio.NC

State-transition dynamics of resting-state functional magnetic resonance imaging data: Model comparison and test-to-retest analysis

Electroencephalogram (EEG) microstate analysis entails finding dynamics of quasi-stable and generally recurrent discrete states in multichannel EEG time series data and relating properties of the estimated state-transition dynamics to observables such as cognition and behavior. While microstate analysis has been widely employed to analyze EEG data, its use remains less prevalent in functional magnetic resonance imaging (fMRI) data, largely due to the slower timescale of such data. In the present study, we extend various data clustering methods used in EEG microstate analysis to resting-state fMRI data from healthy humans to extract their state-transition dynamics. We show that the quality of clustering is on par with that for various microstate analyses of EEG data. We then develop a method for examining test-retest reliability of the discrete-state transition dynamics between fMRI sessions and show that the within-participant test-retest reliability is higher than between-participant test-retest reliability for different indices of state-transition dynamics, different networks, and different data sets. This result suggests that state-transition dynamics analysis of fMRI data could discriminate between different individuals and is a promising tool for performing fingerprinting analysis of individuals.

q-bio.NC

Modeling state-transition dynamics in resting-state brain signals by the hidden Markov and Gaussian mixture models

Recent studies have proposed that one can summarize brain activity into dynamics among a relatively small number of hidden states and that such an approach is a promising tool for revealing brain function. Hidden Markov models (HMMs) are a prevalent approach to inferring such neural dynamics among discrete brain states. However, the impact of assuming Markovian structure in neural time series data has not been sufficiently examined. Here, to address this situation and examine the performance of the HMM, we compare the model with the Gaussian mixture model (GMM), which is with no temporal regularization and thus a statistically simpler model than the HMM, by applying both models to synthetic time series generated from empirical resting-state functional magnetic resonance imaging (fMRI) data. We compared the GMM and HMM for various sampling frequencies, lengths of recording per participant, numbers of participants, and numbers of independent component signals. We find that the HMM attains a better accuracy of estimating the hidden state than the GMM in a majority of cases. However, we also find that the accuracy of the GMM is comparable to that of the HMM under the condition that the sampling frequency is reasonably low (e.g., TR = 2.88 or 3.60 s) or the data is relatively short. These results suggest that the GMM can be a viable alternative to the HMM for investigating hidden-state dynamics under this condition.

q-bio.NC

Clustering coefficients for correlation networks

The clustering coefficient quantifies the abundance of connected triangles in a network and is a major descriptive statistics of networks. For example, it finds an application in the assessment of small-worldness of brain networks, which is affected by attentional and cognitive conditions, age, psychiatric disorders and so forth. However, it remains unclear how the clustering coefficient should be measured in a correlation-based network, which is among major representations of brain networks. In the present article, we propose clustering coefficients tailored to correlation matrices. The key idea is to use three-way partial correlation or partial mutual information to measure the strength of the association between the two neighbouring nodes of a focal node relative to the amount of pseudo-correlation expected from indirect paths between the nodes. Our method avoids the difficulties of previous applications of clustering coefficient (and other) measures in defining correlational networks, i.e., thresholding on the correlation value, discarding of negative correlation values, the pseudo-correlation problem and full partial correlation matrices whose estimation is computationally difficult. For proof of concept, we apply the proposed clustering coefficient measures to functional magnetic resonance imaging data obtained from healthy participants of various ages and compare them with conventional clustering coefficients. We show that the clustering coefficients decline with the age. The proposed clustering coefficients are more strongly correlated with age than the conventional ones are. We also show that the local variants of the proposed clustering coefficients are useful in characterising individual nodes. In contrast, the conventional local clustering coefficients were strongly correlated with and therefore may be confounded by the node's connectivity.

physics.soc-ph

Energy landscape analysis of neuroimaging data

Computational neuroscience models have been used for understanding neural dynamics in the brain and how they may be altered when physiological or other conditions change. We review and develop a data-driven approach to neuroimaging data called the energy landscape analysis. The methods are rooted in statistical physics theory, in particular the Ising model, also known as the (pairwise) maximum entropy model and Boltzmann machine. The methods have been applied to fitting electrophysiological data in neuroscience for a decade, but their use in neuroimaging data is still in its infancy. We first review the methods and discuss some algorithms and technical aspects. Then, we apply the methods to functional magnetic resonance imaging data recorded from healthy individuals to inspect the relationship between the accuracy of fitting, the size of the brain system to be analyzed, and the data length.

q-bio.NC

Rich-club network topology to minimize synchronization cost due to phase difference among frequency-synchronized oscillators

Functions of some networks, such as power grids and large-scale brain networks, rely on not only frequency synchronization, but also phase synchronization. Nevertheless, even after the oscillators reach to frequency-synchronized status, phase difference among oscillators often shows non-zero constant values. Such phase difference potentially results in inefficient transfer of power or information among oscillators, and avoid proper and efficient functioning of the network. In the present study, we newly define synchronization cost by the phase difference among the frequency-synchronized oscillators, and investigate the optimal network structure with the minimum synchronization cost through rewiring-based optimization. By using the Kuramoto model, we demonstrate that the cost is minimized in a network topology with rich-club organization, which comprises the densely-connected center nodes and peripheral nodes connecting with the center module. We also show that the network topology is characterized by its bimodal degree distribution, which is quantified by Wolfson's polarization index. Furthermore, we provide analytical interpretation on why the rich-club network topology is related to the small amount of synchronization cost.

nlin.CD

Enhancing the spectral gap of networks by node removal

Dynamics on networks are often characterized by the second smallest eigenvalue of the Laplacian matrix of the network, which is called the spectral gap. Examples include the threshold coupling strength for synchronization and the relaxation time of a random walk. A large spectral gap is usually associated with high network performance, such as facilitated synchronization and rapid convergence. In this study, we seek to enhance the spectral gap of undirected and unweighted networks by removing nodes because, practically, the removal of nodes often costs less than the addition of nodes, addition of links, and rewiring of links. In particular, we develop a perturbative method to achieve this goal. The proposed method realizes better performance than other heuristic methods on various model and real networks. The spectral gap increases as we remove up to half the nodes in most of these networks.

cond-mat.dis-nn