Discrimination between B-processes is impossible
From MaRDI portal
Publication:975335
Recommendations
Cites work
- scientific article; zbMATH DE number 3984308 (Why is no real title available?)
- scientific article; zbMATH DE number 192937 (Why is no real title available?)
- scientific article; zbMATH DE number 3463931 (Why is no real title available?)
- scientific article; zbMATH DE number 918233 (Why is no real title available?)
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
- How sampling reveals a process
- Hypothesis testing for families of ergodic processes
- Limits to consistent on-line forecasting for ergodic time series
- On classifying processes
- On density estimation from ergodic processes
- Prediction of random sequences and universal coding
- Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
- Testing composite hypotheses about discrete ergodic processes
- The \(\bar d\)-recognition of processes
- The interactions between ergodic theory and information theory
- Two divergence-rate counterexamples
Cited in
(7)- On universal algorithms for classifying and predicting stationary processes
- Nonparametric multiple change point estimation in highly dependent time series
- Approximation with ergodic processes and testability
- Uniform hypothesis testing for finite-valued stationary processes
- scientific article; zbMATH DE number 7639721 (Why is no real title available?)
- Testing composite hypotheses about discrete ergodic processes
- Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates
This page was built for publication: Discrimination between B-processes is impossible
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975335)