English(EN) Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)

新的OmniMatch算法实现了完美的种子图匹配

作者 PulseAugur 编辑部 · [1 个来源] · 2026-08-26 04:00

研究人员开发了OmniMatch，一种用于种子多图匹配的新型算法。该算法被证明可以渐近且高效地对齐多个网络中大量的非种子顶点，即使没有边缘相关性。OmniMatch通过纠正错位的顶点以恢复丢失的测试能力，在模拟和置换图假设检验、连接组学和机器翻译等应用中均显示出有效性。 AI

影响引入了一种新的图匹配算法，在机器翻译和连接组学等领域具有潜在应用。

排序理由该集群包含一篇在arXiv上发表的关于新算法的论文。[lever_c_demoted from research: ic=1 ai=0.7]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 30 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇在arXiv上发表的关于新算法的论文。[lever_c_demoted from research: ic=1 ai=0.7]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

arXiv stat.ML TIER_1 English(EN) · Tong Qi, Vera Andersson, Peter Viechnicki, Vince Lyzinski · 2026-08-26 04:00

无边缘相关性的渐近完美种子图匹配（及其在推理中的应用）

arXiv:2506.02825v3 Announce Type: replace Abstract: We present the OmniMatch algorithm for seeded multiple graph matching. In the setting of $d$-dimensional Random Dot Product Graphs (RDPG), we prove that under mild assumptions, OmniMatch with $s$ seeds asymptotically and efficie…