Testing community structure for hypergraphs
超图社群结构的检验AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要明确研究超图网络的社群结构、超边信息及检验，直接对应网络方向，但未涉及因果干扰效应。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
超图社群结构的检验
- 研究问题
- 如何判断观测超图是否存在社群结构，以及在不同稀疏程度和信噪比下能否将其与 Erdős–Rényi 超图区分？
- 方法与思路
- 作者研究模型可区分性，在有界度数情形分析信噪比阈值，在稠密情形构造子超图计数检验，并扩展至非均匀超图。
- 材料陈述的贡献
- 摘要称发现超边概率的相变，给出特定三均匀模型的尖锐阈值及一般模型的近紧阈值，并分析可计算检验的分布与功效。
- 阅读关注点
- 应核对两社群模型的参数限制、可区分性的定义、稀疏与稠密区间，以及阈值结论和检验可计算性各自覆盖的情形。
- 阅读边界
- 仅据版本未注明的 OpenAlex 摘要；尖锐阈值针对特定模型，不能推广至任意社群数、超边结构或真实网络。
原文摘要
Many complex networks in the real world can be formulated as hypergraphs where community detection has been widely used. However, the fundamental question of whether communities exist or not in an observed hypergraph remains unclear. This work aims to tackle this important problem. Specifically, we systematically study when a hypergraph with community structure can be successfully distinguished from its Erdős–Rényi counterpart, and propose concrete test statistics when the models are distinguishable. The main contribution of this paper is threefold. First, we discover a phase transition in the hyperedge probability for distinguishability. Second, in the bounded-degree regime, we derive a sharp signal-to-noise ratio (SNR) threshold for distinguishability in the special two-community 3-uniform hypergraphs, and derive nearly tight SNR thresholds in the general two-community m-uniform hypergraphs. Third, in the dense regime, we propose a computationally feasible test based on sub-hypergraph counts, obtain its asymptotic distribution, and analyze its power. Our results are further extended to nonuniform hypergraphs in which a new test involving both edge and hyperedge information is proposed. The proofs rely on Janson’s contiguity theory (Combin. Probab. Comput. 4 (1995) 369–405), a high-moments driven asymptotic normality result by Gao and Wormald (Probab. Theory Related Fields 130 (2004) 368–376), and a truncation technique for analyzing the likelihood ratio.