Optimal adaptivity of signed-polygon statistics for network testing
网络检验中带符号多边形统计量的最优自适应性AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要明确研究社会网络中的社群检验、度数异质性与混合成员身份。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
网络检验中带符号多边形统计量的最优自适应性
- 研究问题
- 如何检验对称社会网络只有一个社群还是多个社群，同时容纳强度数异质性、混合成员身份及不同网络稀疏程度？
- 方法与思路
- 作者利用中心化邻接矩阵为网络中的多边形赋分并求和，重点分析带符号三角形与四边形统计量，并以相变框架研究下界。
- 材料陈述的贡献
- 摘要称，两类检验具有可处理的零假设分布，能适应所考察的稀疏程度并达到最优相图，且在文中设定下优于若干已有检验。
- 阅读关注点
- 应核对网络生成模型、中心化参数的估计、零假设分布和稀疏范围，以及最优相图的参数定义及下界所覆盖的备择类别。
- 阅读边界
- 仅据版本未注明的 OpenAlex 摘要；未提供完整模型、相变边界或比较数值，最优性和优势限于文中设定，不能推广至任意网络。
原文摘要
Given a symmetric social network, we are interested in testing whether it has only one community or multiple communities. The desired tests should (a) accommodate severe degree heterogeneity, (b) accommodate mixed memberships, (c) have a tractable null distribution and (d) adapt automatically to different levels of sparsity, and achieve the optimal phase diagram. How to find such a test is a challenging problem. We propose the Signed Polygon as a class of new tests. Fixing m≥3, for each m-gon in the network, define a score using the centered adjacency matrix. The sum of such scores is then the mth order Signed Polygon statistic. The Signed Triangle (SgnT) and the Signed Quadrilateral (SgnQ) are special examples of the Signed Polygon. We show that both the SgnT and SgnQ tests satisfy (a)–(d), and especially, they work well for both very sparse and less sparse networks. Our proposed tests compare favorably with existing tests. For example, the EZ and GC tests behave unsatisfactorily in the less sparse case and do not achieve the optimal phase diagram. Also, many existing tests do not allow for severe heterogeneity or mixed memberships, and they behave unsatisfactorily in our settings. The analysis of the SgnT and SgnQ tests is delicate and extremely tedious, and the main reason is that we need a unified proof that covers a wide range of sparsity levels and a wide range of degree heterogeneity. For lower bound theory, we use a phase transition framework, which includes the standard minimax argument, but is more informative. The proof uses classical theorems on matrix scaling.