A conditionally sure ergodic theorem with an application to percolation

作者：Keane Michael; Takei Masato^*

来源：Stochastic Processes and Their Applications, 2014, 124(11): 3651-3660.

DOI：10.1016/j.spa.2014.06.007

• Ergodic theorem
• Percolation
• Fractal-like graphs

We prove an apparently new type of ergodic theorem, and apply it to the site percolation problem on sparse random sublattices of Z(d) (d %26gt;= 2), called %26quot;lattices with large holes%26quot;. We show that for every such lattice the critical probability lies strictly between zero and one, and the number of the infinite clusters is at most two with probability one. Moreover for almost every such lattice, the infinite cluster, if it exists, is unique with probability one.

• 出版日期2014-11