ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be the number of graphs, let π∗\boldsymbol{\boldsymbol{\pi}}^* be the underlying permutation tuple, and let ov(π^,π∗)ov(\hat{\boldsymbol{\pi}},\boldsymbol{\pi}^*) denote their overlap. In the Erdős–Rényi model, with parameters λ\lambda and ss, assume

λs(1−(1−s)p−1)>1.\lambda s\bigl(1-(1-s)^{p-1}\bigr)>1.

Feasibility conjecture. Partial alignment is feasible: there exists an estimator π^\hat{\boldsymbol{\pi}} and some ε>0\varepsilon>0 such that, with high probability,

ov(π^,π∗)>ε.ov(\hat{\boldsymbol{\pi}},\boldsymbol{\pi}^*)>\varepsilon.

This statement complements the preceding theorem asserting intractability below the threshold λs(1−(1−s)p−1)<1\lambda s(1-(1-s)^{p-1})<1. The source presents the above-threshold claim without a proof or an explicit resolution, so its status remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.