Search arXivSearch

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

Explore connections, maps & timelines

BibTeXRIS

Alex Ely Kossovsky. 2019-01-02. 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 note on the distribution of the partial correlation coefficient with nonparametrically estimated marginal regressions

There has been much interest in the nonparametric testing of conditional independence in the econometric and statistical literature, but the simplest and potentially most useful method, based on the sample partial correlation, seems to have been overlooked, its distribution only having been investigated in some simple parametric instances. The present note shows that an easy to apply permutation test based on the sample partial correlation with nonparametrically estimated marginal regressions has good large and small sample properties.

math.ST

Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests

We consider the problem of sequential hypothesis testing using $e$-processes. For a rich class of composite testing problems---which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases---we show that any $e$-process satisfying a certain sublinear regret bound is asymptotically and almost surely instance-log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems, and we provide explicit test supermartingales and $e$-processes satisfying this notion in a more general case. Furthermore, we derive matching lower and upper bounds on the expected rejection time in the high-confidence regime for the resulting sequential tests in all of these cases. The proofs of these results make weak, algorithm-agnostic moment assumptions and rely on a proof technique involving the aforementioned regret and a family of numeraire portfolios. Finally, we discuss how all of these theorems hold in a distribution-uniform sense, a notion of log-optimality that is stronger still and seems to be new to the literature.

math.ST

Common Drivers in Sparsely Interacting Hawkes Processes

We study a multivariate Hawkes process as a model for time-continuous relational event networks. The model does not assume the network to be known, it includes covariates, and it allows for both common drivers, parameters common to all the actors in the network, and also local parameters specific for each actor. We derive rates of convergence for all of the model parameters when both the number of actors and the time horizon tends to infinity. To prevent an exploding network, sparseness is assumed. We also discuss numerical aspects.

math.ST