Measures on Algebraic-Topological Structures

Piotr Zakrzewski , in Handbook of Measure Theory, 2002

THEOREM 1.6

Suppose a group G acts by measurable transformations on a σ-finite measure space (X, ∑, m) and assume that the measure m is quasi-invariant. If P is a finite, finitely additive, invariant measure defined on ∑ with P ∼ m, then the function µ defined by

μ ( A ) = inf { n P ( A n ) : A n , A n A n } f o r A ,

is a finite, σ-additive, invariant measure on ∑ with µ ∼ m.

To formulate another necessary and sufficient condition for the existence of an invariant probability measure we need the notion of a weakly wandering set.

Suppose a group G acts by measurable transformations on a measurable space (X, ∑). A set A ∈ ∑ is called weakly wandering (under G) if there exist elements g n G , n , such that g n A g m A = 0 for n m . Clearly, every weakly wandering set is G-negligible.

The following strengthening of the Hopf-Kawada theorem was first proved by Hajian and Kakutani (1964) for ℤ-actions and then generalized by Hajian and Itô (1969) to arbitrary actions (partial generalizations were obtained by several authors – see the references in Hajian and Itô (1969)).

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/B9780444502636500282

Handbook of Dynamical Systems

Luis Barreira , ... Omri Sarig , in Handbook of Dynamical Systems, 2006

Lemma 5.13 [139]

Let f : XX be a measurable transformation. If K :X → ℝ is a positive measurable function tempered on some subset ZX, then for any ε > 0 there exists a positive measurable function Kε :Z → ℝ such that K ( x ) K ε ( x ) and if xZ then

e ε K ε ( f ( x ) ) K ε ( x ) e ε .

Note that if f preserves a Lebesgue measure ν on the space X, then any positive function K :X → ℝ with log KL 1(X, ν) satisfies (5.17). The following is now an immediate consequence of Theorem 5.12.

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/S1874575X06800275

Topics from Ergodic Theory

George Roussas , in An Introduction to Measure-Theoretic Probability (Second Edition), 2014

15.4 Measure-Preserving Ergodic Transformations, Invariant Random Variables Relative to a Transformation, and Related Results

The concept of invariance is also defined for r.v.s.

Definition 9

Let T be a (measurable) transformation on ( Ω , A , P ) into itself, and let X be a r.v. on the same space. We say that X is invariant (relative to T ), if X ( ω ) = X ( T ω ) , ω Ω .

Remark 4

For an invariant r.v. X , it is immediate that X ( ω ) = X ( T n ω ) , n 0 (and for n = - 1 , - 2 , , if T is one-to-one onto). Indeed, let ω = T - 1 ω . Then

X ( T - 1 ω ) = X ( ω ) = X ( T ω ) = X ( T ( T - 1 ω ) ) = X ( ω ) ,

and likewise, if T - n ω = ω , then

X ( T - n ω ) = X ( ω ) = X ( T ω ) = X ( T ( T - n ω ) ) = X ( T - ( n - 1 ) ω ) = X ( ω ) ,

by the induction hypothesis.

The fact that X ( ω ) = X ( T n ω ) , ω Ω , n = 0 , ± 1 , , means that X ( ω ) remains constant on the orbit T n ω , n = 0 , ± 1 ,

Now the question arises as to what r.v.s are invariant. The answer to this is given by the following result.

Proposition 16

Let T be a (measurable) transformation on ( Ω , A , P ) into itself, and let X be a r.v. on the same space. Then X is invariant (relative to T ), if and only if X is J -measurable, where J is the σ -field of ( T -) invariant sets in A .

Proof

Let X be invariant, and set A ( x ) = ω Ω ; X ( ω ) x , x R .

Then

T - 1 A ( x ) = ω Ω ; T ω A ( x ) = ω Ω ; X ( T ω ) x = ω Ω ; X ( ω ) x = A ( x ) ,

since X ( T ω ) = X ( ω ) . Thus, T - 1 A ( x ) = A ( x ) , x R , and this establishes J -measurability for X .

Next, let X be J -measurable. We shall show that X is invariant. Since every X is the pointwise limit of simple r.v.s, it suffices to show the result for the case that X is only an indicator function. So let X = I A with A J . Then

X ( T ω ) = I A ( T ω ) = I T - 1 A ( ω ) = I A ( ω ) = X ( ω ) , since T - 1 A = A . ( See also Exercise 4 . )

Ergodicity and invariant r.v.s are related as follows.

Proposition 17

Let T be a (measurable) transformation on ( Ω , A , P ) into itself. Then T is ergodic, if and only if every real-valued r.v. invariant relative to T , defined on the same probability space, is a.s. equal to a finite constant.

Proof

Suppose that every invariant r.v. is a.s. equal to a constant, and let A be an arbitrary set in J . If we set X = I A , then X is J -measurable, and therefore invariant, by Proposition 16. Since X is equal to 1 or 0 with probability P ( A ) or P ( A c ) , respectively, we have that

P ( A ) = 1 or P ( A c ) = 1 . So P ( A ) = 0 or P ( A ) = 1 .

Next, suppose that T is ergodic, so that P ( A ) = 0 or 1 for every A J . We shall prove that every invariant r.v. X is a.s. equal to a constant. Since X is invariant, it is J -measurable and hence P ( X < x ) = 0 or 1 for every x R . On the other hand, P ( X < x ) 1 as x . Hence P ( X < x ) = 1 for all x x 1 , some sufficiently large x 1 . Set

x 0 = inf x R ; P ( X < x ) = 1 ;

x 0 is finite; i.e., x 0 > - , because otherwise P ( X < x ) = 1 for all x would imply 1 = P ( X < x ) P ( X = - ) as x - , a contradiction.

Then

P x 0 - ε < X < x 0 + ε = P X < x 0 + ε - P X x 0 - ε = 1 - 0 = 1

for every ε > 0 . Letting ε 0 and observing that

x 0 - ε < X < x 0 + ε X = x 0 ,

we get P ( X = x 0 ) = 1 .

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/B9780128000427000153

Lyapunov Exponents and Strange Attractors

M. Viana , in Encyclopedia of Mathematical Physics, 2006

Linear Cocycles

Let μ be a probability measure on some space M and f : M M be a measurable transformation that preserves μ. Let π : E M be a finite-dimensional vector bundle, endowed with a Riemannian metric . x on each fiber E x = π 1 x . Let A : E E be a linear cocycle over f. What we mean by this is that

π o A = f o π

and the action A x : E x E f x of A on each fiber is a linear isomorphism. Notice that the action of the nth iterate A n is given by

A n ( x ) = A ( f n 1 ( x ) ) A ( f ( x ) ) . A ( x )

for every n 1 .

Assume the function log + A ( x ) x is μ-integrable:

[5] log + A ( x ) x L 1 ( μ )

(we write log + φ = log max { φ , 1 } , for any φ > 0 ). It is clear that the sequence of functions a n x = log A n x x satisfies

a m + n + n ( x ) a m ( x ) + a n ( f m ( x ) )

for every m, n, and x. It follows from J Kingman's subadditive ergodic theorem that the limit

