A New Computationally Efficient Measure of Topological Redundancy of Biological and Social Networks

Autor:	Albert, Reka, DasGupta, Bhaskar, Gitter, Anthony, Gursoy, Gamze, Hegde, Rashmi, Paul, Pradyut, Sivanathan, Gowri Sangeetha, Sontag, Eduardo
Rok vydání:	2011
Předmět:	Physics - Physics and Society Computer Science - Discrete Mathematics Computer Science - Social and Information Networks Mathematics - Dynamical Systems Quantitative Biology - Molecular Networks 68R10 05C85 05C82 05C20 05C40 91D30 92C42 93C15 37N25 J.3 J.4 F.2.2 G.2.1 G.2.2 G.2.3
Zdroj:	Physical Review E, 84 (3), 036117, 2011
Druh dokumentu:	Working Paper
DOI:	10.1103/PhysRevE.84.036117
Popis:	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. Comment: 18 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1108.6113 Zobrazit plný text záznamu View this record from Arxiv