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

DRESS 与 WL 层级:一次删除一级地攀登

DRESS and the WL Hierarchy: Climbing One Deletion at a Time

Eduar Castrillo Velilla

AI总结:

本文提出 $Δ^k$-DRESS 框架,通过理论证明其能区分 CFI$(K_{k+3})$ 对,并证明其在 WL 层级中具有等价性。

摘要:

DRESS 是一种确定性、无参数的框架,通过迭代优化图中边的结构相似性来生成一个规范指纹:一个实值边向量,通过收敛非线性动力系统到其唯一固定点获得。$Δ^k$-DRESS 通过在 G 的每个 k 顶点删除子图上运行 DRESS 来扩展该框架;它在 companion paper 中被引入并经验性评估,其中 CFI 阶梯表明 $Δ^k$-DRESS 与 $(k{+}2)$-WL 对于 k = 0, 1, 2, 3 是匹配的。本文提供了理论依据。主要贡献是:(i) 无条件证明 $Δ^k$-DRESS 可区分所有 CFI$(K_{k+3})$ 对,对于所有 k ≥ 0(CFI 阶梯定理),通过新的 CFI Deck 分离定理和虚拟 Pebble 引理建立;以及 (ii) 在假设 WL 层级的一个结构猜想(WL-Deck 分离)下,证明 $Δ^k$-DRESS ≥ $(k{+}2)$-WL 对所有图和所有 k ≥ 0。

英文摘要:

DRESS is a deterministic, parameter-free framework that iteratively refines the structural similarity of edges in a graph to produce a canonical fingerprint: a real-valued edge vector, obtained by converging a non-linear dynamical system to its unique fixed point. $Δ^k$-DRESS extends the framework by running DRESS on every $k$-vertex-deleted subgraph of $G$; it was introduced and empirically evaluated in the companion paper, where the CFI staircase showed that $Δ^k$-DRESS matches $(k{+}2)$-WL for $k = 0, 1, 2, 3$. This paper provides the theoretical justification. The main contributions are: (i) an unconditional proof that $Δ^k$-DRESS distinguishes every CFI$(K_{k+3})$ pair for all $k \geq 0$ (CFI Staircase Theorem), established via a new CFI Deck Separation theorem and the Virtual Pebble Lemma; and (ii) a conditional proof that $Δ^k$-DRESS $\geq$ $(k{+}2)$-WL for all graphs and all $k \geq 0$, assuming a single structural conjecture about the WL hierarchy (WL-Deck Separation).

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

↑