• Corpus ID: 235658980

The mean-field behavior of the nearest-neighbor oriented percolation on the BCC lattice above $8+1$ dimensions

  title={The mean-field behavior of the nearest-neighbor oriented percolation on the BCC lattice above \$8+1\$ dimensions},
  author={Lung-Chi Chen and Satoshi Handa and Yoshinori Kamijima},
In this paper, we consider nearest-neighbor oriented percolation with independent Bernoulli bond-occupation probability on the d-dimensional body-centered cubic (BCC) lattice L and the set of non-negative integers Z+. Thanks to the nice structure of the BCC lattice, we prove that the infrared bound holds on L × Z+ in all dimensions d ≥ 9. As opposed to ordinary percolation, we have to deal with the complex numbers due to asymmetry induced by time-orientation, which makes it hard to estimate the… 

Tables from this paper


Mean-field behavior for nearest-neighbor percolation in $d>10$
We prove that nearest-neighbor percolation in dimensions d ≥ 11 displays mean-field behavior by proving that the infrared bound holds, in turn implying the finiteness of the percolation triangle
Mean-Field Behaviour and the Lace Expansion
These lectures describe the lace expansion and its role in proving mean-field critical behaviour for self-avoiding walks, lattice trees and animals, and percolation, above their upper critical
Triangle Condition for Oriented Percolation in High Dimensions
Tree graph inequalities and critical behavior in percolation models
Various inequalities are derived and used for the study of the critical behavior in independent percolation models. In particular, we consider the critical exponent γ associated with the expected
Percolation processes. I. Crystals and Mazes
The paper studies, in a general way, how the random properties of a ‘medium’ influence the percolation of a ‘fluid’ through it. The treatment diifers from conventional diffusion theory, in which it
Inequalities with applications to percolation and reliability
A probability measure μ on ℝ n + is defined to be strongly new better than used (SNBU) if for all increasing subsets . For n = 1 this is equivalent to being new better than used (NBU distributions
A Survey on the Lace Expansion for the Nearest-neighbor Models on the BCC Lattice
The aim of this survey is to explain, in a self-contained and relatively beginner-friendly manner, the lace expansion for the nearest-neighbor models of self-avoiding walk and percolation that
Progress in High-Dimensional Percolation and Random Graphs
Preface -- 1. Introduction and motivation -- 2. Fixing ideas: Percolation on a tree and branching random walk -- 3. Uniqueness of the phase transition -- 4. Critical exponents and the triangle
Generalized approach to the non-backtracking lace expansion
The lace expansion is a powerful perturbative technique to analyze the critical behavior of random spatial processes such as the self-avoiding walk, percolation and lattice trees and animals. The