Nonparametric Statistical Inference for Ergodic Processes

  title={Nonparametric Statistical Inference for Ergodic Processes},
  author={Daniil Ryabko and B. Ya. Ryabko},
  journal={IEEE Transactions on Information Theory},
  • D. RyabkoB. Ryabko
  • Published 3 April 2008
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
In this work, a method for statistical analysis of time series is proposed, which is used to obtain solutions to some classical problems of mathematical statistics under the only assumption that the process generating the data is stationary ergodic. Namely, three problems are considered: goodness-of-fit (or identity) testing, process classification, and the change point problem. For each of the problems a test is constructed that is asymptotically accurate for the case when the data is… 


It is shown how to construct asymptotically consistent efficient algorithms for various statistical problems concerning stationary ergodic time series based on empirical estimates of the distributional distance.

Asymptotic Nonparametric Statistical Analysis of Stationary Time Series

  • D. Ryabko
  • Computer Science, Mathematics
    SpringerBriefs in Computer Science
  • 2019
The main objective in this area of research, the objective which is only partially attained, is to understand what is possible and what is not possible to do for stationary time series.

Clustering processes

  • D. Ryabko
  • Computer Science, Mathematics
  • 2010
A very natural asymptotic notion of consistency is proposed, and simple consistent algorithms exist, under most general non-parametric assumptions, which generalizes such classical statistical problems as homogeneity testing and process classification.

Clustering piecewise stationary processes

  • A. KhaleghiD. Ryabko
  • Computer Science
    2020 IEEE International Symposium on Information Theory (ISIT)
  • 2020
Efficient algorithms are proposed which are shown to be asymptotically consistent without any additional assumptions beyond piecewise stationarity in the context of clustering.

Asymptotically consistent estimation of the number of change points in highly dependent time series

It turns out that in this formulation change point estimation can be reduced to time series clustering and an algorithm is proposed that finds the number of change points and locates the changes and is shown to be asymptotically consistent.

Nonparametric multiple change point estimation in highly dependent time series

Confidence sets in time-series filtering

  • B. RyabkoD. Ryabko
  • Computer Science, Mathematics
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
The problem of filtering of finite-alphabet stationary ergodic time series is considered. A method for constructing a confidence set for the (unknown) signal is proposed, such that the resulting set

Inferring the residual waiting time for binary stationary time series

A sequence of stopping times and universal estimators for these quantities which are pointwise consistent for all ergodic binary stationary processes are presented.

A consistent clustering-based approach to estimating the number of change-points in highly dependent time-series

It is shown that a consistent clustering method may be used to estimate the number of change points, under the additional constraint that the correct number of process distributions that generate the data is provided.

Consistent Algorithms for Clustering Time Series

A natural notion of consistency is proposed for the problem of clustering, and it is shown that there are simple, computationally efficient algorithms that are asymptotically consistent under extremely weak assumptions on the distributions that generate the data.



On hypotheses testing for ergodic processes

This work addresses three problems of statistical analysis of time series: goodness-of-fit testing, process discrimination, and the change point problem by constructing a test that is asymptotically accurate for the case when the data is generated by stationary ergodic processes.

Universal Codes as a Basis for Time Series Testing

Hypothesis testing for families of ergodic processes

General sufficient conditions for the discernibility of two families of stationary ergodic processes are derived. The conditions involve the weak topology for stationary processes. They are analogous

An algorithm for detecting a change in a stochastic process

It is proved that the proposed test for detecting a change from one given stationary and ergodic stochastic process to another such process is asymptotically optimal in a mathematically precise sense.

Limitations on intermittent forecasting

Testing composite hypotheses about discrete-valued stationary processes

  • D. Ryabko
  • Mathematics
    2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)
  • 2010
Given a discrete-valued sample X1,...,Xn we wish to test whether it was generated by a stationary ergodic process belonging to a family H0, or it was generated by a stationary ergodic process outside

Limits to Consistent On-Line Forecasting for Ergodic Time Series

The contributions in this study are all negative, showing that various plausible prediction problems are unsolvable, or in other cases, are not solvable by predictors which are known to be consistent when mixing conditions hold.

How Sampling Reveals a Process

A series of observations {ξ 1 , ξ 2 , ξ 3 ,...} is presented to us and at each time n, when we have observed the first n of them, we are called upon to give our guess for what stochastic process

Detection of multiple changes in a sequence of dependent variables