An algorithmic look at financial volatility
Summary: In this paper, we attempt to give an algorithmic explanation to volatility clustering, one of the most exploited stylized facts in finance. Our analysis with daily data from five exchanges shows that financial volatilities follow Levin's universal distribution \textit{W. Kirchherr} et al. [Math. Intell. 19, No. 4, 7--15 (1997; Zbl 0934.01007)] once transformed into equally proportional binary strings. Frequency ranking of binary trading weeks coincides with that of their Kolmogorov complexity estimated by the second author and \textit{H. Zenil} [Appl. Math. Comput. 219, No. 1, 63--77 (2012; Zbl 1448.68250)]. According to Levin's universal distribution, large (resp. small) volatilities are more likely to be followed by large (resp. small) ones since simple trading weeks such as ``00000 or ``11111 are much more frequently observed than complex ones such as ``10100 or ``01011. Thus, volatility clusters may not be attributed to behavioral or micro-structural assumptions but to the complexity discrepancy between finite strings. This property of financial data could be at the origin of volatility autocorrelation, though autocorrelated volatilities simulated from Generalized Auto-Regressive Conditional Heteroskedacity (hereafter GARCH) cannot be transformed into universally distributed binary weeks.
- Estimating the algorithmic complexity of stock markets
- Algorithmic complexity of real financial markets
- Volatility clustering in financial markets: empirical facts and agent-based models
- On a universal mechanism for long-range volatility correlations
- VOLATILITY CLUSTERING IN FINANCIAL MARKETS: A MICROSIMULATION OF INTERACTING AGENTS
- Algorithmic randomness and complexity.
- An introduction to Kolmogorov complexity and its applications
- Analysis of financial time series
- Autoregressive Conditional Heteroscedasticity with Estimates of the Variance of United Kingdom Inflation
- Empirical properties of asset returns: stylized facts and statistical issues
- Generalized autoregressive conditional heteroscedasticity
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
- Stationarity of GARCH processes and of some nonnegative time series
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The miraculous universal distribution
- Special issue on algorithms in computational finance
- Understand volatility of algorithmic stablecoin: modeling, verification and empirical analysis
- Estimating the algorithmic complexity of stock markets
- An Overview of the Determinants of Financial Volatility: An Explanation of Measuring Techniques
- scientific article; zbMATH DE number 5198651 (Why is no real title available?)
This page was built for publication: An algorithmic look at financial volatility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1712041)
