The complex hierarchical topology of EEG functional connectivity

Smith, Keith and Escudero, Javier (2017) The complex hierarchical topology of EEG functional connectivity. Journal of Neuroscience Methods, 276. pp. 1-12. ISSN 0165-0270 (https://doi.org/10.1016/j.jneumeth.2016.11.003)

[thumbnail of Smith-Escudero-JNM-2017-The-complex-hierarchical-topology-of-EEG-functional-connectivity]
Preview
 Text. Filename: Smith-Escudero-JNM-2017-The-complex-hierarchical-topology-of-EEG-functional-connectivity.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (2MB)| Preview

Abstract

Background Understanding the complex hierarchical topology of functional brain networks is a key aspect of functional connectivity research. Such topics are obscured by the widespread use of sparse binary network models which are fundamentally different to the complete weighted networks derived from functional connectivity. New methods We introduce two techniques to probe the hierarchical complexity of topologies. Firstly, a new metric to measure hierarchical complexity; secondly, a Weighted Complex Hierarchy (WCH) model. To thoroughly evaluate our techniques, we generalise sparse binary network archetypes to weighted forms and explore the main topological features of brain networks – integration, regularity and modularity – using curves over density. Results By controlling the parameters of our model, the highest complexity is found to arise between a random topology and a strict ‘class-based’ topology. Further, the model has equivalent complexity to EEG phase-lag networks at peak performance. Comparison to existing methods Hierarchical complexity attains greater magnitude and range of differences between different networks than the previous commonly used complexity metric and our WCH model offers a much broader range of network topology than the standard scale-free and small-world models at a full range of densities. Conclusions Our metric and model provide a rigorous characterisation of hierarchical complexity. Importantly, our framework shows a scale of complexity arising between ‘all nodes are equal’ topologies at one extreme and ‘strict class-based’ topologies at the other.

ORCID iDs

Smith, Keith ORCID logoORCID: https://orcid.org/0000-0002-4615-9020 and Escudero, Javier;
CORE (COnnecting REpositories)