title: A geometric approach to complexity.
abstract: We develop a geometric approach to complexity based on the principle that complexity requires interactions at different scales of description. Complex systems are more than the sum of their parts of any size and not just more than the sum of their elements. Using information geometry, we therefore analyze the decomposition of a system in terms of an interaction hierarchy. In mathematical terms, we present a theory of complexity measures for finite random fields using the geometric framework of hierarchies of exponential families. Within our framework, previously proposed complexity measures find their natural place and gain a new interpretation.
authors.affiliation: Max Planck Institute for Mathematics in the Sciences, Inselstrasse 22, 04103 Leipzig, Germany. nay@mis.mpg.de
authors.forename: Nihat
authors.initials: N
authors.lastname: Ay
authors.forename: Eckehard
authors.initials: E
authors.lastname: Olbrich
authors.forename: Nils
authors.initials: N
authors.lastname: Bertschinger
authors.forename: Jürgen
authors.initials: J
authors.lastname: Jost