Skip to Main content Skip to Navigation
Journal articles

Estimating the algorithmic complexity of stock markets

Abstract : 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.
Complete list of metadata
Contributor : CRIStAL Equipe SMAC Connect in order to contact the contributor
Submitted on : Wednesday, March 28, 2018 - 2:50:00 PM
Last modification on : Tuesday, June 14, 2022 - 10:38:41 AM

Links full text



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



Record views