Moderate deviation principle for guesswork
The authors establish a moderate deviation principle for the logarithm of guesswork, which was initially studied by \textit{J. L. Massey} [``Guessing and entropy, Proceedings of 1994 IEEE International Symposium on Information Theory (1994; \url{doi:10.1109/ISIT.1994.394764})] to quantify the number of guesses needed to ascertain a discrete random variable. Their approach is based on an asymptotic analysis for Perron-Frobenius eigenvalue of some perturbed matrix and several moments estimates bounds for guesswork. Their results are proved under the framework of \textit{M. M. Christiansen} and \textit{K. R. Duffy} [IEEE Trans. Inf. Theory 59, No. 2, 796--802 (2013; Zbl 1364.94227)].
- A coding theorem and Rényi's entropy
- An upper bound on the cutoff rate of sequential decoding
- Guesswork and Entropy
- Guesswork, Large Deviations, and Shannon Entropy
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- Large deviations for conditional guesswork
- RÉnyi Entropy, Guesswork Moments, and Large Deviations
- Taylor expansions of eigenvalues of perturbed matrices with applications to spectral radii of nonnegative matrices
This page was built for publication: Moderate deviation principle for guesswork
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540884)
