English(EN) Explicit Bounds on the Entropy of Piecewise H\"{o}lder Graphon Models

新研究探讨图模型中的熵界限

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

Connor Loehde-Woolard 在 arXiv 上发表了一篇新论文，详细介绍了分段 Hölder 连续图模型熵的显式界限。该研究提出了关于图大小增加时归一化熵收敛速率的结果，详细证明可在附录中找到。这项工作推导了随机块模型和随机几何图模型的定量界限，提供了显式公式而非渐近陈述。 AI

影响这项研究有助于加深对图模型的理论理解，这可能在机器学习和数据分析中产生下游应用。

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

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

本文如何被排名

Signal score: 16 / 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) · Connor Loehde-Woolard, Fran\c{c}ois G. Meyer · 2026-08-28 04:00

分段 Hölder 图形模型熵的显式界限

arXiv:2608.26501v1 Announce Type: cross Abstract: We study the entropy of random graphs generated by piecewise H\"{o}lder continuous graphons. We first present a result on the rate of convergence of the normalized entropy as the size of the graph grows. The core ideas of the proo…