Estimating the Complexity Function of Financial Time series: An Estimation Based on Predictive Stochastic Complexity

Using a measure of predictive stochastic complexity, this paper examines the complexity of two types of financial time series of several Pacific Rim countries, including 11 series on stock returns and 9 series on exchange-rate returns. Motivated by Chaitin's application of Kolmogorov complexity to the definition of "Life," we examine complexity as a function of sample size and call it the complexity function. According to Chaitin (1979), if a time series is truly random, then its complexity should increase at the same rate as the sample size, which means one would not gain or lose any information by fine tuning the sample size. Geometrically, this means that the complexity function is a 45 degree line. Based on this criterion, we estimate the complexity function for 20 financial time series and their iid normal surrogates. It is found that, while the complexity functions of all surrogates lie near to the 45 degree line, those of the financial time series are above it, except for the Indonesian stock return. Therefore, while the complexity of most financial time series is initially low compared to pseudo random time series, it gradually catches up as sample size increases. The catching-up effect indicates a short-lived property of financial signals. This property may lend support to the hypothesis that financial time series are not random but are composed of a sequence of structures whose birth and death can be characterized by a jump process with an embedded Markov chain. The significance of this empirical finding is also discussed in light of the recent progress in financial econometrics. Further exploration of this property may help data miners to select moderate sample sizes in either their data-preprocessing procedures or active-learning designs.

[1]  Model selection, stochastic complexity and badness amplification , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[2]  Michele Marchesi,et al.  Testing for Non-Linear Structure in an Artificial Financial Market , 2001 .

[3]  J. Rissanen Stochastic Complexity and Modeling , 1986 .

[4]  G. J. Chaltin,et al.  To a mathematical definition of 'life' , 1970, SIGA.

[5]  L. Gerencser,et al.  Applications of stochastic complexity and related computational experiments , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[6]  Carsten Lanquillon Dynamic aspects in neural classification , 1999, Intell. Syst. Account. Finance Manag..

[7]  A. N. Kolmogorov Combinatorial foundations of information theory and the calculus of probabilities , 1983 .

[8]  G. Chaitin,et al.  TOWARD A MATHEMATICAL DEFINITION OF “ LIFE ” , 1979 .

[9]  Lennart Ljung,et al.  System Identification: Theory for the User , 1987 .

[10]  C. Haefke,et al.  Forecasting Stock Market Averages to Enhance Profitable Trading Strategies , 1995 .

[11]  Ming Li,et al.  Kolmogorov Complexity and its Applications , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[12]  Carsten Lanquillon,et al.  Evaluating Usefulness for Dynamic Classification , 1998, KDD.

[13]  Mark H. A. Davis,et al.  Recursive Order Estimation of Autoregressions Without Bounding the Model Set , 1991 .

[14]  Jorma Rissanen,et al.  Stochastic Complexity in Statistical Inquiry , 1989, World Scientific Series in Computer Science.

[15]  Adrian Pagan,et al.  The econometrics of financial markets , 1996 .

[16]  Shu-Heng Chen,et al.  Evolutionary Computation in Financial Engineering: A Roadmap of GAs and GP , 1998 .

[17]  Chung-Ming Kuan,et al.  Forecasting exchange rates using feedforward and recurrent neural networks , 1992 .

[18]  E. Hannan,et al.  Recursive estimation of autoregressions , 1989 .

[19]  L. Gerencser Asymptotics of predictive stochastic complexity , 1991, DCC 1991.

[20]  陳樹衡 Modeling Volatility with Genetic Programming: A First Report , 1998 .