Metraipolis › archive › dc_e0e8f67079cd

Pick-up sticks problems for exponential and Pareto distributions — arXiv:2611.04436

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04436
License (as archived)
CC0-1.0
Archived
2026-11-04T21:56:18.777Z
SHA-256 of the archived text
ec2d9972f5a26181b993e036e6a6cefb3ee6ed3f2eb17671964b8a95edd432d9
Stable URL of this page
https://metraipolis.com/documento/dc_e0e8f67079cd

How to cite

Pick-up sticks problems for exponential and Pareto distributions — arXiv:2611.04436 — arXiv (en), https://arxiv.org/abs/2611.04436 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e0e8f67079cd (Metraipolis archive dc_e0e8f67079cd, sha256 ec2d9972f5a26181b993e036e6a6cefb3ee6ed3f2eb17671964b8a95edd432d9)
BibTeX
@misc{dce0e8f67079cd,
  title = {Pick-up sticks problems for exponential and Pareto distributions — arXiv:2611.04436},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04436},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e0e8f67079cd; sha256 ec2d9972f5a26181b993e036e6a6cefb3ee6ed3f2eb17671964b8a95edd432d9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04436. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We deal with the following two pick-up sticks problems: given an integer n greater than or equal to 3, we choose n sticks with independent random lengths from an exponential distribution or Pareto type I distribution, and we are interested in the probability that no three of them can be the sides of a triangle. In case of exponential distribution, this problem has been solved by other authors: the probability in question is equal to $n!/\big((F_3-1)(F_4-1)\cdots(F_{n+2}-1)\big)$, where $(F_i)_{i=1}^\infty$ is the sequence of Fibonacci numbers. We give a new, self-contained and detailed proof for this formula, which uses a different method compared to the earlier ones. In case of Pareto type I distribution, we derive new formulae for the corresponding probability.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2611.04436 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T21:41:04.535Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).