The square root law in the embedding detection problem for Markov chains with unknown matrix of transition probabilities
From MaRDI portal
Publication:1741485
DOI10.1515/DMA-2019-0007zbMath1416.62458OpenAlexW2916278998WikidataQ128382901 ScholiaQ128382901MaRDI QIDQ1741485
Publication date: 3 May 2019
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2019-0007
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov processes: hypothesis testing (62M02)
Cites Work
- Detection of embeddings in binary Markov chains
- Fisher Information Determines Capacity of ε-Secure Steganography
- A parametric model of embedding and its statistical analysis
- Statistical estimation of parameters for binary Markov chain models with embeddings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The square root law in the embedding detection problem for Markov chains with unknown matrix of transition probabilities