Sparse causality network retrieval from short time series

Aste, Tomaso and Di Matteo, T. (2017) Sparse causality network retrieval from short time series. Complexity, 2017 (4518429). ISSN 1076-2787

Preview

Text - Published Version Available under License Creative Commons Attribution. Download (3MB) | Preview

Abstract

We investigate how efficiently a known underlying sparse causality structure of a simulated multivariate linear process can be retrieved from the analysis of time series of short lengths. Causality is quantified from conditional transfer entropy and the network is constructed by retaining only the statistically validated contributions. We compare results from three methodologies: two commonly used regularization methods, Glasso and ridge, and a newly introduced technique, LoGo, based on the combination of information filtering network and graphical modelling. For these three methodologies we explore the regions of time series lengths and model-parameters where a significant fraction of true causality links is retrieved. We conclude that when time series are short, with their lengths shorter than the number of variables, sparse models are better suited to uncover true causality links with LoGo retrieving the true causality network more accurately than Glasso and ridge.

Item Type:	Article
Official URL:	https://www.hindawi.com/journals/complexity/
Additional Information:	© 2017 Tomaso Aste and T. Di Matteo
Divisions:	Systemic Risk Centre
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	08 Jun 2018 13:39
Last Modified:	15 Nov 2024 04:33
Projects:	ES/K002309/1, TD1210
Funders:	Economic and Social Research Council, COST Action, Complexity Science Hub Vienna
URI:	http://eprints.lse.ac.uk/id/eprint/88241

Actions (login required)

View Item