Papers › A Central Limit Theorem for intransitive dice
A Central Limit Theorem for intransitive dice
Luis G. Coelho, Tertuliano Franco, Lael V. Lima, João P. C. de Paula, João V. A. Pimenta, Guilherme L. F. Silva, Daniel Ungaretti
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Intransitive dice D⁽¹⁾, …, D^((ℓ)) are dice such that D⁽¹⁾ has advantage when played against D⁽²⁾, dice D⁽²⁾ has advantage when played against D⁽³⁾ and so on, up to D^((ℓ)), which has advantage over D⁽¹⁾. In this twofold work, we first present (deterministic) results on the existence of general intransitive dice. Second and mainly, a central limit theorem for the vector of normalized victories of a die against the next one in the list when the faces of a die are i.i.d.\ random variables and all dice are independent, but different dice may have distinct distributions associated with them, as well as they may have distinct numbers of faces. Exploiting this central limit theorem, we derive two major consequences. First, we are able to obtain first order exponential asymptotics for the number of ℓ-tuples of intransitive dice, when the number of faces of the dice grows. Second, we obtain a criterion to ensure that the asymptotic probability of observing intransitive dice is null, which applies to many cases, including all continuous distributions and many discrete ones.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections