• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

配置模型作为 urn 问题。

Configuration models as an urn problem.

机构信息

ETH Zürich, Zürich, 8092, Switzerland.

出版信息

Sci Rep. 2021 Jun 28;11(1):13416. doi: 10.1038/s41598-021-92519-y.

DOI:10.1038/s41598-021-92519-y
PMID:34183694
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC8239003/
Abstract

A fundamental issue of network data science is the ability to discern observed features that can be expected at random from those beyond such expectations. Configuration models play a crucial role there, allowing us to compare observations against degree-corrected null-models. Nonetheless, existing formulations have limited large-scale data analysis applications either because they require expensive Monte-Carlo simulations or lack the required flexibility to model real-world systems. With the generalized hypergeometric ensemble, we address both problems. To achieve this, we map the configuration model to an urn problem, where edges are represented as balls in an appropriately constructed urn. Doing so, we obtain the generalized hypergeometric ensemble of random graphs: a random graph model reproducing and extending the properties of standard configuration models, with the critical advantage of a closed-form probability distribution.

摘要

网络数据科学的一个基本问题是能够辨别随机出现的可观测特征和超出预期的可观测特征。配置模型在这方面起着至关重要的作用,使我们能够将观察结果与经过修正度数的零模型进行比较。然而,现有的公式化方法要么因为需要昂贵的蒙特卡罗模拟,要么因为缺乏对现实系统进行建模的必要灵活性,从而限制了大规模数据分析的应用。通过广义超几何系综,我们解决了这两个问题。为了实现这一目标,我们将配置模型映射到一个 urn 问题中,其中边被表示为适当构造的 urn 中的球。通过这样做,我们得到了随机图的广义超几何系综:一个复制和扩展标准配置模型属性的随机图模型,具有闭式概率分布的关键优势。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/fe0c/8239003/5f4ab12dbadd/41598_2021_92519_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/fe0c/8239003/689cbae9467d/41598_2021_92519_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/fe0c/8239003/5f4ab12dbadd/41598_2021_92519_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/fe0c/8239003/689cbae9467d/41598_2021_92519_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/fe0c/8239003/5f4ab12dbadd/41598_2021_92519_Fig2_HTML.jpg

相似文献

1
Configuration models as an urn problem.配置模型作为 urn 问题。
Sci Rep. 2021 Jun 28;11(1):13416. doi: 10.1038/s41598-021-92519-y.
2
The Random Plots Graph Generation Model for Studying Systems with Unknown Connection Structures.用于研究具有未知连接结构系统的随机图生成模型。
Entropy (Basel). 2022 Feb 20;24(2):297. doi: 10.3390/e24020297.
3
Condensation of degrees emerging through a first-order phase transition in classical random graphs.经典随机图一级相变中出现的凝聚度。
Phys Rev E. 2019 Jul;100(1-1):012305. doi: 10.1103/PhysRevE.100.012305.
4
Poincaré cycle of a multibox Ehrenfest urn model with directed transport.
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Mar;67(3 Pt 1):031101. doi: 10.1103/PhysRevE.67.031101. Epub 2003 Mar 10.
5
Network comparison and the within-ensemble graph distance.网络比较与集合内图距离
Proc Math Phys Eng Sci. 2020 Nov;476(2243):20190744. doi: 10.1098/rspa.2019.0744. Epub 2020 Nov 4.
6
Triadic Closure in Configuration Models with Unbounded Degree Fluctuations.具有无界度波动的配置模型中的三元闭包
J Stat Phys. 2018;173(3):746-774. doi: 10.1007/s10955-018-1952-x. Epub 2018 Jan 25.
7
Bias in generation of random graphs.随机图生成中的偏差。
Phys Rev E Stat Nonlin Soft Matter Phys. 2012 Feb;85(2 Pt 2):026101. doi: 10.1103/PhysRevE.85.026101. Epub 2012 Feb 2.
8
Limit theorem for the Robin Hood game.罗宾汉游戏的极限定理。
Stat Probab Lett. 2019 Jun;149:9-15. doi: 10.1016/j.spl.2019.01.001. Epub 2019 Jan 25.
9
Exact solution for the time evolution of network rewiring models.网络重新布线模型时间演化的精确解。
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 May;75(5 Pt 2):056101. doi: 10.1103/PhysRevE.75.056101. Epub 2007 May 2.
10
An ensemble of random graphs with identical degree distribution.具有相同度分布的随机图集合。
Chaos. 2020 Jan;30(1):013136. doi: 10.1063/1.5105354.

