Information needs to be appropriately encoded to be reliably transmitted over physical media. Similarly, neurons have their own codes to convey information in the brain. Even though it is well-known that neurons exchange information using a pool of several protocols of spatio-temporal encodings, the suitability of each code and their performance as a function of network parameters and external stimuli is still one of the great mysteries in neuroscience.
View Article and Find Full Text PDFIn a causal world the direction of the time arrow dictates how past causal events in a variable X produce future effects in Y. X is said to cause an effect in Y, if the predictability (uncertainty) about the future states of Y increases (decreases) as its own past and the past of X are taken into consideration. Causality is thus intrinsic dependent on the observation of the past events of both variables involved, to the prediction (or uncertainty reduction) of future event of the other variable.
View Article and Find Full Text PDFWhen the state of the whole reaction network can be inferred by just measuring the dynamics of a limited set of nodes the system is said to be fully observable. However, as the number of all possible combinations of measured variables and time derivatives spanning the reconstructed state of the system exponentially increases with its dimension, the observability becomes a computationally prohibitive task. Our approach consists in computing the observability coefficients from a symbolic Jacobian matrix whose elements encode the linear, nonlinear polynomial or rational nature of the interaction among the variables.
View Article and Find Full Text PDFThis work uses an information-based methodology to infer the connectivity of complex systems from observed time-series data. We first derive analytically an expression for the Mutual Information Rate (MIR), namely, the amount of information exchanged per unit of time, that can be used to estimate the MIR between two finite-length low-resolution noisy time-series, and then apply it after a proper normalization for the identification of the connectivity structure of small networks of interacting dynamical systems. In particular, we show that our methodology successfully infers the connectivity for heterogeneous networks, different time-series lengths or coupling strengths, and even in the presence of additive noise.
View Article and Find Full Text PDFObservability is a very useful concept for determining whether the dynamics of complicated systems can be correctly reconstructed from a single (univariate or multivariate) time series. When the governing equations of dynamical systems are high-dimensional and/or rational, analytical computations of observability coefficients produce large polynomial functions with a number of terms that become exponentially large with the dimension and the nature of the system. In order to overcome this difficulty, we introduce here a symbolic observability coefficient based on a symbolic computation of the determinant of the observability matrix.
View Article and Find Full Text PDF