Estimating the algorithmic complexity of stock markets - Archive ouverte HAL Access content directly
Journal Articles Algorithmic Finance Year : 2015

Estimating the algorithmic complexity of stock markets


Randomness and regularities in finance are usually treated in probabilistic terms. In this paper, we develop a different approach in using a non-probabilistic framework based on the algorithmic information theory initially developed by Kolmogorov (1965). We develop a generic method to estimate the Kolmogorov complexity of numeric series. This approach is based on an iterative "regularity erasing procedure" (REP) implemented to use lossless compression algorithms on financial data. The REP is found to be necessary to detect hidden structures, as one should "wash out" well-established financial patterns (i.e. stylized facts) to prevent algorithmic tools from concentrating on these non-profitable patterns. The main contribution of this article is methodological: we show that some structural regularities, invisible with classical statistical tests, can be detected by this algorithmic method. Our final illustration on the daily Dow-Jones Index reveals a weak compression rate, once well- known regularities are removed from the raw data. This result could be associated to a high efficiency level of the New York Stock Exchange, although more effective algorithmic tools could improve this compression rate on detecting new structures in the future.

Dates and versions

hal-01745717 , version 1 (28-03-2018)



Olivier Brandouy, Jean-Paul Delahaye, Lin Ma. Estimating the algorithmic complexity of stock markets. Algorithmic Finance, 2015, 4 (3-4), pp.159 - 178. ⟨10.3233/AF-150052⟩. ⟨hal-01745717⟩
99 View
0 Download



Gmail Facebook Twitter LinkedIn More