SearcharxivSearch

arXiv · comp-gas/9507003

Estimating Predictability: Redundancy and Surrogate Data Method

Abstract

A method for estimating theoretical predictability of time series is presented, based on information-theoretic functionals---redundancies and surrogate data technique. The redundancy, designed for a chosen model and a prediction horizon, evaluates amount of information between a model input (e.g., lagged versions of the series) and a model output (i.e., a series lagged by the prediction horizon from the model input) in number of bits. This value, however, is influenced by a method and precision of redundancy estimation and therefore it is a) normalized by maximum possible redundancy (given by the precision used), and b) compared to the redundancies obtained from two types of the surrogate data in order to obtain reliable classification of a series as either unpredictable or predictable. The type of predictability (linear or nonlinear) and its level can be further evaluated. The method is demonstrated using a numerically generated time series as well as high-frequency foreign exchange data and the theoretical predictability is compared to performance of a nonlinear predictor.

Explore related subjects

Keep this discovery

BibTeXRIS

M. Paluš, L. Pecen, D. Pivka. 1995-07-31. Estimating Predictability: Redundancy and Surrogate Data Method. https://arxiv.org/abs/comp-gas/9507003

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Exact results for deterministic cellular automata traffic models

We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to a well known lattice path counting problem. Assuming infinite lattice size and random initial configuration, the flow can be expressed in terms of generalized hypergeometric function. We show that the steady state limit agrees with previously published results.

comp-gas

A new discrete velocity method for Navier-Stokes equations

The relation between Latttice Boltzmann Method, which has recently become popular, and the Kinetic Schemes, which are routinely used in Computational Fluid Dynamics, is explored. A new discrete velocity model for the numerical solution of the Navier-Stokes equations for incompressible fluid flow is presented by combining both the approaches. The new scheme can be interpreted as a pseudo-compressibility method and, for a particular choice of parameters, this interpretation carries over to the Lattice Boltzmann Method.

comp-gas

Construction of Molecular Dynamics Like Cellular Automata Models for Simulation of Compressible Fluid Dynamic Systems

This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results indicate, the attempt is successful. A systematic method for constructing cellular automata models of fluid dynamic systems is discovered and proposed following a review of the existing developments. The considerations required for constructing such models for fluid dynamic systems consisting of particles with arbitrary interaction potentials and existing over arbitrary spatial lattices are outlined. The method is illustrated by constructing a model for simulation of systems of particles moving with unit speed along the links of an underlying square spatial lattice. Using this model, two two-dimensional systems are simulated and studied for a number of model and system parameters. For almost all the model and system parameters, the results are found to be in complete agreement with the available theoretical predictions. For some model parameters, results show (expected) departure from theoretical predictions which is explained.

comp-gas