arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 0908.1143physics.soc-phcond-mat.dis-nncond-mat.stat-mechcs.NI
收藏

复杂网络的构建块有多小

How small are building blocks of complex networks

Almerima Jamakovic, Priya Mahadevan, Amin Vahdat, Marian Boguna, Dmitri Krioukov

摘要:

网络模体是复杂网络的小构件。统计上显著的基序通常执行网络特定的功能。然而,模体与网络的全球结构和功能之间的联系的确切性质仍然难以捉摸。在这里,我们表明,一些真正的网络的全局结构是由统计上的概率连接的图案的大小最多为3,一旦这个概率占节点度。在这些网络中的节点三元组的连接配置文件捕捉所有的本地和全局属性。这一发现影响了依赖于基序统计显著性的方法,并丰富了我们对塑造复杂网络结构的基本力量的理解。

英文摘要:

Network motifs are small building blocks of complex networks. Statistically significant motifs often perform network-specific functions. However, the precise nature of the connection between motifs and the global structure and function of networks remains elusive. Here we show that the global structure of some real networks is statistically determined by the probability of connections within motifs of size at most 3, once this probability accounts for node degrees. The connectivity profiles of node triples in these networks capture all their local and global properties. This finding impacts methods relying on motif statistical significance, and enriches our understanding of the elementary forces that shape the structure of complex networks.

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

↑