arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.16598math.CO
收藏

$L^p$-图核中Robinson性质的鲁棒恢复:一种割范数方法

Robust Recovery of Robinson Property in $L^p$-Graphons: A Cut-Norm Approach

Mahya Ghandehari, Teddy Mishura

AI总结:

本文研究了$L^p$-图核的Robinson性质恢复问题,通过引入量化函数$Λ$,证明了在割范数意义下局部近Robinson图核可被有效逼近,并给出了误差界限,该结果适用于任意尺寸对称矩阵。

摘要:

本文研究了$L^p$-图核类中的Robinson图核补全/恢复问题,重点关注$5<p\leq \infty$的范围。若图核$w$满足Robinson性质,即当$x\leq y\leq z$时,$w(x,z)\leq \min\{w(x,y),w(y,z)\}$,则称其为Robinson的。我们证明,若图核具有局部近Robinson特征,则它可以在割范数意义下被Robinson图核有效逼近。为实现此恢复结果,我们引入了一个定义在$L^p$-图核空间上的函数$Λ$,用于量化图核$w$遵循Robinson性质的程度。我们证明,当图核的邻近度以割范数理解时,$Λ$是衡量Robinson性质的合适度量。具体而言,我们表明:(1)当且仅当$w$是Robinson时,$Λ(w)=0$;(2)$Λ$是割范数连续的,即若两个图核在割范数下接近,则它们的$Λ$值也接近;(3)对于$p > 5$,任何$L^p$-图核$w$都可以被Robinson图核逼近,且逼近误差以$Λ(w)$为界。若将$w$视为Robinson图核的含噪版本,我们的方法提供了一种具体的方案,用于恢复无噪$w$的割范数逼近。鉴于任何对称矩阵都是一种特殊类型的图核,我们的结果可适用于任意尺寸的对称矩阵。我们的工作扩展并改进了先前的研究结果,这些先前结果仅回答了$L^\infty$-图核这一特殊情形下的类似问题。

英文摘要:

This paper investigates the Robinson graphon completion/recovery problem within the class of $L^p$-graphons, focusing on the range $5<p\leq \infty$. A graphon $w$ is Robinson if it satisfies the Robinson property: if $x\leq y\leq z$, then $w(x,z)\leq \min\{w(x,y),w(y,z)\}$. We demonstrate that if a graphon possesses localized near-Robinson characteristics, it can be effectively approximated by a Robinson graphon in terms of cut-norm. To achieve this recovery result, we introduce a function $Λ$, defined on the space of $L^p$-graphons, which quantifies the degree to which a graphon $w$ adheres to the Robinson property. We prove that $Λ$ is a suitable gauge for measuring the Robinson property when proximity of graphons is understood in terms of cut-norm. Namely, we show that (1) $Λ(w)=0$ precisely when $w$ is Robinson; (2) $Λ$ is cut-norm continuous, in the sense that if two graphons are close in the cut-norm, then their $Λ$ values are close; and (3) for $p > 5$, any $L^p$-graphon $w$ can be approximated by a Robinson graphon, with error of the approximation bounded in terms of $Λ(w)$. When viewing $w$ as a noisy version of a Robinson graphon, our method provides a concrete recipe for recovering a cut-norm approximation of a noiseless $w$. Given that any symmetric matrix is a special type of graphon, our results can be applicable to symmetric matrices of any size. Our work extends and improves previous results, where a similar question for the special case of $L^\infty$-graphons was answered.

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

↑