An Entropy Estimator for a Class of Infinite Alphabet Processes
From MaRDI portal
Publication:4954380
DOI10.1137/S0040585X97977100zbMATH Open1047.28500MaRDI QIDQ4954380FDOQ4954380
Authors: Anthony Quas 
Publication date: 6 June 2000
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Recommendations
- Entropy estimators with almost sure convergence and an \(\mathcal O(n^{-1})\) variance
- Entropy estimation in Turing's perspective
- Entropy of a stationary process and entropy of a shift transformation in its sample space
- On entropy estimation for distributions with countable support.
- On the Entropy Rate of Pattern Processes
Statistical aspects of information-theoretic topics (62B10) Nonparametric estimation (62G05) Stationary stochastic processes (60G10) Measure-preserving transformations (28D05)
Cited In (5)
- A Central Limit Theorem for Non-Overlapping Return Times
- String matching bounds via coding
- Symbolic transfer entropy rate is equal to transfer entropy rate for bivariate finite-alphabet stationary ergodic Markov processes
- BIAS REDUCTION OF THE NEAREST NEIGHBOR ENTROPY ESTIMATOR
- Non-parametric change-point estimation using string matching algorithms
This page was built for publication: An Entropy Estimator for a Class of Infinite Alphabet Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954380)
