Reconstruction of shredded random matrices
arxiv(2024)
摘要
A matrix is given in “shredded” form if we are presented with the multiset
of rows and the multiset of columns, but not told which row is which or which
column is which. The matrix is reconstructible if it is uniquely determined by
this information. Let M be a random binary n× n matrix, where each
entry independently is 1 with probability p=p(n)≤1/2. Atamanchuk,
Devroye and Vicenzo introduced the problem and showed that M is
reconstructible with high probability for p≥ (2+ε)1/nlog
n. Here we find that the sharp threshold for reconstructibility is at
p∼1/2nlog n.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要