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

退化随机环境

Degenerate random environments

Mark Holmes, Thomas S. Salisbury

摘要:

我们考虑某些独立同分布的连通性。$\Z^d$上的随机环境,其中在每个位置,某些步骤可能不可用。场地渗流和定向渗流可以看作是我们所考虑的模型的特殊情况。在这类模型中,最常被研究的量之一是从原点沿着连通路径可以到达的(随机)顶点集。更一般地说,对于我们考虑的模型,多种不同类型的连通性是有意义的,包括:从原点可以到达的顶点集;从原点可以到达的顶点集;两者的交集。与渗流模型一样,我们考虑的许多模型都承认或预期承认相变。本文的主要结果之一是证明了一些二维模型的相变是非单调的,在其基础参数的存在性,和改进的边界上的定向网站渗流的临界值的三角形晶格。随机有向图的连通性为理解这些随机环境中的随机游动的渐近性质提供了基础,我们将在第二篇论文中对此进行研究。

英文摘要:

We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider. In such models, one of the quantities most often studied is the (random) set of vertices that can be reached from the origin by following a connected path. More generally, for the models we consider, multiple different types of connectivity are of interest, including: the set of vertices that can be reached from the origin; the set of vertices from which the origin can be reached; the intersection of the two. As with percolation models, many of the models we consider admit, or are expected to admit phase transitions. Among the main results of the paper is a proof of the existence of phase transitions for some two-dimensional models that are non-monotone in their underlying parameter, and an improved bound on the critical value for oriented site percolation on the triangular lattice. The connectivity of the random directed graphs provides a foundation for understanding the asymptotic properties of random walks in these random environments, which we study in a second paper.

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

↑