The Planted Matching Problem: Phase Transitions and Exact Results

12/18/2019
by   Mehrdad Moharrami, et al.
22

We study the problem of recovering a planted matching in randomly weighted complete bipartite graphs K_n,n. For some unknown perfect matching M^*, the weight of an edge is drawn from one distribution P if e ∈ M^* and another distribution Q if e ∈ M^*. Our goal is to infer M^*, exactly or approximately, from the edge weights. In this paper we take P=(λ) and Q=(1/n), in which case the maximum-likelihood estimator of M^* is the minimum-weight matching M_min. We obtain precise results on the overlap between M^* and M_min, i.e., the fraction of edges they have in common. For λ> 4 we have almost-perfect recovery, with overlap 1-o(1) with high probability. For λ < 4 the expected overlap is an explicit function α(λ) < 1: we compute it by generalizing Aldous' celebrated proof of Mézard and Parisi's ζ(2) conjecture for the un-planted model, using local weak convergence to relate K_n,n to a type of weighted infinite tree, and then deriving a system of differential equations from a message-passing algorithm on this tree.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/17/2021

The planted matching problem: Sharp threshold and infinite-order phase transition

We study the problem of reconstructing a perfect matching M^* hidden in ...
02/22/2022

Random Graph Matching in Geometric Models: the Case of Complete Graphs

This paper studies the problem of matching two complete graphs with edge...
01/18/2021

Revisiting the Auction Algorithm for Weighted Bipartite Perfect Matchings

We study the classical weighted perfect matchings problem for bipartite ...
09/17/2022

Exact Matching and the Top-k Perfect Matching Problem

The aim of this note is to provide a reduction of the Exact Matching pro...
05/22/2020

Recovery thresholds in the sparse planted matching problem

We consider the statistical inference problem of recovering an unknown p...
02/08/2020

A new generalization of edge overlap to weighted networks

Finding the strength of an edge in a network has always been a big deman...
01/29/2019

Matching is as Easy as the Decision Problem, in the NC Model

We give an NC reduction from search to decision for the problem of findi...