跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要直接研究网络数据、邻接矩阵及随机块模型的拟合优度检验。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Yujia Wu
Wei Lan
Long Feng
Chih-Ling Tsai

稀疏网络的拟合优度检验

研究问题
在社区数量增长、社区间连接概率可低至 log(n)/n 量级的稀疏网络中,如何检验随机块模型结构是否充分拟合?
方法与思路
作者对邻接矩阵逐元素偏差进行子抽样并构造最大统计量,利用抽样缓解稀疏性影响,再提出 bootstrap 校正和增强统计量。
材料陈述的贡献
摘要称,零假设下统计量收敛至第一类极值分布,给出渐近功效,并将方法扩展到度修正随机块模型及稠密网络。
阅读关注点
应核对子抽样机制、社区估计误差及稀疏度和社区数的增长条件,并检查极值近似、bootstrap 校正与增强统计量的实现。
阅读边界
仅据所给 RePEc 出版社摘要解读;具体正则条件与功效数值未说明,“不依赖网络结构”的表述不能理解为无需任何模型限制。

原文摘要

The stochastic block model (SBM) has been widely used to analyze network data. Various goodness-of-fit tests have been proposed to assess the adequacy of model structures. To the best of our knowledge, however, none of the existing approaches are applicable for sparse networks in which the connection probability of any two communities is of order n−1logn, and the number of communities is divergent. To fill this gap, we propose a novel goodness-of-fit test for the stochastic block model. The key idea is to construct a maximal statistic from subsampled entry-wise deviations of the adjacency matrix, using the sampling process to alleviate the negative effects of network sparsity. We demonstrate theoretically that the proposed test statistic converges to the Type-I extreme value distribution under the null hypothesis regardless of the network structure. Accordingly, it can be applied to both dense and sparse networks. In addition, we obtain the asymptotic power against alternatives. Moreover, we introduce a bootstrap-corrected test statistic to improve the finite sample performance, recommend an augmented test statistic to increase the power, and extend the proposed test to the degree-corrected SBM. Simulation studies and two empirical examples with both dense and sparse networks indicate that the proposed method performs well.

笔记与分组
相关领域论文