Distributional asymptotics mod 1 of $(\log_bn)$
Abstract
This paper studies the distributional asymptotics of the slowly changing sequence of logarithms with It is known that is not uniformly distributed modulo one, and its omega limit set is composed of a family of translated exponential distributions with constant An improved upper estimate is obtained for the rate of convergence with respect to (w.r.t.) the Kantorovich metric on the circle, compared to the general results on rates of convergence for a class of slowly changing sequences in the author's companion in-progress work. Moreover, a sharp rate of convergence w.r.t. the Kantorovich metric on the interval , is derived. As a byproduct, the rate of convergence w.r.t. the discrepancy metric (or the Kolmogorov metric) turns out to be as well, which verifies that an upper bound for this rate derived in [Y. Ohkubo and O. Strauch, Distribution of leading digits of numbers, Unif. Distrib. Theory, (2016), no.1, 23--45.] is sharp.
Cite
@article{arxiv.1609.08207,
title = {Distributional asymptotics mod 1 of $(\log_bn)$},
author = {Chuang Xu},
journal= {arXiv preprint arXiv:1609.08207},
year = {2019}
}
Comments
To appear in Unif. Distrib. Theory