On the number of solutions in random hypergraph 2-colouring
The electronic journal of combinatorics, Tome 24 (2017) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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

Felicia Rassmann  1

1 Goethe University Frankfurt
@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/}
}
TY  - JOUR
AU  - Felicia Rassmann
TI  - On the number of solutions in random hypergraph 2-colouring
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6029/
DO  - 10.37236/6029
ID  - 10_37236_6029
ER  - 
%0 Journal Article
%A Felicia Rassmann
%T On the number of solutions in random hypergraph 2-colouring
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/6029/
%R 10.37236/6029
%F 10_37236_6029
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

Cité par Sources :