引用本文的文献

1
ENQUIRE automatically reconstructs, expands, and drives enrichment analysis of gene and Mesh co-occurrence networks from context-specific biomedical literature.ENQUIRE可根据特定背景的生物医学文献自动重建、扩展并推动基因与医学主题词(Mesh)共现网络的富集分析。
PLoS Comput Biol. 2025 Feb 11;21(2):e1012745. doi: 10.1371/journal.pcbi.1012745. eCollection 2025 Feb.
2
Empirical networks are sparse: Enhancing multiedge models with zero-inflation.经验网络是稀疏的:用零膨胀增强多边模型。
PNAS Nexus. 2025 Jan 9;4(1):pgaf001. doi: 10.1093/pnasnexus/pgaf001. eCollection 2025 Jan.
3
Reconstructing signed relations from interaction data.

本文引用的文献

1
A Pólya urn approach to information filtering in complex networks.复杂网络中的信息过滤的 Pólya urn 方法。
Nat Commun. 2019 Feb 14;10(1):745. doi: 10.1038/s41467-019-08667-3.
2
The checkerboard score and species distributions.棋盘格评分和物种分布。
Oecologia. 1990 Nov;85(1):74-79. doi: 10.1007/BF00317345.
3
Weighted networks as randomly reinforced urn processes.
Phys Rev E Stat Nonlin Soft Matter Phys. 2013 Feb;87(2):020106. doi: 10.1103/PhysRevE.87.020106. Epub 2013 Feb 28.
从交互数据中重建符号关系。
Sci Rep. 2023 Nov 24;13(1):20689. doi: 10.1038/s41598-023-47822-1.
4
Struggling With Change: The Fragile Resilience of Collectives.挣扎于变化之中:集体的脆弱适应力。
Perspect Psychol Sci. 2024 Mar;19(2):374-384. doi: 10.1177/17456916231192052. Epub 2023 Sep 28.
4
Stochastic blockmodels and community structure in networks.网络中的随机块模型与社区结构
Phys Rev E Stat Nonlin Soft Matter Phys. 2011 Jan;83(1 Pt 2):016107. doi: 10.1103/PhysRevE.83.016107. Epub 2011 Jan 21.
5
Combinatorial approach to modularity.模块化的组合方法。
Phys Rev E Stat Nonlin Soft Matter Phys. 2010 Aug;82(2 Pt 2):026102. doi: 10.1103/PhysRevE.82.026102. Epub 2010 Aug 4.
6
Loops and multiple edges in modularity maximization of networks.网络模块化最大化中的回路与多重边
Phys Rev E Stat Nonlin Soft Matter Phys. 2010 Apr;81(4 Pt 2):046102. doi: 10.1103/PhysRevE.81.046102. Epub 2010 Apr 2.
7
Modularity and community structure in networks.网络中的模块化与群落结构。
Proc Natl Acad Sci U S A. 2006 Jun 6;103(23):8577-82. doi: 10.1073/pnas.0601602103. Epub 2006 May 24.
8
Generating uniformly distributed random networks.生成均匀分布的随机网络。
Phys Rev E Stat Nonlin Soft Matter Phys. 2005 Nov;72(5 Pt 2):056708. doi: 10.1103/PhysRevE.72.056708. Epub 2005 Nov 16.
9
Mixing patterns in networks.网络中的混合模式。
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Feb;67(2 Pt 2):026126. doi: 10.1103/PhysRevE.67.026126. Epub 2003 Feb 27.
10
The average distances in random graphs with given expected degrees.具有给定期望度的随机图中的平均距离。
Proc Natl Acad Sci U S A. 2002 Dec 10;99(25):15879-82. doi: 10.1073/pnas.252631999. Epub 2002 Dec 4.