lim n 1 n a n ( x )

exists for μ-almost all x. In view of [2], this means that the largest Lyapunov exponent λ k x of the sequence A n x , n 1 is a limit, and not just a lim sup, at almost every point.

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/B0125126662001000

On Products of Topological Measure Spaces

Grekas Stratos , in Handbook of Measure Theory, 2002

THEOREM 2.1

If μ is a Baire measure on a compact group G, then every automorphism of the measure algebra of μ can be induced by an invertible, completion Baire measurable transformation of G.

The proof uses an interesting method of combining the classical Weil-Pontrjagin theorem with ideas of Choksi (1972).

Choksi and Simha (1978) remarked that the proof of Theorem 2.1 "seems to depend on topological properties of homogeneity of the space". Confirming this vague assertion, these authors proved, among others, the following theorem.

THEOREM 2.2

Let G be a locally compact σ-compact group, L a closed subgroup of G and μ a σ-finite Baire measure on (the homogeneous space) G/L. Then, every automorphism of the measure algebra of μ is induced by an invertible, completion Baire measurable point transformation of G/L.

It is worthwhile to note, here, that the purpose of this section is not to survey the whole work on measures on compact groups, but, mainly, to focus the reader's interest on the similarity that exists between Haar measure and product measure.

In (1979), Choksi and Fremlin wrote an article in which a large class of results in topological measure theory, usually proved for Polish spaces, was shown to hold in any uncountable product i I X i of compact metric spaces. Two Radon probability measures on i I X i , whose measure algebras are homogeneous of the same Maharam type, where shown to be (completion) Baire isomorphic. Also, the authors, combining their results with Maharam's famous theorem, arrived at some surprising theorems, some of whose proofs do not assume any set-theoretic hypotheses. The main of the latter are included in the statement (for a precise statement, see Choksi and Fremlin (1979, Theorem 5)):

PROPERTY 2.3

For a large, in fact cofinal, class of cardinals I, any two completion regular measures on i I X i , are completion Baire isomorphic.

Choksi (1984) asks "whether analogues of the results of Choksi and Fremlin – without additional set-theoretic assumptions – are valid for compact groups (and possibly even for homogeneous spaces)". This important conjecture was based on the one hand, on Kakutani and Kodaire theorem, and on the other on Theorems 2.1 and 2.2. Furthermore, this conjecture implies the necessity to find an intimate connection between Haar measure and product measure.

Choban (1994) had already proved that every compact group is Baire isomorphic to a product of compact metric spaces. In a subsequent paper, the author rediscovered the same result and proved that such a Baire isomorphism can be constructed so that it takes Haar measure to a product measure (Grekas, 1994). Thus, the Haar measure on a compact group plays a similar role to that of a product measure in the structure theory of measure algebras on a product of compact metric spaces (similar results can be proved for compact homogeneous spaces (Grekas, 1995)).

Shortly before the previously mentioned, the author attempted, bearing in mind Choksi's question, to obtain "compact group analogues" of the results of Choksi and Fremlin (1979). Grekas (1992a) deals with the isomorphisms of measure algebras on compact groups and their inducing point maps. Modifying the proof of Theorem 2.1, the author first proves that two (Radon probability) measures on the group, whose measure algebras are homogeneous of the same type, are completion Baire isomorphic. The rest of the paper, as Choksi and Fremlin did, studies how many non-isomorphic completion regular measures can exist on the group. Using approximation by Lie groups, it is shown that the compact group analogue of Property 2.3 is valid (see Theorem 5.A and Remark 5.13(3) there); note that to carry out the extension to compact groups, it is used, in a crucial way, the fact – incidentally established there – that the Haar measure on any uncountable compact group G is homogeneous of Maharam type w(G). The author states nextly the following theorem.

THEOREM 2.4

If G is a compact group with w ( G ) w then the Maharam type of G is equal to the Maharam type of { 0 , 1 } r l ( G ) .

Although the statement was correct, there were some gaps in the proof; see also corrigendum (Grekas, 1994) (a detailed account of these problems is given in Godin (2000)).

REMARK 2.5

Theorem 2.4 leads to an affirmative answer to Choksi's question, not only regarding the results free on additional set-theoretic assumptions but also regarding the remaining results of Choksi and Fremlin.

A correct proof of Theorem 2.4 was done in Grekas and Mercourakis (1998), where the measure-theoretic structure of topological groups is further more investigated. More precisely. Theorem 2.4 is an immediate consequence of the following structure theorem (Grekas and Mercourakis, 1998, Theorems 1.1 and 1.4):

THEOREM 2.6

Let G be a compact group with ω ( G ) = α ω . There exist two families G ξ , H ξ , ξ < α of compact metric groupseach having at least two points if α ω + and two continuous open surjections

such that

where λ ξ , λ , μ ξ denotes the (normalized) Haar measure on G ξ , G , H ξ respectively.

Roughly speaking, the measure λ is compressed between ξ λ ξ and ξ μ ξ so that the maps f, g are very close to being continuous epimorphisms (see Remarks 1.2 and Corollaries 1.3, 1.6 in the same paper). Theorem 2.6, whose proof is based on classical results of Pontrjagin-van Kampen and Mostert (see Price (1997); also references given in Grekas and Mercourakis (1998). extends and refines the well-known structure theorem of Kuzminov (1959): every compact group is a dyadic space (Comfort et al., 1992) contains many interesting insights into the structure of topological groups). The remaining part of Grekas and Mercourakis (1998) deals with the structure of the Jordan algebra of the Haar measure. As it is already mentioned, the Haar measure on a compact group G is Baire isomorphic to the Haar measure on some product X = ξ < w ( G ) X ξ compact Lie groups. The authors, therefore, obtain a stronger result, in fact that the isomorphism can be chosen to be a "Jordan isomorphism" (see Definition 2.6 and Theorem 2.13); this, particularly, implies that the space of Riemann integrable functions on a compact group is isometric to that of Riemann integrable functions on some product of compact Lie groups (Corollary 2.15 there). Additionally, several applications of the above results are given. Among these, the authors obtain a direct proof of the existence of a strong – not necessarily invariant – lifting for the Haar measure on a compact group and a rather illuminating proof of the existence of uniformly distributed sequences on a compact separable group (Veech, 1971).

REMARKS AND QUESTIONS 2.7

(1)

Grekas (1995) showed, using Furstenberg's (1963) theorem that the phase space of any minimal distal flow is Baire isomorphic to a product of compact metric spaces; the isomorphism takes some invariant, completion regular probability measure to a product measure. According to the previously referred, the author believes that this isomorphism can be chosen to be also a Jordan isomorphism.

(2)

It is easy to verify that if two Radon probability spaces have isomorphic Jordan algebras, then they have isomorphic measure algebras are hence the same Maharam type (Grekas and Mercourakis, 1998). The converse is not true, as it follows from Examples (1) and (2) in the same paper. In view of these examples, it is natural to ask whether there exists a strictly positive measure μ on X = { 0 , 1 } α , α ω + , homogeneous of Maharam type or. such that its Jordan algebra is not isomorphic to the Jordan algebra of the Haar measure on X (of special interest is the case ω + α c ; notice that a similar question has been posed in Mercourakis (1996)).

