arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.01426math.PR
收藏

简单对称排它过程

Coalescing and branching simple symmetric exclusion process

Ivailo Hartarsky, Fabio Martinelli, Cristina Toninelli

摘要:

受动力学约束的相互作用粒子系统(KCM)的启发,我们考虑了一般有限图$G=(V,E)$上与$G$上的有偏投票模型对偶的可逆合并和分支简单排它过程。我们的主要目标是严格限制其对数Sobolev常数和弛豫时间,特别关注微妙的轻微超临界状态下,粒子的平衡密度趋于零的$|V|\rightarrow \infty$。我们的结果使我们能够非常直接地恢复和改善$\ell^p$ -混合,$p\ge 2$,和更一般的图形,混合时间的结果Pillai和史密斯的弗雷德里克森-安德森一个自旋促进(FA- $1$ f)KCM上的离散$d$维环面。鉴于应用到更复杂的$j$ f KCM,$j>1$,我们还扩展了一个类似的过程与更一般的产品状态空间的分析的一部分。

英文摘要:

Motivated by kinetically constrained interacting particle systems (KCM), we consider a reversible coalescing and branching simple exclusion process on a general finite graph $G=(V,E)$ dual to the biased voter model on $G$. Our main goal are tight bounds on its logarithmic Sobolev constant and relaxation time, with particular focus on the delicate slightly supercritical regime in which the equilibrium density of particles tends to zero as $|V|\rightarrow \infty$. Our results allow us to recover very directly and improve to $\ell^p$-mixing, $p\ge 2$, and to more general graphs, the mixing time results of Pillai and Smith for the Fredrickson-Andersen one spin facilitated (FA-$1$f) KCM on the discrete $d$-dimensional torus. In view of applications to the more complex FA-$j$f KCM, $j>1$, we also extend part of the analysis to an analogous process with a more general product state space.

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

↑