SearcharxivSearch

arXiv · 1410.2174

Arithmetical Tugs of War and Benford's Law

Abstract

Benford's Law predicts that the first significant digit on the leftmost side of numbers in real-life data is proportioned between all possible 1 to 9 digits approximately as in LOG(1 + 1/digit), so that low digits occur much more frequently than high digits in the first place. The two essential prerequisites for data configuration with regards to compliance with Benford's Law are high order of magnitude and positive skewness with a tail falling to the right of the histogram, so that quantitative configuration is such that the small is numerous and the big is rare. A related topic in the study of Benford's Law is the stark contrast between multiplications and additions of random variables and their distinct resultant quantitative and digital configurations. Random multiplication processes induce substantial increase in order of magnitude and they tend to the skewed Lognormal Distribution, favoring the small over the big. Random addition processes on the other hand do not induce any increase in order of magnitude and they tend to the symmetrical Normal Distribution as predicated by the Central Limit Theorem, favoring the medium over the small and the big. Thus, while multiplication processes are highly conducive to Benford behavior, addition processes are highly detrimental to Benford behavior. In this article it is shown that often in real-life data, multiplication and addition processes mix together within one measurement or expression, and consequently they fiercely compete for dominance, each attempting to exert the greatest influence upon sizes and digits. Such tugs of war between additions and multiplications are won or lost depending on the orders of magnitude of the generating random variables, as well as on the relative strength of the two warring sides, measured in terms of the comparative arithmetical involvement in the algebraic expression of the process.

Explore related subjects

Keep this discovery

BibTeXRIS

Alex Ely Kossovsky. 2014-10-08. Arithmetical Tugs of War and Benford's Law. https://arxiv.org/abs/1410.2174

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

KEEP EXPLORING

Related papers

A Scale Invariance Property of PCA

The PCA algorithm is sensitive to changes in measurement scale. Measuring one variable of a system in inches rather than centimeters, say, alters both its principal axes and principal eigenvalues. Although this scale dependence is generally complicated, we show here that it nevertheless obeys a strict invariance property: under a continuous scale adjustment, the initial state's $k$-th largest principal component (ordered by eigenvalue) continuously evolves into the final state's $k$-th largest principal component, for each $k$. In this sense, we can say that the modes of PCA are "order-stable" with respect to changes in measurement scale. A special case occurs when scaling along directions that are orthogonal to some modes. Here, apparent eigenvalue crossings can occur. However, we show that we can interpret these apparent crossings as cases where the modes instantaneously swap their orientation, in this way maintaining the required order stability.

math.ST

Small noise asymptotics for linear parabolic SPDEs in two space dimensions with unknown damping factors

We study parametric estimation for second order linear parabolic stochastic partial differential equations in two space dimensions with a small volatility parameter driven by a $Q$-Wiener process with an unknown damping parameter using high frequency spatio-temporal data. We first provide an estimator for the damping parameter of the $Q$-Wiener process utilizing realized quadratic variations based on spatial and temporal increments. We next propose minimum contrast estimators of the diffusive and advective parameters in the SPDE using a contrast function with the proposed estimator of the damping parameter. We then construct a quasi-maximum likelihood estimator of the reaction parameter in the SPDE using the approximate coordinate process derived from the estimators of the diffusive and advective parameters. We also provide simulation results of the proposed estimators.

math.ST

Spike Estimation from Heteroscedastic Noise via Random Splitting

In this paper, we consider a spiked Wigner type matrix with a heteroscedastic and unknown variance profile. It is well known that in the supercritical regime of the BBP transition, strong spikes can create outliers in the spectrum. Unfortunately, in the heteroscedastic case, in general it is not possible to estimate the spike strength from these observed outlier consistently, as the latter is a solution to a Dyson equation with unknown parameters from the variance profile. In this paper, inspired by the work on sparse matrix completion \citep{BordenaveCosteNadakuditi2023}, we introduce an asymmetrized model by randomly splitting the spiked matrix into two parts, which transforms the noisy Wigner type matrix into a non Hermitian random matrix, while preserving the Hermitian spikes at the cost of a dilution. We establish a BBP type transition for the asymmetrized model, from which we can estimate the strength of the spikes precisely, even without knowing the variance profile of the noise part. We then further apply our approach to study the correlation between two correlated spiked models, where the spike/signal parts of the two models are correlated, and the noise parts are independent but may both be heteroscedastic. By applying our asymmetrization approach to the two models separately and also jointly, we are able to obtain a precise estimate of the correlation between the signal parts of the two models.

math.ST