Skip to main content

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 491 Accesses

Abstract

This chapter considers various generalizations of the results surveyed in this volume, as well as some open problems. In particular, generalizations to distances other than the distributional distance are considered, as well as non-stationary processes and processes more general than time series, such as multidimensional processes and processes on infinite random graphs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Terrence M. Adams and Andrew B. Nobel. Uniform approximation of Vapnik-Chervonenkis classes. Bernoulli, 18(4):1310–1319, 2012.

    Article  MathSciNet  Google Scholar 

  2. David Aldous and Russell Lyons. Processes on unimodular random networks. Electron. J. Probab., 12:no. 54, 1454–1508, 2007.

    Google Scholar 

  3. Itai Benjamini and Nicolas Curien. Ergodic theory on stationary random graphs. Electron. J. Probab., 17:no. 93, 1–20, 2012.

    Google Scholar 

  4. András Gyorgy, Tamás Linder, and Gábor Lugosi. Efficient tracking of large classes of experts. IEEE Transactions on Information Theory, 58(11):6709–6725, 2012.

    Article  MathSciNet  Google Scholar 

  5. L. V. Kantorovich and G. S. Rubinstein. On a function space in certain extremal problems. Dokl. Akad. Nauk USSR, 115(6):1058–1061, 1957.

    Google Scholar 

  6. A.N. Kolmogorov. Sulla determinazione empirica di una legge di distribuzione. G. Inst. Ital. Attuari, pages 83–91, 1933.

    Google Scholar 

  7. Ulrich Krengel. Ergodic Theorems. Walter de Gruyter, Berlin, New York, 1985.

    Book  Google Scholar 

  8. Russell Lyons and Yuval Peres. Probability on trees and networks, volume 42. Cambridge University Press, 2016.

    Google Scholar 

  9. D.S. Ornstein and B. Weiss. How sampling reveals a process. Annals of Probability, 18(3):905–930, 1990.

    Article  MathSciNet  Google Scholar 

  10. D. Ryabko. Hypotheses testing on infinite random graphs. In Proceedings of the 28th International Conference on Algorithmic Learning Theory (ALT’17), volume 76 of PMLR, pages 400–411, Kyoto, Japan, 2017. JMLR.

    Google Scholar 

  11. Daniil Ryabko and Jeremie Mary. A binary-classification-based metric between time-series distributions and its use in statistical and learning problems. Journal of Machine Learning Research, 14:2837–2856, 2013.

    MathSciNet  MATH  Google Scholar 

  12. P. Shields. The Ergodic Theory of Discrete Sample Paths. AMS Bookstore, 1996.

    Google Scholar 

  13. Frans MJ Willems. Coding for a binary independent piecewise-identically-distributed source. IEEE Transactions on Information Theory, 42(6):2210–2217, 1996.

    Google Scholar 

  14. V. M. Zolotarev. Probability metrics. Theory of Probability and Its Applications., 28(2):264–287, 1983.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ryabko, D. (2019). Generalizations. In: Asymptotic Nonparametric Statistical Analysis of Stationary Time Series. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-12564-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-12564-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-12563-9

  • Online ISBN: 978-3-030-12564-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics