Transcripts: An algebraic approach to coupled time series

Abstract

Ordinal symbolic dynamics is based on ordinal patterns. Its tools include permutation entropy (in metric and topological versions), forbidden patterns, and a number of mathematical results that make this sort of symbolic dynamics appealing both for theoreticians and practitioners. In particular, ordinal symbolic dynamics is robust against observational noise and can be implemented with low computational cost, which explains its increasing popularity in time series analysis. In this paper, we study the perhaps less exploited aspect so far of ordinal patterns: their algebraic structure. In a first part, we revisit the concept of transcript between two symbolic representations, generalize it to N representations, and derive some general properties. In a second part, we use transcripts to define two complexity indicators of coupled dynamics. Their performance is tested with numerical and real world data.