Shotgun reconstruction in the hypercube
نویسندگان
چکیده
Mossel and Ross raised the question of when a random coloring graph can be reconstructed from local information, namely, colorings (with multiplicity) balls given radius. In this article, we are concerned with 2-colorings vertices -dimensional hypercube, or equivalently Boolean functions. worst case, diameter required to reconstruct. However, situation for is dramatically different: show that almost every 2-coloring multiset radius 2. Furthermore, , -coloring 1-balls.
منابع مشابه
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one position. An edge coloring of a graph H is called rainbow if no two edges of H have the same color. Let f(G, H) be the largest number of colors such that there exists an edge coloring of G with f(G, H) colors such that no su...
متن کاملSecure Communication in Shotgun Cellular Systems
In this paper, we analyze the secure connectivity in Shotgun cellular systems (SCS: Wireless communication systems with randomly placed base stations) by Poisson intrinsically secure communication graph (IS-graph), i.e., a random graph which describes the connections that are secure over a network. For a base-station in SCS, a degree of secure connections is determined over two channel models: ...
متن کاملHypercube Related Polytopes
Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.
متن کاملThe Hypercube Graph and the Inhibitory Hypercube Network
In this paper we review the spectral properties of the hypercube graph Qn and derive the Walsh functions as eigenvectors of the adjacency matrix. We then interpret the Walsh functions as states of the hypercube, with vertices labeled +1 and -1, and elucidate the regularity of the induced vertex neighborhoods and subcubes. We characterize the neighborhoods of each vertex in terms of the number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2021
ISSN: ['1042-9832', '1098-2418']
DOI: https://doi.org/10.1002/rsa.21028