SearcharxivSearch

arXiv · 0910.1359

Scatter and regularity imply Benford's law... and more

Abstract

A random variable (r.v.) X is said to follow Benford's law if log(X) is uniform mod 1. Many experimental data sets prove to follow an approximate version of it, and so do many mathematical series and continuous random variables. This phenomenon received some interest, and several explanations have been put forward. Most of them focus on specific data, depending on strong assumptions, often linked with the log function. Some authors hinted - implicitly - that the two most important characteristics of a random variable when it comes to Benford are regularity and scatter. In a first part, we prove two theorems, making up a formal version of this intuition: scattered and regular r.v.'s do approximately follow Benford's law. The proofs only need simple mathematical tools, making the analysis easy. Previous explanations thus become corollaries of a more general and simpler one. These results suggest that Benford's law does not depend on properties linked with the log function. We thus propose and test a general version of the Benford's law. The success of these tests may be viewed as an a posteriori validation of the analysis formulated in the first part.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Gauvrit, Jean-Paul Delahaye. 2009-10-07. Scatter and regularity imply Benford's law... and more. https://arxiv.org/abs/0910.1359

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR