2016/03/24 by Rassmann, Felicia
#Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR)
paper · doi:10.48550/arxiv.1603.07523
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≥ 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.