A conditionally sure ergodic theorem with an application to percolation

Michael Keane and Masato Takei

Stochastic Processes and their Applications, 2014, vol. 124, issue 11, 3651-3660

Abstract: We prove an apparently new type of ergodic theorem, and apply it to the site percolation problem on sparse random sublattices of Zd (d≥2), called “lattices with large holes”. 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.

Keywords: Ergodic theorem; Percolation; Fractal-like graphs (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304414914001379
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:124:y:2014:i:11:p:3651-3660

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spa.2014.06.007

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().