稀疏随机图上Ising模型的高维结构学习
High Dimensional Structure Learning of Ising Models on Sparse Random Graphs
摘要:
研究了稀疏Erdos-Renyi随机图上马尔可夫铁磁伊辛模型的结构学习问题。我们提出了简单的本地算法,并分析其性能的相关性衰减的制度。我们证明了一组有条件的互信息测试的基础上的算法是一致的结构学习整个政权的相关性衰减。该算法需要样本个数为ω(\log n),其计算复杂性为O(n^4)。一种基于相关阈值的简单算法在相关衰减时输出到原始图的编辑距离恒定的图,所需样本个数为Ω(\log n)。在更严格的条件下,相关阈值法对于结构估计是一致的。最后证明了随机图的一致重构所需样本数Ω(c \log n)的一个下界,其中c为平均度.因此,我们建立了一致的结构估计是可能的,几乎顺序最优的样本复杂性在整个政权的相关性衰减。
英文摘要:
We consider the problem of learning the structure of ferromagnetic Ising models Markov on sparse Erdos-Renyi random graph. We propose simple local algorithms and analyze their performance in the regime of correlation decay. We prove that an algorithm based on a set of conditional mutual information tests is consistent for structure learning throughout the regime of correlation decay. This algorithm requires the number of samples to scale as ω(\log n), and has a computational complexity of O(n^4). A simpler algorithm based on correlation thresholding outputs a graph with a constant edit distance to the original graph when there is correlation decay, and the number of samples required is Ω(\log n). Under a more stringent condition, correlation thresholding is consistent for structure estimation. We finally prove a lower bound that Ω(c\log n) samples are also needed for consistent reconstruction of random graphs by any algorithm with positive probability, where c is the average degree. Thus, we establish that consistent structure estimation is possible with almost order-optimal sample complexity throughout the regime of correlation decay.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。