Skip to main content
Log in

Discrimination Between B-Processes is Impossible

  • Published:
Journal of Theoretical Probability Aims and scope Submit manuscript

Abstract

Two series of binary observations x 1,x 1,… and y 1,y 2,… are presented: x n and y n are given at each time n∈ℕ. It is assumed that the sequences are generated independently of each other by two B-processes. The question of interest is whether the sequences represent a typical realization of two different processes or of the same one. It is demonstrated that this is impossible to decide, in the sense that every discrimination procedure is bound to err with non-negligible frequency when presented with sequences from some B-processes. This contrasts with earlier positive results on B-processes, in particular, those showing that there are consistent \(\bar{d}\) -distance estimates for this class of processes, and on ergodic processes, in particular, those establishing consistent change point estimates.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Adams, T.M., Nobel, A.B.: On density estimation from ergodic processes. Ann. Probab. 26(2), 794–804 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Gyorfi, L., Morvai, G., Yakowitz, S.: Limits to consistent on-line forecasting for ergodic time series. IEEE Trans. Inf. Theory 44(2), 886–892 (1998)

    Article  MathSciNet  Google Scholar 

  3. Gray, R.: Probability, Random Processes, and Ergodic Properties. Springer, Berlin (1988)

    MATH  Google Scholar 

  4. Lehmann, E.L.: Testing Statistical Hypotheses. Springer, Berlin (1986)

    MATH  Google Scholar 

  5. Morvai, G., Weiss, B.: On classifying processes. Bernoulli 11(3), 523–532 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Nobel, A.B.: Hypothesis testing for families of ergodic processes. Bernoulli 12(2), 251–269 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ornstein, D.S.: Ergodic Theory, Randomness, and Dynamical Systems. Yale Mathematical Monographs, vol. 5. Yale Univ. Press, New Haven (1974)

    MATH  Google Scholar 

  8. Ornstein, D.S., Shields, P.: The \(\bar{d}\) -recognition of processes. Adv. Math. 104, 182–224 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ornstein, D.S., Weiss, B.: How sampling reveals a process. Ann. Probab. 18(3), 905–930 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ryabko, B.: Prediction of random sequences and universal coding. Probl. Inf. Transm. 24, 87–96 (1988)

    MATH  MathSciNet  Google Scholar 

  11. Ryabko, B., Astola, J., Gammerman, A.: Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series. Theor. Comput. Sci. 359, 440–448 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  12. Ryabko, D., Ryabko, B.: Nonparametric statistical inference for ergodic processes. IEEE Trans. Inf. Theory (to appear)

  13. Ryabko, D., Ryabko, B.: On hypotheses testing for ergodic processes. In: Proceedings of IEEE Information Theory Workshop (ITW’08), Porto, Portugal, pp. 281–283 (2008)

  14. Shields, P.: Two divergence-rate counterexamples. J. Theor. Probab. 6, 521–545 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Shields, P.: The interactions between ergodic theory and information theory. IEEE Trans. Inf. Theory 44(6), 2079–2093 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Shields, P.: The Ergodic Theory of Discrete Sample Paths. AMS Bookstore. AMS, Providence (1996)

    MATH  Google Scholar 

  17. Shiryaev, A.: Probability, 2nd edn. Springer, Berlin (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniil Ryabko.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ryabko, D. Discrimination Between B-Processes is Impossible. J Theor Probab 23, 565–575 (2010). https://doi.org/10.1007/s10959-009-0263-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10959-009-0263-1

Mathematics Subject Classification (2000)

Navigation