Next Article in Journal
Pricing Strategies of Logistics Distribution Services for Perishable Commodities
Previous Article in Journal
Weak Fault Detection of Tapered Rolling Bearing Based on Penalty Regularization Approach
Previous Article in Special Issue
Intelligent Dynamic Backlash Agent: A Trading Strategy Based on the Directional Change Framework
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(11), 185; https://doi.org/10.3390/a11110185

An Algorithmic Look at Financial Volatility

1
Department of Finance, University of Lille, 59043 Lille, France
2
Department of Computer Sciences, University of Lille, 59650 Villeneuve d’ascq, France
*
Author to whom correspondence should be addressed.
Received: 13 September 2018 / Revised: 29 October 2018 / Accepted: 4 November 2018 / Published: 13 November 2018
(This article belongs to the Special Issue Algorithms in Computational Finance)
Full-Text   |   PDF [306 KB, uploaded 22 November 2018]   |  

Abstract

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 Kirchherr et al. (1997) once transformed into equally proportional binary strings. Frequency ranking of binary trading weeks coincides with that of their Kolmogorov complexity estimated by Delahaye et al. (2012). 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. View Full-Text
Keywords: kolmogorov complexity; volatility clustering; universal distribution kolmogorov complexity; volatility clustering; universal distribution
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Ma, L.; Delahaye, J.-P. An Algorithmic Look at Financial Volatility. Algorithms 2018, 11, 185.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top