Abstract
For any x ∈ [0, 1), let x = [ɛ 1, ɛ 2, …,] be its dyadic expansion. Call r n (x):= max{j ⩾ 1: ɛ i+1 = … = ɛ i+j = 1, 0 ⩽ i ⩽ n − j} the n-th maximal run-length function of x. P.Erdös and A.Rényi showed that \(\mathop {\lim }\limits_{n \to \infty } \) r n (x)/log2 n = 1 almost surely. This paper is concentrated on the points violating the above law. The size of sets of points, whose runlength function assumes on other possible asymptotic behaviors than log2 n, is quantified by their Hausdorff dimension.
Similar content being viewed by others
References
R. Arratia, L. Gordon, M. S. Waterman: The Erdös-Rényi law in distribution, for coin tossing and sequence matching. Ann. Stat. 18 (1990), 539–570.
I. Benjamini, O. Häggström, Y. Peres, J. E. Steif: Which properties of a random sequence are dynamically sensitive? Ann. Probab. 31 (2003), 1–34.
P. Billingsley: Ergodic Theory and Information. Wiley Series in Probability and Mathematical Statistics. New York: John Wiley and Sons, 1965.
D. Khoshnevisan, D. A. Levin, P. J. Méndez-Hernández: On dynamical Gaussian random walks. Ann. Probab. 33 (2005), 1452–1478.
D. Khoshnevisan, D. A. Levin, P. J. Méndez-Hernández: Exceptional times and invariance for dynamical random walks. Probab. Theory Relat. Fields. 134 (2006), 383–416.
D. Khoshnevisan, D. A. Levin: On dynamical bit sequences. arXiv:0706.1520v2.
J.-H. Ma, S.-Y. Wen, Z.-Y. Wen: Egoroff’s theorem and maximal run length. Monatsh. Math. 151 (2007), 287–292.
P. Révész: Random Walk in Random and Non-Random Enviroments. Singapore. World Scientific, 1990.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the HNSN under 09JJ3001, HNKSPP (2010J05) and HNED under 11C0671.
Rights and permissions
About this article
Cite this article
Zou, R. Hausdorff dimension of the maximal run-length in dyadic expansion. Czech Math J 61, 881–888 (2011). https://doi.org/10.1007/s10587-011-0055-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-011-0055-5