arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv physics/0512075physics.soc-phcond-mat.soft
收藏

无标度网络中的度景观

Degree Landscapes in Scale-Free Networks

Jacob Bock Axelsen, Sebastian Bernhardsson, Martin Rosvall, Kim Sneppen, Ala Trusina

摘要:

我们概括的度组织视图的现实世界中的网络与广泛的度分布在一个景观模拟与山脉(高度节点)和山谷(低度节点)。例如,相邻节点之间的相关度对应于平滑的景观(社交网络),层次网络对应于一座山的景观(互联网),而没有层次特征的度分解网络对应于有几座山的粗糙景观。我们还生成脊景观模型的网络所施加的限制下,网络嵌入的空间,相关的空间或分子网络,功能定位。为了量化拓扑结构,我们在这里测量山脉的宽度以及不同山脉之间的间距。

英文摘要:

We generalize the degree-organizational view of real-world networks with broad degree-distributions in a landscape analogue with mountains (high-degree nodes) and valleys (low-degree nodes). For example, correlated degrees between adjacent nodes corresponds to smooth landscapes (social networks), hierarchical networks to one-mountain landscapes (the Internet), and degree-disassortative networks without hierarchical features to rough landscapes with several mountains. We also generate ridge landscapes to model networks organized under constraints imposed by the space the networks are embedded in, associated to spatial or, in molecular networks, to functional localization. To quantify the topology, we here measure the widths of the mountains and the separation between different mountains.

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

↑