pith. sign in

arxiv: 1810.03279 · v1 · pith:VOEUQIXNnew · submitted 2018-10-08 · 📊 stat.AP

Modeling Brain Connectivity with Graphical Models on Frequency Domain

classification 📊 stat.AP
keywords connectivitygraphicalalgorithmsbrainlassosparsedomainestimation
0
0 comments X
read the original abstract

Multichannel electroencephalograms (EEGs) have been widely used to study cortical connectivity during acquisition of motor skills. In this paper, we introduce copula Gaussian graphical models on spectral domain to characterize dependence in oscillatory activity between channels. To obtain a simple and robust representation of brain connectivity that can explain the most variation in the observed signals, we propose a framework based on maximizing penalized likelihood with Lasso regularization to search for the sparse precision matrix. To address the optimization problem, graphical Lasso, Ledoit-Wolf and sparse estimation of a covariance matrix (SPCOV) algorithms were modified and implemented. Simulations show the benefit of using the proposed algorithms in terms of robustness and small estimation errors. Furthermore, analysis of the EEG data in a motor skill task conducted using algorithms of modified graphical LASSO and Ledoit-Wolf, reveal a sparse pattern of brain connectivity among cortices which is consistent with the results from other work in the literature.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spectral approximation for the separable covariance mixture model

    math.ST 2026-04 unverdicted novelty 6.0

    Resolvents of the sample covariances in the separable mixture model approximate deterministic matrices defined via solutions to a dual system of equations, without simultaneous diagonalizability assumptions.