Tootfinder

Benford Behavior in Stick Fragmentation Problems
Bruce Fang, Ava Irons, Ella Lippelman, Steven J. Miller
https://arxiv.org/abs/2508.17360 https://arxiv.org…

Benford Behavior in Stick Fragmentation Problems
Benford's law is the statement that in many real-world data sets, the probability of having digit \(d\) in base \(B\), where \(1 \leq d \leq B\), as the first digit is \(\log_{B}\left(\tfrac{d+1}{d}\right)\). We sometimes refer to this as weak Benford behavior, and we say that a data set exhibits strong Benford behavior in base \(B\) if the probability of having significand at most \(s\), where \(s \in [1,B)\), is \(\log_{B}(s)\). We examine Benford behaviors in the stick fragmentation model. B…

Robust inference under Benford's law
Lucio Barabesi, Andrea Cerioli, Andrea Cerasa, Domenico Perrotta
https://arxiv.org/abs/2507.08650 https://

Robust inference under Benford's law
We address the task of identifying anomalous observations by analyzing digits under the lens of Benford's law. Motivated by the crucial objective of providing reliable statistical analysis of customs declarations, we answer one major and still open question: How can we detect the behavior of operators who are aware of the prevalence of the Benford's pattern in the digits of regular observations and try to manipulate their data in such a way that the same pattern also holds after data fabricatio…

Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Benford's Law from Turing Ensembles and Integer Partitions
Alexander Kolpakov, Aidan Rocke

Benford behavior resulting from stick and box fragmentation processes
Bruce Fang, Steven J. Miller
https://arxiv.org/abs/2508.12915 https://arxiv.org/pdf/2…

Benford behavior resulting from stick and box fragmentation processes
Benford's law is the statement that in many real world data sets, the probability of having digit $d$ in base $B$, where $1 \leq d \leq B$, as the first digit is \log_{B}\!\left(\frac{d+1}{d}\right). We sometimes refer to this as weak Benford behavior, and we say that a data set exhibits strong Benford behavior in base $B$ if the probability of having significand at most s, where $1 \leq s < B$, is \log_{B}\!\left(s\right). We examine Benford behaviors in two different probabilistic models: sti…