Talk by Dr. Bree Cummins (Mathematical Sciences, MSU)

10/10/2019  Wilson Hall 1-144  3:10-4:00pm



Experimental time series provide an informative window into the underlying dynamical system, and the timing of the extrema of a time series contains information about its structure. However, the time series often contain significant measurement error. We describe a method for characterizing a time series for any assumed level of measurement error by a sequence of intervals, each of which is guaranteed to contain an extremum for any function that approximates the time series.  Based on the merge tree of a continuous function, we define a new object called the normalized branch decomposition, which allows us to compute intervals for any noise level. We show that there is a well-defined total order on these intervals for a single time series, and that it is naturally extended to a partial order across a collection of time series comprising a dataset. We use the order of the extracted intervals in two applications. First, the partial order describing a single dataset can be used to pattern match against switching model output (DSGRN software), which allows the rejection of a network model. Second, the comparison between graph distances of the partial orders of different datasets can be used to quantify similarity between biological replicates.

This is joint work with Eric Berry, Riley Nerem, Tomas Gedeon, Lauren Smith, and Steve Haase.