Taylor Dane, Shai Saray, Stanley Natalie, Mucha Peter J
Carolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599, USA.
Curriculum in Bioinformatics and Computational Biology, University of North Carolina, Chapel Hill, North Carolina 27599, USA.
Phys Rev Lett. 2016 Jun 3;116(22):228301. doi: 10.1103/PhysRevLett.116.228301. Epub 2016 Jun 2.
Many systems are naturally represented by a multilayer network in which edges exist in multiple layers that encode different, but potentially related, types of interactions, and it is important to understand limitations on the detectability of community structure in these networks. Using random matrix theory, we analyze detectability limitations for multilayer (specifically, multiplex) stochastic block models (SBMs) in which L layers are derived from a common SBM. We study the effect of layer aggregation on detectability for several aggregation methods, including summation of the layers' adjacency matrices for which we show the detectability limit vanishes as O(L^{-1/2}) with increasing number of layers, L. Importantly, we find a similar scaling behavior when the summation is thresholded at an optimal value, providing insight into the common-but not well understood-practice of thresholding pairwise-interaction data to obtain sparse network representations.
许多系统自然地由多层网络表示,其中边存在于多层中,这些层编码不同但可能相关的相互作用类型,理解这些网络中社区结构可检测性的限制非常重要。利用随机矩阵理论,我们分析了多层(具体来说,多路复用)随机块模型(SBM)的可检测性限制,其中L层源自一个共同的SBM。我们研究了几种聚合方法中层聚合对可检测性的影响,包括层邻接矩阵的求和,我们表明随着层数L的增加,可检测性极限以O(L^{-1/2})的速度消失。重要的是,当求和在最优值处进行阈值处理时,我们发现了类似的缩放行为,这为将成对相互作用数据进行阈值处理以获得稀疏网络表示这一常见但尚未得到充分理解的做法提供了见解。