语言的多维Boltzmann采样
Multi-dimensional Boltzmann Sampling of Languages
摘要:
本文讨论了统一的随机生成的单词从上下文无关的语言(在一个字母表的大小$k$),同时限制每个字母的目标频率的出现。我们的方法包括在一个多维扩展的玻尔兹曼采样器\cite{Duchon2004}。我们发现,大多数\emph{strong-connectivity}假设下,我们的采样返回一个字的大小在$[(1-\varepsilon)n, (1+\varepsilon)n]$和确切的频率在$\mathcal{O}(n^{1+k/2})$预期的时间。此外,如果我们接受$Ω(\sqrt{n})$中每个字母出现次数的宽度公差区间,则我们的采样器在预期的$\mathcal{O}(n)$时间内执行近似大小的单词生成。我们说明了这些技术的俄罗斯方块镶嵌均匀的统计在不同类型的tetraminoes的生成。
英文摘要:
This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size $k$), while constraining every letter to a targeted frequency of occurrence. Our approach consists in a multidimensional extension of Boltzmann samplers \cite{Duchon2004}. We show that, under mostly \emph{strong-connectivity} hypotheses, our samplers return a word of size in $[(1-\varepsilon)n, (1+\varepsilon)n]$ and exact frequency in $\mathcal{O}(n^{1+k/2})$ expected time. Moreover, if we accept tolerance intervals of width in $Ω(\sqrt{n})$ for the number of occurrences of each letters, our samplers perform an approximate-size generation of words in expected $\mathcal{O}(n)$ time. We illustrate these techniques on the generation of Tetris tessellations with uniform statistics in the different types of tetraminoes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。