arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.09104stat.ME
收藏

加权网络中模式检测的近似条件抽样

Approximate Conditional Sampling for Pattern Detection in Weighted Networks

James A. Scott, Axel Gandy

摘要:

评估网络模式的统计显著性对于理解这些模式是否表明存在有趣的网络现象,或者它们是否仅仅是由不太有趣的过程(如网络异质性)引起的至关重要。通常,显著性是参考空模型计算的。虽然已经有广泛的研究,这种零模型的非加权图,很少有做了加权的情况下。本文提出了一个加权图的空模型。该模型精确地确定了节点的强度,近似地确定了节点的度。提出了一种新的MCMC算法对模型进行采样,并讨论了其随机稳定性。我们的经验表明,该模型相比,有利的替代品,特别是当网络模式是微妙的。我们展示了如何使用该算法来评估社区结构的统计意义。

英文摘要:

Assessing the statistical significance of network patterns is crucial for understanding whether such patterns indicate the presence of interesting network phenomena, or whether they simply result from less interesting processes, such as nodal-heterogeneity. Typically, significance is computed with reference to a null model. While there has been extensive research into such null models for unweighted graphs, little has been done for the weighted case. This article suggests a null model for weighted graphs. The model fixes node strengths exactly, and approximately fixes node degrees. A novel MCMC algorithm is proposed for sampling the model, and its stochastic stability is considered. We show empirically that the model compares favorably to alternatives, particularly when network patterns are subtle. We show how the algorithm can be used to evaluate the statistical significance of community structure.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