On the number of solutions in random hypergraph 2-colouring
The electronic journal of combinatorics, Tome 24 (2017) no. 3
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv
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.
DOI :
10.37236/6029
Classification :
05C15, 05C65, 05C80, 60C05
Mots-clés : random hypergraphs, 2-colouring, small subgraph conditioning, partition function, limiting distribution
Mots-clés : random hypergraphs, 2-colouring, small subgraph conditioning, partition function, limiting distribution
Affiliations des auteurs :
Felicia Rassmann  1
Felicia Rassmann. On the number of solutions in random hypergraph 2-colouring. The electronic journal of combinatorics, Tome 24 (2017) no. 3. doi: 10.37236/6029
@article{10_37236_6029,
author = {Felicia Rassmann},
title = {On the number of solutions in random hypergraph 2-colouring},
journal = {The electronic journal of combinatorics},
year = {2017},
volume = {24},
number = {3},
doi = {10.37236/6029},
zbl = {1369.05086},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6029/}
}
Cité par Sources :