大规模基数排序树
Radix sort trees in the large
摘要:
基于trie-based基数排序算法将成对不同的无限二进制串存储在二叉树的叶子中,使得每个叶子的Ulam-Harris编码等于对应串的前缀(即,初始段),其中前缀具有最小长度,使得它们成对不同。我们调查{ \em基数排序树链} -树值马尔可夫链时,出现连续存储无限二进制字符串$Z_1,\ldots, Z_n$,$n=1,2,\ldots$根据基于trie-based基数排序算法,其中的源字符串$Z_1, Z_2,\ldots$是独立和相同的分布。我们建立了一个双射之间的对应关系的基数排序树链与{ \em对称伯努利源}(也就是说,每个$Z_k$是一个公平的抛硬币序列)和家庭的基数排序树链的$Z_k$的共同分布是一个扩散的概率测度$\{0,1\}^\infty$。从本质上讲,我们的结果特征的所有方式,它是可能的条件,这样的基数排序树链一致的行为“在大”。
英文摘要:
The trie-based radix sort algorithm stores pairwise different infinite binary strings in the leaves of a binary tree in a way that the Ulam-Harris coding of each leaf equals a prefix (that is, an initial segment) of the corresponding string, with the prefixes being of minimal length so that they are pairwise different. We investigate the {\em radix sort tree chains} -- the tree-valued Markov chains that arise when successively storing infinite binary strings $Z_1,\ldots, Z_n$, $n=1,2,\ldots$ according to the trie-based radix sort algorithm, where the source strings $Z_1, Z_2,\ldots$ are independent and identically distributed. We establish a bijective correspondence between the full Doob--Martin boundary of the radix sort tree chain with a {\em symmetric Bernoulli source} (that is, each $Z_k$ is a fair coin-tossing sequence) and the family of radix sort tree chains for which the common distribution of the $Z_k$ is a diffuse probability measure on $\{0,1\}^\infty$. In essence, our result characterizes all the ways that it is possible to condition such a chain of radix sort trees consistently on its behavior "in the large".
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。