On the number of solutions in random hypergraph 2-colouring (Q2401392): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 07:00, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of solutions in random hypergraph 2-colouring |
scientific article |
Statements
On the number of solutions in random hypergraph 2-colouring (English)
0 references
8 September 2017
0 references
Summary: 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\geq 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.
0 references
random hypergraphs
0 references
2-colouring
0 references
small subgraph conditioning
0 references
partition function
0 references
limiting distribution
0 references
