arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.01175math.STstat.TH
收藏

加权随机区组模型中群落估计的最优速率

Optimal Rates for Community Estimation in the Weighted Stochastic Block Model

Min Xu, Varun Jog, Po-Ling Loh

摘要:

网络中的社区识别是社会科学、神经科学和遗传学等领域的一个重要问题。在过去的十年中,随机块模型(SBM)已经成为一个流行的统计框架,这个问题。然而,SBM有一个重要的局限性,即它们只适用于具有未加权边缘的网络;在各种科学应用中,忽略边缘权重可能会导致有价值的信息丢失。我们研究了一个加权的推广的SBM,在其中的意见收集的形式加权邻接矩阵和每个边缘的权重是独立的从一个未知的概率密度确定的社区成员的端点。我们的特点是加权SBM的误聚类错误的最佳率在1/2之间的权重分布的社区内和社区之间的边缘,基本上概括了现有的结果为未加权SBM的Renyi分歧。此外,我们提出了一个计算上易于处理的算法,实现了最佳的差错率的离散化。我们的方法是自适应的,在这个意义上说,该算法,不假设知识的重量密度,以及最好的算法,知道的重量密度。

英文摘要:

Community identification in a network is an important problem in fields such as social science, neuroscience, and genetics. Over the past decade, stochastic block models (SBMs) have emerged as a popular statistical framework for this problem. However, SBMs have an important limitation in that they are suited only for networks with unweighted edges; in various scientific applications, disregarding the edge weights may result in a loss of valuable information. We study a weighted generalization of the SBM, in which observations are collected in the form of a weighted adjacency matrix and the weight of each edge is generated independently from an unknown probability density determined by the community membership of its endpoints. We characterize the optimal rate of misclustering error of the weighted SBM in terms of the Renyi divergence of order 1/2 between the weight distributions of within-community and between-community edges, substantially generalizing existing results for unweighted SBMs. Furthermore, we present a computationally tractable algorithm based on discretization that achieves the optimal error rate. Our method is adaptive in the sense that the algorithm, without assuming knowledge of the weight densities, performs as well as the best algorithm that knows the weight densities.

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

↑