Cargando…

Clustering Coefficients for Correlation Networks

Graph theory is a useful tool for deciphering structural and functional networks of the brain on various spatial and temporal scales. 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 ap...

Descripción completa

Detalles Bibliográficos
Autores principales: Masuda, Naoki, Sakaki, Michiko, Ezaki, Takahiro, Watanabe, Takamitsu
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Frontiers Media S.A. 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5863042/
https://www.ncbi.nlm.nih.gov/pubmed/29599714
http://dx.doi.org/10.3389/fninf.2018.00007
_version_ 1783308338272927744
author Masuda, Naoki
Sakaki, Michiko
Ezaki, Takahiro
Watanabe, Takamitsu
author_facet Masuda, Naoki
Sakaki, Michiko
Ezaki, Takahiro
Watanabe, Takamitsu
author_sort Masuda, Naoki
collection PubMed
description Graph theory is a useful tool for deciphering structural and functional networks of the brain on various spatial and temporal scales. 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 neighboring 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 (i.e., abundance of triangles around a focal node) are useful in characterizing individual nodes. In contrast, the conventional local clustering coefficients were strongly correlated with and therefore may be confounded by the node's connectivity. The proposed methods are expected to help us to understand clustering and lack thereof in correlational brain networks, such as those derived from functional time series and across-participant correlation in neuroanatomical properties.
format Online
Article
Text
id pubmed-5863042
institution National Center for Biotechnology Information
language English
publishDate 2018
publisher Frontiers Media S.A.
record_format MEDLINE/PubMed
spelling pubmed-58630422018-03-29 Clustering Coefficients for Correlation Networks Masuda, Naoki Sakaki, Michiko Ezaki, Takahiro Watanabe, Takamitsu Front Neuroinform Neuroscience Graph theory is a useful tool for deciphering structural and functional networks of the brain on various spatial and temporal scales. 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 neighboring 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 (i.e., abundance of triangles around a focal node) are useful in characterizing individual nodes. In contrast, the conventional local clustering coefficients were strongly correlated with and therefore may be confounded by the node's connectivity. The proposed methods are expected to help us to understand clustering and lack thereof in correlational brain networks, such as those derived from functional time series and across-participant correlation in neuroanatomical properties. Frontiers Media S.A. 2018-03-15 /pmc/articles/PMC5863042/ /pubmed/29599714 http://dx.doi.org/10.3389/fninf.2018.00007 Text en Copyright © 2018 Masuda, Sakaki, Ezaki and Watanabe. http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
spellingShingle Neuroscience
Masuda, Naoki
Sakaki, Michiko
Ezaki, Takahiro
Watanabe, Takamitsu
Clustering Coefficients for Correlation Networks
title Clustering Coefficients for Correlation Networks
title_full Clustering Coefficients for Correlation Networks
title_fullStr Clustering Coefficients for Correlation Networks
title_full_unstemmed Clustering Coefficients for Correlation Networks
title_short Clustering Coefficients for Correlation Networks
title_sort clustering coefficients for correlation networks
topic Neuroscience
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5863042/
https://www.ncbi.nlm.nih.gov/pubmed/29599714
http://dx.doi.org/10.3389/fninf.2018.00007
work_keys_str_mv AT masudanaoki clusteringcoefficientsforcorrelationnetworks
AT sakakimichiko clusteringcoefficientsforcorrelationnetworks
AT ezakitakahiro clusteringcoefficientsforcorrelationnetworks
AT watanabetakamitsu clusteringcoefficientsforcorrelationnetworks