• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

具有尊重时间的 null 模型的随机生长网络。

Randomizing growing networks with a time-respecting null model.

机构信息

Alibaba Research Center for Complexity Sciences, Alibaba Business School, Hangzhou Normal University, Hangzhou 311121, PR China.

Department of Physics, University of Fribourg, 1700 Fribourg, Switzerland.

出版信息

Phys Rev E. 2018 May;97(5-1):052311. doi: 10.1103/PhysRevE.97.052311.

DOI:10.1103/PhysRevE.97.052311
PMID:29906916
Abstract

Complex networks are often used to represent systems that are not static but grow with time: People make new friendships, new papers are published and refer to the existing ones, and so forth. To assess the statistical significance of measurements made on such networks, we propose a randomization methodology-a time-respecting null model-that preserves both the network's degree sequence and the time evolution of individual nodes' degree values. By preserving the temporal linking patterns of the analyzed system, the proposed model is able to factor out the effect of the system's temporal patterns on its structure. We apply the model to the citation network of Physical Review scholarly papers and the citation network of US movies. The model reveals that the two data sets are strikingly different with respect to their degree-degree correlations, and we discuss the important implications of this finding on the information provided by paradigmatic node centrality metrics such as indegree and Google's PageRank. The randomization methodology proposed here can be used to assess the significance of any structural property in growing networks, which could bring new insights into the problems where null models play a critical role, such as the detection of communities and network motifs.

摘要

复杂网络通常用于表示随时间而变化的非静态系统

人们结交新朋友,新论文发表并引用现有的论文,等等。为了评估在这种网络上进行的测量的统计显著性,我们提出了一种随机化方法——一种尊重时间的零模型,它既保留了网络的度序列,也保留了单个节点度值的时间演化。通过保留所分析系统的时间链接模式,所提出的模型能够消除系统的时间模式对其结构的影响。我们将该模型应用于《物理评论》学术论文的引文网络和美国电影的引文网络。该模型表明,这两个数据集在它们的度-度相关性方面存在显著差异,我们讨论了这一发现对度中心性指标(如入度和谷歌的 PageRank)所提供的信息的重要意义。这里提出的随机化方法可用于评估增长网络中任何结构属性的显著性,这可能会为在零模型发挥关键作用的问题(如社区和网络基元的检测)带来新的见解。

相似文献

1
Randomizing growing networks with a time-respecting null model.具有尊重时间的 null 模型的随机生长网络。
Phys Rev E. 2018 May;97(5-1):052311. doi: 10.1103/PhysRevE.97.052311.
2
Temporal node centrality in complex networks.复杂网络中的时间节点中心性
Phys Rev E Stat Nonlin Soft Matter Phys. 2012 Feb;85(2 Pt 2):026107. doi: 10.1103/PhysRevE.85.026107. Epub 2012 Feb 13.
3
Spatial network surrogates for disentangling complex system structure from spatial embedding of nodes.从节点的空间嵌入中分离复杂系统结构的空间网络替代物。
Phys Rev E. 2016 Apr;93:042308. doi: 10.1103/PhysRevE.93.042308. Epub 2016 Apr 12.
4
Resilience centrality in complex networks.复杂网络中的弹性中心性
Phys Rev E. 2020 Feb;101(2-1):022304. doi: 10.1103/PhysRevE.101.022304.
5
Spectral Learning Algorithm Reveals Propagation Capability of Complex Networks.谱学习算法揭示复杂网络的传播能力。
IEEE Trans Cybern. 2019 Dec;49(12):4253-4261. doi: 10.1109/TCYB.2018.2861568. Epub 2018 Aug 21.
6
Quality assessment of static aggregation compared to the temporal approach based on a pig trade network in Northern Germany.基于德国北部生猪贸易网络,将静态聚集与时间方法进行比较的质量评估。
Prev Vet Med. 2016 Jul 1;129:1-8. doi: 10.1016/j.prevetmed.2016.05.005. Epub 2016 May 10.
7
Impact of second-order network motif on online social networks.二阶网络基序对在线社交网络的影响。
J Supercomput. 2022;78(4):5450-5478. doi: 10.1007/s11227-021-04079-7. Epub 2021 Sep 24.
8
Exploring the assortativity-clustering space of a network's degree sequence.探索网络度序列的 assortativity-聚类空间。
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Apr;75(4 Pt 2):046111. doi: 10.1103/PhysRevE.75.046111. Epub 2007 Apr 19.
9
Analytical description of the evolution of neural networks: learning rules and complexity.神经网络演化的分析描述:学习规则与复杂性
Biol Cybern. 1999 Aug;81(2):169-75. doi: 10.1007/s004220050553.
10
Correlations in scale-free networks: tomography and percolation.无标度网络中的相关性:断层扫描与渗流
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Sep;68(3 Pt 2):036119. doi: 10.1103/PhysRevE.68.036119. Epub 2003 Sep 22.

引用本文的文献

1
The simple regularities in the dynamics of online news impact.在线新闻影响力动态中的简单规律。
J Comput Soc Sci. 2022;5(1):629-646. doi: 10.1007/s42001-021-00140-w. Epub 2021 Sep 12.