Relations between the set-complexity and the structure of graphs and their sub-graphs

Abstract

: We describe some new conceptual tools for the rigorous, mathematical description of the "set-complexity" of graphs. This set-complexity has been shown previously to be a useful measure for analyzing some biological networks, and in discussing biological information in a quantitative fashion. The advances described here allow us to define some significant relationships between the set-complexity measure and the structure of graphs, and of their component sub-graphs. We show here that modular graph structures tend to maximize the set-complexity of graphs. We point out the relationship between modularity and redundancy, and discuss the significance of set-complexity in this regard. We specifically discuss the relationship between complexity and entropy in the case of complete-bipartite graphs, and present a new method for constructing highly complex, binary graphs. These results can be extended to the case of ternary graphs, and to other multi-edge graphs, which are fundamentally more relevant to biological structures and systems. Finally, our results lead us to an approach for extracting high complexity modular graphs from large, noisy graphs with low information content. We illustrate this approach with two examples.

DOI: 10.1186/1687-4153-2012-13

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Ignac2012RelationsBT, title={Relations between the set-complexity and the structure of graphs and their sub-graphs}, author={Tomasz M. Ignac and Nikita A. Sakhanenko and David J. Galas}, booktitle={EURASIP J. Bioinformatics and Systems Biology}, year={2012} }