超图中Ollivier-Ricci曲率的新界限已详细介绍

作者 PulseAugur 编辑部 · [1 个来源] · 2026-11-02 05:00

本文为高阶网络（特别是超图）中的Ollivier-Ricci曲率（ORC）引入了新的理论界限。研究详细说明了Bauer-Jost-Liu曲率界限如何应用于超图ORC，并根据局部质量和几何分析了其准确性。研究还探讨了计算应用，包括一个保留精确传输决策的阈值级联，并通过对公共数据实例的大量数值实验验证了研究结果。 AI

排序理由该集群包含一篇研究论文，详细介绍了超图中Ollivier-Ricci曲率的理论界限和计算应用。[lever_c_demoted from research: ic=1 ai=0.7]

在 arXiv stat.ML 阅读 →

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

本文如何被排名

Signal score: 1 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇研究论文，详细介绍了超图中Ollivier-Ricci曲率的理论界限和计算应用。[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: 1 days old; Coverage has settled into its steady-state source set.

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

报道来源 [1]

arXiv stat.ML TIER_1 English(EN) · Wonwoo Kang, Heehyun Park · 2026-11-02 05:00

Transport-Free Lower Bounds for Ollivier--Ricci Curvature in Higher-Order Networks: Scope, Tightness, and Computational Applications

arXiv:2405.13302v2 Announce Type: replace Abstract: We study how the Bauer--Jost--Liu curvature bound applies to hypergraph Ollivier--Ricci curvature (ORC) and how its accuracy depends on local mass and geometry. An explicit weighted-graph representation shows how the graph theor…

本文如何被排名

报道来源 [1]

Transport-Free Lower Bounds for Ollivier--Ricci Curvature in Higher-Order Networks: Scope, Tightness, and Computational Applications

相关实体

相关话题