Answers are grounded in this paper and cite their sources.
We prove that, with high probability, the Erdős--Rényi random graph $G(n,p)$ is reconstructible up to isomorphism from the multiset of its rooted induced 2-neighborhoods whenever p≥ n-3/4(log n)³. Together with the non-reconstructibility result of Johnston, Kronenberg, Roberts and Scott, our result locates the second reconstruction transition at the scale p=n-3/4 up to polylogarithmic factors, resolving a question they posed. Our proof relies on a global rigidity argument exploiting 5-cycle constraints.
No takes yet. Share an insight, caveat, or question.
Yiming Chen (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: