3 problems
- 0 votes0 replies0 views
Luo et al.'s planted clique exact recovery threshold conjecture
Luo et al.'s exact recovery conjecture. This -scale boundary is optimal for polynomial-time exact recovery. The conjecture concerns the computational threshold separating…
- 0 votes0 replies1 view
Morgan et al.'s largest-degree hyperedge recovery threshold conjecture
Let a heterogeneous random hypergraph contain hyperedges of multiple degrees, and suppose its projected graph is observed under the density condition studied by Morgan et al. Their…
- 0 votes0 replies0 views
Optimality of the maximal-clique recovery threshold for largest-degree hyperedges
Let a heterogeneous hypergraph be generated under the model considered in the paper, and let the maximal clique estimator be the estimator defined by Algorithm 1. The recovery thre…