English

Shotgun Assembly of Linial-Meshulam Model

Combinatorics 2022-09-23 v1 Probability

Abstract

In a recent paper [6], J. Gaudio and E. Mossel studied the shotgun assembly of the Erd\H{o}s-R\'enyi graph G(n,pn)\mathcal G(n,p_n) with pn=nαp_n=n^{-\alpha}, and showed that the graph is reconstructable form its 11-neighbourhoods if 0<α<1/30<\alpha < 1/3 and not reconstructable from its 11-neighbourhoods if 1/2<α<11/2 <\alpha<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)Y_{d}(n,p_n) on nn vertices with pn=nαp_n=n^{-\alpha} is reconstructable from its 11-neighbourhoods when 0<α<1/30< \alpha < 1/3 and is not reconstructable form its 11-neighbourhoods when 1/2<α<11/2 < \alpha < 1.

Keywords

Cite

@article{arxiv.2209.10942,
  title  = {Shotgun Assembly of Linial-Meshulam Model},
  author = {Kartick Adhikari and Sukrit Chakraborty},
  journal= {arXiv preprint arXiv:2209.10942},
  year   = {2022}
}

Comments

14 pages, 2 figures