Recent advances in tractography enable the generation of weighted structural connectomes where connection strengths are biologically meaningful. However, use of probabilistic tracking algorithms leads to dense graphs with many low-strength connections, many of which may be considered erroneous. Historically, the existence of such false positives necessitated thresholding of weak connections; this was especially relevant when constructing binary connectomes. Here we show that in dense weighted structural connectomes, the contribution of weak connections to network metrics is negligible and, thus, their removal is not necessary; indeed, the confounds introduced by an arbitrary cut-off value may in fact render this process undesirable.
This abstract and the presentation materials are available to members only; a login is required.