Random Consolidations and Fragmentations Cycles Lead to Benford' Law
Alex Ely Kossovsky

TL;DR
This paper demonstrates that a process of alternating random consolidations and fragmentations of quantities converges to Benford's Law, driven by the dominance of multiplicative effects over additive ones.
Contribution
It introduces a novel stochastic process model showing how cycles of consolidation and fragmentation lead to Benford's Law, highlighting the role of multiplicative dominance.
Findings
Process converges to Benford's Law after many cycles
Multiplicative effects dominate additive effects in the process
Randomness in fragmentation and consolidation is essential for convergence
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. For example, digit 1 occurs approximately 30.1% in the first place in random numbers, while digit 9 occurs only approximately 4.6%. In this article it is shown that a process where a large enough set of identical quantities constantly alternates between minuscule random consolidations (summing two randomly chosen values into a singular value) and tiny random fragmentations (division of one randomly chosen value into two new values) converges digit-wise to the Benford proportions after sufficiently many such cycles. The statistical tendency of the system after numerous cycles is to have approximately 2/3…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · Authorship Attribution and Profiling