(3)

Associate with any topological space X is the Boolean algebra Ω ( X ) of Baire sets modulo sets of first category. Given an automorphism τ of Ω ( X ) it may not be possible to find a point transformation of X that induces τ (Choksi et al., 1987). However, when X is a product of complete separable metric spaces, it is shown in Maharam (1979) that any automorphism of Ω ( X ) can be realized by an invertible, Baire measurable transformation of X. By combining Maharam's result with ideas of Grekas and Mercourakis (1998), it is possible to prove the same result in the case when X is any compact group (it is a natural question whether category results are valid for compact groups).

(4)

Methods which were developed in the proof of Theorem 2.6 can lead to some results concerning the "homeomorphic measure problem" for compact connected topological groups (Grekas and Mercourakis, 2002). For more information on this problem, see references in Prasad (1981), Morris and Peck (1983, 1984), Gryllakis (1989).

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/B978044450263650018X

Mathematical Statistical Physics

Alain-Sol Sznitman , in Les Houches, 2006

5 Diffusions in random environment

We now discuss the continuous set-up and consider a diffusion on ℝ d with local characteristics, i.e. covariance matrix and drift, that are bounded stationary functions a(x, ω), b(x, ω), x ∈ d , ω ∈ Ω, where Ω is endowed with a group ( t x ) x d of jointly measurable transformations preserving the probability ℙ on Ω. The local characteristics are supposed to satisfy a Lipschitz condition, i.e. for some K > 0,

(5.1) | a ( x , ω ) a ( y , ω ) | + | b ( x , ω ) b ( y , ω ) | K | x y | , for x , y d , ω Ω ,

and a(·, ·) is uniformly elliptic. Further they satisfy a finite-range dependence condition, i.e. for some R > 0,

(5.2) σ ( a ( x , ) , b ( x , ) , x A ) and σ ( a ( y , ω ) , b ( y , ω ) , y B ) are -independent, when A , B d lie at mutual distance at least R .

The diffusion in the random environment ω is then the solution of the martingale problem attached to

(5.3) L = 1 2 i , j = 1 d a i j ( y , ω ) i j 2 + i = 1 d b i ( y , ω ) i .

The main issue is now to understand its asymptotic behavior. When b ≡ 0, or L = ½ ▽(a(·, ω) ▽), or L = ½Δ − ▽ V(·, ω) · ▽, with V a bounded stationary function, the method of the environment viewed from the particle applies and enables to prove a functional central limit theorem for the particle, see for instance Kozlov [51], Olla [58], [59], Osada [60], Papanicolaou-Varadhan [61], [62], Yurinsky [91], and also for divergence-free drifts Landim-Olla-Yau [53], Oelschläger [57]. However, the application of the method is rigid, and for instance breaks down if one replaces ▽ V(·, ω) with ▽ V(·, ω) + u, with u ≠ 0 a constant vector, in the case of L = ½Δ − ▽ V(·, ω)· ▽. This case was only very recently treated in Shen [73], using methods stemming from the progresses made in the study of ballistic RWRE.

The investigation of diffusions in random environment attached to (5.3) in the general framework described above, constitutes a continuous analogue of the study of RWRE. In particular when d > 1, the model is massively non-self adjoint and few explicit calculations are available. Building up on the recent advances concerning ballistic random walk in random environment, progress has also been achieved in the analysis of diffusions in random environment with ballistic behavior (i.e. with non-degenerate limiting velocity), cf. Komorowski-Krupa [49], [50], Schmitz [70], [71], Shen [72], and also Goergen [34].

However diffusive behavior has remained quite poorly understood, we will now describe one recent advance. When d > 1, there is no explicit formula for what the limiting velocity ought to be, and in view of the discussion below (4.19)-(4.21), it is not a straightforward matter to predict whether the limiting velocity vanishes or not.

One convenient way to "center" the process when trying to investigate diffusive behavior, is to impose the following (restricted) isotropy condition:

(5.4) for any rotation matrix r preserving the union of coordinate axes of d , ( a ( r , ω ) , b ( r , ω ) ) has same law as ( r a ( , ω ) r T , r b ( , ω ) ) .

One then has the following result concerning small isotropic perturbation of Brownian motion:

Theorem 5.1. (d ≥ 3, [85], [86])

There is η 0(d, K, R) > 0, such that when

| a ( x , ω ) I | η 0 , | b ( x , ω ) | η 0 , f o r a l l x d , ω Ω ,

then for ℙ-a.e. ω,

(5.5) 1 t X t c o n v e r g e s i n P 0 , ω d i s t r i b u t i o n a s t , t o a B r o w n i a n m o t i o n w i t h v a r i a n c e σ 2 > 0 , ( f u n c t i o n a l c e n t r a l l i m i t t h e o r e m ) ,

(5.6) f o r a l l x d , P x , ω a . s . , lim t | X t | = , ( t r a n s i e n c e ) ,

(5.7) for any bounded f , g on d , that are

with u, ∈ ≥ 0, the solution of:

{ t u ɛ = L ɛ u ɛ + g i n ( 0 , ) × d u ɛ | t = 0 = f

and

L ɛ = 1 2 i , j = 1 d a i j ( x ɛ , ω ) i j 2 + 1 ɛ i = 1 d b i ( x ɛ , ω ) i , f o r ɛ > 0 , L 0 = 1 2 σ 2 Δ .

The situation under study is a continuous counterpart of the problem considered by Bricmont-Kupiainen [19] for RWRE (see also [14] for a control of exit distributions). The proof is however different, and provides very quantitative couplings of the diffusion in random environment with Brownian motion, cf. Proposition 6.2 of [86]. It uses a renormalization scheme together with a sequence of Hölder norms, coupling, and wavelets. The cases of not necessarily small isotropic perturbations, or of dimension 2, are presently open.

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/S0924809906800417

Introduction

In Inference for Heavy-Tailed Data Analysis, 2017

1.1 Basic Probability Theory

Let Ω be a space, which is an arbitrary, nonempty set. Write ω Ω if ω is an element of Ω, and write A Ω if A is a subset of Ω.

Definition 1.1

A nonempty class A of subsets of Ω is called an algebra if

i)

the complementary set A c A whenever A A ; and

ii)

the union A 1 A 2 A whenever A 1 A and A 2 A .

Moreover, A is called a σ -algebra or a σ -field if, in addition to i) and ii),
iii)

i = 1 A i A whenever A i A for i 1 .

Definition 1.2

If A is a σ-algebra with respect to the space Ω, then the pair ( Ω , A ) is called a measurable space. The sets of A are called measurable sets.

Definition 1.3

The elements of the σ-algebra B generated by the class of infinite intervals of the form [ , x ) for < x < are called Borel sets. The measurable space ( R ¯ = [ , ] , B ) is called Borel space.

Definition 1.4

If ( Ω 1 , A 1 ) and ( Ω 2 , A 2 ) are two measurable spaces and f is a mapping from Ω 1 to Ω 2 , then f is said to be a measurable transformation/mapping if f 1 ( A ) A 1 for any A A 2 , where f 1 ( A ) = { ω : ω Ω 1 , f ( ω ) A } .

