Related papers: General Distributions of Number Representation Ele…

For uniformly chosen random $\alpha \in [0,1]$, it is known the probability the $n^{\rm th}$ digit of the continued-fraction expansion, $[\alpha]_n$ converges to the Gauss-Kuzmin distribution $\mathbb{P}([\alpha]_n = k) \approx \log_2 (1 +…

Inspired by the basic stick fragmentation model proposed by Becker et al. in arXiv:1309.5603v4, we consider three new versions of such fragmentation models, namely, continuous with random number of parts, continuous with probabilistic…

We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…

Benford's law states that in data sets from different phenomena leading digits tend to be distributed logarithmically such that the numbers beginning with smaller digits occur more often than those with larger ones. Particularly, the law is…

We introduce and study in detail a special class of backward continued fractions that represents a generalization of R\'enyi continued fractions. We investigate the main metrical properties of the digits occurring in these expansions and we…

Benford's law describes a common phenomenon among many naturally occurring data sets and distributions in which the leading digits of the data are distributed with the probability of a first digit of $d$ base $B$ being…

Benford's law states that the occurrence of significant digits in many data sets is not uniform but tends to follow a logarithmic distribution such that the smaller digits appear as first significant digits more frequently than the larger…

Benford's law predicts the occurrence of the $n^{\mathrm{th}}$ digit of numbers in datasets originating from various sources of the world, ranging from financial data to atomic spectra. It is intriguing that although many features of…

Benford's law states that for many random variables X > 0 its leading digit D = D(X) satisfies approximately the equation P(D = d) = log_{10}(1 + 1/d) for d = 1,2,...,9. This phenomenon follows from another, maybe more intuitive fact,…

We study, from the viewpoint of metrical number theory and (infinite) ergodic theory, the probabilistic laws governing the occurrence of prime numbers as digits in continued fraction expansions of real numbers.

Benford's law is an empirical law predicting the distribution of the first significant digits of numbers obtained from natural phenomena and mathematical tables. It has been found to be applicable for numbers coming from a plethora of…

A new multivariate distribution possessing arbitrarily parametrized and positively dependent univariate Pareto margins is introduced. Unlike the probability law of Asimit et al. (2010) [Asimit, V., Furman, E. and Vernic, R. (2010) On a…

We show the leading digits of a variety of systems satisfying certain conditions follow Benford's Law. For each system proving this involves two main ingredients. One is a structure theorem of the limiting distribution, specific to the…

Benford's law states that many data sets have a bias towards lower leading digits (about $30\%$ are 1s). There are numerous applications, from designing efficient computers to detecting tax, voter and image fraud. It's important to know…

We derive a necessary and sufficient condition for the sum of M independent continuous random variables modulo 1 to converge to the uniform distribution in L^1([0,1]), and discuss generalizations to discrete random variables. A consequence…

The diverse applications of the Benford law attract investigators working in various fields of physics, biology and sociology. At the same time, the groundings of the Benford law remain obscure. Our paper demonstrates that the Benford law…

Two dynamical indicators, the local dimension and the extremal index, used to quantify persistence in phase space have been developed and applied to different data across various disciplines. These are computed using the asymptotic limit of…

We prove connections between Zeckendorf decompositions and Benford's law. Recall that if we define the Fibonacci numbers by $F_1 = 1, F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$, every positive integer can be written uniquely as a sum of…

Kossovsky recently conjectured that the distribution of leading digits of a chain of probability distributions converges to Benford's law as the length of the chain grows. We prove his conjecture in many cases, and provide an interpretation…

In this work, we prove the joint convergence in distribution of $q$ variables modulo one obtained as partial sums of a sequence of i.i.d. square integrable random variables multiplied by a common factor given by some function of an…