2017
DOI: 10.1007/978-3-319-67159-8_19
|View full text |Cite
|
Sign up to set email alerts
|

Topological Distances Between Brain Networks

Abstract: Many existing brain network distances are based on matrix norms. The element-wise differences may fail to capture underlying topological differences. Further, matrix norms are sensitive to outliers. A few extreme edge weights may severely affect the distance. Thus it is necessary to develop network distances that recognize topology. In this paper, we introduce Gromov-Hausdorff (GH) and Kolmogorov-Smirnov (KS) distances. GH-distance is often used in persistent homology based brain network models. The superior p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
30
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1
1

Relationship

5
3

Authors

Journals

citations
Cited by 39 publications
(30 citation statements)
references
References 184 publications
(351 reference statements)
0
30
0
Order By: Relevance
“…Although we did not provide a comparison against baseline approaches, KS-distance was compared against other topological distances and matrix norms before [14]. Schematic of how Betti numbers change over graph filtration.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Although we did not provide a comparison against baseline approaches, KS-distance was compared against other topological distances and matrix norms before [14]. Schematic of how Betti numbers change over graph filtration.…”
Section: Discussionmentioning
confidence: 99%
“…Given network = (V, w) with node set V and edge weight w = (w ij ) between nodes i and j, define binary network ϵ = V, w ϵ , where any edge weight of w less than or equal to ϵ is made into zero while edge weight larger than ϵ is made into one. Then we have graph filtration [5,14] ϵ 0…”
Section: Monotonicity Of Number Of Cyclesmentioning
confidence: 99%
“…Naturally, we are interested in using correlations or their simple functions such asρij=boldxiboldxj1emor1emρij=1boldxiboldxjas edge weights. Among possible functions of correlations,wij=false(1ρijfalse)1/2satisfies triangle inequality w ij ≤ w ik + w kj and other metric properties (Chung, Lee, Solo, Davidson, & Pollak, 2017a). Having metric distances facilitates more mathematically coherent interpretation of brain networks and offers many nice mathematical properties.…”
Section: Correlation Brain Networkmentioning
confidence: 99%
“…The above simulation produces modular structures in the network (Chung et al, 2017a). Let Y 1 be the 20 × 5 data matrix…”
Section: Validationmentioning
confidence: 99%