Papers › Emergence of Fluctuation Relations in UNO
Emergence of Fluctuation Relations in UNO
Peter Sidajaya, Jovan Hsuen Khai Low, Clive Cenxin Aw, Valerio Scarani
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.
In the last two decades, fluctuation theorems have been proved formally and demonstrated experimentally for several variables (such as entropy production, work, or flux) and different noises causing the fluctuations (of either thermal or other origin; Markovian or non-Markovian). Here we report the observation of a detailed fluctuation relation in a statistical process outside thermodynamics and physics: the card game UNO. As the fluctuating variable, we consider the number of steps W needed for one player's deck to change from x to y number of cards. The other players and the remaining cards play the role of a finite non-Markovian bath. Numerical simulations of runs of the game show that W obeys a fluctuation relation analogous to Crooks' theorem. While the observed behavior shares some common features with infinite random walks, it also exhibits deviations that are clear signatures of non-Markovianity and the finiteness of the bath: Notably, the parameter corresponding to temperature depends strongly on the transition x→y. Our paper contributes to extending the scope of fluctuation theorems beyond their usual thermodynamic setting.
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