2023
DOI: 10.1214/22-aoas1633
|View full text |Cite
|
Sign up to set email alerts
|

Topological learning for brain networks

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
13
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 8 publications
(13 citation statements)
references
References 117 publications
0
13
0
Order By: Relevance
“…Ignoring −∞, W d is the 1D persistent digram. We can show that the birth set is the MST ( Fig 3 ) [ 62 ].…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Ignoring −∞, W d is the 1D persistent digram. We can show that the birth set is the MST ( Fig 3 ) [ 62 ].…”
Section: Methodsmentioning
confidence: 99%
“…The identification of W b is based on the modification to Kruskal’s or Prim’s algorithm that identifies the MST [ 6 , 62 ]. Then W d is identified as .…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…During the filtration, a topological latent space is created, spanning from the minimum to maximum weights of the weighted adjacency matrix. Various metrics have been proposed to quantify the differences in structural and functional connectivity between different brain states or conditions within this latent space ( Sizemore et al, 2018 , 2019 ; Songdechakraiwut and Chung, 2023 ).…”
Section: Methodsmentioning
confidence: 99%
“…Both utilize Euclidean distance as edge weights and have monotone -curve. However, only the graph filtration has a monotone -curve making it more suitable for scalable Wasserstein distance computations ( Chung et al, 2019b ; Songdechakraiwut and Chung, 2023 ).…”
Section: Methodsmentioning
confidence: 99%