A comparison of the cluster-span threshold and the union of shortest paths as objective thresholds of EEG functional connectivity networks from Beta activity in Alzheimer's disease

The Cluster-Span Threshold (CST) is a recently introduced unbiased threshold for functional connectivity networks. This binarisation technique offers a natural trade-off of sparsity and density of information by balancing the ratio of closed to open triples in the network topology. Here we present findings comparing it with the Union of Shortest Paths (USP), another recently proposed objective method. We analyse standard network metrics of binarised networks for sensitivity to clinical Alzheimer's disease in the Beta band of Electroencephalogram activity. We find that the CST outperforms the USP, as well as subjective thresholds based on fixing the network density, as a sensitive threshold for distinguishing differences in the functional connectivity between Alzheimer's disease patients and control. This study provides the first evidence of the usefulness of the CST for clinical research purposes.

[1]  P. Tewarie,et al.  The Union of Shortest Path Trees of Functional Brain Networks , 2015, Brain Connect..

[2]  Mario A. Parra,et al.  Cluster-span threshold: An unbiased threshold for binarising weighted complete networks in functional connectivity analysis , 2015, 2015 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC).

[3]  C. Stam,et al.  Opportunities and methodological challenges in EEG and MEG resting state functional brain network research , 2015, Clinical Neurophysiology.

[4]  Edwin van Dellen,et al.  The minimum spanning tree: An unbiased method for brain network analysis , 2015, NeuroImage.

[5]  C. Stam Modern network science of neurological disorders , 2014, Nature Reviews Neuroscience.

[6]  Jonas Richiardi,et al.  Graph analysis of functional brain networks: practical issues in translational neuroscience , 2014, Philosophical Transactions of the Royal Society B: Biological Sciences.

[7]  Javier M. Buldú,et al.  Functional brain networks: great expectations, hard times and the big leap forward , 2014, Philosophical Transactions of the Royal Society B: Biological Sciences.

[8]  C J Stam,et al.  The trees and the forest: Characterization of complex brain networks with minimum spanning trees. , 2014, International journal of psychophysiology : official journal of the International Organization of Psychophysiology.

[9]  C. Stam,et al.  Alzheimer's disease: connecting findings from graph theoretical studies of brain networks , 2013, Neurobiology of Aging.

[10]  Vince D. Calhoun,et al.  EEGIFT: Group Independent Component Analysis for Event-Related EEG Data , 2011, Comput. Intell. Neurosci..

[11]  R. Oostenveld,et al.  An improved index of phase-synchronization for electrophysiological data in the presence of volume-conduction, noise and sample-size bias , 2011, NeuroImage.

[12]  Robert Oostenveld,et al.  FieldTrip: Open Source Software for Advanced Analysis of MEG, EEG, and Invasive Electrophysiological Data , 2010, Comput. Intell. Neurosci..

[13]  Olaf Sporns,et al.  Complex network measures of brain connectivity: Uses and interpretations , 2010, NeuroImage.

[14]  O. Sporns,et al.  Complex brain networks: graph theoretical analysis of structural and functional systems , 2009, Nature Reviews Neuroscience.

[15]  E. Todeva Networks , 2007 .

[16]  J. Escudero,et al.  Analysis of electroencephalograms in Alzheimer's disease patients with multiscale entropy , 2006, Physiological measurement.

[17]  C. Stam,et al.  Small-world networks and functional connectivity in Alzheimer's disease. , 2006, Cerebral cortex.

[18]  G. Cecchi,et al.  Scale-free brain functional networks. , 2003, Physical review letters.

[19]  S. Folstein,et al.  “Mini-mental state”: A practical method for grading the cognitive state of patients for the clinician , 1975 .

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[21]  T. Snijders The degree variance: An index of graph heterogeneity , 1981 .