Albert Réka, DasGupta Bhaskar, Hegde Rashmi, Sivanathan Gowri Sangeetha, Gitter Anthony, Gürsoy Gamze, Paul Pradyut, Sontag Eduardo
Department of Physics, Pennsylvania State University, University Park, Pennsylvania 16802, USA.
Phys Rev E Stat Nonlin Soft Matter Phys. 2011 Sep;84(3 Pt 2):036117. doi: 10.1103/PhysRevE.84.036117. Epub 2011 Sep 29.
It is well known that biological and social interaction networks have a varying degree of redundancy, though a consensus of the precise cause of this is so far lacking. In this paper, we introduce a topological redundancy measure for labeled directed networks that is formal, computationally efficient, and applicable to a variety of directed networks such as cellular signaling, and metabolic and social interaction networks. We demonstrate the computational efficiency of our measure by computing its value and statistical significance on a number of biological and social networks with up to several thousands of nodes and edges. Our results suggest a number of interesting observations: (1) Social networks are more redundant that their biological counterparts, (2) transcriptional networks are less redundant than signaling networks, (3) the topological redundancy of the C. elegans metabolic network is largely due to its inclusion of currency metabolites, and (4) the redundancy of signaling networks is highly (negatively) correlated with the monotonicity of their dynamics.
众所周知，生物和社会交互网络具有不同程度的冗余性，尽管目前对于造成这种情况的确切原因尚未达成共识。在本文中，我们为带标签的有向网络引入了一种拓扑冗余度量，该度量形式化、计算效率高，并且适用于各种有向网络，如细胞信号传导网络、代谢网络和社会交互网络。我们通过计算该度量在一些拥有多达数千个节点和边的生物网络和社会网络上的值及其统计显著性，来证明我们的度量的计算效率。我们的结果表明了一些有趣的观察结果：（1）社会网络比其对应的生物网络具有更高的冗余性；（2）转录网络的冗余性低于信号传导网络；（3）秀丽隐杆线虫代谢网络的拓扑冗余性很大程度上归因于其包含的通用代谢物；（4）信号传导网络的冗余性与其动态的单调性高度（负）相关。
