当前位置: X-MOL 学术Random Struct. Algorithms › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Shotgun reconstruction in the hypercube
Random Structures and Algorithms ( IF 0.9 ) Pub Date : 2021-06-25 , DOI: 10.1002/rsa.21028
Michał Przykucki 1 , Alexander Roberts 2 , Alex Scott 2
Affiliation  

Mossel and Ross raised the question of when a random coloring of a graph can be reconstructed from local information, namely, the colorings (with multiplicity) of balls of given radius. In this article, we are concerned with random 2-colorings of the vertices of the urn:x-wiley:rsa:media:rsa21028:rsa21028-math-0001-dimensional hypercube, or equivalently random Boolean functions. In the worst case, balls of diameter urn:x-wiley:rsa:media:rsa21028:rsa21028-math-0002 are required to reconstruct. However, the situation for random colorings is dramatically different: we show that almost every 2-coloring can be reconstructed from the multiset of colorings of balls of radius 2. Furthermore, we show that for urn:x-wiley:rsa:media:rsa21028:rsa21028-math-0003, almost every urn:x-wiley:rsa:media:rsa21028:rsa21028-math-0004-coloring can be reconstructed from the multiset of colorings of 1-balls.

中文翻译:

超立方体中的霰弹枪重建

Mossel 和 Ross 提出了何时可以从局部信息重建图的随机着色的问题,即给定半径的球的着色(具有多重性)。在本文中,我们关注urn:x-wiley:rsa:media:rsa21028:rsa21028-math-0001维超立方体顶点的随机 2-着色,或等效的随机布尔函数。在最坏的情况下,urn:x-wiley:rsa:media:rsa21028:rsa21028-math-0002需要直径的球来重建。然而,随机着色的情况却截然不同:我们表明,几乎所有 2-着色都可以从半径为 2 的球的着色多重集重建。此外,我们表明,对于urn:x-wiley:rsa:media:rsa21028:rsa21028-math-0003,几乎所有 -urn:x-wiley:rsa:media:rsa21028:rsa21028-math-0004着色都可以从多重集重建1 球的着色。
更新日期:2021-06-25
down
wechat
bug