Definition 1.5

For a measurable space ( Ω , A ) , a set function P defined on A is called a probability if

i)

P ( ) = 0 , where ∅ denotes the empty set;

ii)

P ( A B ) = P ( A ) + P ( B ) for disjoint events A , B A (i.e., A B = );

iii)

P ( i = 1 A i ) = i = 1 P ( A i ) for disjoint events A i A , i = 1 , 2 , .

In this case, ( Ω , A , P ) is called a probability space.

Definition 1.6

A real-valued measurable function X on a probability space ( Ω , A , P ) is called a random variable. The function

F ( x ) = P ( X x ) : = P ( { ω Ω : X ( ω ) x } ) for x R = ( , )

is called the cumulative distribution function or distribution function of X.

Definition 1.7

A sequence of random variables { X n } n = 1 defined on a probability space ( Ω , A , P ) is called independent if for any m 1 , 1 i 1 < < i m < and < x 1 , , x m <

P ( X i 1 x 1 , , X i m x m ) = j = 1 m P ( X i j x j ) .

Definition 1.8

If { X n } n = 0 is a sequence of random variables on a probability space ( Ω , A , P ) , then { X n } n = 1 is said to converge in probability to X 0 (notation: X n p X 0 ) if for any ϵ > 0

lim n P ( | X n X 0 | > ϵ ) = 0 .

Definition 1.9

If { X n } n = 0 is a sequence of random variables on a probability space ( Ω , A , P ) with corresponding cumulative distribution functions { F n ( x ) } n = 0 , then { X n } n = 1 is said to converge in distribution to X 0 (notation: X n d X 0 or X n d F 0 ) if for any continuity point x of F 0

lim n F n ( x ) = F 0 ( x ) .

Definition 1.10

A sequence of random variables { X n } on a probability space ( Ω , A , P ) is said to be bounded in probability if for any ϵ > 0 , there exist constants C > 0 and integer N such that

P ( | X n | > C ) ϵ for all n N .

Let { X n } be a sequence of random variables on a probability space ( Ω , A , P ) and { b n } be a sequence of positive constants. We write X n = o p ( b n ) if X n / b n p 0 , and write X n = O p ( b n ) if X n / b n is bounded in probability.

Definition 1.11

A stochastic process is a collection { X t : t T } , where T is a subset of R and X t is a random variable on a probability space ( Ω , A , P ) .

Definition 1.12

A Wiener process { W ( t ) : t 0 } is a continuous-time stochastic process satisfying

i)

W ( 0 ) = 0 ;

ii)

W ( t + u ) W ( t ) is independent of the σ-algebra generated by { W ( s ) : 0 < s t } for any u > 0 ;

iii)

W ( t + u ) W ( t ) has a normal distribution with mean zero and variance u for any u > 0 .

Definition 1.13

If W ( t ) for t 0 is a Wiener process, then B ( t ) = W ( t ) t T W ( T ) is called a Brownian Bridge on [ 0 , T ] . In this case,

B ( 0 ) = B ( T ) = 0 and E ( B ( s ) B ( t ) ) = s ( T t )

for 0 s < t T , but the increments are no longer independent.

Definition 1.14

The space D [ 0 , 1 ] denotes the space of functions on [ 0 , 1 ] that are right continuous and have left-hand limits.

For the space ( E , ε ) , let C K ( E ) be the set of all continuous, real valued functions on E with compact support, and C K + ( E ) be the subset of C K ( E ) consisting of continuous, nonnegative functions with compact support. Let M + ( E ) be the set of all nonnegative Radon measures on ( E , ε ) and define μ + ( E ) to be the smallest σ-field of subsets of M + ( E ) making the maps m m ( f ) = E f d m from M + ( E ) R measurable for all f C K + ( E ) . Here Radon means the measure of compact sets is always finite.

Definition 1.15

ξ is a random measure if it is a measurable map from a probability space ( Ω , A , P ) into ( M + ( E ) , μ + ( E ) ) .

Definition 1.16

For μ n , μ M + ( E ) , we say μ n converges vaguely to μ (written μ n v μ ) if μ n ( f ) μ ( f ) for all f C K + ( E ) .

Definition 1.17

C R d is a cone if t x C for every t > 0 and x C .

Let Λ denote the class of strictly increasing, continuous mappings of [ 0 , 1 ] onto itself with λ ( 0 ) = 0 and λ ( 1 ) = 1 for each λ Λ . Given x and y in the space D [ 0 , 1 ] , define d ( x , y ) to be the infimum of those positive ϵ for which there exists a λ Λ such that

sup t | λ ( t ) t | ϵ and sup t | x ( t ) y ( λ ( t ) ) | ϵ .

In this way, d ( x , y ) defines the Skorohod topology.

Definition 1.18

Let F be the cumulative distribution function of a random variable X. Then the generalized inverse of F is defined as

(1.1) F ( u ) = inf { t : F ( t ) u } for 0 < u < 1 .

Lemma 1.1

Let F be a cumulative distribution function.

i)

For any x R and u ( 0 , 1 ) , F ( u ) x if and only if u F ( x ) .

ii)

If U is a random variable with uniform distribution over ( 0 , 1 ) , then the distribution function of F ( U ) is F ( x ) .

iii)

If F is continuous, then F ( F ( u ) ) = u for 0 < u < 1 .

Proof

i) If u F ( x ) , then x { t : F ( t ) u } , which implies that

x inf { t : F ( t ) u } = F ( u ) .

Next assume that F ( u ) x . Since F is right continuous, we have

F ( x ) F ( F ( u ) ) = F ( inf { t : F ( t ) u } ) = inf { F ( t ) : F ( t ) u } u .

Hence part i) follows.

ii) It follows from part i) that P ( F ( U ) x ) = P ( U F ( x ) ) = F ( x ) for any x. That is, F ( U ) has the distribution function F ( x ) .

iii) It follows obviously. □

Like Csörgő et al. [25], we use the following conventions concerning integrals.

When a < b and g is a left-continuous and f is a right-continuous function, then

(1.2) a b f d g = [ a , b ) f d g and a b g d f = ( a , b ] g d f ,

whenever these integrals make sense as Lebesgue–Stieltjes integrals. In this case the usual integration by parts formula

(1.3) a b f d g + a b g d f = g ( b ) f ( b ) g ( a ) f ( a )

is valid.

For any Brownian bridge { B ( s ) : 0 s 1 } , and with 0 a < b 1 and the functions f and g as above we define the following stochastic integral

(1.4) a b f ( s ) d B ( s ) = f ( b ) B ( b ) f ( a ) B ( a ) a b B ( s ) d f ( s )

and the same formula for g replacing f.

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/B9780128046760000018

TRANSIENT RANDOM WALKS ON DYNAMICALLY ORIENTED LATTICES

NADINE GUILLOTIN-PLANTARD , RENÉ SCHOTT , in Dynamic Random Walks, 2006

4 EXAMPLES

