English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Preprint

Connectome smoothing via low-rank approximations

MPS-Authors
/persons/resource/persons19840

Margulies,  Daniel S.
Max Planck Research Group Neuroanatomy and Connectivity, MPI for Human Cognitive and Brain Sciences, Max Planck Society;
Child Mind Institute, New York, NY;

External Resource
No external resources are shared
Fulltext (public)

Tang_2018.pdf
(Preprint), 3MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Tang, R., Ketcha, M., Badea, A., Calabrese, E. D., Margulies, D. S., Vogelstein, J. T., et al. (2018). Connectome smoothing via low-rank approximations. arXiv.


Cite as: http://hdl.handle.net/21.11116/0000-0002-B429-5
Abstract
In statistical connectomics, the quantitative study of brain networks, estimating the mean of a population of graphs based on a sample is a core problem. Often, this problem is especially difficult because the sample or cohort size is relatively small, sometimes even a single subject. While using the element-wise sample mean of the adjacency matrices is a common approach, this method does not exploit any underlying structural properties of the graphs. We propose using a low-rank method which incorporates tools for dimension selection and diagonal augmentation to smooth the estimates and improve performance over the naive methodology for small sample sizes. Theoretical results for the stochastic blockmodel show that this method offers major improvements when there are many vertices. Similarly, we demonstrate that the low-rank methods outperform the standard sample mean for a variety of independent edge distributions as well as human connectome data derived from magnetic resonance imaging, especially when sample sizes are small. Moreover, the low-rank methods yield "eigen-connectomes", which correlate with the lobe-structure of the human brain and superstructures of the mouse brain. These results indicate that low-rank methods are an important part of the tool box for researchers studying populations of graphs in general, and statistical connectomics in particular.