Shotgun assembly of Erdős-Rényi random graphs
Graph shotgun assembly refers to the problem of reconstructing a graph from a collection of local neighborhoods. In this paper, we consider shotgun assembly of \ER random graphs $G(n, p_n)$, where $p_n = n^{-\alpha}$ for $0 < \alpha < 1$. We consider both reconstruction up to isomorphism as...
Main Authors: | Gaudio, Julia, Mossel, Elchanan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Institute of Mathematical Statistics
2022
|
Online Access: | https://hdl.handle.net/1721.1/145812 |
Similar Items
-
Shotgun assembly of random jigsaw puzzles
by: Bordenave, Charles, et al.
Published: (2021) -
On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
by: Sotirov, R., et al.
Published: (2012) -
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
by: Boix-Adserà, Enric, et al.
Published: (2022) -
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
by: Boix-Adsera, Enric, et al.
Published: (2021) -
Broadcasting on Random Directed Acyclic Graphs
by: Makur, Anuran, et al.
Published: (2021)