Recovery thresholds in the sparse planted matching problem

Guilhem Semerjian, Gabriele Sicuro, Lenka Zdeborová

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)
62 Downloads (Pure)

Abstract

We consider the statistical inference problem of recovering an unknown perfect matching, hidden in a weighted random graph, by exploiting the information arising from the use of two different distributions for the weights on the edges inside and outside the planted matching. A recent work has demonstrated the existence of a phase transition, in the large size limit, between a full and a partial-recovery phase for a specific form of the weights distribution on fully connected graphs. We generalize and extend this result in two directions: we obtain a criterion for the location of the phase transition for generic weights distributions and possibly sparse graphs, exploiting a technical connection with branching random walk processes, as well as a quantitatively more precise description of the critical regime around the phase transition.
Original languageEnglish
JournalPhysical Review E
Volume102
Issue number2
DOIs
Publication statusPublished - 6 Aug 2020

Fingerprint

Dive into the research topics of 'Recovery thresholds in the sparse planted matching problem'. Together they form a unique fingerprint.

Cite this