Orateur
M.
Guilhem Semerjian
Description
This talk will present some results on the planted matching problem, an inference problem where the goal is to recover a perfect matching hidden (planted) in a weighted graph, the weights on the planted and non-planted edges being drawn from two different distributions. The results are obtained with statistical mechanics techniques, and in particular a mapping to branching random walks.
Joint work with Gabriele Sicuro and Lenka Zdeborova, Phys. Rev. E 102, 022304 (2020).
