A New Computationally Efficient Measure of Topological Redundancy of Biological and Social Networks
arXiv:1108.6113 · doi:10.1103/PhysRevE.84.036117
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, 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.
18 pages
References in corpus (12)
- Statistical mechanics of complex networks
- Assortative mixing in networks
- The large-scale organization of metabolic networks
- Random graphs with arbitrary degree distributions and their applications
- Mixing patterns in networks
- Community detection in complex networks using Extremal Optimization
- Self-similar community structure in organisations
- Dynamical and correlation properties of the Internet
- Community Structure in Jazz
- Exploring networks with traceroute-like probes: theory and simulations
- Network Archaeology: Uncovering Ancient Networks from Present-day Interactions
- On Strongly Connected Digraphs with Bounded Cycle Length
Cited by in corpus (4)
- Topological implications of negative curvature for biological and social networks
- Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks
- Reproducibility and FAIR Principles: The Case of a Segment Polarity Network Model
- Finding Influential Cores via Normalized Ricci Flows in Directed and Undirected Hypergraphs with Applications