.png){kind=icon}
返回
Sizing complex networks
.png){kind=icon}
OA
AI
DOI：10.1038/s42005-019-0239-0.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Among the many features of natural and man-made complex networks the small-world phenomenon is a relevant and popular one. But, how small is a small-world network and how does it compare to others? Despite its importance, a reliable and comparable quantification of the average pathlength of networks has remained an open challenge over the years. Here, we uncover the upper (ultra-long (UL)) and the lower (ultra-short (US)) limits for the pathlength and efficiency of networks. These results allow us to frame their length under a natural reference and to provide a synoptic representation, without the need to rely on the choice for a null-model (e.g., random graphs or ring lattices). Application to empirical examples of three categories (neural, social and transportation) shows that, while most real networks display a pathlength comparable to that of random graphs, when contrasted against the boundaries, only the cortical connectomes prove to be ultra-short.
Keyword:
RICH-CLUB ORGANIZATION
NAVIGABILITY
COMMUNITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.8
论文数:
2.8K
被引数:
9.2K
机构
引用论文
Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems.png)
plos biologyOAAI
plos biologyIF3.6
OAAI分享收藏A multi-task neural network for multilingual sentiment classification and language detection on Twitter用于Twitter多语言情感分类和语言检测的多任务神经网络
PREAI
分享收藏
查看更多内容