Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 94 tok/s
Gemini 2.5 Pro 42 tok/s Pro
GPT-5 Medium 13 tok/s
GPT-5 High 17 tok/s Pro
GPT-4o 101 tok/s
GPT OSS 120B 460 tok/s Pro
Kimi K2 198 tok/s Pro
2000 character limit reached

Generalized Continuous and Discrete Stick Fragmentation and Benford's Law (2309.00766v1)

Published 2 Sep 2023 in math.PR

Abstract: Inspired by the basic stick fragmentation model proposed by Becker et al. in arXiv:1309.5603v4, we consider three new versions of such fragmentation models, namely, continuous with random number of parts, continuous with probabilistic stopping, and discrete with congruence stopping conditions. In all of these situations, we state and prove precise conditions for the ending stick lengths to obey Benford's law when taking the appropriate limits. We introduce the aggregated limit, necessary to guarantee convergence to Benford's law in the latter two models. We also show that resulting stick lengths are non-Benford when our conditions are not met. Moreover, we give a sufficient condition for a distribution to satisfy the Mellin transform condition introduced in arXiv:0805.4226v2, yielding a large family of examples.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.