Construction of the Incipient Infinite Cluster for Spread-out Oriented Percolation Above 4 + 1 Dimensions

 We construct the incipient infinite cluster measure (IIC) for sufficiently spread-out oriented percolation on ℤ ^d × ℤ₊, for d +1 > 4+1. We consider two different constructions. For the first construction, we define ℙ ⁿ (E) by taking the probability of the intersection of an event E with the event that the origin is connected to (x,n)  ℤ ^d × ℤ₊, summing this probability over x  ℤ ^d , and normalising the sum to get a probability measure. We let n → ∞ and prove existence of a limiting measure ℙ_∞, the IIC. For the second construction, we condition the connected cluster of the origin in critical oriented percolation to survive to time n, and let n → ∞. Under the assumption that the critical survival probability is asymptotic to a multiple of n ⁻¹, we prove existence of a limiting measure ℚ_∞, with ℚ_∞ = ℙ_∞. In addition, we study the asymptotic behaviour of the size of the level set of the cluster of the origin, and the dimension of the cluster of the origin, under ℙ_∞. Our methods involve minor extensions of the lace expansion methods used in a previous paper to relate critical oriented percolation to super-Brownian motion, for d+1 > 4+1. Received: 13 December 2001 / Accepted: 11 July 2002 Published online: 29 October 2002 RID="*" ID="*" Present address: Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. E-mail: rhofstad@win.tue.nl     

Scaling for a random polymer

LetQ _n ^β be the law of then-step random walk on ?^d obtained by weighting simple random walk with a factore ^?β for every self-intersection (Domb-Joyce model of “soft polymers”). It was proved by Greven and den Hollander (1993) that ind=1 and for every β∈(0, ∞) there exist θ^*(β)∈(0,1) and such that under the lawQ _n ^β asn→∞: $$\begin{array}{l} (i) \theta ^* (\beta ) is the \lim it empirical speed of the random walk; \\ (ii) \mu _\beta ^* is the limit empirical distribution of the local times. \\ \end{array}$$ A representation was given forθ ^*(β) andµ _β ^β in terms of a largest eigenvalue problem for a certain family of ? x ? matrices. In the present paper we use this representation to prove the following scaling result as β?0: $$\begin{array}{l} (i) \beta ^{ - {\textstyle{1 \over 3}}} \theta ^* (\beta ) \to b^* ; \\ (ii) \beta ^{ - {\textstyle{1 \over 3}}} \mu _\beta ^* \left( {\left\lceil { \cdot \beta ^{ - {\textstyle{1 \over 3}}} } \right\rceil } \right) \to ^{L^1 } \eta ^* ( \cdot ) . \\ \end{array}$$ The limitsb ^*∈(0, ∞) and are identified in terms of a Sturm-Liouville problem, which turns out to have several interesting properties. The techniques that are used in the proof are functional analytic and revolve around the notion of epi-convergence of functionals onL ²(?⁺). Our scaling result shows that the speed of soft polymers ind=1 is not right-differentiable at β=0, which precludes expansion techniques that have been used successfully ind≧5 (Hara and Slade (1992a, b)). In simulations the scaling limit is seen for β≦10^?2.     

Possible Loss and Recovery of Gibbsianness¶During the Stochastic Evolution of Gibbs Measures

We consider Ising-spin systems starting from an initial Gibbs measure ν and evolving under a spin-flip dynamics towards a reversible Gibbs measure μ≠ν. Both ν and μ are assumed to have a translation-invariant finite-range interaction. We study the Gibbsian character of the measure νS(t) at time t and show the following: (1) For all ν and μ, νS(t) is Gibbs for small t. (2) If both ν and μ have a high or infinite temperature, then νS(t) is Gibbs for all t > 0. (3) If ν has a low non-zero temperature and a zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t and non-Gibbs for large t. (4) If ν has a low non-zero temperature and a non-zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t, non-Gibbs for intermediate t, and Gibbs for large t. The regime where μ has a low or zero temperature and t is not small remains open. This regime presumably allows for many different scenarios. Received: 26 April 2001 / Accepted: 10 October 2001     

Random walks on inhomogeneous lattices

For lattices with two kinds of points (black and white), distributed according to a translation-invariant joint probability distribution, we study statistical properties of the sequence of consecutive colors encountered by a random walker moving through the lattice. The probability distribution for the single steps of the walk is considered to be independent of the colors of the points. Several exact results are presented which are valid in any number of dimensions and for arbitrary probability distributions for the coloring of the points and the steps of the walk. They are used to derive a few general properties of random walks on lattices containing traps.Presented at the Symposium on Random Walks, Gaithersburg, MD, June 1982.     

On three conjectures by K. E. Shuler

Some fifteen years ago, Shuler formulated three conjectures relating to the large-time asymptotic properties of a nearest-neighbor random walk on ² that is allowed to make horizontal steps everywhere but vertical steps only on a random fraction of the columns. We give a proof of his conjectures for the situation where the column distribution is stationary and satisfies a certain mixing codition. We also prove a strong form of scaling to anisotropic Brownian motion as well as a local limit theorem. The main ingredient of the proofs is a large-deviation estimate for the number of visits to a random set made by a simple random walk on . We briefly discuss extensions to higher dimension and to other types of random walk.Dedicated to Prof. K. E. Shuler on the occasion of his 70th birthday, celebrated at a Symposium in his honor on July 13, 1992, at the University of California at San Diego, La Jolla, California.     

A long-time tail for random walk in random scenery

Consider a simple random walk on ^d whose sites are colored black or white independently with probabilityq, resp. 1–q. Walk and coloring are independent. Letn _k be the number of steps by the walk between itskth and (k+1) th visits to a black site (i.e., the length of itskth white run), and let _k =E(n _k )–q ^–1. Our main result is a proof that (*) lim _k k ^d/2 _k = (1 –q)q ^{d/2 – 2}(d/2) ^d/2. Since it is known thatq ^{– 1} _k =E(n ₁ n _{k + 1} B) –E(n ₁ B)E(n _{k + 1} B), withB the event that the origin is black, (*) exhibits a long-time tail in the run length autocorrelation function. Numerical calculations of _k (1k100) ind=1, 2, and 3 show that there is an oscillatory behavior of _k for smallk. This damps exponentially fast, following which the power law sets in fairly rapidly. We prove that if the coloring is not independent, but is convex in the sense of FKG, then the decay of _k cannot be faster than (*).     

Dynamic structure factor in a random diffusion model

Let {X _t:0} denote random walk in the random waiting time model, i.e., simple random walk with jump ratew ^–1(X _t), where {w(x):x^d} is an i.i.d. random field. We show that (under some mild conditions) theintermediate scattering function F(q,t)=E ₀ (q^d) is completely monotonic int (E ₀ denotes double expectation w.r.t. walk and field). We also show that thedynamic structure factor S(q, w)=2 ₀ cos(t)F(q, t) exists for 0 and is strictly positive. Ind=1, 2 it diverges as 1/||^1/2, resp. –ln(||), in the limit 0; ind3 its limit value is strictly larger than expected from hydrodynamics. This and further results support the conclusion that the hydrodynamic region is limited to smallq and small such that ||D |q|², whereD is the diffusion constant.