The number of random 2-SAT solutions is asymptotically log-normal
<|reference_start|>The number of random 2-SAT solutions is asymptotically log-normal: We prove that throughout the satisfiable phase, the logarithm of the number of satisfying assignments of a random 2-SAT formula satisfies a central limit theorem. This implies that the log of the number of satisfying assignments exhibits fluctuations of order $\sqrt n$, with $n$ the number of variables. The formula for the variance can be evaluated effectively. By contrast, for numerous other random constraint satisfaction problems the typical fluctuations of the logarithm of the number of solutions are {\em bounded} throughout all or most of the satisfiable regime.<|reference_end|>
@article{chatterjee2024the,
    title={The number of random 2-SAT solutions is asymptotically log-normal},
    author={Arnab Chatterjee, Amin Coja-Oghlan, Noela M"uller, Connor Riddlesden,
  Maurice Rolvien, Pavel Zakharov, Haodong Zhu},
    journal={arXiv preprint arXiv:2405.03302},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.03302},
    primaryClass={cs.DM math.CO math.PR}
}