Unique reconstruction threshold for random jigsaw puzzles

From MaRDI portal



Abstract: A random jigsaw puzzle is constructed by arranging n2 square pieces into an nimesn grid and assigning to each edge of a piece one of q available colours uniformly at random, with the restriction that touching edges receive the same colour. We show that if q=o(n) then with high probability such a puzzle does not have a unique solution, while if qgen1+varepsilon for any constant varepsilon>0 then the solution is unique. This solves a conjecture of Mossel and Ross (Shotgun assembly of labeled graphs, arXiv:1504.07682).












This page was built for publication: Unique reconstruction threshold for random jigsaw puzzles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360828)