On the Number of Solutions in Random Hypergraph 2-Colouring
Keyword(s):
We determine the limiting distribution of the logarithm of the number of satisfying assignments in the random $k$-uniform hypergraph 2-colouring problem in a certain density regime for all $k\ge 3$. As a direct consequence we obtain that in this regime the random colouring model is contiguous wrt. the planted model, a result that helps simplifying the transfer of statements between these two models.
Keyword(s):
Keyword(s):
Keyword(s):
1982 ◽
Vol 40
◽
pp. 460-461
2019 ◽
Vol 35
(3)
◽
2020 ◽
Vol 86
(5)
◽
pp. 65-72