股票市场的数学复杂性估计
Estimating the Algorithmic Complexity of Stock Markets
摘要:
金融中的随机性和随机性通常用概率的术语来处理。在本文中,我们开发了一个完全不同的方法,在使用非概率框架的基础上,最初由Kolmogorov(1965)开发的算法信息理论。我们提出了这个理论的一些要素,并说明为什么它特别与金融相关,并可能与经济学的其他子领域相关。我们开发了一个通用的方法来估计Kolmogorov复杂性的数值序列。这种方法是基于一个迭代的“规律性擦除过程”,实现使用无损压缩算法对金融数据。例子提供了模拟和现实世界的金融时间序列。本文的贡献是双重的。第一个是方法:我们表明,一些结构性的,不可见的经典统计检验,可以检测到这种算法的方法。第二个是在每日道琼斯指数的插图表明,除了几个众所周知的泡沫,隐藏的结构可能在这个指数仍然有待确定。
英文摘要:
Randomness and regularities in Finance are usually treated in probabilistic terms. In this paper, we develop a completely different approach in using a non-probabilistic framework based on the algorithmic information theory initially developed by Kolmogorov (1965). We present some elements of this theory and show why it is particularly relevant to Finance, and potentially to other sub-fields of Economics as well. We develop a generic method to estimate the Kolmogorov complexity of numeric series. This approach is based on an iterative "regularity erasing procedure" implemented to use lossless compression algorithms on financial data. Examples are provided with both simulated and real-world financial time series. The contributions of this article are twofold. The first one is methodological : we show that some structural regularities, invisible with classical statistical tests, can be detected by this algorithmic method. The second one consists in illustrations on the daily Dow-Jones Index suggesting that beyond several well-known regularities, hidden structure may in this index remain to be identified.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。