On the approximation of high-order binary Markov chains by parsimonious models
From MaRDI portal
Publication:6548989
Cites work
- A Markov chain of order s with r partial connections and statistical inference on its parameters
- An integer-valued pth-order autoregressive structure (INAR(p)) process
- An Introduction to Discrete‐Valued Time Series
- Approximation by superpositions of a sigmoidal function
- Estimation and Modelling Repeated Patterns in High Order Markov Chains with the Mixture Transition Distribution Model
- scientific article; zbMATH DE number 1808197 (Why is no real title available?)
- scientific article; zbMATH DE number 3147701 (Why is no real title available?)
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- scientific article; zbMATH DE number 1235881 (Why is no real title available?)
- scientific article; zbMATH DE number 1245627 (Why is no real title available?)
- scientific article; zbMATH DE number 1560711 (Why is no real title available?)
- scientific article; zbMATH DE number 2171896 (Why is no real title available?)
- scientific article; zbMATH DE number 846906 (Why is no real title available?)
- scientific article; zbMATH DE number 2199188 (Why is no real title available?)
- scientific article; zbMATH DE number 3085434 (Why is no real title available?)
- Markov chains with r-partial relations and their statistical estimation
- Methods OI geometry and probabilistic combinatorics in threshold logic
- Neural network-based models of binomial time series in data analysis problems
- Robust estimation for binomial conditionally nonlinear autoregressive time series based on multivariate conditional frequencies
- STATIONARY DISCRETE AUTOREGRESSIVE-MOVING AVERAGE TIME SERIES GENERATED BY MIXTURES
- Statistical analysis of high-order Markov dependencies
- Statistical analysis of multivariate discrete-valued time series
- Statistical estimation of parameters for binary conditionally nonlinear autoregressive time series
- Statistical Methods in Markov Chains
- Testing the NIST statistical test suite on artificial pseudorandom sequences
- Variable length Markov chains
Cited in
(1)
This page was built for publication: On the approximation of high-order binary Markov chains by parsimonious models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548989)