Here are the slides for the talk, given with a focus on applications of these results to time series analysis.
Given a time series, we can extract a collection of permutations of a fixed length by sliding a window across our data and recording the relative order of the values in the window. It is known that the distribution of permutations that appear conveys information about the complexity of the time series; one commonly studied measure is permutation entropy. Interestingly, in the specific case that the time series is defined by iterating a piecewise monotone map of the interval, there are forbidden permutations. Moreover, the number of allowed permutations encodes the system’s topological entropy, a measure of complexity that is itself closely related to the permutation structure of periodic points.
Using permutation-based measures of entropy in time series analysis as motivation, I will talk about some interesting problems that arise at this intersection of combinatorics, dynamics and time series analysis.
Here are slides for the talk.
Here are the slides from this seminar talk.