No description available.

Cellular automata (CA) are fully discrete dynamical systems. Space is represented by a regular lattice while time proceeds in finite steps. Each cell of the lattice is assigned a state, chosen from a finite set of "values". The states of the cells are updated synchronously according to a local interaction rule, whereby each cell obeys the same rule. Formal definitions of deterministic, probabilistic and lattice-gas CA are presented. With the so-called mean-field approximation any CA model can be transformed into a deterministic model with continuous state space. CA rules, which characterise movement, single-component growth and many-component interactions are designed and explored. It is demonstrated that lattice-gas CA offer a suitable tool for modelling such processes and for analysing them by means of the corresponding mean-field approximation. In particular two types of many-component interactions in lattice-gas CA models are introduced and studied. The first CA captures in abstract form the essential ideas of activator-inhibitor interactions of biological systems. Despite of the automaton´s simplicity, self-organised formation of stationary spatial patterns emerging from a randomly perturbed uniform state is observed (Turing pattern). In the second CA, rules are designed to mimick the dynamics of excitable systems. Spatial patterns produced by this automaton are the self-organised formation of spiral waves and target patterns. Properties of both pattern formation processes can be well captured by a linear stability analysis of the corresponding nonlinear mean-field (Boltzmann) equations.

This thesis investigates time series analysis tools for prediction, as well as detection and characterization of dependencies, informed by dynamical systems theory. Emphasis is placed on the role of delays with respect to information processing in dynamical systems, as well as with respect to their effect in causal interactions between systems. The three main features that characterize this work are, first, the assumption that time series are measurements of complex deterministic systems. As a result, functional mappings for statistical models in all methods are justified by concepts from dynamical systems theory. To bridge the gap between dynamical systems theory and data, differential topology is employed in the analysis. Second, the Bayesian paradigm of statistical inference is used to formalize uncertainty by means of a consistent theoretical apparatus with axiomatic foundation. Third, the statistical models are strongly informed by modern nonlinear concepts from machine learning and nonparametric modeling approaches, such as Gaussian process theory. Consequently, unbiased approximations of the functional mappings implied by the prior system level analysis can be achieved. Applications are considered foremost with respect to computational neuroscience but extend to generic time series measurements.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

This thesis consists of two main parts. First of all, the condition number of rectangular Vandermonde matrices with nodes on the complex unit circle is studied. The first time quantitative bounds for the extreme singular values are proven in the multivariate setting and when nodes of the Vandermonde matrix form clusters. In the second part, an optimized presentation of the deterministic stability analysis of the subspace method ESPRIT is given and results from the first part are applied.