Ordered cyclic motifs contribute to dynamic stability in biological and engineered networks
Representation and analysis of complex biological and engineered systems as directed networks is useful for understanding their global structure/function organization. Enrichment of network motifs, which are over-represented subgraphs in real networks, can be used for topological analysis. Because c...
Saved in:
Published in: | Proceedings of the National Academy of Sciences - PNAS Vol. 105; no. 49; pp. 19235 - 19240 |
---|---|
Main Authors: | , , , , , |
Format: | Journal Article |
Language: | English |
Published: |
United States
National Academy of Sciences
09-12-2008
National Acad Sciences |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Representation and analysis of complex biological and engineered systems as directed networks is useful for understanding their global structure/function organization. Enrichment of network motifs, which are over-represented subgraphs in real networks, can be used for topological analysis. Because counting network motifs is computationally expensive, only characterization of 3- to 5-node motifs has been previously reported. In this study we used a supercomputer to analyze cyclic motifs made of 3-20 nodes for 6 biological and 3 technological networks. Using tools from statistical physics, we developed a theoretical framework for characterizing the ensemble of cyclic motifs in real networks. We have identified a generic property of real complex networks, antiferromagnetic organization, which is characterized by minimal directional coherence of edges along cyclic subgraphs, such that consecutive links tend to have opposing direction. As a consequence, we find that the lack of directional coherence in cyclic motifs leads to depletion in feedback loops, where the number of nodes affected by feedback loops appears to be at a local minimum compared with surrogate shuffled networks. This topology provides more dynamic stability in large networks. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 Author contributions: A.M., G.A.C., R.I., and G.S. designed research; A.M., G.A.C., J.W., A.R.R., R.I., and G.S. performed research; A.M., G.A.C., R.I., and G.S. analyzed data; and A.M., G.A.C., J.W., R.I., and G.S. wrote the paper. Edited by Charles R. Cantor, Sequenom, Inc., San Diego, CA, and approved September 29, 2008 1A.M. and G.A.C contributed equally this work. |
ISSN: | 0027-8424 1091-6490 |
DOI: | 10.1073/pnas.0805344105 |