The main motivation of this work is the generalization of the transience of the i.i.d. case of [23] to dependent or inhomogeneous orientations. Depending on the original dynamical systems, we obtain various extensions corresponding to well known examples of dynamical systems such that Bernoulli and Markov shifts, Gibbs measures, SRB measures (Manneville-Pomeau maps), rotations on the torus, etc., our framework is very general from this point of view. Nevertheless, to get the transience of the walk, we need to generate the orientations by choosing a suitable function f satisfying (10.4). In some sense, this condition requires the model not to be too close to the deterministic case because to satisfy the condition, f should not be "μ-too often" 0 or 1. We describe now the examples providing extensions of the i.i.d. case to various disordered orientations.

1 Bernoulli shift

The first considered dynamical system S is the Bernoulli shift on the product space E = [0, 1]z endowed with the Borel σ-algebra, the bilatere shift transformation T defined by

T : E E x = ( x y ) y Z ( T x ) y = x y + 1 , y Z .

The product Lebesgue measure μ = λ⊗z of the Lebesgue measure λ on [0, 1] is T-invariant and we choose as generating function f the projection on the zero coordinate:

f : E [ 0 , 1 ] x x 0 .

For all y ∈ Z, we then have

f о T y ( x ) = x y = ξ ( y ) [ 0 , 1 ] .

We consider this ξ′s as new random variables on E whose indepen dence is inherited from the product structure of μ. The condition

E d μ f ( 1 f ) <

becomes

0 1 d λ ( x ) x ( 1 x ) <

and the transience holds in this particular case. In fact, this product form of μ allows in this annealed case another description of the i.i.d. case of [23], for which we check ξ ( y ) = 1 2 for all y ∈ ℤ and

(10.27) Cov μ [ X 0 , X y ] = E μ [ X 0 X y ] = 4 E [ ξ ( 0 ) ξ ( y ) ] 1 = 0.

The result is also valid in the quenched case, for which the distribution of the orientation has an inhomogeneous product form.

2 Markov shift

If one considers a measure μ with correlations, then the same holds for Pμ. It is the case when one considers a Markovian measure instead of a product one on the space [0,1]Z with stationary distribution π, whose correlations are given by (10.3).

The transience of the simple random walk on this particular dynamically oriented lattice holds for ℙμ-a.e. environment as soon as the following condition is satisfied:

0 1 d π ( x ) x ( 1 x ) < .

It is the case when the usual Lebesgue measure or Lebesgue measure of index p is the invariant measure.

In the quenched case, there are no correlations by construction and the law of the orientations depends on the measurable transformation only. This case is nevertheless different from this of the Bernoulli shift because the typical set of points x for which the transience holds depends on the measure μ.

3 Translation-invariant Gibbs measures

We consider now a measurable space of the form E = ∑z where ∑ is a finite alphabet and T is again the bilatere shift defined above. We focus on the Ising model for which ∑ = {−1, +1}, and the function f used to generate the transition probabilities and to come back in [0, 1] is a dyadic transformation. In ergodic theory, Gibbs measures can be defined as equilibrium states or directly in term of an energy function Ψ: E → R, regular enough and chosen here to be Hölder continuous (more details can be found in [93]). A Borel probability measure on E is a Gibbs measure for Ψ if for every homeomorphism τ that affects only finitely many coordinates,

τ ψ= μ e ψ τ

where

ψ τ = lim n ψ n о τ 1 ψ n

and Ψ n , is the restriction of Ψ on ∑{−n,…,n}. There exist many equivalent definitions of Gibbs measures in ergodic theory, see [93]. We focus here on the example of the Ising model where the energy function is

ψ( w )= J w 0 w 1

with a coupling J ∈ ℝ. The Gibbs measures are very different depending on the sign of the coupling; if J > 0, the model is said to be ferromagnetic and has positive correlations (one orientation is likely to agree with its neighbors), while in the antiferromagnetic case (J < 0) the sign of the correlations can differ. The case J = 0 correspond to the i.i.d. case, already known to be a transient case. To go back in [0, 1], we introduce f = d о π with π: {−1, + 1} → {0,1}z; ω ↦ σ with σ y = 1 + ω y 2 for all y ∈ ℤ, and

d : { 0 , + 1 } Z [ 0 , 1 ] ω y Z σ y 2 y .

Due to the absence of phase transition in this one dimensional model, the average of f under μ is 1 2 . Condition (10.4) is believed to be true as soon as the energy function is finite range. This would extend in particular the transience of the i.i.d. case to more general models with exponential decays of (positive or negative) correlations.

4 SRB measures, Manneville-Pomeau maps

SRB measures provide another source of examples for dependent orientations. When E is the interval [0, 1], a measure μ of the dynamical system S is said to be an SRB measure if the empirical measure 1 n i = 1 n δ T i ( x ) converge weakly to μ for Lebesgue a.e. x. There exist many other definitions of SRB measures, see e.g. [172, 89]. In particular, it has the Bowen boundedness property in the sense that it is close to a Gibbs measure on some increasing cylinder, i.e. there exists a constant C > 0 such that for all x ∈ [0,1] and every n ≥ 1

1 C μ ( I i 1 , , i n ( x ) ) exp ( k = 0 n 1 Φ ( T k ( x ) ) ) C

where Φ = − log|T′| and Ii1, …, in is the interval of monotonicity for Tn which contains x.

