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

立即免费体验

通过优化模拟无标度网络的动态。

Simulating the dynamics of scale-free networks via optimization.

机构信息

Departamento de Engenharia de Produção, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil.

出版信息

PLoS One. 2013 Dec 6;8(12):e80783. doi: 10.1371/journal.pone.0080783. eCollection 2013.

DOI:10.1371/journal.pone.0080783
PMID:24353752
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC3865918/
Abstract

We deal here with the issue of complex network evolution. The analysis of topological evolution of complex networks plays a crucial role in predicting their future. While an impressive amount of work has been done on the issue, very little attention has been so far devoted to the investigation of how information theory quantifiers can be applied to characterize networks evolution. With the objective of dynamically capture the topological changes of a network's evolution, we propose a model able to quantify and reproduce several characteristics of a given network, by using the square root of the Jensen-Shannon divergence in combination with the mean degree and the clustering coefficient. To support our hypothesis, we test the model by copying the evolution of well-known models and real systems. The results show that the methodology was able to mimic the test-networks. By using this copycat model, the user is able to analyze the networks behavior over time, and also to conjecture about the main drivers of its evolution, also providing a framework to predict its evolution.

摘要

我们在这里讨论复杂网络演化的问题。分析复杂网络的拓扑演化对于预测其未来起着至关重要的作用。虽然已经在这个问题上做了大量的工作,但到目前为止,很少有研究关注信息论量化指标如何应用于网络演化的特征描述。为了动态捕捉网络演化的拓扑变化,我们提出了一个模型,通过使用均方根误差(Jensen-Shannon 散度)与平均度数和聚类系数相结合,能够量化和再现给定网络的几个特征。为了支持我们的假设,我们通过复制知名模型和真实系统的演化来测试该模型。结果表明,该方法能够模拟测试网络。通过使用这个模仿模型,用户可以分析网络随时间的行为,也可以推测其演化的主要驱动因素,并提供一个预测其演化的框架。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/3aa130fe9ea1/pone.0080783.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/f4c29c1ec51b/pone.0080783.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/fa0c009f874f/pone.0080783.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/ef4fd1dc08fb/pone.0080783.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/19ffac028d60/pone.0080783.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/2124392213a9/pone.0080783.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/3995ebf417cd/pone.0080783.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/490e794ea87e/pone.0080783.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/3aa130fe9ea1/pone.0080783.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/f4c29c1ec51b/pone.0080783.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/fa0c009f874f/pone.0080783.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/ef4fd1dc08fb/pone.0080783.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/19ffac028d60/pone.0080783.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/2124392213a9/pone.0080783.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/3995ebf417cd/pone.0080783.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/490e794ea87e/pone.0080783.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5376/3865918/3aa130fe9ea1/pone.0080783.g008.jpg

相似文献

1
Simulating the dynamics of scale-free networks via optimization.通过优化模拟无标度网络的动态。
PLoS One. 2013 Dec 6;8(12):e80783. doi: 10.1371/journal.pone.0080783. eCollection 2013.
2
Characterizing the community structure of complex networks.刻画复杂网络的群落结构。
PLoS One. 2010 Aug 12;5(8):e11976. doi: 10.1371/journal.pone.0011976.
3
Quantifying the compressibility of complex networks.量化复杂网络的压缩性。
Proc Natl Acad Sci U S A. 2021 Aug 10;118(32). doi: 10.1073/pnas.2023473118.
4
[Dynamic paradigm in psychopathology: "chaos theory", from physics to psychiatry].[精神病理学中的动态范式:“混沌理论”,从物理学到精神病学]
Encephale. 2001 May-Jun;27(3):260-8.
5
The effect of the neural activity on topological properties of growing neural networks.神经活动对生长神经网络拓扑特性的影响。
J Integr Neurosci. 2016 Sep;15(3):305-319. doi: 10.1142/S0219635216500187. Epub 2016 Aug 10.
6
Reconfiguration and search of social networks.社交网络的重新配置与搜索
ScientificWorldJournal. 2013 Dec 18;2013:391782. doi: 10.1155/2013/391782. eCollection 2013.
7
Mapping and discrimination of networks in the complexity-entropy plane.在复杂性-熵平面上对网络进行映射和区分。
Phys Rev E. 2017 Oct;96(4-1):042304. doi: 10.1103/PhysRevE.96.042304. Epub 2017 Oct 17.
8
Network transfer entropy and metric space for causality inference.用于因果推断的网络转移熵和度量空间。
Phys Rev E Stat Nonlin Soft Matter Phys. 2013 May;87(5):052814. doi: 10.1103/PhysRevE.87.052814. Epub 2013 May 31.
9
Macromolecular crowding: chemistry and physics meet biology (Ascona, Switzerland, 10-14 June 2012).大分子拥挤现象:化学与物理邂逅生物学(瑞士阿斯科纳,2012年6月10日至14日)
Phys Biol. 2013 Aug;10(4):040301. doi: 10.1088/1478-3975/10/4/040301. Epub 2013 Aug 2.
10
Characterization of network complexity by communicability sequence entropy and associated Jensen-Shannon divergence.通过可通信性序列熵和相关的 Jensen-Shannon 散度对网络复杂性进行表征。
Phys Rev E. 2020 Apr;101(4-1):042305. doi: 10.1103/PhysRevE.101.042305.

引用本文的文献

1
Action-based Modeling of Complex Networks.基于行为的复杂网络建模。
Sci Rep. 2017 Jul 27;7(1):6673. doi: 10.1038/s41598-017-05444-4.
2
Quantification of network structural dissimilarities.网络结构差异的量化。
Nat Commun. 2017 Jan 9;8:13928. doi: 10.1038/ncomms13928.

本文引用的文献

1
Attack robustness and centrality of complex networks.复杂网络的攻击鲁棒性和中心性。
PLoS One. 2013;8(4):e59613. doi: 10.1371/journal.pone.0059613. Epub 2013 Apr 2.
2
Popularity versus similarity in growing networks.在不断发展的网络中,受欢迎程度和相似度。
Nature. 2012 Sep 27;489(7417):537-40. doi: 10.1038/nature11459. Epub 2012 Sep 12.
3
Network science: Luck or reason.网络科学:运气还是理性。
Nature. 2012 Sep 27;489(7417):507-8. doi: 10.1038/nature11486. Epub 2012 Sep 12.
4
What's in a crowd? Analysis of face-to-face behavioral networks.人群中有什么?面对面行为网络分析。
J Theor Biol. 2011 Feb 21;271(1):166-80. doi: 10.1016/j.jtbi.2010.11.033. Epub 2010 Dec 3.
5
Evolution of networks with aging of sites.网络随站点老化的演变。
Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics. 2000 Aug;62(2 Pt A):1842-5. doi: 10.1103/physreve.62.1842.
6
Structure of growing networks with preferential linking.具有优先连接的增长网络结构。
Phys Rev Lett. 2000 Nov 20;85(21):4633-6. doi: 10.1103/PhysRevLett.85.4633.
7
Connectivity of growing random networks.增长型随机网络的连通性。
Phys Rev Lett. 2000 Nov 20;85(21):4629-32. doi: 10.1103/PhysRevLett.85.4629.
8
Emergence of scaling in random networks.随机网络中幂律分布的出现。
Science. 1999 Oct 15;286(5439):509-12. doi: 10.1126/science.286.5439.509.
9
Collective dynamics of 'small-world' networks.“小世界”网络的集体动力学
Nature. 1998 Jun 4;393(6684):440-2. doi: 10.1038/30918.