← All problems

Gaussian limit conjecture for random Bergman game lengths

8 years old · traced to

Let 0(n){}_0(n) denote the initial state of the Bergman Game, and let Ln\mathcal{L}_n be the distribution of the length of a random game played from 0(n){}_0(n), where at each state an available move is chosen uniformly at random. Gaussian limit conjecture. The distribution Ln\mathcal{L}_n converges to a Gaussian with linear mean

μn≈2n+O(1).\mu_n \approx 2n+O(1).

This conjecture is based on numerical data for the Bergman Game; the corresponding behavior for generalized Bergman Games is expected to be similar, but no concrete results are proved in the source.

References

4 papers in this index state this conjecture (2018–2021). The statement above is taken from the most recent of them; the others are arXiv:2006.16457, arXiv:1909.01938, arXiv:1809.04881.

Source: Benjamin Baily, Justine Dell, Irfan Durmić, Henry Fleischmann, Faye Jackson, Isaac Mijares, Steven J. Miller, Ethan Pesikoff, Luke Reifenberg, Alicia Smith Reina and Yingzi Yang, “The Generalized Bergman Game”, arXiv:2109.00117 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.