In some cases, it is possible to control the correlations for SRB measures and we detail now an example where our transience result holds, the Manneville-Pomeau maps. These maps have been introduced in the 1980′s to study intermittency phenomenon in the study of turbulence in chaotic systems ([7] and references therein) and has been recently identified as weakly Gibbsian measures, see [126]. They are expanding interval maps and in this example we describe the original MP map. The measurable space E is the unit interval [0,1] and for α ∈]0, 1[ the map is given by

T : [ 0 , 1 ] [ 0 , 1 ] x T ( x ) = x + x 1 + α mod 1.

The existence of an absolutely continuous (w.r.t. the Lebesgue measure on [0, 1]) SRB invariant measure μ has been established by [150] and the following bounds of Radon-Nikodym derivative h = d μ d λ has been proved (see [126, 185]):

(10.28) C , C > 0 s .t . C x α < h(x)< C x α .

This measure is known to be mixing, and a polynomial decay of correlation, with a power β > 0, has even been proved for g regular enough ([85, 118, 126, 189]):

(10.29) | C μ g ( y ) | = O ( | y | β ) .

The map T is not invertible but we use Theorem 10.2. It remains to find suitable function f who generates orientations for which the simple random walk is transient. By (10.28), a sufficient condition for the condition (10.4) to hold is

0 1 d x x α f ( x ) ( 1 f ( x ) ) <

and this is for example true for the function f ( x ) = 1 2 ( 1 + x T ( x ) ) and the choice of an α < 1 3 .

5 The rotation on the torus

We consider the dynamical system S = ([0, 1], B([0, 1]), λ, T α) where T α is the rotation on the torus [0, 1] with angle α ∈ ℝ defined by

and λ is the Lebesgue measure on [0, 1]. For every function f: [0, 1] → [0, 1] such that 0 1 f ( x ) d x = 1 2 and

0 1 d x f ( x ) ( 1 f ( x ) ) <

conclusions of Theorem 10.1 hold. Such functions are called admissible. Every function uniformly bounded from 0 and 1, with integral 1 2 is admissible. We also allow functions f to take values 0 and 1: for instance, f 1(x) = x is admissible although f 2(x) = cos2(2πx) is not. We actually have no explanations about this phenomenon, moreover we do not know the behavior (recurrence or transience) of the simple random walk on the dynamically oriented lattice generated by f 2. Nevertheless, we can construct particular angles and functions for which the random walk on the corresponding lattice is recurrent. Take α = 1 2 q for q an integer larger or equal to 1 and f = 1 [0,1/2[, then the lattice we obtain is Z2 with undirected vertical lines and horizontal strips of height q, alternatively oriented to the left then to the right. The simple random walk on this deterministic and periodic lattice is known to be recurrent, see [23]. A deeper study is needed for this particular choice of dynamical system.

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/B9780444527356500476

Mathematical Statistical Physics

Frank Redig , in Les Houches, 2006

4 Towards infinite-volume: the basic questions

In the previous subsection we showed how to compute probabilities of several subconfigurations in the thermodynamic limit. The computation of

(4.1) lim V 2 μ V ( η 0 = k )

for k = 2, 3, 4 is still possible explicitly, but already requires a "tour de force" performed in a seminal paper of Priezzhev [34]. For d > 2 the height probabilities 2, …, 2d cannot be computed explicitly, and probabilities of more complicated local events cannot be computed explicitly either (not even for ℤ2).

However the interesting features of this model, like power-law decay of correlations, avalanche tail distribution, etc., are all statements about the large volume behavior. A natural question is therefore whether the thermodynamic limit

(4.2) lim V d μ V

exists as a weak limit (we will define this convergence more accurately later on). Physically speaking this means that enlarging the system more and more leads to converging probabilities for local events, i.e., events like η(x 1) = k 1, … η (xn ) = kn . A priori this is not clear at all. Usually, e.g. in the context of models of equilibrium statistical mechanics, existence of the thermodynamic limit is based on some form of locality. More precisely existence of thermodynamic limits in the context of Gibbs measures is related to "uniform summability" of the "local potential". This "uniform locality" is absent in our model (the burning algorithm is non-local, and application of the addition operator can change the configuration in a large set).

Let us now come to some more formal definitions. For V ⊆ ℤ d a finite set we denote by Ω V = {1, … 2d} V the set of stable configurations in V. The infinite-volume stable configurations are collected in the set Ω = { 1 , , 2 d } d . We will always consider Ω with the product topology. Natural σ-fields on Ω are FV = σ{ψ x : η → η x , xV}, and the Borel-σ-field F = σ ( V d F V ) . If we say that μ is a measure on Ω we always mean a measure defined on the measurable space (Ω, F). For a sequence aV indexed by finite subsets of ℤ d and with values in a metric space (X, d) we say that aV a if for every ∈ > 0 there exists V 0 such that for all VV 0 finite, d(aV, a) < ∈. Remind that Ω with the product topology is a compact metric space. An example of a metric generating the product topology is

(4.3) d ( η , ξ ) = Σ x d 2 | x | | η ( x ) ξ ( x ) |

where for x = ( x 1 , , x d ) d , | x | = i = 1 d | x i | .

A function f : Ω → ℝ is said to be local if there exists a finite set V such that f ( η V ξ V c ) = f ( η V ζ V c ) for all η, ξ, ζ, i.e., the value of the function depends only of the heights at a finite number of sites. Of course a local function can be viewed as a function defined on Ω V if V is large enough. Local functions are continuous and the set of local functions is uniformly dense in the set of continuous functions (by Stone-Weierstrass theorem). So in words, continuity of a function f : Ω → ℝ means that the value of the function depends only weakly on heights far away (uniformly in these far-away heights).

Definition 4.1

Let ( μ V ) V d be a collection of probability measures on Ω V and μ a probability measure on Ω. We say that μ V converges to μ if for all local functions f

(4.4) lim V d μ V ( f ) = μ ( f )

Remark

If for all local functions the limit in the lhs of (4.4) exists, then by Riesz representation theorem, this limit indeed defines a probability measure on Ω.

We denote byℛ V the set of recurrent (allowed) configurations in finite volume V ⊆ ℤ d . The set ℛ ⊆ Ω is the set of allowed configurations in infinite-volume, i.e.,

(4.5) = { η Ω : V d finite , η V V }

For η ∈ Ω we define ax,V :

(4.6) a x , V η = ( a x , V η V ) η V c

For a measure μ concentrating on ℛ we say that ax,V ax μ-a.s. if there exists a set Ω′ ⊆ Ω with μ(Ω′) = 1 such that for all η ∈ Ω′, ax,V η converges to a configuration ax (η) (in the metric (4.3)) as V ↑ ℤ d . Ifax,V ax μ a.s, then we say that the infinite-volume addition operator ax is well-defined μ-almost surely. It is important to realize that we cannot expect ax,V η to converge for all η ∈ ℛ.. For instance consider the maximal configuration (in d = 2 e.g.) ηmax ≡ 4. Then it is easy to see that ax,V η does not converge: taking the limit V ↑ ℤ d along a sequence of squares or along a sequence of triangles gives a different result. Since we will show later on that we have a natural measure μ on ℛ, we can hope that "bad" configurations like ηmax are exceptional in the sense of the measure μ.

We now present a list of precise questions regarding infinite-volume limits.

1.

Do the stationary measures μ V = 1 | V | η V δ η converge to a measure μ as V ↑ ℤ d , concentrating on ℛ? Is the limiting measure μ translation invariant, ergodic, tail-trivial?

2.

Is ax well-defined μ-a.s.? Is μ invariant under the action of ax ? Does abelianness still hold (i.e., axay = ayax on a set of μ-measure one)?

3.

What remains of the group structure of products of ax in the infinite volume? E.g., are the ax invertible (as measurable transformations)?

4.

Is there a natural stationary (continuous time) Markov process {η t : t ≥ 0} with μ as an invariant measure?

5.

Has this Markov process good ergodic properties?

Regarding question 4, a natural candidate is a process generated by Poissonian additions. In words it is described as follows. At each site x ∈ d we have a Poisson process N t ϕ x with intensity ϕ x , for different sites these processes are independent. Presuppose now that questions 1−2 have a positive answer. Then we can consider the formal product

(4.7) Π x d a x

More precisely we want conditions on the addition rates ϕ x such that

lim V d Π x V a x ( η )

exists for μ almost every η ∈ ℛ (or preferably even for a bigger class of initial configurations η ∈ Ω). It turns out that a constant addition rate will not be possible (for the non-dissipative model). A sufficient condition is (as we will prove later)

(4.8) Σ x d ϕ x G ( 0 , x ) <

where G(0, x) is the Green function of the lattice Laplacian on ℤ d . This implies that for questions 4−5, we have to restrict to transient graphs (i.e., d ≥ 3). We remark here that probably the restriction d ≥ 3 is of a technical nature, and a stationary dynamics probably exists also in d = 2, but this is not proved. On the other hand, we believe that the condition (4.8) is necessary and sufficient for the convergence of the formal product (4.7). Results in that direction are presented in the last section of these notes.

4.1 General estimates

Suppose that we have solved problem 1 from our list in the previous section, i.e., we know that μ V converges to μ. Then we can easily solve problem 2.

Proposition 4.2

Suppose that μV converges to μ in the sense of definition 4.1. Suppose that d ≥ 3. Then a x = lim V d a x , V is μ-almost surely well-defined. Moreover there exists a μ-measure one set Ω′ ⊆ ℛℛ such that for all η ∈ Ω′, for all V ⊆ ℤ d finite and nx ≥ 0, x ∈ V the products x V a x n x ( η ) are well-defined.

a x 1 = lim V d a x , V 1 is μ-almost surely well-defined. Moreover there exists a μ-measure one set Ω′ ⊆ℛ such that for all η ∈ Ω′, for all V ⊆ ℤ d finite and nx ≥ 0, x ∈ V the products x V a x n x ( η ) are well-defined.

Proof

Let us prove that ax is μ-almost surely well-defined. The other statements of the proposition will then follow easily.

Call NV (x, y, η) the number of topplings at y needed to stabilize η = δ x in the finite volume V (so throwing away the grains falling off the boundary of V).

It is easy to see that for V′ ⊃ V and all y ∈ d , N V ( x , y , η ) N V ( x , y η ) (this follows from abelianness). Therefore we can define N ( x , y , η ) = lim V d N V ( x , y , η ) (which is at this stage possibly +∞). Clearly NV (x, ·, η) is only a function of the heights η(z), z ∈ V, and thus it is a local function of η.

Moreover, we have, μ V (NV (x, y, η)) = GV (x, y) (see (2.21), (3.20)). Therefore, using that μ V → μ,

(4.9) d μ ( N ( x , y , η ) ) = d μ ( lim V d N V ( x , y , η ) ) = lim V d μ ( N V ( x , y , μ ) ) lim V lim W d μ W ( N V ( x , y , η ) ) lim W d μ W ( N W ( x , y , η ) ) = lim W G W ( x , y ) = G ( x , y )

where we used d ≥ 3, so that G(x, y) < ∞ (this works in general for transient graphs).

This proves that N (x, y, η) is μ-a.s. well-defined and is an element of L 1 (μ) (so in particular finite, μ-a.s.). Therefore we can define

(4.10) a x ( η ) = η + δ x Δ N ( x , , η )

Then we have ax = lim V a x,V μ-almost surely, so ax is well-defined μ-a.s.

Let us now prove the a.s. existence of inverses a x 1 . In finite volume we have, for η ∈ ℛ V

(4.11) a x , V 1 η = η δ x + Δ n x V ( , η )

where now n x V ( y , η ) denotes the number of "untopplings" at y in order to make η − δ x recurrent. Upon an untoppling of a site y, the site y receives 2d grains and all neighbors z ∈ V of y lose one grain. Upon untoppling of a boundary site some grains are gained, i.e., the site receives 2d grains but only the neighbors in V lose one grain.

The inverse a x , V 1 can be obtained as follows. If η − δ x is recurrent (∈ ℛ V ), then it is equal to a x , V 1 η . Otherwise it contains a FSC with support V 0. Untopple the sites of V 0. If the resulting configuration is recurrent, then it is a x , V 1 η . Otherwise it contains a FSC with support V 1, untopple V 1, etc. It is clear that in this way one obtains a recurrent configuration a x , V 1 η such that (4.11) holds. Integrating (4.11) over μ V gives

(4.12) μ V ( n x V ( y , η ) ) = G V ( x , y )

Proceeding now in the same way as with the construction of ax , one obtains the construction of a x 1 in infinite volume. The remaining statements of the proposition are obvious.

The essential point in proving that ax is well-defined in infinite volume is the fact that the toppling numbers N (x, y, η) are well-defined in ℤ d , by transience.

For x ∈ d and η ∈ ℛ, we define the avalanche initiated at x by

(4.13) A υ ( x , η ) = { y d : N ( x , y , η ) > 0 }

This is possibly an infinite set, e.g. if η is the maximal configuration. In order to proceed with the construction of a stationary process, we need that μ is invariant under the action of the addition operator ax . This is the content of the following proposition.

Proposition 4.3

Suppose that avalanches are almost surely finite. Then we have that μ is invariant under the action of ax and a x 1 .

Proof.

Let f be a local function. We write, using invariance of μ W under the action of ax,W :

(4.14) f d μ a x f d μ = ( ( a x f a x , V f ) d μ ) + ( ( a x , V f ) d μ ( a x , V f ) d μ W ) + ( ( a x , V f ) d μ ( a x , W f ) d μ W ) + ( f d μ W f d μ ) : = A V + B V , W + C V , W + D W

For ∈ > 0 given, using that ax,V ax, A can be made smaller than ∈/4 by choosing V large enough. The second and the fourth term B and D can be made smaller than ∈/4 by choosing W big enough, using μ W → μ, the fact that f is local and the fact that for fixed V, ax,V f is also a local function. So the only problematic term left is the third one. If ax,V ax,W , then the avalanche is not contained in V. Therefore

C V , W 2 f μ W ( A υ ( x , η ) V )

Notice that for fixed V, the event (x, η) ⊈ V is a local event (depends only on heights in V together with its exterior boundary). Therefore, we can choose W big enough such that

μ W ( A υ ( x , η ) V ) μ ( A υ ( x , η ) V ) < ɛ / 8

and by the assumed finiteness of avalanches, we can assume that we have chosen V large enough such that

μ ( A υ ( x , η ) V ) < ɛ / 8

Since ∈ > 0 was arbitrary, and f an arbitrary local function, we conclude that μ is invariant under the action of ax .

By the finiteness of avalanches, for μ almost every η ∈ ℛ, there exists V = V(η) such that a x , V ( η ) = a x , V ( η ) ( η ) for all VV(η). It is then easy to see that a x 1 ( η ) = a x , V 1 ( η ) for all VV(η). One then easily concludes the invariance of μ under a x 1 .

4.2 Construction of a stationary Markov process

In this subsection we suppose that μ = lim V d exists, and that d ≥ 3, so that we have existence of ax and invariance of μ under ax . In the next section we will show how to obtain this convergence μ V → μ.

The essential technical tool in constructing a process with μ as a stationary measure is abelianness. Formally, we want to construct a process with generator

(4.15) L f ( η ) = Σ x ϕ x ( a x f f )

where ax f (η) = f (ax η). For the moment don't worry about domains, etc. For a finite volume V, the generator

(4.16) L V f ( η ) = Σ x V ϕ x ( a x f f )

defines a bounded operator on the space of bounded measurable functions. This is simply because ax are well-defined measurable transformations. Moreover it is the generator of a pure jump process, which can explicitly be represented by

(4.17) n t V = Π x V a x t ϕ x ( η )

where N t ϕ x are independent (for different x ∈ d ) Poisson processes with rate ϕ x .

The Markov semigroup of this process is

(4.18) S V ( t ) = e t L V f = Π x V e ϕ x ( a x I ) t

Notice that since μ is invariant under ax , it is invariant under SV (t) and SV (t) is a semigroup of contractions on Lp (μ) for all 1 ≤ p ≤ ∞. We are interested in the behavior of this semigroup as a function of V.

Theorem 4.4

Suppose that (4.8) is satisfied. Then, for all p > 1, and every local function f, SV (t) f is a Lp (μ) Cauchy net, and its limit S ( t ) f : = lim V d S V ( t ) f extends to a Markov semigroup on Lp (μ).

Proof

We use abelianness and the fact that SV (t) are Lp (μ) contractions to write, for VW ⊆ ℤ d

(4.19) S V ( t ) f S W ( t ) f p = S V ( t ) ( I S W \ V ( t ) ) f p = S V ( t ) 0 t S W \ V ( s ) ( L W \ V f ) d s p 0 t S W \ V ( s ) ( L W \ V f ) p d s t L W \ V f p

Now, suppose that f is a local function with dependence set Df .

(4.20) | L W \ V f | Σ x W \ V ϕ x | ( a x f f ) | Σ x W \ V 2 ϕ x f I ( y D f ¯ : N ( x , y , η ) > 0 )

Where D f ¯ is the union of Df with its external boundary. Hence

(4.21) L W \ V f p 2 f Σ x W \ V ϕ x I ( y D f ¯ : N ( x , y , η ) > 0 ) p 2 f Σ x W \ V ϕ x μ ( { η : y D f ¯ : N ( x , y , η ) > 0 } ) 2 f Σ x W \ V ϕ x Σ y D f ¯ G ( x , y )

This converges to zero as V, W ↑ ℤ d by assumption (4.8) (remember that D f ¯ is a finite set).

Therefore, the limit

(4.22) S ( t ) f = lim V d S V ( t ) f

exists in L (μ) for all f local and defines a contraction. Therefore it extends to the whole of L (μ) by density of the local functions. To verify the semigroup property, note that

(4.23) S ( t + s ) f S ( t ) ( S ( s ) f ) = lim W d lim V d S V ( t + s ) f S W ( t ) S V ( s ) f = lim W d lim V d S V ( s ) ( S V ( t ) S W ( t ) ) f lim W d lim V d ( S V ( t ) S W ( t ) ) f = 0

It is clear that S(t) 1 = 1, and S(t) f ≥ 0 for f ≥ 0, since for all V ⊆ ℤ d these hold for SV (t), i.e., S(t) is a Markov semigroup.

So far, abelianness delivered us a simple proof of the fact that under (4.8) we have a natural candidate semigroup with stationary measure μ. Kolmogorov's theorem gives us the existence of a Markov process with semigroup S(t). The following explicit representation can be used in order to show that this process has a decent (cadlag) version with paths that are right-continuous and have left limits.

Theorem 4.5

Let the addition rate satisfy (4.8). Denote bythe joint distribution of the independent Poisson processes N t ϕ x . Then μ ×almost surely, the product

(4.24) Π x V a x N t ϕ x η

converges as V ↑ ℤ d to a configuration ηt ∈ ℛ. The process t : t ≥ 0} is a version of the process with semigroup S(t) defined in Theorem 4.4, i.e., for all t ≥ 0, η ∈ Ω′, with μ(Ω′) = 1,

(4.25) S ( t ) f ( η ) = E η f ( η t )

Moreover this version concentrates on D([0, ∞), ℛ).

As a corollary of this theorem, one recovers the generator of the semigroup.

Proposition 4.6

Define

(4.26) ϕ = { f L 1 ( μ ) : Σ x d ϕ x | a x f f | d μ < }

For ϕ satisfying (4.8) all local functions are in ℬϕ. For f ∈ ℬϕ, the expression

(4.27) L f = Σ X d ( a x f f )

is well-defined, i.e., the series converges in Lp (μ) (for all 1 ≤ p ≤ ∞) and moreover,

(4.28) lim t 0 S ( t ) f f t = L f

in Lp(μ).

The following theorem shows that we can start the process from a measure stochastically below μ. We remind this notion briefly here, for more details, see e.g. [24] chapter 2. For η, ξ ∈ Ω we define η ≤ ξ if for all x ∈ d , η x ≤ ξ x . Functions f: Ω → ℝ preserving this order are called monotone. Two probability measures ν1, ν2 on Ω are ordered (notation ν1 ≤ ν2) if for all f monotone, the expectations are ordered, i.e., ν1 (f) ≤ ν2 (f). This is equivalent with the existence of a coupling ν12 of ν1 and ν2 such that

v { ( η , ξ ) : η ξ } = 1

Theorem 4.7

Let ν ≤ μ, andbe as in Theorem 4.5. Then, ν × ℙ almost surely the products x V a x N t ϕ x (η) converge, as V ↑ ℤ d , to a configuration ηt . {η t, t ≥ 0} is a Markov process with initial distribution ν.

Proof

For V ⊆ ℤ d finite and η ∈ Ω′, we define

(4.29) η t V = Π x V a x N t ϕ x ( η )

Then we have the relation

(4.30) η t V = η + N V t Δ n t V ( η )

where N t V denotes ( N t ϕ x ) x V , and n t V collects for all sites in ℤ d the number of topplings caused by addition of N t V to η. Since η ∈ Ω′, these numbers are well-defined. Moreover for η ∈ Ω′, the toppling numbers are non-decreasing in V and converge as V ↑ ℤ d to their infinite-volume counterparts nt which satisfy

(4.31) η t = η + N t Δ n t ( η )

For all V and η ≤ ξ it is clear that n t V ( η ) n t V ( ξ ) . Choose now ν12 to be a coupling of ν and μ such that ν121 ≤ η2) = 1. Clearly, η1 belongs to Ω′ with ν12 probability one. Therefore for ν12 almost all η1, the limit lim V d n t V ( η 1 ) = ( η 1 ) t is well-defined, and the corresponding process η t , starting from η = η1 is then defined via (4.31).

A trivial example of a possible starting configuration is the minimal configuration η ≡ 1. Less trivial examples are measures concentrating on minimal recurrent configurations (i.e., minimal elements of ℛ.).

Remark

In general we do not know whether νS(t) converges to μ as t → ∞, unless, as we will see later, ν is absolutely continuous w.r.t. μ. With respect to that question, it would be nice to find a "successfull" coupling, i.e., a coupling ℙζ,ξ of two versions of η t , starting from ζ, ξ such that lim t→∞ζ,ξ V (t) = ξ V (t)) = 1 for all finite V ⊆ ℤ d . Less ambitious but also interesting would be to obtain this result for ζ ∈ Ω′ and ξ = axζ. This would yield that all limiting measures lim n→∞ νS(tn ) along diverging subsequences tn ↑ ∞ are ax -invariant. Uniqueness of ax -invariant measures can then possibly be obtained by showing that μ is a Haar measure on some decent group consisting of products of ax .

Read full chapter

URL:

https://www.sciencedirect.com/science/article/pii/S092480990680051X