2018
DOI: 10.1002/hbm.24235
|View full text |Cite
|
Sign up to set email alerts
|

Static and dynamic connectomics differentiate between depressed patients with and without suicidal ideation

Abstract: Neural circuit dysfunction underlies the biological mechanisms of suicidal ideation (SI). However, little is known about how the brain's "dynome" differentiate between depressed patients with and without SI. This study included depressed patients (n = 48) with SI, without SI (NSI), and healthy controls (HC, n = 30). All participants underwent resting-state functional magnetic resonance imaging. We constructed dynamic and static connectomics on 200 nodes using a sliding window and full-length time-series correl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
84
1
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
6

Relationship

4
2

Authors

Journals

citations
Cited by 113 publications
(87 citation statements)
references
References 62 publications
1
84
1
1
Order By: Relevance
“…We decreased the r thr from 1 to 0 (from maximum to minimum) till the existing number of edges satisfies a sparsity threshold. Specifically, 0sparsity1=εrthrN()N1/2 where εrthr expresses the existing number of edges generated by thresholding at r thr , and N ( N − 1)/2 represents the maximum possible number of edges existing in a given network of N nodes (Bullmore & Bassett, ; Liao et al, ). In this case, when r thr = 0, sparsity = 1; when r thr = 1, sparsity = 0.…”
Section: Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…We decreased the r thr from 1 to 0 (from maximum to minimum) till the existing number of edges satisfies a sparsity threshold. Specifically, 0sparsity1=εrthrN()N1/2 where εrthr expresses the existing number of edges generated by thresholding at r thr , and N ( N − 1)/2 represents the maximum possible number of edges existing in a given network of N nodes (Bullmore & Bassett, ; Liao et al, ). In this case, when r thr = 0, sparsity = 1; when r thr = 1, sparsity = 0.…”
Section: Methodsmentioning
confidence: 99%
“…The minimum sparsity was defined across all subjects as follows: (a) the mean degree of a node (the number of connections to the node) over all nodes in thresholded weighted matrices was greater than 2 × log( N ) ≈ 9.7 (Achard & Bullmore, ; Ji et al, ; Liao et al, , ); where N expresses the number of nodes, N = 128. In this case, total number of edges ≈882, which was equivalent to sparsity = 0.11 or 11% of the maximum number of edges possible (C1282=8128) in a network of 128 nodes.…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations