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

图上相互作用粒子系统的存在性与收敛性

Existence and Convergence of Interacting Particle Systems on Graphs

Kuldeep Guha Mazumder

AI总结:

本文研究了图上相互作用粒子系统在无界度数或跳跃速率下的存在性和收敛性,通过引入新的假设和条件,证明了在某些随机图模型中这些系统能够存在。

摘要:

我们为在局部有限图上具有可能无界度数或跳跃速率的相互作用粒子系统给出了一般的存在性和收敛性结果。我们允许局部状态空间为波兰空间,并且一个点的跳跃会影响其邻居的状态。相互作用粒子系统的两个常见假设是度数和跳跃速率的均匀界。在本文中,我们放松这些假设,允许存在高度数或快速跳跃的顶点。我们引入了新的假设,确保这些顶点彼此之间足够远,因此过程不会爆炸。我们的假设涉及某些加权连通常数在基础图的正方形图上的有限性,我们的证明过程是通过显示这些假设导致Poisson图构造的非渗流。对于某些随机图模型,我们给出了一些可实际验证的充分条件,使得我们的假设几乎必然成立。这些条件涉及自避游走从每个顶点出发的分数矩和固定幂次跳跃速率的乘积矩的指数增长。利用这些条件,我们展示了在随机图上存在具有可能无界跳跃速率的相互作用粒子系统,如接触过程、共识形成模型、进化模型等,这些随机图可能几乎必然缺乏度数的均匀界,例如在准传递图上的长程渗流和在Delone集上的几何随机图。

英文摘要:

We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the states of its neighbours. The two common assumptions on interacting particle systems are uniform bounds on degrees and jump rates. In this paper, we relax these assumptions and allow for vertices with high degrees or rapid jumps. We introduce new assumptions ensuring that such vertices are placed sufficiently apart from each other and hence the process does not blow up. Our assumptions involve finitude of certain weighted connective constants on the square graph of the underlying graph and our proofs proceed by showing that these assumptions imply non-percolation of the Poisson graphical construction. For some random graph models, we give practically verifiable sufficient conditions under which our assumptions hold almost surely. These conditions involve exponential growth of a fractional moment sum of probabilities of self-avoiding walks from each vertex and that of product moments of fixed powers of jump rates. Using these conditions, we show the existence of interacting particle systems with possibly unbounded jump rates like contact processes, consensus formation models, evolutionary models, etc., on random graphs which can lack uniform bounds on degrees almost surely, e.g., long-range percolations on quasi-transitive graphs, and geometric random graphs on Delone sets.

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

↑