Title
Computationally Efficient Measure Of Topological Redundancy Of Biological And Social Networks
Abstract
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.
Year
DOI
Venue
2011
10.1103/PhysRevE.84.036117
PHYSICAL REVIEW E
DocType
Volume
Issue
Journal
84
3
ISSN
Citations 
PageRank 
2470-0045
6
0.64
References 
Authors
13
8
Name
Order
Citations
PageRank
Réka Albert134730.04
Bhaskar DasGupta255170.14
Anthony Gitter3476.07
Gamze Gursoy460.98
Rashmi Hegde560.64
Pradyut Paul660.64
Gowri Sangeetha Sivanathan760.64
Eduardo D. Sontag83134781.88