随机矩阵与擦除鲁棒框架
Random Matrices and Erasure Robust Frames
摘要:
数据擦除在通信中经常发生。防止擦除涉及数据表示中的冗余。在数学上,这可以通过使用帧的冗余来实现。测量帧对擦除的鲁棒性的一种方法是检查从帧中擦除一定数量的向量的帧的最坏情况条件数。在\cite{FicMix12}中引入了术语{ \em数字擦除鲁棒帧(NERF)},以更精确地描述帧的擦除鲁棒性。在论文中,作者建立了其条目独立于标准正态分布的随机帧可以抵抗高达约15%的擦除,并询问是否存在抵抗超过50%的擦除的帧。在本文中,我们表明,具有很高的概率随机帧,独立的维度,对任何数量的擦除,只要剩余的向量的数量至少是$1+δ$倍的尺寸为一些$δ_0>0$强大。这是最好的结果,也意味着擦除的比例可以任意接近1,同时仍然保持鲁棒性。我们的结果关键取决于一个新的估计的最小奇异值的矩形随机矩阵独立的标准正常的项目。
英文摘要:
Data erasure can often occur in communication. Guarding against erasures involves redundancy in data representation. Mathematically this may be achieved by redundancy through the use of frames. One way to measure the robustness of a frame against erasures is to examine the worst case condition number of the frame with a certain number of vectors erased from the frame. The term {\em numerically erasure-robust frames (NERFs)} was introduced in \cite{FicMix12} to give a more precise characterization of erasure robustness of frames. In the paper the authors established that random frames whose entries are drawn independently from the standard normal distribution can be robust against up to approximately 15\% erasures, and asked whether there exist frames that are robust against erasures of more than 50\%. In this paper we show that with very high probability random frames are, independent of the dimension, robust against any amount of erasures as long as the number of remaining vectors is at least $1+δ$ times the dimension for some $δ_0>0$. This is the best possible result, and it also implies that the proportion of erasures can arbitrarily close to 1 while still maintaining robustness. Our result depends crucially on a new estimate for the smallest singular value of a rectangular random matrix with independent standard normal entries.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。