arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.24286nlin.AO
收藏

在单纯复形中揭示隐藏的高阶漏洞:通过分支一致的功能鲁棒性

Hidden Higher-Order Vulnerabilities in Simplicial Complexes Revealed by Branch-Consistent Functional Robustness

College of Future Information Technology, Fudan University(复旦大学未来信息技术学院)

Kaiming Luo

AI总结:

研究通过分支一致的功能鲁棒性方法揭示高阶网络的鲁棒性问题,证明传统方法定义不清,提出新的追踪方式以保持鲁棒性定义。

摘要:

高阶网络的鲁棒性通常通过删除单纯形时Hodge 1-拉普拉斯算子的瞬时最小正本征值来量化。本文显示该可观测值通常定义不清:在删除轨迹中,本征值分支可能切换,因此被监控的量可能对应于不同的非谐波模式。主要问题是定义而非算法问题。通过固定完整复形的第一非谐波分支并在损坏过程中追踪该分支,定义了分支一致的功能鲁棒性。三角形敏感性直接由一阶扰动理论得出,使结果模式敏感的删除协议成为可观测值本身的结果而非独立启发式方法。在合成和经验的 clique 复合体中,仅移除少量三角形足以使跟踪模式崩溃,而图层面可观测值保持不变,因为1-骨架被精确保留。同一框架还揭示了功能关键单纯形的桥梁状局部化,并提供了动态时间尺度的紧凑预测。

英文摘要:

Robustness of higher-order networks is often quantified by the instantaneous smallest positive eigenvalue of the Hodge $1$-Laplacian under simplex deletion. We show that this observable is generically ill-defined: along a deletion trajectory, eigenvalue branches can switch, so the quantity being monitored may correspond to different nonharmonic modes at different steps. The primary issue is therefore definitional rather than algorithmic. We resolve it by fixing the first nonharmonic branch of the intact complex and following that same branch throughout the damage process, which defines a branch-consistent functional robustness. Triangle sensitivities then follow directly from first-order perturbation theory, making the resulting mode-sensitive deletion protocol a consequence of the observable itself rather than an independent heuristic. Across synthetic and empirical clique complexes, removing only a small fraction of triangles is sufficient to drive the tracked mode to collapse, while graph-level observables remain unchanged because the $1$-skeleton is exactly preserved. The same framework also reveals bridge-like localization of functionally critical simplices and provides a compact predictor of dynamical timescales.

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

↑