A percolation-based thresholding method with applications in functional connectivity analysis

Farnaz Zamani Esfahlani, Hiroki Sayama

Research output: Contribution to journalConference article

Abstract

Despite the recent advances in developing more effective thresholding methods to convert weighted networks to unweighted counterparts, there are still several limitations that need to be addressed. One such limitation is the inability of the most existing thresholding methods to take into account the topological properties of the original weighted networks during the binarization process, which could ultimately result in unweighted networks that have drastically different topological properties than the original weighted networks. In this study, we propose a new thresholding method based on the percolation theory to address this limitation. The performance of the proposed method was validated and compared to the existing thresholding methods using simulated and real-world functional connectivity networks in the brain. Comparison of macroscopic and microscopic properties of the resulted unweighted networks to the original weighted networks suggests that the proposed thresholding method can successfully maintain the topological properties of the original weighted networks.

Original languageEnglish
Pages (from-to)221-231
Number of pages11
JournalSpringer Proceedings in Complexity
Issue number219279
DOIs
Publication statusPublished - 2018 Jan 1
Externally publishedYes
Event9th International Conference on Complex Networks, CompleNet 2018 - Boston, United States
Duration: 2018 Mar 52018 Mar 8

Fingerprint

Functional analysis
Thresholding
Weighted Networks
Brain
Connectivity
Topological Properties
Binarization
Percolation Theory
Network Connectivity
Convert

ASJC Scopus subject areas

  • Applied Mathematics
  • Modelling and Simulation
  • Computer Science Applications

Cite this

A percolation-based thresholding method with applications in functional connectivity analysis. / Esfahlani, Farnaz Zamani; Sayama, Hiroki.

In: Springer Proceedings in Complexity, No. 219279, 01.01.2018, p. 221-231.

Research output: Contribution to journalConference article

@article{8f150f41cfe342078d8d2b2bb0272557,
title = "A percolation-based thresholding method with applications in functional connectivity analysis",
abstract = "Despite the recent advances in developing more effective thresholding methods to convert weighted networks to unweighted counterparts, there are still several limitations that need to be addressed. One such limitation is the inability of the most existing thresholding methods to take into account the topological properties of the original weighted networks during the binarization process, which could ultimately result in unweighted networks that have drastically different topological properties than the original weighted networks. In this study, we propose a new thresholding method based on the percolation theory to address this limitation. The performance of the proposed method was validated and compared to the existing thresholding methods using simulated and real-world functional connectivity networks in the brain. Comparison of macroscopic and microscopic properties of the resulted unweighted networks to the original weighted networks suggests that the proposed thresholding method can successfully maintain the topological properties of the original weighted networks.",
author = "Esfahlani, {Farnaz Zamani} and Hiroki Sayama",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-73198-8_19",
language = "English",
pages = "221--231",
journal = "Springer Proceedings in Complexity",
issn = "2213-8684",
number = "219279",

}

TY - JOUR

T1 - A percolation-based thresholding method with applications in functional connectivity analysis

AU - Esfahlani, Farnaz Zamani

AU - Sayama, Hiroki

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Despite the recent advances in developing more effective thresholding methods to convert weighted networks to unweighted counterparts, there are still several limitations that need to be addressed. One such limitation is the inability of the most existing thresholding methods to take into account the topological properties of the original weighted networks during the binarization process, which could ultimately result in unweighted networks that have drastically different topological properties than the original weighted networks. In this study, we propose a new thresholding method based on the percolation theory to address this limitation. The performance of the proposed method was validated and compared to the existing thresholding methods using simulated and real-world functional connectivity networks in the brain. Comparison of macroscopic and microscopic properties of the resulted unweighted networks to the original weighted networks suggests that the proposed thresholding method can successfully maintain the topological properties of the original weighted networks.

AB - Despite the recent advances in developing more effective thresholding methods to convert weighted networks to unweighted counterparts, there are still several limitations that need to be addressed. One such limitation is the inability of the most existing thresholding methods to take into account the topological properties of the original weighted networks during the binarization process, which could ultimately result in unweighted networks that have drastically different topological properties than the original weighted networks. In this study, we propose a new thresholding method based on the percolation theory to address this limitation. The performance of the proposed method was validated and compared to the existing thresholding methods using simulated and real-world functional connectivity networks in the brain. Comparison of macroscopic and microscopic properties of the resulted unweighted networks to the original weighted networks suggests that the proposed thresholding method can successfully maintain the topological properties of the original weighted networks.

UR - http://www.scopus.com/inward/record.url?scp=85054712622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054712622&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-73198-8_19

DO - 10.1007/978-3-319-73198-8_19

M3 - Conference article

SP - 221

EP - 231

JO - Springer Proceedings in Complexity

JF - Springer Proceedings in Complexity

SN - 2213-8684

IS - 219279

ER -