随机堆的割不变law of large numbers
A cut-invariant law of large numbers for random heaps
摘要：
配备Bernoulli测度的堆么半群是概率异步系统的模型。在这个框架中，我们引入了异步停时的概念，这是类似于经典概率过程的停时的概念。证明了一个强Bernoulli性质。一个概念的切割不变性制定的收敛遍历平均。然后证明了具有Bernoulli测度的堆幺半群的一个强大数律。最后，在此框架下，基于Kingman次可加遍历定理，研究了一个次可加的大数定律。
英文摘要：
Heap monoids equipped with Bernoulli measures are a model of probabilistic asynchronous systems. We introduce in this framework the notion of asynchronous stopping time, which is analogous to the notion of stopping time for classical probabilistic processes. A Strong Bernoulli property is proved. A notion of cut-invariance is formulated for convergent ergodic means. Then a version of the Strong law of large numbers is proved for heap monoids with Bernoulli measures. Finally, we study a sub-additive version of the Law of large numbers in this framework based on Kingman sub-additive Ergodic Theorem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
