The following text from the website of the Complex Systems Society addresses the question "What are Complex Systems?" and perfectly describes the main concept that underlies this project: "The most famous quote about Complex Systems comes from Aristole who said that 'The whole is more than the sum of its parts'. Complex systems are systems where the collective behavior of their parts entails emergence of properties that can hardly, if not at all, be inferred from properties of the parts."

We propose a geometric formalization of this concept. The complexity of a system is quantified as its deviation from the sum of its parts which is interpreted as a geometric projection. While our initial approach was based on information geometry only, the current study also applies the theory of hierarchical and, in particular, graphical models and causality theory based on Bayesian networks. This allows for an integrated analysis of the interplay of causal interactions, stochastic dependence, and complexity.

Relations to and among other approaches to complexity are studied. We are particularly interested in understanding how algorithmic notions of complexity correspond to probabilistic ones, similar to the well-known close connection between algorithmic complexity and Shannon entropy. In that context, various complexity measures for stochastic processes are related to corresponding complexities of typical process realizations, thereby identifying similarities of seemingly different concepts.

Related Group Publications:
Ay, Olbrich, Bertschinger, Jost. A Geometric Approach to Complexity, Chaos 2011, submitted.
E. Olbrich, N. Bertschinger, N. Ay and J. Jost How should complexity scale with system size?, Eur. Phys. J. B 63 (2008), 407-415. [pdf]
T. Kahle, E.Olbrich, J. Jost, N. Ay Complexity Measures from Interaction Structures, Phys. Rev. E 79, 026201 (2009) [pdf]
Wolfgang Löhr: Properties of the Statistical Complexity Functional and Partially Deterministic HMMs, Entropy, 11 (3):385-401, 2009. [pdf]
Wolfgang Löhr, Nihat Ay, On the Generative Nature of Prediction, Advances in Complex Systems, 12 (2):169-194, 2009. [pdf]
N. Ay, M. Müller, A. Szkola, Effective complexity of stationary process realisations, in preparation
N. Ay, M. Müller, A. Szkola, Effective complexity and its relation to logical depth
arXiv:0810.5663, submitted to IEEE Trans. Inf. Theory (2008) [pdf] (arxiv) [pdf] (SFI)
N. Ay, E. Olbrich, N. Bertschinger, J. Jost. A Unifying Framework for Complexity Measures of Finite Systems.
Proceedings of ECCS'06. Santa Fe Insitute Working Paper 06-08-028. [pdf]
E. Olbrich, T. Kahle, N. Bertschinger, N. Ay, J. Jost. Quantifying structure in networks.
Proceedings of ECCS 2009, in press.
W. Löhr, N. Ay, Non-Sufficient Memories that are Sufficient for Prediction.
Proceedings of Complex'2009, Shanghai. Volume 4 (I) of LNICST, pp. 265-276. Springer, 2009. [pdf]