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

几何种植匹配的强恢复

Strong recovery of geometric planted matchings

Dmitriy Kunisky, Jonathan Niles-Weed

摘要:

我们研究的问题,有效地恢复一个未标记的收集$n$点在$\mathbb{R}^d$和一个小的随机扰动这些点之间的匹配。我们考虑一个初始点是独立同分布的模型。标准高斯向量,通过添加i.i.d.具有方差$σ^2$的高斯向量。在这种情况下,最大似然估计(MLE)可以在多项式时间内找到线性分配问题的解。我们建立阈值$σ^2$的MLE完美地恢复种植匹配(没有错误),并强烈恢复种植匹配($o(n)$错误)的$d$常数和$d = d(n)$增长任意。这两个阈值之间,我们表明,MLE使$n^{δ+ o(1)}$错误的明确$δ\in (0, 1)$。这些结果扩展到几何设置最近的工作线恢复匹配种植在随机图与独立加权边缘。我们的证明技术依赖于仔细分析的组合结构的部分匹配在大型,弱相关的随机图使用的第一和第二时刻的方法。

英文摘要:

We study the problem of efficiently recovering the matching between an unlabelled collection of $n$ points in $\mathbb{R}^d$ and a small random perturbation of those points. We consider a model where the initial points are i.i.d. standard Gaussian vectors, perturbed by adding i.i.d. Gaussian vectors with variance $σ^2$. In this setting, the maximum likelihood estimator (MLE) can be found in polynomial time as the solution of a linear assignment problem. We establish thresholds on $σ^2$ for the MLE to perfectly recover the planted matching (making no errors) and to strongly recover the planted matching (making $o(n)$ errors) both for $d$ constant and $d = d(n)$ growing arbitrarily. Between these two thresholds, we show that the MLE makes $n^{δ+ o(1)}$ errors for an explicit $δ\in (0, 1)$. These results extend to the geometric setting a recent line of work on recovering matchings planted in random graphs with independently-weighted edges. Our proof techniques rely on careful analysis of the combinatorial structure of partial matchings in large, weakly dependent random graphs using the first and second moment methods.

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

↑