Shotgun Assembly of Linial-Meshulam Model
Abstract
In a recent paper [6], J. Gaudio and E. Mossel studied the shotgun assembly of the Erdos-R\'enyi graph G(n,pn) with pn=n-α, and showed that the graph is reconstructable form its 1-neighbourhoods if 0<α < 1/3 and not reconstructable from its 1-neighbourhoods if 1/2 <α<1. In this article, we generalise the notion of reconstruction of graphs to the reconstruction of simplicial complexes. We show that the Linial-Meshulam model Yd(n,pn) on n vertices with pn=n-α is reconstructable from its 1-neighbourhoods when 0< α < 1/3 and is not reconstructable form its 1-neighbourhoods when 1/2 < α < 1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.