arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.04750cs.DS
收藏

每行一个随机短块的近二次矩阵的有效高斯消去法及其应用

Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications

Martin Dietzfelbinger, Stefan Walzer

摘要:

在本文中,我们确定了一类新的稀疏近二次随机布尔矩阵,具有满行秩的$\mathbb{F}_2=\{0,1\}$以高概率,并可以转化为梯形几乎线性时间由一个简单的版本的高斯消元。具有维度$n(1-\varepsilon) \times n$的随机矩阵如下生成:在每行中,在随机位置处标识长度为$L=O((\log n)/\varepsilon)$的块。区块外的条目为0,区块内的条目由公平的硬币投掷给出。根据块的位置对行进行排序将矩阵转换为一种带矩阵,事实证明,高斯消去法在这种带矩阵上非常有效,并且具有很高的概率。为了证明,高斯消除的效果被解释为罗宾汉散列的(“抛硬币”)变体,其行为可以根据排队论的简单马尔可夫模型来捕获。根据这一领域的结果,确定了预期建造时间和高成功概率的界限。通过采用散列,该矩阵族导致检索数据结构的新实现,其表示用于$m=(1-\varepsilon)n$键的某集合$S$的任意函数$f\colon S \to \{0,1\}$。它需要$m/(1-\varepsilon)$位的空间,在字RAM上构造需要$O(m/\varepsilon^2$)预期时间,而查询需要$O(1/\varepsilon)$时间并且仅访问表示中的$O((\log m)/\varepsilon)$位的一个连续段。该方法与最先进的方法相比具有竞争力。通过完善的方法,检索数据结构导致(静态)完美的哈希函数和(静态)布隆过滤器的高效构造,具有几乎最佳的空间和非常本地的存储访问模式的查询。

英文摘要:

In this paper we identify a new class of sparse near-quadratic random Boolean matrices that have full row rank over $\mathbb{F}_2=\{0,1\}$ with high probability and can be transformed into echelon form in almost linear time by a simple version of Gauss elimination. The random matrix with dimensions $n(1-\varepsilon) \times n$ is generated as follows: In each row, identify a block of length $L=O((\log n)/\varepsilon)$ at a random position. The entries outside the block are 0, the entries inside the block are given by fair coin tosses. Sorting the rows according to the positions of the blocks transforms the matrix into a kind of band matrix, on which, as it turns out, Gauss elimination works very efficiently with high probability. For the proof, the effects of Gauss elimination are interpreted as a ("coin-flipping") variant of Robin Hood hashing, whose behaviour can be captured in terms of a simple Markov model from queuing theory. Bounds for expected construction time and high success probability follow from results in this area. By employing hashing, this matrix family leads to a new implementation of a retrieval data structure, which represents an arbitrary function $f\colon S \to \{0,1\}$ for some set $S$ of $m=(1-\varepsilon)n$ keys. It requires $m/(1-\varepsilon)$ bits of space, construction takes $O(m/\varepsilon^2$) expected time on a word RAM, while queries take $O(1/\varepsilon)$ time and access only one contiguous segment of $O((\log m)/\varepsilon)$ bits in the representation. The method is competitive with state-of-the-art methods. By well-established methods the retrieval data structure leads to efficient constructions of (static) perfect hash functions and (static) Bloom filters with almost optimal space and very local storage access patterns for queries.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