基于迭代投影的非均匀种植分区恢复
Recovering Nonuniform Planted Partitions via Iterated Projection
摘要:
在种植划分问题中,随机图的$n$顶点被划分成$k$“簇”,并且相同簇和不同簇中的顶点之间的边分别以恒定概率$p$和$q$被包括(其中$0 \le q < p \le 1$)。我们给出了一个有效的频谱算法,恢复集群的概率很高,提供的任何两个集群的大小是非常接近或分离的$\geq Ω(\sqrt n)$。我们还讨论了一个推广的种植划分算法,其中算法的输入不是一个随机图,而是一个随机实对称矩阵与独立的上对角元素。我们的算法是一个适应以前的算法的统一的情况下,即,当所有簇的大小为$n / k \geq Ω(\sqrt n)$时。原始算法通过迭代投影逐个恢复聚类:它在随机图的邻接矩阵的主$k$维特征空间上构造正交投影算子,用它恢复其中一个聚类,然后删除它并在剩余的顶点上递归。我们在这里表明,一个类似的算法在非均匀的情况下。
英文摘要:
In the planted partition problem, the $n$ vertices of a random graph are partitioned into $k$ "clusters," and edges between vertices in the same cluster and different clusters are included with constant probability $p$ and $q$, respectively (where $0 \le q < p \le 1$). We give an efficient spectral algorithm that recovers the clusters with high probability, provided that the sizes of any two clusters are either very close or separated by $\geq Ω(\sqrt n)$. We also discuss a generalization of planted partition in which the algorithm's input is not a random graph, but a random real symmetric matrix with independent above-diagonal entries. Our algorithm is an adaptation of a previous algorithm for the uniform case, i.e., when all clusters are size $n / k \geq Ω(\sqrt n)$. The original algorithm recovers the clusters one by one via iterated projection: it constructs the orthogonal projection operator onto the dominant $k$-dimensional eigenspace of the random graph's adjacency matrix, uses it to recover one of the clusters, then deletes it and recurses on the remaining vertices. We show herein that a similar algorithm works in the nonuniform case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。