pith. sign in

arxiv: cond-mat/0311109 · v1 · submitted 2003-11-05 · ❄️ cond-mat

Functional Complexity Measure for Networks

classification ❄️ cond-mat
keywords functionalnetworkscomplexityflexibilitymeasureaddressesapplicationartificial
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.