Barzel Baruch, Biham Ofer
Racah Institute of Physics, The Hebrew University, Jerusalem, Israel.
Phys Rev E Stat Nonlin Soft Matter Phys. 2009 Oct;80(4 Pt 2):046104. doi: 10.1103/PhysRevE.80.046104. Epub 2009 Oct 7.
Networks are useful for describing systems of interacting objects, where the nodes represent the objects and the edges represent the interactions between them. The applications include chemical and metabolic systems, food webs as well as social networks. Lately, it was found that many of these networks display some common topological features, such as high clustering, small average path length (small-world networks), and a power-law degree distribution (scale-free networks). The topological features of a network are commonly related to the network's functionality. However, the topology alone does not account for the nature of the interactions in the network and their strength. Here, we present a method for evaluating the correlations between pairs of nodes in the network. These correlations depend both on the topology and on the functionality of the network. A network with high connectivity displays strong correlations between its interacting nodes and thus features small-world functionality. We quantify the correlations between all pairs of nodes in the network, and express them as matrix elements in the correlation matrix. From this information, one can plot the correlation function for the network and to extract the correlation length. The connectivity of a network is then defined as the ratio between this correlation length and the average path length of the network. Using this method, we distinguish between a topological small world and a functional small world, where the latter is characterized by long-range correlations and high connectivity. Clearly, networks that share the same topology may have different connectivities, based on the nature and strength of their interactions. The method is demonstrated on metabolic networks, but can be readily generalized to other types of networks.
网络对于描述相互作用的对象系统很有用,其中节点代表对象,边代表它们之间的相互作用。其应用包括化学和代谢系统、食物网以及社交网络。最近发现,这些网络中的许多都呈现出一些共同的拓扑特征,比如高聚类性、小平均路径长度(小世界网络)以及幂律度分布(无标度网络)。网络的拓扑特征通常与网络的功能相关。然而,仅拓扑结构并不能解释网络中相互作用的性质及其强度。在此,我们提出一种评估网络中节点对之间相关性的方法。这些相关性既取决于拓扑结构,也取决于网络的功能。具有高连通性的网络在其相互作用的节点之间显示出强相关性,因此具有小世界功能。我们对网络中所有节点对之间的相关性进行量化,并将它们表示为相关矩阵中的矩阵元素。根据这些信息,可以绘制网络的相关函数并提取相关长度。然后将网络的连通性定义为该相关长度与网络平均路径长度之比。使用这种方法,我们区分拓扑小世界和功能小世界,后者的特征是长程相关性和高连通性。显然,基于其相互作用的性质和强度,具有相同拓扑结构的网络可能具有不同的连通性。该方法在代谢网络上得到了验证,但可以很容易地推广到其他类型的网络。