arXiv:1504.07682 [math.PR]AbstractReferencesReviewsResources
Shotgun assembly of labeled graphs
Published 2015-04-28Version 1
We consider the problem of reconstructing graphs or labeled graphs from neighborhoods of a given radius r. Special instances of this problem include DNA shotgun assembly, neural network reconstruction, and assembling random jigsaw puzzles. We provide some necessary and some sufficient conditions for correct recovery both in combinatorial terms and for some generative models including random labelings of lattices, Erdos-Renyi random graphs, and the random jigsaw puzzle model. Many open problems and conjectures are provided.
Comments: 21 pages
Related articles: Most relevant | Search more
arXiv:1503.06346 [math.PR] (Published 2015-03-21)
Jigsaw Percolation on Erdos-Renyi Random Graphs
arXiv:2108.09636 [math.PR] (Published 2021-08-22)
Shotgun assembly of unlabeled Erdos-Renyi graphs
arXiv:2202.02968 [math.PR] (Published 2022-02-07)
Shotgun Assembly of Random Geometric Graphs