ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f:[n]→Rf:[n]\rightarrow\mathbb{R} be an arbitrary injective function, and let ε>0\varepsilon>0. For a random graph G∼G(n,p)G\sim G(n,p) with p≥(1+ε)/np\geq(1+\varepsilon)/n, a subset V′⊆[n]V'\subseteq[n] is sought such that the restricted framework (G[V′],f∣V′)(G[V'],f|_{V'}) is globally rigid in R\mathbb{R}.

Giro et al.'s reconstruction conjecture. For every ε>0\varepsilon>0 and every p≥(1+ε)/np\geq(1+\varepsilon)/n, with high probability there exists a subset V′⊆[n]V'\subseteq[n] of size ∣V′∣=Ωε(n)|V'|=\Omega_{\varepsilon}(n) such that (G[V′],f∣V′)(G[V'],f|_{V'}) is globally rigid in R\mathbb{R}.

This conjecture asks whether the threshold 1/n1/n for the emergence of the giant 2-connected component is also the threshold for reconstructing a positive fraction of the points of any injective embedding. The paper proves a stronger near-spanning result at a suitable constant multiple of 1/n1/n, but the stated conjecture 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.