Moderate deviation principle for guesswork (Q6540884)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Moderate deviation principle for guesswork |
scientific article; zbMATH DE number 7850478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Moderate deviation principle for guesswork |
scientific article; zbMATH DE number 7850478 |
Statements
Moderate deviation principle for guesswork (English)
0 references
17 May 2024
0 references
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)].
0 references
guesswork
0 references
moderate deviation
0 references
Rényi entropy
0 references
Shannon entropy
0 references
Perron-Frobenius eigenvalue
0 references
0 references
0.8352583050727844
0 references
0.7840453386306763
0 references
0.7313032150268555
0 references
0.7019076943397522
0 references