arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.04772math.PR
收藏

有向图上的布尔渗流与随机交换过程

Boolean percolation on digraphs and random exchange processes

Georg Braun

AI总结:

本文在一般图论框架下研究 Lamperti 引入的长程渗流模型,探讨其与随机交换过程的联系,并阐明了格 $\mathbb{N}_0^n$ 和 $\mathbb{Z}^n$ 被本质覆盖的条件,同时证明无法覆盖有向 $n$ 叉树。

摘要:

我们在一般的图论表述下,研究由 Lamperti 引入的长程渗流模型。针对各种基础有向图,我们探讨了该模型与随机交换过程之间的联系。对于 $n \in \mathbb{N}$,我们阐明了在此模型中格 $\mathbb{N}_0^n$ 和 $\mathbb{Z}^n$ 被本质覆盖的条件。此外,对于所有 $n \geq 2$,我们证明在我们的模型中无法覆盖有向 $n$ 叉树。

英文摘要:

We study, in a general graph-theoretic formulation, a long-range percolation model introduced by Lamperti. For various underlying directed graphs, we discuss connections between this model and random exchange processes. We clarify, for $n \in \mathbb{N}$, under which conditions the lattices $\mathbb{N}_0^n$ and $\mathbb{Z}^n$ are essentially covered in this model. Moreover, for all $n \geq 2$, we establish that it is impossible to cover the directed $n$-ary tree in our model.

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

↑