Shotgun threshold for sparse Erdős-Rényi graphs

Abstract

In the shotgun assembly problem for a graph, we are given the empirical profile for rooted neighborhoods of depth $r$ (up to isomorphism) for some $r\ge 1$ and we wish to recover the underlying graph up to isomorphism. When the underlying graph is an Erdős-Rényi $\mathcal{G}(n,\frac{\hat{I}}{»}n)$, we show that the shotgun assembly threshold $r_{\ast }\approx \frac{\log n}{\log (\hat{I}{»}^2{\hat{I}}_{\hat{I}}^3»{)}^{-1}}$ where ${\hat{I}}_{\hat{I}}^3»$ is the probability for two independent Poisson-Galton-Watson trees with parameter $\hat{I}»$ to be rooted isomorphic with each other. Our result sharpens a constant factor in a previous work by Mossel and Ross (2019) and thus solves a question therein.

40pages, 5 figures; Minor revision