Detection of embeddings in binary Markov chains
From MaRDI portal
Publication:314172
DOI10.1515/DMA-2016-0002zbMATH OpenNoneOpenAlexW2339888487MaRDI QIDQ314172FDOQ314172
Authors: Yuriĭ Semenovich Kharin, Egor V. Vecherko
Publication date: 13 September 2016
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2016-0002
Recommendations
- Statistical estimation of parameters for binary Markov chain models with embeddings
- On finite Markov chain imbedding and its applications
- Notes on Markov embedding
- On the embedding problem for discrete-time Markov chains
- The embedding problem for Markov matrices
- Embeddable Markov matrices
- Markov type and threshold embeddings
- A filtering technique for Markov chains with applications to spectral embedding
- The Complexity of Distinguishing Markov Random Fields
Markov processes: estimation; hidden Markov models (62M05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Mixing: Properties and examples
- Tests of Statistical Hypotheses Concerning Several Parameters When the Number of Observations is Large
- On one statistical model of steganography
- A parametric model of embedding and its statistical analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite Continuous Time Markov Chains
- Title not available (Why is that?)
- Statistical estimation of parameters for binary Markov chain models with embeddings
- A Markov chain of order s with r partial connections and statistical inference on its parameters
- Robust estimation of AR coefficients under simultaneously influencing outliers and missing values
Cited In (5)
- Semibinomial conditionally nonlinear autoregressive models of discrete random sequences: probabilistic properties and statistical parameter estimation
- The square root law in the embedding detection problem for Markov chains with unknown matrix of transition probabilities
- Statistical analysis of conditionally binomial nonlinear regression time series with discrete regressors
- Constrained Embedding Probability for Two Binary Strings
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
Uses Software
This page was built for publication: Detection of embeddings in binary Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314172)