Periodic measures and Wasserstein distance for analysing periodicity of time series datasets

被引:2
作者
Feng, Chunrong [1 ]
Liu, Yujia [2 ]
Zhao, Huaizhong [1 ,2 ]
机构
[1] Univ Durham, Dept Math Sci, Durham DH1 3LE, England
[2] Shandong Univ, Res Ctr Math & Interdisciplinary Sci, Qingdao 266237, Peoples R China
来源
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION | 2023年 / 120卷
基金
英国工程与自然科学研究理事会;
关键词
Random periodic processes; Ergodicity; Periodic measures; Law of large numbers; Dataset; Wasserstein distance; SYSTEMS;
D O I
10.1016/j.cnsns.2023.107166
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this article, we establish the probability foundation of the periodic measure approach in analysing periodicity of a dataset. It is based on recent work of random periodic processes. While random periodic paths provide a pathwise model for time series datasets with a periodic pattern, their law is a periodic measure and gives a statistical description and the ergodic theory offers a scope of statistical analysis. The connection of a sample path and the periodic measure is revealed in the law of large numbers (LLN). We prove first the period is actually a deterministic number and then for discrete processes, Bezout's identity comes in naturally in the LLN along an arithmetic sequence of an arbitrary increment. The limit is a periodic measure whose period is equal to the greatest common divisor between the test period and the true period of the random periodic process. This leads to a new scheme of detecting random periodicity of a dataset and finding its period, as an alternative to the Discrete Fourier Transformation (DFT) and periodogram approach. We find that in some situations, the classical method does not work robustly, but the new one can work efficiently. We prove that the periodicity is quantified by the Wasserstein distance, in which the convergence of empirical distributions is established.(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页数:31
相关论文
共 40 条