• Corpus ID: 209414792

The Planted Matching Problem: Phase Transitions and Exact Results

  title={The Planted Matching Problem: Phase Transitions and Exact Results},
  author={Mehrdad Moharrami and Cristopher Moore and Jiaming Xu},
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 \in M^*$ and another distribution $Q$ if $e \notin M^*$. Our goal is to infer $M^*$, exactly or approximately, from the edge weights. In this paper we take $P=\exp(\lambda)$ and $Q=\exp(1/n)$, in which case the maximum-likelihood estimator of $M^*$ is the minimum-weight matching $M_… 

Figures from this paper

Recovery thresholds in the sparse planted matching problem

A criterion for the location of the phase Transition for generic weights distributions and possibly sparse graphs is obtained, 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.

The planted k-factor problem

It is argued that, in the large size limit, a phase transition can appear between a full and a partial recovery phase as function of the signal-to-noise ratio.

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

It is proved that when λ ≤ 4−ǫ, the optimal reconstruction error is exp (−Θ(1/√ǫ), confirming the conjectured infinite-order phase transition in [24].

Detecting Correlated Gaussian Databases

  • K. ZeynepB. Nazer
  • Computer Science
    2022 IEEE International Symposium on Information Theory (ISIT)
  • 2022
For certain choices of parameters, the detection achievability bound outperforms this recovery converse bound, demonstrating that detection can be easier than recovery in this scenario.

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

An approximate maximum likelihood estimator is derived, which provably achieves, with high probability, perfect recovery of π ∗ when σ = o ( n − 2 /d ) and almost perfect recovery with a vanishing fraction of errors when ρ = n − 1 /d .

Strong recovery of geometric planted matchings

The problem of efficiently recovering the matching between an unlabelled collection of n points in R and a small random perturbation of those points is studied and it is shown that the MLE makes n errors for an explicit δ ∈ (0, 1).

Random Graph Matching with Improved Noise Robustness

This work proposes a new algorithm for graph matching that associates each vertex with a signature vector using a multistage procedure and then matches a pair of vertices from the two graphs if their signature vectors are close to each other.



Dynamic Programming Optimization over Random Data: The Scaling Exponent for Near-Optimal Solutions

It is shown that, amongst solutions differing from the optimal solution in a small proportion of places, one can find near-optimal solutions whose objective function value differs from the optimum by a factor of order $\delta^2$ but not of smaller order.

Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem

Both Parisi's conjecture and Sorkin's conjecture are generalized to the average value of the smallest k-assignment when there are n jobs and m machines and are proved based on a common set of combinatorial and probabilistic arguments.

Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem

The objective method is used to analyze the performance of BP as the size of the underlying graph becomes large and establishes that the dynamic of BP on Knn converges in distribution as n → ∞ to an appropriately defined dynamic on the Poisson weighted infinite tree, and proves correlation decay for this limiting dynamic.

A proof of Parisi’s conjecture on the random assignment problem

Abstract.An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal.

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem

We prove that with high probability over the choice of a random graph G from the Erdös-Rényi distribution G(n,1/2), the nO(d)-time degree d Sum-of-Squares semidefinite programming relaxation for

Belief propagation for optimal edge-cover in the random complete graph

The objective method of Aldous is applied to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs and shows that a belief propagation algorithm converges asymptotically to the optimal solution.

Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method

This work extends the results to maximum weight matchings in G(n, c/n) and G r (n) using the recently developed local weak convergence method further reduced to a certain local optimality property exhibited by the models it considers.

Sudden Emergence of a Giantk-Core in a Random Graph

These proofs are based on the probabilistic analysis of an edge deletion algorithm that always find ak-core if the graph has one, and demonstrate that, unlike the 2-core, when ak- core appears for the first time it is very likely to be giant, of size ?pk(?k)n.

Linear phase transition in random linear constraint satisfaction problems

It is proved that the feasibility property experiences a linear phase transition, when n→∞ and m = cn for a constant c, and it is extended to maximum weight b-matchings also in G(n, cn).