arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2008.01038stat.ME
收藏

具有未知连接函数的潜在距离图的双样本检验

Two-sample Testing on Latent Distance Graphs With Unknown Link Functions

Yiran Wang, Minh Tang, Soumendra Nath Lahiri

摘要:

我们提出了一个有效的和一致的测试的假设,两个潜在的距离随机图在同一顶点集上有相同的生成潜在的位置,一些不可识别的相似性变换。我们的检验统计量是基于第一次估计的边缘概率矩阵截断的奇异值分解的平均邻接矩阵在每个人口,然后计算斯皮尔曼秩之间的相关系数这些估计。模拟数据的实验结果表明,即使每个总体只有一个样本,只要顶点的数量不是太少,测试程序也有功效。在神经连接图数据集上的应用表明,我们可以区分来自不同年龄组的扫描,而在致癫痫记录数据集上的应用表明,我们可以区分癫痫发作和非癫痫发作事件。

英文摘要:

We propose a valid and consistent test for the hypothesis that two latent distance random graphs on the same vertex set have the same generating latent positions, up to some unidentifiable similarity transformations. Our test statistic is based on first estimating the edge probabilities matrices by truncating the singular value decompositions of the averaged adjacency matrices in each population and then computing a Spearman rank correlation coefficient between these estimates. Experimental results on simulated data indicate that the test procedure has power even when there is only one sample from each population, provided that the number of vertices is not too small. Application on a dataset of neural connectome graphs showed that we can distinguish between scans from different age groups while application on a dataset of epileptogenic recordings showed that we can discriminate between seizure and non-seizure events.

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

↑