符号序列与Tsallis熵
Symbolic Sequences and Tsallis Entropy
摘要：
我们解决这项工作，调查符号序列的长程相关性，通过使用计算模拟。我们分析了具有两个、三个和四个符号的序列，这些序列可以重复$l$次，概率分布为$p(l)\propto 1/ l^μ$。对于这些序列，我们验证了通常的熵增加得更慢时，相关的符号和Tsallis熵的展品，一个合适的选择$q$，线性行为。我们还研究了链作为一个随机行走的过程，并观察到一个不寻常的扩散行为取决于参数$μ$的值。
英文摘要：
We address this work to investigate symbolic sequences with long-range correlations by using computational simulation. We analyze sequences with two, three and four symbols that could be repeated $l$ times, with the probability distribution $p(l)\propto 1/ l^μ$. For these sequences, we verified that the usual entropy increases more slowly when the symbols are correlated and the Tsallis entropy exhibits, for a suitable choice of $q$, a linear behavior. We also study the chain as a random walk-like process and observe a nonusual diffusive behavior depending on the values of the parameter $μ$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
