Functional Complexity Measure for Networks
arXiv:cond-mat/0311109 · doi:10.1016/j.physa.2004.01.061
Abstract
We propose a complexity measure which addresses the functional flexibility of networks. It is conjectured that the functional flexibility is reflected in the topological diversity of the assigned graphs, resulting from a resolution of their vertices and a rewiring of their edges under certain constraints. The application will be a classification of networks in artificial or biological systems, where functionality plays a central role.
11 pages, LaTeX2e, 5 PostScript figures
Cited by in corpus (4)
- Characterization of complex networks: A survey of measurements
- Offdiagonal Complexity: A computationally quick complexity measure for graphs and networks
- Information content of colored motifs in complex networks
- Existence of biological uncertainty principle implies that we can never find 'THE' measure for biological complexity