Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I might be missing something, but how is it that overall the number of leading 2s is greater than the number of leading 1s, but not in any of the constituent regions?



I don't think Simpsons paradox plays any role here, if I understand this correctly.

In the first graph, the leading digit counts are not the things being summed up across all the regions. The weekly report counts are summed up across all regions and then the leading digits are counted.


Could it be that the mean number of reports in a week is in the 2.5-3.5x10^x range?

Why would he look at the leading number instead of the trailing number?

He really ought to provide the exact dataset that he's using to generate the graphs.


Benford's law is about the distribution of the leading digit, not the trailing ones.


Right, but was his objective to use Benford's law, or was it to test whether the data was tampered with?


His objective was to use Benford's law to test whether the data as tampered with. (This is a standard use of Benford's law.)




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: