鲁棒自有序图:构造及其在性质检验中的应用
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
AI总结:
本文开创性地研究鲁棒自有序图的结构、构造与应用,证明有界度及线性度鲁棒自有序图存在且可高效构造,并利用其导出有界度图模型中测试与容忍测试查询复杂度的次指数分离。
摘要:
一个图 $G$ 被称为自有序的(也称为非对称的),如果恒等置换是它唯一的自同构。等价地,从 $G$ 到任何与 $G$ 同构的图存在唯一的同构。我们说 $G=(V,E)$ 是鲁棒自有序的,如果 $E$ 与通过任意置换 $\pi:V\to V$ 置换 $V$ 后得到的图的边集之间的对称差的大小与 $\pi$ 的非不动点数量成正比。在这项工作中,我们开创了对鲁棒自有序图的结构、构造和用途的研究。\n\n我们证明鲁棒自有序的有界度图存在(且数量丰富),并且它们可以在强意义上被高效构造。具体来说,给定这样一个图中一个顶点的索引,可以在多项式时间内(即,在图的规模的对数多项式时间内)找到它的所有邻居。\n\n我们还考虑无界度的图,寻求相应的无界鲁棒性参数。我们再次证明这样的图(线性度)存在(且数量丰富),并且它们可以在强意义上被高效构造。这需要使用非常不同的工具。具体来说,我们表明这种图的构造归结为不可延展的双源提取器的构造(具有非常弱的参数但具有一些额外的自然特性)。\n\n我们证明鲁棒自有序的有界度图对于在有界度和稠密图模型中获取测试图性质的查询复杂度的下界是有用的。通过这种归约,我们获得的一个结果是在有界度图模型中,测试和容忍测试图性质的查询复杂度之间的次指数分离。
英文摘要:
A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly self-ordered if the size of the symmetric difference between $E$ and the edge-set of the graph obtained by permuting $V$ using any permutation $π:V\to V$ is proportional to the number of non-fixed-points of $π$. In this work, we initiate the study of the structure, construction and utility of robustly self-ordered graphs. We show that robustly self-ordered bounded-degree graphs exist (in abundance), and that they can be constructed efficiently, in a strong sense. Specifically, given the index of a vertex in such a graph, it is possible to find all its neighbors in polynomial-time (i.e., in time that is poly-logarithmic in the size of the graph). We also consider graphs of unbounded degree, seeking correspondingly unbounded robustness parameters. We again demonstrate that such graphs (of linear degree) exist (in abundance), and that they can be constructed efficiently, in a strong sense. This turns out to require very different tools. Specifically, we show that the construction of such graphs reduces to the construction of non-malleable two-source extractors (with very weak parameters but with some additional natural features). We demonstrate that robustly self-ordered bounded-degree graphs are useful towards obtaining lower bounds on the query complexity of testing graph properties both in the bounded-degree and the dense graph models. One of the results that we obtain, via such a reduction, is a subexponential separation between the query complexities of testing and tolerant testing of graph properties in the bounded-degree graph model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。