arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.07265math.STcs.LGeess.SPstat.MEstat.MLstat.TH
收藏

边分布未知的多网络共享结构恢复

Recovering shared structure from multiple networks with unknown edge distributions

University of Wisconsin-Madison(威斯康星大学麦迪逊分校);University of Michigan(密歇根大学)

Keith Levin, Asad Lodhia, Elizaveta Levina

摘要:

在越来越多的环境中,数据集由来自网络群体的多个样本组成,顶点在这些网络中对齐。例如,神经科学中的大脑连接网络由已经与共同模板对齐的大脑区域之间的相互作用的测量组成。我们考虑这样一种设置,即观察到的网络具有共同的期望,但它们边缘的噪声结构可能不同。我们的方法利用共享的平均结构去噪观测网络的边缘水平的测量和估计底层的人口水平的参数。我们还探讨了边缘级错误影响估计和下游推理的程度。本文建立了一个有限样本集中不等式,研究了随机加权邻接矩阵的低秩特征值截断问题。所提出的方法是说明合成网络和数据从fMRI研究精神分裂症。

英文摘要:

In increasingly many settings, data sets consist of multiple samples from a population of networks, with vertices aligned across these networks. For example, brain connectivity networks in neuroscience consist of measures of interaction between brain regions that have been aligned to a common template. We consider the setting where the observed networks have a shared expectation, but may differ in the noise structure on their edges. Our approach exploits the shared mean structure to denoise edge-level measurements of the observed networks and estimate the underlying population-level parameters. We also explore the extent to which edge-level errors influence estimation and downstream inference. We establish a finite-sample concentration inequality for the low-rank eigenvalue truncation of a random weighted adjacency matrix that may be of independent interest. The proposed approach is illustrated on synthetic networks and on data from an fMRI study of schizophrenia.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