Log In Sign Up

Planted matching problems on random hypergraphs

by   Urte Adomaityte, et al.

We consider the problem of inferring a matching hidden in a weighted random k-hypergraph. We assume that the hyperedges' weights are random and distributed according to two different densities conditioning on the fact that they belong to the hidden matching, or not. We show that, for k>2 and in the large graph size limit, an algorithmic first order transition in the signal strength separates a regime in which a complete recovery of the hidden matching is feasible from a regime in which partial recovery is possible. This is in contrast to the k=2 case where the transition is known to be continuous. Finally, we consider the case of graphs presenting a mixture of edges and 3-hyperedges, interpolating between the k=2 and the k=3 cases, and we study how the transition changes from continuous to first order by tuning the relative amount of edges and hyperedges.


The planted k-factor problem

We consider the problem of recovering an unknown k-factor, hidden in a w...

Recovery thresholds in the sparse planted matching problem

We consider the statistical inference problem of recovering an unknown p...

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

We give a quasipolynomial time algorithm for the graph matching problem ...

Random hypergraphs and property B

In 1964 Erdős proved that (1+1)) ln(2)/4 k^2 2^k edges are sufficient to...

Consistent recovery threshold of hidden nearest neighbor graphs

Motivated by applications such as discovering strong ties in social netw...

The Minimization of Random Hypergraphs

We investigate the maximum-entropy model B_n,m,p for random n-vertex, m-...

Strong recovery of geometric planted matchings

We study the problem of efficiently recovering the matching between an u...