The sparse parity matrix
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Joon Lee, Jean Bernoulli, Ravelomanana

TL;DR
This paper investigates the overlap of solutions to sparse random parity matrices over GF(2), revealing a phase transition at d=e where the overlap behavior shifts from concentration to bifurcation, impacting theories of random CSPs and inference.
Contribution
It establishes the first rigorous analysis of the overlap distribution for solutions of sparse random parity matrices, identifying a phase transition at d=e with distinct behaviors.
Findings
For d<e, the overlap concentrates on a single value.
For d>e, the overlap conditioned on A concentrates, but unconditionally it bifurcates.
The results reveal a phase transition at d=e affecting solution structure.
Abstract
Let be an -matrix over whose every entry equals with probability independently for a fixed . Draw a vector randomly from the column space of . It is a simple observation that the entries of a random solution to are asymptotically pairwise independent, i.e., for . But what can we say about the {\em overlap} of two random solutions , defined as ? We prove that for the overlap concentrates on a single deterministic value . By contrast, for the overlap…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
