Seeking for simplicity in complex networks
Seeking for simplicity in complex networks
复制标题
DOI：
10.1209/0295-5075/85/48001
复制
发表时间：
2009-02-01
期刊：
影响因子：
1.8
通讯作者：
Rodrigues, F. A.
中科院分区：
文献类型：
--
作者：
Costa, L. da F.;Rodrigues, F. A.
复杂网络可以理解为其连通性属性偏离规则或近规则图的连通性属性的图，规则或近规则图被理解为“简单”。虽然大量的注意力，到目前为止，致力于复杂的网络已经适当地驱动这些结构的“复杂”的性质，在这项工作中，我们解决他们的简单性的识别。其基本思想是寻找具有相似度量的子图。这种方法为补充网络的特征铺平了道路，包括表明蛋白质-蛋白质相互作用网络以及在较小程度上互联网可能会随着时间的推移变得越来越简单的结果。版权所有（C）EPLA，2009
Complex networks can be understood as graphs whose connectivity properties deviate from those of regular or near-regular graphs, which are understood as being "simple". While a great deal of the attention so far dedicated to complex networks has been duly driven by the "complex" nature of these structures, in this work we address the identification of their simplicity. The basic idea is to seek for subgraphs whose nodes exhibit similar measurements. This approach paves the way for complementing the characterization of networks, including results suggesting that the protein-protein interaction networks, and to a lesser extent also the Internet, may be getting simpler over time. Copyright (C) EPLA, 2009