Library of Congress Cataloging-in-Publication Data
Janicki, Aleksander Simulation and chaotic behavior of a-stable stochastic processes / Aleksander Janicki, Aleksander Weron. cm. -- (Monographs and textbooks in pure and applied p. mathematics; 178) Includes bibliographical references and index. ISBN 0-8247-8882-6 I. Stochastic processes--Data processing. I.Peron, A. II. Title. RI. Series. QA274.J35 1994 93-21359 003',76--dc20 CIP
The publisher offers discounts on this book when ordered in bulk quantities. For more information, write to Special Sales/Professional Marketing at the address below. This book is printed on acid-free paper. Copyright 1994 by MARCEL DEKKER, INC. All Rights Reserved. Neither this book nor any part may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, microfilming, and recording, or by any information storage and retrieval system, without permission in writing from the publisher. MARCEL DEKKER, INC. 270 Madison Avenue, New York, New York 10016 Current printing (last digit): 10 9 8 7 6 5 4 3 2 PRINTED IN THE UNITED STATES OF AMERICA
Contents Preface 11 Preliminary Remarks 1.1 Historical Overview 1.2 Stochastic a-Stable Modeling 1,3 Statistical versus Stochastic Modeling 1.4 Hierarchy of Chaos 1.5 Computer Simulations and Visualizations 1.6 Stochastic Processes
1 1 3 4 6 6 7
.....
2 Brownian Motion, Poisson Process, a-Stable Levy Motion 2.1 Introduction 2.2 Brownian Motion ... 2 3 The Poisson Process 2.4 a-Stable Random Variables 2.5 a-Stable Levy Motion
9 9 9 20 23 30
35 3 Computer Simulation of a-Stable Random Variables 35 3.1 Introduction 36 3.2 Computer Methods of Generation of Random Variables 3.3 Series Representations of Stable Random Variables • . • , • 40 43 3.4 Convergence of LePage Random Series 47 3.5 Computer Generation of a-Stable Distributions 3. Exact Formula for Tail Probabilities 51 55 3.7 Density Estimators • I 4
Stochastic Integration 4.1 Introduction 4 4,2 Ito Stochastic Integral .... 4.3 a-Stable Stochastic Integrals of Deterministic Functions 4.4 Infinitely Divisible Processes 4.5 Stochastic Integrals with ID Integrators . 4,6 Levy Characteristics 4.7 Stochastic Processes as Integrators 4.8 Integrals of Deterministic Functions with ID Integrators 4,9 Integrals with Stochastic Integrands and ID Integrators
. . •
.
0
.
,
i • i
•
•
.
im
67 67 69 73 75 79 83 86 90 96
PREFACE
vi
101 107
4.10 Diffusions Driven by Brownian Motion 4.11 Diffusions Driven by a-Stable Levy Motion
111 111 112 116 127 134
5 Spectral Representations of Stationary Processes 5.1 Introduction 5.2 Gaussian Stationary Processes 5.3 Representation of a--Stable Stochastic Processes 5A Structure of Stationary Stable Processes 5.5 Self-similar a-Stable Processes
141 6 Computer Approximations of Continuous Time Processes 6.1 Introduction 141 6.2 Approximation of Diffusions Driven by Brownian Motion . . . 142 6.3 Approximation of Diffusions Driven by a-Sta.ble Uvy Measure . 156 6.4 Examples of Application in Mathematics 158 171 '7 Examples of a-Stable Stochastic Modeling 171 7.1 Survey of a-Stable Modeling . 7.2 Chaos, Levy Flight, and Levy Walk 173 7.3 Examples of Diffusions in Physics 179 TA Logistic Model of Population Growth 192 7.5 Option Pricing Model in Financial Economics 196 203 203 205 21)8 217 218 224 226
8 Convergence of Approximate Methods 8_1 Introduction 8.2 Error of Approximation of 165 Integrals 8.3 The Rate of Convergence of LePage Type Series 8.4 Approximation of Levy a-Stable Diffusions 8.5 Applications to Statistical Tests of Hypotheses 8.6 Levy Processes and Poisson Random Measures 8.7 Limit Theorems for Sums of Random Variables
9 Chaotic Behavior of Stationary Processes 231 9.1 Examples of Chaotic Behavior 231 9.2 Ergo& Property of Stationary Gaussian Processes 239 9.3 Basic Facts of General E.rgodic Theory 242 9.4 Birkholf Theorem for Stationary Processes 246 9.5 Hierarchy of Chaotic Properties 251 9.6 Dynamical Functional 255 10 Hierarchy of Chaos for Stable and ID Stationary Processes 263 10.1 Introduction 263 10.2 Ergorlicity of Stable Processes 265 10.3 Mixing and Other Chaotic Properties of Stable Processes • . . 279 10.4 Introduction to Stationary ID Processes 287 10.5 Ergodic Properties of ID Processes 295 P
•
}
.
1
A
6
F
1
1
..
A
A. PENICK' and A, WERON 10.6 Mixing Properties of ID Processes
10,7 Examples of Chaotic Hehavior of ID Processes 10.8 Random Measures on Sequences of Sets
vii 297
302 307
Appendix: A Guide to Simulation
315
Bibliography
339
Index
353
There is no applied mathematics in form of a ready doctrine. It originates in the contact of mathematical thought with the surrounding world, but only when both mathematical spirit and the matter are in a flexible state. Hugo Steinhaus
SIMULATION AND CHAOTIC BEHAVIOR OF a-STABLE STOCHASTIC PROCESSES
Chapter 1 Preliminary Remarks 1.1 Historical Overview We start with the historical overview of a development of investigations and applications of a-stable random variables and processes. The interested reader looking for documented sources on this topic is referred to Fienberg (1992) and to some books reviewed there, e.g., Stigler (1986). The early problem considered by pioneering statisticians of the 18th and 19th centuries was to find the best fit of an equation to a set of observed data points. After some false starts they hit upon the method of least squares. Legendre's work seemed to be the most influential at the time. Laplace elaborated upon it, and finally, in a discussion of the distribution of errors, Gauss emphasized the importance of the normal or Gaussian distribution. Laplace was a great enthusiast of generating functions and solved many complicated probability problems exploiting them. As the theory of Fourier series and integrals emerged in the early 1800's, he and Poisson made the next natural step applying such representations of probability distributions as a new natural tool for analysis, thus introducing the powerful characteristic function method. Laplace seemed to be especially pleased noticing that the Gaussian density was its own Fourier transform. In the early 1850's Cauchy, Laplace's former student, became interested in the theory of errors and extended the analysis, generalizing the Gaussian formula to a new one 1
.fN(x) = — 7r
exp(—ctN) cos( tx) dt,
expressed as a Fourier integral with t N replacing t 2 . He succeeded in evaluating the integral (in the non-Gaussian case) only for N 1, thus obtaining the famous Cauchy law defined by the density
fi(x) = 7r ( c2 + x 2)
.
It was realized only much later (in 1919, thanks to Bernstein) that I N is positivedefinite, and hence is a probability density function only when 0 < N < 2.
1
2
CHAPTER 1
Replacing N by a real parameter a with values in (0, 2j, we find that the integral defining functions f, fa (x) is a source of remarkable surprises. After Cauchy there was a decline in mathematicians' interest in this subject until 1924, when the theory of stable distributions originated with Paul Levy. When fashion sought the most general conditions for the validity of the Central Limit Theorem, Levy' found simple exceptions to it, namely the class of a-stable distributions with index of stability a < 2. The ambiguous name stable has been assigned to these distributions because, if X 1 and X2 are random variables having such distribution, then X defined by the linear combination cX + c 2 X2 has a similar distribution with the same index a for any positive real values of the constants c, c 1 and c 2 with c' + Levy noted that the Gaussian case (a = 2) is "singular" because for all a E (0,2) all nondegenerate densities fa (r) have inverse power tails, i.e. f{izi>,} f°(x) dr C A for large A. Since these distributions have no second moments, the second moment existence condition for the CLT is violated, allowing for the possibility of unusual results. Research concerning stable stochastic processes and models has been directed towards delineating the extent to which they share the features of the Gaussian models, and even more significantly, towards discovering their own distinguishing and often surprising features, e.g., Weron (1984). In the last ten years many important results characterizing different properties of these processes (and of other subclasses of processes with independent increments) have been obtained by several authors. Of particular importance are the results concerning representations involving stochastic integrals. A collection of papers edited by Cambanis, Samorodnitsky and Taqqu (1991) provides a review of the state of the art on the structure of stable processes as models for random phenomena. Modern stochastic integration originated in the early work of Wiener. Stochastic integrals with respect to Brownian motion were defined by It (1944). Doob (1953) proposed a general integral with respect to L 2 --martingales. On the basis of the Doob--Meyer decomposition theorem, Kunita and Watanabe (1967) further developed the theory of this integral. Meyer and Doleans-Dade (1970) extended the definition of the stochastic integral to all local martingales and subsequently to semimartingales. The natural role of semimartingales was made evident thanks to the contribution of Bichteler (1981) and Dellacherie (1980), who established that semimartingales are the most general class of integrators for which one can have a reasonable definition of stochastic integral against predictable integrands. Our main tool of description of stochastic processes in which we are interested is a stochastic integral with respect to the a stable Levy motion or, in a more general setting, with respect to a-stable stochastic measures (see Samorodnitsky and Taqqu (1993)). The a stable Levy motion together with the Poisson process and Brownian motion are the most important examples of Levy processes, which form the first class of stochastic processes being studied in the modern spirit. They still provide the most important examples of Markov processes as well as of semimartingales (see Protter (1990)).
A. JANICKI and A. WERON
3
Thus, on the one hand, the class of stochastic processes in which we are interested is much broader than the class of Gaussian processes and, on the other, it is contained in the class of infinitely divisible processes (e.g., Levy processes), which itself is contained in the class of semimartingales.
1.2 Stochastic a—Stable Modeling In the past few years there has been an explosive growth in the study of physical and economic systems that can be successfully modeled with the use of stable distributions and processes. Especially infinite moments, elegant scaling properties and the inherent self-similarity property of stable distributions are appreciated by physicists. For a recent survey, see Janicki and Weron (1992). We believe that stable distributions and stable processes do provide useful models for many phenomena observed in diverse fields. The central-limit-type argument often used to justify the use of the Gaussian model in applications may also be applied to support the choice of the non-Gaussian stable model. That is, if the randomness observed is the result of summing many small effects, and those effects themselves follow a heavy-tailed distribution, then a non-Gaussian stable model may be appropriate. An important distinction between Gaussian and non-Gaussian stable distributions is that stable distributions are heavytailed, always with the infinite variance, and in some cases with the infinite first moment. Another distinction is that they admit asymmetry, or skewness, while a Gaussian distribution is necessarily symmetric about its mean. In certain applications then, where an asymmetric or heavy-tailed model is called for, a stable model may be a viable candidate. In any case, non Gaussian stable distributions furnish tractable examples of non-Gaussian behavior and provide points of comparison with the Gaussian case, highlighting the special nature of Gaussian distributions and processes. In order to appreciate the basic difference between a Gaussian distribution and a distribution with a long tail, Montroll and Shlesinger (1983b) proposed to compare the distribution of heights with the distribution of annual incomes for American adult males. An average individual who seeks a friend twice his height would fail. On the other hand, one who has an average income will have no trouble to discover a richer person, who, with a little diligence, may locate a third person with twice his income, etc. The income distribution in its upper range has a Pareto inverse power tail; however, most of the income distributions follow a log-normal curve, but the last few percent have a stable tail with exponent a = 1.6 (cf., Badgar (1980)), i.e., the mean is finite but the variance of the corresponding 1.6-stable distribution diverges.
CHAPTER 1
4
1.3 Statistical versus Stochastic Modeling The notions of a statistical model and a stochastic model may be understood differently and may be ambiguous in some situations. In order to clear up what we mean by these terms we formulate a few remarks on this subject. One of a number possible descriptions of statistical model is the following (see Clogg (1992)) What statistical methodology refers to in most areas today is virtually synonymous with statistical modeling. A statistical model can be thought of as an equation, or set of equations, that (a) link "inputs" to "outputs"..., (b) have both fixed and stochastic components, (c) include either a linear or a nonlinear decomposition between the two types of components, and (d) purport to explain, summarize or predict levels of or variability in the "outputs". A very interesting discussion about how to model the progression of cancer, the AIDS epidemic, and other real life phenomena, is contained in the chapter "Model building: Speculative data analysis" of Thompson and Tapia (1990). The main idea is to derive a stochastic process that describes as closely as possible an investigated problem. Starting from an appropriate system of axioms one has to arrive at a formula (a stochastic model) defining this process, construct it explicitly in some way, and verify its correctness and usefulness. Appealing to one of the problems they are interested in, Thompson and Tapia (1990) say "If we wish to understand the mechanism of cancer progression, we need to conjecture a model and then test it against a data base." Quite often a stochastic model is a synonym of a stochastic differential equation or system of stochastic differential equations. Thanks to ItO's theory of stochastic integration with respect to Brownian motion, it is commonly understood that any continuous diffusion process {X(t) : t > 0) with given drift and diffusion coefficients can be obtained as a solution of the stochastic differential equation X(t) = Xo a(s„V(s)) ds I c(s, X(s)) dB(s), 1> 0, where { B(1) : t a [0, Do)} stands for a Brownian motion process and X 0 is a given Gaussian random variable. The theory of such stochastic differential equations is well developed (see, e.g., Arnold (1974)) and they are widely applied in stochastic modeling. however, it is not so commonly understood that a vast class of diffusion processes {X(t) : t > 0) with given drift and diffusion coefficients can be described by the stochastic differential equation X(t) = X0 + f a(s, X(s)) ds
c(s, X(s))
1 > 0,
A. JANICKI and A. WERON
5
where {L (t) t E [0, cc)} stands for a stable Levy motion process and X 0 is a given a-stable random variable. Note that, in general, diffusion processes {X(t) : t > 0} defined above do not belong to the class of a-stable processes. On the other hand, they belong to the import class of diffusions with jumps. As sources of information on modern aspects of stochastic analysis (e.g., on various properties of stochastic integrals and existence of solutions of stochastic differential equations driven by stochastic measures of different kinds) we recommend, among others, Protter (1990) and Kwapien and Woyczynski (1992). An application of stochastic differential equations to statistical or stochastic model building is not an easy task. So it seems that the use of suitable statistical estimation techniques, computer simulation procedures, and numerical discretization methods should prove to be a powerful tool. In most of non-trivial cases ... the "closed form" solution is itself so complicated that it is good for little other than as a device for pointwise numerical evaluation. The simulation route should generally be the method of approach for non-trivial time-based modeling. ... Unfortunately, at the present time, the use of the modern digital computer for simulation based modeling and computation is an insignificant fraction of total computer usage. (Thompson and Tapia (1990), p. 232-233.) We agree with this opinion and add that, unfortunately, as far as we know, practical approximate methods for solving stochastic differential equations involving stochastic integrals with stable integrands or integrators are only now beginning to be developed. In our exposition we emphasize the methods exploiting computer graphics. Let us cite Thompson's opinion: I feel that the graphics-oriented density estimation enthusiasts fall fairly clearly into the exploratory data analysis camp, which tends to replace statistical theory by the empiricism of a human observer. Exploratory data analysis, including nonparametric density estimation, should be a first step down a road to understanding the mechanism of data generating systems. The computer is a mighty tool in assisting us with graphical displays, but it can help us even more fundamentally in revising the way we seek out the basic underlying mechanisms of real world phenomena via stochastic modeling. (Thompson and Tapia (1990), p. xiv.) In our approach we feel strongly inspired by the work of S. M. Ulam, who was one of the first enthusiasts of application of computers not only to scientific calculations or to the construction of mathematical models of physical phenomena but even to the investigation of new universal laws of nature; consult e.g., A. R. Bednarek and F. Ulam (1990).
6
CHAPTER 1
1.4 Hierarchy of Chaos The past few years have witnessed an explosive growth in interest in physical, chemical, engineering and economic systems that could be studied using stochastic and chaotic methods, see Berliner (1992) and Chatterjee and Yilrnaz (1992). "Stochastic" and "chaotic" refer to nature's two paths to unpredictability, or uncertainty. To scientists and engineers the surprise was that chaos (making a very small change in the universe can lead to a very large change at some later time) is unrelated to randomness. Things are unpredictable if you look at the individual events; however, one can say a lot about averaged-out quantities. This is where the stochastic stuff comes in. Our aim in the second part of the monograph is the theoretical investigation and computer illustration of the hierarchy of chaos for stochastic processes (Gaussian and non Gaussian stable) with applications to stochastic modeling. The ergodic theory is one of the very few parts of mathematics that has undergone substantial changes in recent decades. Previously, the ergodic theory had been solving rather general and qualitative problems but now it has become a powerful tool for studying statistical and chaotic properties of dynamical systems. This, in turn, makes ergodic theory quite interesting not only for mathematicians but also for physicists, biologists, chemists and many others. Indeed, the ergodic theory of stochastic processes is a part of general ergodic theory that is now intensively being developed. Until recently, characterizations of ergodic properties were known only for Markov or Gaussian processes. However, due to modern results on representations of different classes of stochastic processes in terms of stochastic integrals with respect to stochastic measures, it is now possible to characterize ergodic properties for a much wider spectrum of stochastic processes and establish the whole hierarchy of chaos (ergodicity, weak mixing, p-mixing, exactness and K-property). A crucial role in our theoretical study is played by the dynamical functional, which describes dynamical properties of stochastic processes and facilitates the investigation of ergodic properties of stochastic processes having a spectral representation. One of our ideas is to study and characterize ergodic properties of different classes of stochastic processes by means of purely theoretical as well as computer methods. We attempt to demonstrate usefulness of constructive numerical methods of approximation and computer simulations of such processes in investigation of their ergodic properties, providing some new quantitative information on their dynamical properties.
1.5 Computer Simulations and Visualizations Using our own software packages of computer programs written in languages Turbo C or Turbo Pascal for IBM PC, we want to show that proper use of computer graphics can provide useful and sometimes surprisingly interesting information enabling us to better understand phenomena that are of complicated, chaotic or stochastic nature.
A. JANICKI and A. WERON
7
To our knowledge, up to now the numerical analysis of stochastic differential systems driven by Brownian motion has essentially focused on such problems as mean-square approximation, pathwise approximation or approximation of expectations of the solution, etc. (see, e.g., Pardoux and Talay (1985), Talay (1983) and (1986), Yamada (1976)). There are some results on convergence of approximate solutions. The results on the rate of convergence of approximations of stochastic integrals driven by Brownian motion can be found in Rootzen (1980). Our aim is to adapt some of these constructive computer techniques based on discretization of the time parameter t to the case of stochastic integrals and stochastic differential equations driven by stable Levy motion. We describe some results on the convergence of approximate numerical solutions. There are still many open questions concerning this problem. The research in the theory of convergence of constructive approximations of stochastic integrals and stochastic differential equations driven by infinitely divisible measures or by semimartingales is in progress. There is a growing literature on the stability of stochastic integrals and stochastic differential equations with jumps (we refer the reader to Kasahara, Yamada (1991), Jakubowski, Memin and Pages (1989), Slominski (1989), Kurtz and Protter (1991) and (1992)). We have to rely on some results in this more general setting, though they are not so easily applicable in practice. Our idea is to represent the discrete time processes approximating stochastic processes with continuous time parameter t by appropriately constructed finite sets of random samples in order to obtain kernel estimators of densities of these processes on finite sets of values of t and to get some useful quantitative information on their behavior. We recommend the following monographs: Bratley, Fox and Schrage (1987), Devroye (1986) and (1987), Newton (1988), Rice (1990).
1.6 Stochastic Processes We restricted ourselves precisely to problems strictly connected with the theory of a-stable stochastic processes and with computer techniques of their approximate construction and simulation. We tried to make the book as much self-contained as possible. Our main goal was to convince the reader that our constructive approach provides powerful tools for modeling and solving approximately a wide variety of problems from the physical, biological and social sciences, so we provide detailed descriptions of necessary algorithms and a lot of examples of graphical presentation and visualization of stochastic processes of different kinds. Concentrating our attention on computer simulations and ergodic properties of a-stable processes, we tried to make our exposition as simple as possible, but the interested reader, on the basis of the very quickly growing literature concerning modern stochastic integration and its various applications, has an opportunity to go further in the investigation of the problems which are discussed here.
8
CHAPTER 1
We assume that the reader is familiar with some of the well known textbooks on probability theory, such as Breirnan (1968), Feller (1966) and (1971), Shiryaev (1984) or many others. As the main source of information on a stable processes we consider the book by Samorodnitsky arid Taqqu (1993) (see also a survey paper of Weron (1984)). Basic facts concerning some aspects of stochastic analysis and especially the theory of stochastic integrals and stochastic differential equations of different types can be found, for example, in Arnold (1974), Elliot (1982), Ikeda and Watanabe (1981), Jacod (1979), Kallianpur (1980), Kwapieri and Woyczyriski (1992), Liptser and Shiryaev (1977) and (1978), McKean (1969), Nletivier (1982), Protter (1990) or Revuz and Yor (1991).
Chapter 2 Brownian Motion, Poisson Process, a-Stable Levy Motion 2.1 Introduction In this chapter we recall briefly the main, most important properties of the Brownian motion and Poisson processes, list some properties of a-stable random variables, and introduce an a-stable Levy motion, placing it somewhere in between Brownian motion and Poisson processes, among a vast class of infinitely divisible processes. These three classes of "elementary" processes will serve as principal tools for constructing stochastic measures, allowing us to describe vast classes of stochastic processes with the use of stochastic integrals of different kinds. We emphasize the importance of constructive methods of description of stochastic processes. We believe that a few graphs of trajectories of the Brownian motion, the Poisson process and the a-stable Levy motion will convince the reader that computer simulation methods are quite powerful and provide some useful information on behavior of stochastic processes. We apply such methods in the investigation of more complicated problems presented in the next chapters of the book.
2.2 Brownian Motion We find it interesting to start with the presentation of some methods of construction of Brownian motion processes and computer graphs of their trajectories, which these methods provide (see Figures 2.2.1 - 2.2.3). We present briefly three different methods: the first is based on the Levy-Ciesielski Representation, the second (from our point of view the most important) is based on the summation of independent increments, and the third exploits random walk process. All of them provide "essentially the same result", thus from the point of view of practical computations and applications, justifying their correctness.
9
10
CHAPTER 2
Taking as a given a complete probability space (Q,T, P) (together with a filtration 1F1 1), let us recall the definition of the standard, one dimensional Brownian motion.
Definition 2.2.1 The standard, one-dimensional Brownian motion is a process {B(t) : t > 0) (or in full notation: {B(t,w) : t > 0, w a 52}), satisfying the following conditions I. Ptc.o : B(0,w) =
= 1;
2. {B(t,u))} has independent increments, i.e. for any sequence 0 = t o < < t n , the random variables B(1 3 ) — B(1,_ ) ), j = I, 2, ..., n, are 11 < independent (in other words, for any 0 < s < t, the increment 13(0— 13(s) is independent of T5 ); 3. for any 0 < s < 1, the random variable B(t) — B(s) is normally distributed with mean 0 and variance t — s, i.e. Pia < B(t)— B(s)
= 1 N/27r(t
—
s).1
h
.2
c 70-) d.r;
P{w : B(•,w) is a continuous function} = 1.
Notice that
E
n
[ ex p (i
.
Ea
J=1
n 1
I
( 13(1 )) —Bt -In)] = Ilex P (— - a; (I ) — I_ i )) , (2.2.1) i=1
for any sequence 0 = t o < t i < 1, 2, ..., n, (i = ).
<
< co and any real numbers a j , j =
It can be derived easily from the definition that the marginal distribution of for Borel sets A in IR can be given by the formula
1
c V27r(t, — t ) --1) 3= 1
P {(13(t i )....,B(t n )) a A } = I (II
for any sequence 0 = t o < < < t n and r o = 0. In other words, if we define the Gaussian kernel Sr -y)2 1 e 2t M r ` Y) = V2irt
t > 0, x y IR.
then the cumulative distribution function for (BOO. B( 1 2), •••• 13(1,)) has the form
11
A. JANICKI and A. WERON F(t 1 ,t 2
t)(Xl, x2, •••, xn) fx2
Pti ( 13 ,10Pt2-ti (Y1) 11 2)—Ptn-tn-i (Yn-1, Yn) dYn•••42 417
=
for (x i , x 2 , ..., x ii ) E R n . A stochastic process is very often thought of as a consistent family of marginal distributions. Thus we can regard a Brownian motion as specified by the above marginal distributions. Of course, by the Kolmogorov Extension Theorem, such a family of marginal distributions specifies a stochastic process which has a version {B(t,w) : t > 0} as above.
Transition probabilities. Let us also recall that transition probabilities are defined by
1.L2
pt(x , A) = tat
JA
e
du
and satisfy the Chapman-Kolmogorov Equation, i.e. p t+ ,(x, A) = p t (x,dy) p,(y, A). IR
Semigroup representation. The semigroup representation has the form (Ptf)(x) = .f(Y) Pt(x,c1 Y),
for t > 0, with Po = /.
IR
Here {Pt : t > 0} denotes a strongly continuous contraction semigroup on the Banach space of bounded uniformly continuous functions on IR. The infinitesimal generator of {Pt : t > 0} is given by lim
(Pt.n(x)
./ (x) .
= 1f
2
(x).
Now we would like to present a few possible methods of constructing Brownian motion processes.
Interpolation technique of approximate construction of Brownian motion on [0,1]. Observe that with fixed 0 < t 1 < 1 2 < oo, the random variable B(s) for s = (t 1 +1 2 )12 is normal with mean w = (z 1 +z 2 )/2 and variance a- 2 = r/2 with 7 = (12 — t 1 )/2, under conditions: z 1 = B( 1 1), z 2 = B(1 2 ). Indeed, using the formulas
P[B(t i ) E A z., B(s) E A y , B(12) E Az] =
fA„ f,413 t1 ( 0 , x)pr(x,
z) dxdydz
w 2 dxdydz = fAr fA„ f,m,(0,i)p,2_„(r,z) P27exp (Y 2a2 )
12
CHAPTER 2
describing the joint density of B(t i ), B(s)- B(t 1 ), B(t 2 ) - B(s), and
P[B(t1) E
B(12) E Az] =
Jti fAJ
1)Pt2-ti (X,
z) drdz,
we obtain
P [B((t i t 2 )/2) E A 5 1 B(1 1 ) = z 1 , B(1 2 ) = z 2 ] -
fAye-(Y-"2/(2'2) dy.
This suggests that we can construct the Brownian motion on some finite interval of t, say, on the interval [0, 1]. Assume that the probability space (52,.1, P) is rich enough to carry a countable collection {G : k = 0,1, ...} of independent, standard normal random variables (i.e. t k A1 (0, 1) for k = 0,1, ...). Using linear interpolation and a recursion formula we define the sequence of processes Be' ) =- {B ( ' ) (1): t E [0, III, as follows. Starting with the processes
0 ) (0 = tt o
,
t E [0,1],
we can assume that for any fixed n > 1 we are given the real-valued stochastic processes {B(' - ' ) (t): t E [0, 1]} which is piecewise-linear on subintervals [k/2" -1 , (k 1)/2'1 of the interval [0,1] for k = - 1. In order to construct the process 1/3 ( " ) (t) : t E [0, 1]1 we put
B"(k12" -1 ) and, for k = 0,1,
B ( " -1) (k12'),
k = 0, 1,
2n -1 ,
- 1,
/1 ( " ) ((2k + 1)/2") =
{ B ( ' -1) (k/2" -1 )
B ( " -1) ((k + 1 )/2" -1
Cr' - ' +1, Linear interpolation on subintervals [k/2", (k + 1)/21 of [0, 1] completes the construction of B" on [0, 1].
Levy-Ciesielski construction. The algorithm exploiting the Gaussian property of the Brownian motion described above is derived from the Levy Ciesielski series representation of this process. In order to obtain the theorem on the convergence of the sequence {BMW, B (1) (t),...1 to the Brownian motion on [0, 1], we recall this theoretical construction giving another description of these processes. We define the system {/Pk " ) } of Haar functions, putting
fie ) (t) = 1
for t E [0, 1];
/2(n-1)/2, if t E [2k/2", (2k + 1)/2"), H it," ) (t) = -2 ( n -1) / 2 , if t a [(2k + 1)/2', (2k + 2)/2"), elsewhere in [0, 1], 0, for
71 =
1, 2, ..., k = 0, 1, ..., 2" -1 - 1.
13
A. JANICKI and A. WERON
We define also the Schauder functions by 111 n) (u) du,
41) (0 =
for t E [0,1],
- 1. k = 0, 1, ..., where n = 0, 1, It is clear, by induction with respect to n, that n 2" -1 -1
B N (t, CO) = E
E
(2.2.2)
for t E [0, 1],
2..._1+k(w)sr(t),
m=0 k=0
for n= 0, 1,
.
Theorem 2.2.1 As n
co, the sequence {B(n)(1,w)}: 0 given by (2.2.2) converges uniformly with respect to t on [0,1] to a continuous function B(.,co) for a.a. w E 11 and the process {B(1,w) :1 E [0, 1], w E ft} is the Brownian motion on [0, 1]. PROOF.
Define by =
MaX0
I. For x > 0 we have 2
e - u 2 / 2 du Pi16--1-Fki > x] = PUoi > xi = V r f , -
<
=
r
7r
\,--,
r
cc' x
- e - ' 2 /2 du
x
cz 2 / 2 x '
which, for n > 1, gives
[ 2^-1
P[by > n] = P U W2n-14-ki > n} < 2' 1 P[161 > n] k=0
e2n_ie-n212
7r
n
Observe that E:,2n-le-n 3 /2/n < M, thus the Borel-Cantelli lemma implies that there is a subset ft of SI such that P(52) = 1 and for each co E n there is an integer n(w) satisfying b,(,,,) < n for all n > n(w). Then co
E E 14 2.-1+kt)(t)i< E n2-(n+1),2‹
co,
.
n=n(w)
n.n(ca)
so for w E 5./ the sequence {B(n)(t,w)} converges uniformly in t to a limit B(t,w). The continuity of {B(t,co): t E [0, 1]) follows from the uniformity of the convergence. The Haar system {H : ( ) } forms a complete orthonormal basis in the Hilbert space L 2 [0,1], so applying the Parseval Equality to functions Au) = and g(u) = .1[ 0 ,.,](u) gives co 2 ^- ' -1
E E n.0 ic.0
t)(0,5(:)(3).s A t,
for s, t E [0,1].
(2.2.3)
14
CHAPTER 2
In order to prove that the process {B(t,w) : t E [0, 1]} is the Brownian motion process, i.e. that the increments {B(t,)—B(t,_ 1 )}, for 0 = t o < t i < < t o < 1, arc independent, normally distributed, with mean zero and variance t, — t,_ 1 , it suffices to prove (2.2.1). Using the independence and standard normality of random variables {6}, we have from (2.2.2)
Elexp
E
{
(a 3+1 — a,) B (m) (t,)}1
1= 1 M
E
exp —i
E
E E k=0
- ai) SInti)
1=1
M
= H
(aj+i — a .i)S k( m) ( t i)
E eXP
m=o k0
j=1
Al 2'" -3 -1
H
m=o k=0
1 exp — En (aj +1 — 2 i=i
r
a,)Sr(t ; ) }
--N I 1 x-nM I — ai) (a.i+1 — aj) eXP 2-d
E E sni i )sr)(til
2_, i=1
m=0 k=0
< t„ < 1 and any real parameters a,, for any 0 -= to < ti < with a, ÷i = 0. Letting M 4 co and using (2.2.3), we obtain —
E[exP
E ai (B(t.i) B(ti_ j=1
E [exp exp
{
1=1 n-1 n
—
1
(a)+1 - cti) B(ti)}1 1 n — ai)t, — 2 (a, +1 — a i ) 2
E
,=1
3=1
n-1
(a, +i —
a,)(—
+1 )
t, —
j=1
2
1
(c4 + , —
t — —a 2 t„ 2 n
jr--1
n-I _= H exp — 21 E
J=1
This ends the proof.
1 n
2 }
( — a1 ) t 2 4—, a'-+ j=1
n-1
exp —
= 1, 2, ...,n + 1
) }1
(a .4. 1 a
exp —
j
(t
}
— t„_ 1 ) .
J=1
❑
A. JANICKI and A. WERON
15
The figure below (Fig. 2.2.1) contains the result of computer realization of this method.
Figure 2.2.1. Trajectories of Brownian motion (Levy-Ciesielski representation). The technique used to produce all figures in this chapter will be elaborated and applied later on several times to visualize various types of stochastic processes and will be explained there in detail.
Construction of Brownian motion on [0, oo). The construction of the Brownian motion on [0, described above and a simple patching-together technique provide a Brownian motion process defined on [0, oo). Starting with a sequence (11 Pnil n = 1, 2, ..., of probability spaces --n, - .F together with the Brownian motion fX(n)(t) : t E [0,1]} on each space, define S/ = x S/ 2 x X P2 X ..., and finally = .F1 .7.2 P = n-1
B(t,w) Exw(l,w) +x(n)(t—n+1,w), n-1 < t < n, with n = 1, 2, ..., 3 .=1
The process {B(t) : t E [0, oo)} is clearly continuous and has independent increments, which are symmetric Gaussian random variables with proper variances.
Approximation of Brownian motion by summation of increments. In order to obtain an approximate construction of the Brownian motion on a given interval [0, T] one can proceed as follows. Introduce a mesh {t, = iT : i = 0, 1, ..., I} on [0, T] with fixed natural number I and T = T/I. For a given finite sequence {C i }, i 1, 2, ..., /, of independent
CHAPTER 2
16
Gaussian variables with mean 0 and variance r (i.e. C i Ar(0,T)), put Br(0) = 0 a.e., for i = 1,2,...,1; compute
Br(t) = firr(t,_ 1 )+ (t — tt-i)(,
for t E
td.
The process {Br(t) : t c [0, T]} converges to the Brownian motion process on [0, T], when T --* 0. The result of application of this method is presented in Fig. 2.2.2 below, where T = 4 and r = 0.002 (1 = 2000).
Figure 2.2.2. Trajectories of Brownian motion (summation of increments).
Random walk approximating Brownian motion. Now we are going to state and prove a theorem on convergence of constructions described above, but in a slightly more general framework. Let us consider a sequence {6}7, of independent, identically distributed random variables with mean 0 and variance 1 and define the sequence of partial sums So = 0; S k =
E
, for k = 1, 2, ... .
By applying a linear interpolation technique we can define the continuous time process 1/ ( t) = S[ f ] (t — [t]g[t1-4-1, for t E [0, co),
17
A. JANICKI and A. WERON
where [t] denotes the greatest integer not greater than t. Next, let us define the sequence of random walk processes
X ( n ) (t) = Y(nt), for t E [0, co). (2.2.4) Note that {X(n)(t)) can be interpreted as a good approximation of the Brownian motion because, with s = k/n and t = (k I )/n, increments X(n)(t) — X(n)(s) = (I / N/Ti)ek +i are independent of Tx(n) = a(6 , with zero mean and variance t — s. An example of realization of this method is visualized on Fig. 2.2.3 below. Random variables e, are chosen to be independent discrete random variables with masses concentrated on points 0, 0, —0 with probabilities s s 4 -1 -, respectively. (Notice that five first moments of e, are the same as those of the standard normal random variable.) ,
,
Figure 2.2.3. Trajectories of a random walk process approximating Brownian motion. The result on convergence of this approximate construction is proved in the following theorem.
Theorem 2.2.2 With {X(n ) (t): t > 0) defined by (2.2.4) and for any 0 5_ 1 1 < £2 < < < 00, we have (X ( n ) (t i ), X ( n ) (1 2 ),
X ( n ) (t d )) 22* (B(1 1 ), 8(1 2 ),
B(t d )) ,
as n
where {B(t) : t > 0} is the standard, one-dimensional Brownian motion.
00,
CHAPTER 2
18
PROOF. For the sake of simplicity we take the case d = 2. Set .s = Li, t We have to show that
t2.
(X ( n ) (s), X ( ' ) (t)) 12) (B(s), B(1)).
Since (
le vT I
< 1
n, [in]
X ' (t) )
.1
[tn]-1-1
I
so, by the Cebysev Inequality, we have )( (n)
—
(I)
1
0-1
> El < ,2 n
S[tn]
-
4
0,
as n —) oo. It is clear then that (
(
n)
s
')( ) —
Ft
s13 „1, s[ t
(
in probability,
—) 0
so it suffices to show that SE tn.]) 72> (B(s), B(t)),
which is equivalent to 1
krd
E
[sn]
\TTI (E ]
(B(s), B(t) — B(s)).
=[sn]+ 1
The independence of the random variables .ft,} 3°°, implies lim
E [exp {—
E
11
x[tn] —s
iv
n
11 n oo
[sn]
Z 221
fri =1
exp
in \
rn
4- /7 7n
[in] E exp{ —
[sn]
J.1
;
La
j=isni4-1
iv
• liliar
Fri
j.[sn]-1-
provided both limits on the right-hand side exist. We have
11 = e ' E [exp l \i-rt , [sn]
Urn because 1
1
- 23 / 2
iu
[sn]
3 n1
t
N/ t
V71 1/[sn] 4,• =1 cj
—s 0,
in probability
&;
, (2.2.5)
19
A. JANICKI and A. WERON
and, thanks to the Central Limit Theorem, the sequence Vsfisn1 31 converges in distribution to the normal random variable with mean 0 and variance s. Similarly, [
lim
n-»oo
[in)
.
E [exp
NFL
(, 11 = e - v 2(t- s ) / 2 . j.kn)+1
0
Substitution in (2.2.5) completes the proof.
Canonical probability space for Brownian motion. Let us denote by C[0, oo) the space of all real-valued continuous functions w -= w(t) defined on [0, oo) with the metric 00
p(w1,w2)
n=1
,
w2(t)i A 1 )
Let C be the collection of finite-dimensional cylinder sets of the form C =
E C[0, 00); (10(ti), ...,W(t n )) E
,
(Rn). for any natural n > 1, 0 < < < < oo and any D The smallest o--field containing C is equal to the Borel o--field generated by all open sets in C[0, oo). We denote it by B(C[0, oo)). If p,, acting from C into [0,11, is defined by
1 c 2(5 -5_1) " V2r(ti — ti _ i ) 1 .1
( TT
p(C) —
D
dX1
••dXn
for C EC (with to = 0 and x o =- 0), then extends to a probability measure on the space (C[0, oo),B(C[0,cxD)). The measure is called the Wiener measure and the probability space (C[0, oo),B(C([0,00)), /.1) is known as the Wiener space. Then B(t,w) = co(t) is a Brownian motion and this probability space is called the canonical probability space for Brownian motion. We want to end this section by recalling the theorem, which asserts convergence of random walks defined by (2.2.4).
Theorem 2.2.3 (The Invariance Principle). Let (51,.F, P) be a probability space on which is given a sequence {6}7 1 of independent, identically distributed random variables with mean 0 and variance 1. Define the sequence of processes X(n) = {X(n)(t) : I E [0, oo)} by (2.2.4). Let Pn be the measure induced by x n on (C[0, oo), B(C[0,co))). Then the sequence of measures {P (n) }„c°1 converges (
)
df
weakly to a measure P, under which the coordinate mapping process W(t,w) = w(t) on C[0, oo) is the standard one-dimensional Brownian motion.
For the proof we refer the interested reader to Karatzas and Shreve (1988).
CHAPTER 2
20
Remark 2.2.1 The standard one-dimensional Brownian motion defined on any probability space can be thought of as a random variable with values in C[0, oo). Regarded this way, the Brownian motion induces the Wiener measure P on the measure space (C[0,00),B(C[0,00))). This explains why the probability space of the form (C[0, oo), B(C[0, oo)), P) is called the canonical probability space for the Brownian motion. This characterization of the Brownian motion and more sophisticated constructions describing processes with jumps (and further - semimartingales) play an important role in the modern approach to the theory of stochastic processes, but are not so crucial in approximate constructions of stochastic processes, applicable in computer simulations.
Multidimensional Brownian motion. In order to construct ddimensional Brownian motion it is enough to take d independent copies of standard, one-dimensional Brownian motion B(') = {B ( ' ) (t) : t a [0, Do)), i = I...., d, defined on probability spaces MO ) , J o ) , PO ) ) (with filtrations .7;( ` 1 ) and on the product space (Q(11 X ... X li(d), pi)
T(d), p(1)
x p(d))
to define B(t,w) = (B (1) (t,w 1 ),...,B (d) (t,w d )), with the filtration .Ft =
2.3 The Poisson Process Along with Brownian motion the Poisson process plays a fundamental role in the theory of continuous-time stochastic processes, so taking as given a complete probability space (fi,.F, P) (together with a filtration {Ft }), let us recall the definition of this process. Suppose we are given a strictly increasing sequence {T},-,>c) of positive random variables with To = 0 a.s. and sup, 7', = oo a.s.
Definition 2.3.1 The process N = {N(t) : t > 0) defined by
E Co
N(t)
n=1
with values in IN U {0} is called the counting process (without explosion and associated to the sequence {7; 1 }„ >1 ).
= IA (x) denotes the characteristic function of the set A.) It is not difficult to notice that [T,, oo)
{N
n} = {(t, w) : N(t,w)>
21
A. JANICKI and A. WERON [T,,Tn+i ) {N = n}. Note that for 0 < s < t < oo we have
E ii „,,,,(t) 00
N(t) — N(s) =
T
•
/(0 . 7.„,(s).
n=1
The increment N(t) — N(s) counts the number of random times T n that occur between the fixed times s and t.
Remark 2.3.1 In order to have this process adapted to the filtration {..rt } it is enough to assume that Tn are stopping times.
Definition 2.3.2 An adapted counting process N without explosion is a Poisson process if
1. Pico : N(0,w) = 0} =1; 2. {N(t,w)} has independent increments, i.e. for any sequence 0 = t o < t i < < t n , the random variables N(t,) — N(t i _ i ), j = 1,2,...,n, are independent (in other words, for any 0 < s < t, the increment N(I)— N(s) is independent of .F3 ); 3. {N(t,w)} has stationary increments, i.e. for any 0 < s < t < co and 0 < u < v < oo random variables N(t) — N(s) and N(v) — N(u) have the same distribution.
Theorem 2.3.1 Let N be a Poisson Process. Then ook ; P(N(t) = k) = e-Atk!
k = 0, 1, ...,
for some > 0, which means that N(t) has the Poisson distribution with parameter At. For the proof we refer the reader to Protter (1990). In two figures below (Fig.2.3.1 and Fig.2.3.2) we present (exact, not approximated !) trajectories of the Poisson process with the compensator {N(t)—At} f>0 , for two values of A : 1.0 and 0.1, respectively. The random variables T r, in the sequence {TO have been chosen as arrival times, i.e. Tn is a sum of n independent, exponentially distributed random variables with the distribution function
F(x) =1 —
22
CHAPTER 2
Figure 2.3.1. Trajectories of the Poisson process with compensator for A = 1.0.
Figure 2.3.2. Trajectories of the Poisson process with compensator for A = 0.1.
A. JANICKI and A. WERON
23
2.4 a-Stable Random Variables As the title of this monograph indicates, we focus our attention on the class of a-stable (or stable) random variables. From the literature on this topic let us mention among others: Feller (1966) and (1971), Levy (1937) and (1948), Zolotarev (1986) or Samorodnitsky and Taqqu (1993).
Characteristic function. The most common and convenient way to introduce a-stable random variable is to define its characteristic function. Definition 2.4.1 The characteristic function of an a-stable random variable involves four parameters: a - index of stability, $ - skewness parameter, or - scale parameter and ti - shift. This function is given by
{1 -
log (ti (0) =
when a E (0,0 and by
U
ifisgn (0) tan (air/2) 1 +
(1, 2] , QE f -1, 1) ,
p € IR;
E
log (0) =
- cri 0 1+ ittO, when a = 1, which gives a very well-known symmetric Cauchy distribution.
In spite of the belief of some authors recalling "reparametrization that removes discontinuity", it seems to us that the only acceptable value of parameter 0 for a = 1 is 0 = 0, (see Figures 2.4.5, 2.4.6 below). For the random variable X distributed according to the rule described above we use the notation X - 0, it). When = fi = 0, i.e., X is a symmetric a-stable random variable, we will write X SaS. In order to shorten the notation we denote by Sc. any random variable X such that X S c,(1,0,0).
Domain of attraction of X. A random variable X has a stable distribution if and only if it has a domain of attraction, i.e., if there exist a sequence Y2, ... of i.i.d. random variables and sequences NO and {a n } of positive real numbers such that
Y1 + Y2 + ••• + do
+ a, -4 X.
According to Feller (1971), we have in general d o n i /ah(n), where the function h = h(x), x > 0 varies slowly at infinity; the sequence {Y,} is said to belong to the normal domain of attraction of X when d r, = n 11 '. Observe that if Y e s are i.i.d. random variables with finite variance, then X is Gaussian and we obtain an ordinary version of the Central Limit Theorem.
Levy measure. To justify what was said above one can recall the LevyKhintchine Representation Theorem (see Feller (1971)). Let us introduce the Uvy measure
dzic,(x) =
0
x +a 1
,, ) (x) dx +
lx11+,,I(_00'0)(x)
dx
99
CHAPTER 2
with non -negative numbers P, Q, and a function i0x
00,x) = e ih 1
1 + x2
Then for X we have the following representation
E exp(iox)= {
cxp {ib0 — c 2 0 2 } exp fib0 + fiR\{0} V , (0,x) dv,„,(x)}
if a = if 0 <
9,
< 2,
where b i c are real numbers (looking for a more general form of the L6..vy Khintchine Formula, see Definition 4.4.2).
Some arithmetic properties. Now we are going to recall a few simple but important properties of random variables S„(a, 13, it). 1. If we have X i 3i, random variables, then
p i ) for i = 1,2 and X 1 , X2 are independent,
+ X2
with a
=
= (ai
Oicq -1-132GrY
a y
So( a, 2 , j 2. If we have X 1 , X2 C is a real constant, then
)
,
p = p 1 +1 1 2.
and A, B are real positive constants and
(a(fla + Ba)'/",43,M.V+13') 11 ' +
+ 1.3X 2 + C
.
3. A' p) is a symmetric random variable if and only if 3 = 0 and p = 0. It is symmetric about p if and only if 3 = 0. 1. If we have X
S„(cr, i3 p) and a c (0.2) and p E (0,0), then ,
and if p c [Q, 2), then 5. If we have A' ^- S„.(a, 0, p) and a
E (1,2],
Ex =
Covariation.
then
u
Let (Xi. X 2 ) denote a jointly SaS random vector, where c ( 1 , 2]. Considering the Sati random variable Y = 0 1 X 1 0 2 X 2 for any real
25
A. JANICKI and A. WERON
0 1 , 0 2 we get
Y
0, 0)
with a = 0- (01, 02).
Definition 2.4.2 The covariation
X2]„ of the jointly SaS random
vector (X 1 , X 2 ) is
1 0 [X 1 , X 2 ]„ = -00 a 1
(yr, 0 2) 101=0, 0,..-1•
The covariation is designed to replace the covariance when a E (1, 2). In the case of a = 2 we have the following relation between these two expressions [ X1, X2]2 = Co v (X 1 , X2)•
Asymptotic behavior of tail probabilities. Using the Central-Limit-Theorem-type argument, one can prove that if X •-••, Sa (er, d, p) and E (0,2), then lim P{X > = Co
l +
2 1
lirn VP{X < -y}o ', 2 -
y -I. CO
where Ca = 1
o cc
x' sin(s) dx) .
Density functions. When we start to work with a-stable distributions, the main problem is that except for a few values of four parameters describing the characteristic function, their density functions are not known explicitly. The most interesting exceptions are the following: - the Gaussian distribution S2 (cr, 0, IL), whose density is f(x) =
exp 1-(x - it) 2 /(4a 2 )};
20.07
the Cauchy distribution S i (a, 0, p), whose density is f(x) =
2a r((x - ) 2 + 4cr 2 )'
the Levy distribution S 1 1 2 (0,1,p), whose density f(x) =
o.
\ 1/2
27r)
a
) -3/2 exp
(x
2(x
is concentrated on (/1, co), i.e., f (x) = 0 for x E (-co,
-
p)}
CHAPTER 2
26
So, in order to obtain a stable density functions, we have to take into account the definition describing characteristic functions of a-stable random variables and apply the Fourier transform, namely f(') =
2ir
f: e '0(t)dt. -
Using a numerical approximation of this formula we were able to construct such densities in the general case. The result of computer calculations is presented here in the form of a series of graphs of such densities for different values of parameters a, 3,o (the role of parameter ti is obvious), obtained with the use of IRM PC/386 graphics. -
Figures 2.4.1 - 2.4.6 below demonstrate in a very precise way how a- stable density functions depend on parameters: • a - the index of stability from the interval (0, 2], • 3 the skewness parameter from the interval [-1, 1], with the exception: a = 1 3 = 0, • a -- the scale parameter from (0, oc).
Figure 2.4.1 shows the dependence of densities on a and Figure 2.4.2 - the dependence on a. Figures 2.4.3 and 2.4.4 demonstrate how densities fluctuate when parameter 3 goes throughout the set of different values from -1 to 1, for two different values of a, respectively. Each of these two figures contains one example of the so called totally skewed density (in Figure 2.4.3 we have the density of X So . 8 (1, —1, 0) and in Figure 2.4.4 - X S 0 . 5 (1, 1, 0). Figures 2.4.5 and 2.4.6 show what is going on, when parameter a approaches 1 with fixed, different from 0 value of parameter 3. This corresponds to the remark on the definition of the characteristic function of a-stable random variable (exceptional case of a = 1) at the beginning of this section. We believe that it is an easy and instructive task to find out which curves correspond to which values of parameters in all figures presented here. Figures 2.4.1 2.4.5 preserve the same scaling of both axes; the next (Figure 2.4.6) has the vertical one changed. ti
A. JANICKI and A. WERON
27
-0_6
-0.4
-0.2
0 Figure 2.4.1. The case of a
E
{2.0, 1.2, 0.8, 0.5}, Q = 0.0, a = 1.0, II = 0.0.
Figure 2.4.2. The case of a = 1.2, # = 0.0, a
E
10.5, 0.7, 1.0, 1.5},
= 0.0.
CHAPTER 2
28
-0.6
-
_4
Figure 2.4.3. The case of a = 0.8, /3 E {-1.0, —0.8, —0.5, 0.0}, v = 1.0 and
FL = 0.0.
-0 .6
Figure 2.4.4. The case of cv = 0.5, i3 E {-0.5, 0.0, 1.0},
a = 1.0, p = 0.0.
A. JANICKI and A. WERON
29
-0.6
-0.4
-0.2
----1
---
Figure 2.4.5. The case of a
E
{0.5, 0.8, 0.9, 0.95},
3 = 0.8, a = 1.0, ii = 0.0.
)
-0.3
Figure 2.4.6. The case of a E {1.8, 1.2, 1.1, 1.05, }, 0 = 0.8, a= 1.0, p, = 0.0.
30
CHAPTER 2
2.5 a-Stable Levy Motion Roughly speaking, an a-stable process is a random element whose finite dimensional distribution is a-stable, where 0 < a < 2.
Definition 2.5.1 A stochastic process {X(t): t
E T}, where T is an arbitrary set, is stable if all its finite dimensional distributions
X (t 1 ), X (1 2 ), ..., X (1„), 1 1 ,1 2 , ...,t n ET,
n>1
are stable. It is symmetric stable if all its finite-dimensional distributions are symmetric stable. If the finite dimensional distributions are stable or symmetric stable, then by consistency, they must all have the same index of stability a. It is known that { X(t) : t E T} is symmetric stable if and only if all linear combinations
a k X(t k ),
n> 1,
E T,
a1, a 2 , ...,
E R,
k=1
are symmetric stable. For non-symmetric stable processes this property holds only when a > 1. The best known example of an a-stable process is the a-stable Levy motion. Let us recall the definition.
Definition 2.5.2 A stochastic process {X(t) : t > 0) is called the (standard) a-stable Levy motion if
1. X(0) = 0 a.s.; 2. IX(t): t >
has independent increments;
3. X(I) - X(s) S.((t - 3) 11 ', OM for any 0 < s <1 < o o. Observe that the a-stable Levy motion has stationary increments. It is the Brownian motion, when a = 2 . The a-stable Levy motions are SaS when / = 0 and they are 1/a self-similar. That is, for all c > 0 the processes {X(ct) : t > 0) and {cliaX(t) : t > 0) have the same finite-dimensional distributions. The first step toward a description of basic properties of stable processes would be the discussion of some properties of the a-stable Levy motion. In order to illustrate the most important features of this stochastic process distinguishing it from the processes presented in Sections 2.2 and 2.3, we present some computer graphs of trajectories of standard a-stable Levy motion for a few different values of the parameter a. At a first glance one can notice a remarkable qualitative and quantitative difference between graphical representations of the Brownian motion (see Section 2.2) and the a stable Levy motion presented here (with the parameter a taking on smaller values, the "jumps" of the trajectories become bigger, so in Figures 2.2.1 and 2.5.1 - 2.5.3 we had to change constantly the scaling of the vertical axis). We will come back to the discussion of this effect later on.
A. JANICKI and A. WERON
Figure 2.5.1. Trajectories of a-stable Levy motion in the case of a = 1.7.
Figure 2.5.2. Trajectories of a-stable Levy motion in the case of a = 1.2.
31
CHAPTER 2
32
J --8
2
Figure 2.5.3. Trajectories of SoS 1,6vy motion in the case of o = 0.7.
-12
Figure
Trajectories of totally skewed Levy motion in the case of a = 0.7.
A. JANICKI and A. WERON
33
Construction of the SaS Levy Motion from the Brow nian Motion. It was Bochner (1955) who noted an interesting relationship between the processes plotted in figures presented in this chapter. It is possible to obtain the SaS Levy motion process from the Brownian motion by a random time change defined by the totally skewed Levy motion. Here we present this construction. Observe that if the measure v, on (0, oo) is defined by the formula
dva(x)
x ^a dx,
then for 0 < a < 1 the following integral
I(u) = 1 °° (es"— 1) dv„(x) is finite (see Sections 2.4 and 4.4 for the Levy-Khintchine Formula in different settings). Consider the stochastic process X = {X(t)} with stationary independent increments, and such that the characteristic function
E e iux ( i ) = e itp ( u ) has the exponent function 0(u) = 1(u). Then, the process X is the limit of the sequence of processes {X„} with exponent functions
1,,(u)
i/n
(e' — 1) dva (x).
These processes have only upward jumps. Hence, all paths of {X(t)} are nondecreasing pure jump functions, (see Breiman (1968)). Take on a given probability space the normalized Brownian motion {B(t)} and an a/2-stable totally skewed Levy motion {X(t)} with nondecreasing sample paths (a/2 E (0,1), # = 1), and such that T{X(t): t > 0), T{B(t) : t > 0} are independent. If we put Y(t) = B(X(t)), then the process {Y(t)} is an SaS Levy motion. The idea becomes clear when one notice that the process defined by Y(t +.9) — Y(t) = B ((X(t s) — X(t)) + X(t)) — B (X(1)) looks just as if it were the Y(s), independent of Y(r), r < t. For a formal proof we will follow Breiman (1968). Take as X n (t) the process of jumps of X(t) larger than [0, 1/n). According to the above considerations its characteristic function is described by the exponent function
O n (u) = f (e i "— 1) dv„/2(x).
CHAPTER 2
31
The jumps of Xn (t) occur at the jump times of a Poisson process with intensity A, = Y2,... independent of one another and of the and the jumps have magnitude jump times, and are identical distributed. Thus B (X,,(1)) has jumps only at the jump times of the Poisson process. The size of the k-th jump is CA: =
B(} B( 1 1)
VI) — B(Yk_ i ...+ Yi )
k > 1, k = 1.
By an argument almost exactly the same as that used in the proof of the strong Nlarkov property for the Brownian motion, Uk is independent of Uk_. 1 ,...,U1 and has the same distribution as U 1 . Therefore B (X(t)) is a process with stationary, independent increments. Take {n'} such that ,V,,(t) X(1) a.s. and uniformly on compact sets. Use continuity of the Brownian motion B(t) to get lim B (X,„,(t)) = B (X(1))
a.s. for every 1 E [0, oo).
Thus, B (X(t)) is a process with stationary independent increments. To obtain its characteristic function write the conditional expectation
E lexp[iuB(X(1))) I Z(1)
=
E exp[iuB(z)] = exp[—zu
2
/2].
Therefore, Eexp[iuB(X(I))l = EexP(—(u 2 /2)X(1)) exP(--exkin, so, Y(t) = 13( X(t)) belongs to the class of SoS 1,6vy motion processes.
Chapter 3 Computer Simulation of a-Stable Random Variables 3.1 Introduction One of our main goals in this book is to describe some computational methods of constructing and simulating the most common stochastic processes. These methods are based on computational algorithms providing random numbers or random variables with given distributions. There is a vast literature concerning this topic. Among others, let us only mention Devroye (1986), Bratley, Fox and Schrage (1987), Rice (1990), Newton (1988), Deak (1990), James (1990). Here we will recall only a few of the possible general methods consisting in the transformation of a given random variable, which is uniformly distributed in (0,1), into another random variable with the desired distribution. Theoretically, it is possible to use as a starting point a random variable obeying another probability law (e.g., Gaussian or gamma random variables), but the transformation of uniform random variables is the most suitable and the most common. They can be generated in a fast and easy way. For generating a random variable with a given distribution we prefer to apply "the most suitable" of a few possible methods, supporting our choice by computational experience, though we are aware that if highly accurate numerically data are required, then only a combination of two or more different methods should provide proper results. For us, one of the most important classes of random variates is the class of astable (or stable) random variables. Thus we present and discuss here the results of our investigations concerning the properties of some methods of theoretical representation and computer simulation of such distributions. An especially important role in the theory of stable and infinitely divisible processes is played by their series representations (see Rajput and Rosinski (1989), Rosinski (1990), Tallagrand (1990) and others). In the simplest case we have the so called LePage series representations of stable random variables and processes (see LePage, Woodroofe and Zinn (1981), or LePage (1980) and (1989)). We show that, contrary to the common belief, they converge very slowly, so they are not the 35
CHAPTER 3
36
most suitable means of generating stable random variables. We discuss some methods that perform much better. Accidentally, we have formulated a nice and simple lemma providing a solution of an important problem of calculating tail probabilities of stable random variables. The algorithm describing them involves only one deterministic function of two real variables. Thanks to some computer experiments we were able to provide a deeper quantitative insight into the structure of stable laws, varying with some parameters defining them. Finally we recall basic facts concerning the problem of statistical estimation of densities of some classes of random variables (see e.g., Tapia and Thompson (1978)). Computer methods of constructing stochastic processes involve at least two kinds of discretization techniques: discretization of the time parameter and approximate representation of random variates with the aid of artificially produced finite time series data sets or statistical samples so we arc interested in statistical methods of data analysis such as constructions of empirical cumulative distribution functions or kernel probability density estimates, etc. Applying computer graphics, we attempt to explain to what extent they can provide results good enough to be applied to solve approximately quite complicated problems involving a stable random variates that are discussed in the subsequent, chapters of the book.
3.2 Computer Methods of Generation of Ran-
dom Variables In computer simulations of random variables and processes of primary importance is the problem of the proper construction of random quantities that follow a particular probability law. As we mentioned above, when saying "computer" we will always refer to IBM PC/AT/386 microcomputers, so it is natural to suppose that using computer programming languages Turbo C or Turbo Pascal, we have at our disposal a built in function called rand that generates pseudorandom uniformly distributed positive integers (consult the Appendix, where this function is included in an exemplary program). It is not our objective to argue whether the method applied there is better or worse than other known methods of construction of pseudo random uniformly distributed numbers. As a matter of fact, we are not interested in such questions as whether distributions of generated pseudo random sequences would pass some statistical or other tests. Supported by the results of various numerical experiments we believe that the function rand is quite good for our purposes and we will rather focus our attention on such questions as weather given random quantities can he applied properly in the construction of solutions of given problems or not.
Linear congruential method. Among devices generating large sets of random variates with "proper" statistical properties we would like to men-
37
A. JANICKI and A. WERON
tion, currently the most common, the linear congruential method. It provides a sequence of integers /0 , /1 ,12 , ..., each between 0 and m — 1, by the recurrence relation = a In + c ( mod m ),
where m, a, c are given positive integers. In calculations with IBM PC/386 the following exemplary triples (m, a, c) can serve our purposes: (134456,8121,28411), (243000,4561,51349), (259200, 7141, 54733), (714025, 4096, 150889). Here, in all four cases, the period of the sequence /0 , / 1 ,12 , ... is of maximal length, i.e., of length rn. Further application of the so-called shuffling procedure provides new efficient algorithms producing random sequences with still much longer periods, helps to break up possible sequential correlations or diminish the effects of any cycle or bias.
Add-with-carry and subtract-with-borrow generators. A description of a new powerful class of methods for generating random numbers with very long periods can be found in Marsaglia and Zaman (1991). Let us recall here only one example of add-with- carry generator useful for experiments. Fix base 6 to represent any integer I in the range from 0 up to 6 21 -1 as a sequence of twenty one digits from the set {0, 1, 2, 3, 4, 5}. Now, start an iterating formula by choosing any sequence of twenty one seed digits and any initial carry bit c E {0,1} (with two exceptions: twenty one 0's for c = 0 and twenty one 5's for c = 1), i.e., let 10
With
X0X1.•X19X20,
=
CO
E {0,
1}.
Cn - a
{0,1} ,
already constructed, one has to calculate X n +20 = Xn-1 Xn+18 + en-1 ( mod
en
6 ),
0,
if
Xn-i Xn+18 Cn-i <
1,
if
Xn-1
en-1 >
6, 6
and to output finally In = XnXn+i •••Xn+19Xn-/-20,
where positive n can increase up to 6 21 + 6 2 — 1, because this number is a prime for which 6 is a primitive root and thus this generator will always have period 6 21 + 62 — 2 = 21 936 950 640 377 890. (Every possible set of twenty one successive "throws" from the set {0, 1, 2, 3, 4, 5} will appear in the sequence, with frequencies for shorter strings consistent with uniformity for the full period!)
CHA PTER 3
38
From now on we can assume that, at any time needed, we have at our disposal a random variable -y which is uniformly distributed on the interval (0,1). This allows us to construct random variates that follow different probability laws.
Inversion method. This method provides a random number with the desired distribution function by making use of the inverse of the distribution function. Consider a random variable e with density function f(x), x E frz,b1. Its distribution function is F(x) = f f(y)dy• a
If its inverse F - ' exists and -y is uniformly distributed on (0,1), then the distribution function of the random variable e = F -1 (7) is F(x).
Exponential distribution. Consider the random variable r exponentially distributed with parameter A and apply the inversion method to get f(x) AC A r and F(27)= 1 - C A ' for x > 0.
So, if -y is distributed uniformly on (0,1), then l
= — log(l - -y). A
Normal distribution. One of the variations of the Central Limit Theorem states that if e l , e2 . , ... are independent, identically distributed random variables with finite variance and E( n ) it, 1) 2 (W = 0 2 , for n = 1, 2, ..., then lim P
n -=
{el +
e2
+ en —
of
< x} =
1
r
e - '212 du.
12
Taking into account the sequence 7 1 , y2, ..., 712 of independent random variables uniformly distributed on (0,1) (here au = 1/2, 0 2 = 1/12), we have X
P {7i + '72 + • • • + 712 - 6 < x}
/
e- 2 12 du,
so we obtain an algorithm generating approximately the standard normal distribution A((0, 1). Another exact method of computer construction of standard normal distributions, the so-called Box-Muller method, is based on the observation that if 7 2 are two independent random variables uniformly distributed on (0,1), then ih = \/- 2 In (7 1 ) cos (21r1 2 ), 712 = In (y i ) sin (27r7 2 ) are independent, standard normal.
39
A. JANICKI and A. WERON
The random iteration algorithm for computing fractals. It is a very nice random algorithm producing approximate attractors of IFS (iterated function systems; see Barnsley (1988)). Here we present an example of such an algorithm which produces the famous "fern" fractal. Let us fix (x o , y o ) = (0,0). According to the law of a discrete random variable k, that takes values 1, 2, 3,4 with probabilities 0.01, 0.85, 0.07, 0.07, respectively, one has to compute xn+, = a[k]x v, + b[k]Y.+ e[k], Y.+1 = c[k]xn+ d[k]Yn + f [k],
for n = 0, 1, a[1] b[1] c[1] d[1] e[1] f[1]
, where = = = = = =
0.00; 0.00; 0.00; 0.16; 0.00; 0.00;
a[2] b[2] c[2] d[2] e[2] 42]
= = = = = =
0.85; 0.04; -0.04; 0.85; 0.00; 1.60;
a[3] b[3] c[3] d[3] e[3] f[3]
= = = = = =
0.20; -0.26; 0.23; 0.22; 0.00; 1.60;
a[4] b[4] c[4] d[4] e[4] f[4]
= = = = = =
-0.15; 0.28; 0.26; 0.24; 0.00; 0.44.
The results of the computer experiment are contained in two figures presented below. We believe that they demonstrate that, to some extent, the computer generator of discrete random variables and computer graphics (see Remark 3.5.2) provide acceptable results.
Figure 3.2.1. The fern fractal obtained by IFS method for 100000 iterations.
CHAPTER 3
40
Figure 3.2.2. Enlarged part of the fern fractal (400000 iterations).
3.3 Series Representations of Stable Random Variables From our point of view the most important class of random variates is the class of a stable random variables and processes. An explicit description provides the so called LePage series representation formula. It plays a very important role in theoretical investigations of stable and infinitely divisible variables and processes. It seems to be an important problem to answer the question whether this formula would be useful in computer simulations. So, in this section we discuss the problem of a speed of convergence of such series representations. In the sequel we will restrict ourselves to the case of a E (1, 2) and /3 E ( I, I ) and we will consider only "normalized" stable variables X 3,0). (The other cases can be treated in a very similar way.) So, let {r i ,r2 ,...} be a sequence of arrival times (jump points) of the right continuous Poisson process with unit rate. Thus the random variable .r; has the density -
L(x) = x 2-1 e' 1(0 ,,, ) (x)IF(j). (here F stands for the gamma function and IA = IA(x) denotes the characteristic function of the set A.) Let us also define the sequence of i.i.d. random variables as follows:
P {&i = ti} =
P
t21 = P2,
= 1, 2, ... ,
41
A. JANICKI and A. WERON
where 11 = (I + 0) 1/(e'-1) , Pl
= ( 1 — 0) 11(a-1) 1 {( 1 +
t2 =
— ( 1 fi)11('-1),
— (3)1/(a-1)} ,
+
P2 = 1
—
•
We will assume the sequence { 1 ,6,...} to be independent of the sequence {7 1 , ...}. Let us define -
E
X, = L(a, 0) -11 '
2
=1
00
X = L(a, Q) -1 /a E
3=i
where L(a,
= —2aF( --a) cos (a7r/2)p 1 t i
Our aim is to give a quantitative information on the rate of convergence of LePage-type sums X, to X with respect to different values of parameters a, 13. Before stating the main theorem we need two lemmas.
Lemma 3.3.1 Ifs > 0, then
E CO
5
s.(a,
3=1
o, 0),
i.e. the series on the left-hand side converges a.s. to a stable random variable X S,Jel, 0,0) for as L(a, 0).
Lemma 3.3.2 For X„ defined above we have n+rn
EiXn+m Xn12 = C(er,13 )
E
2=n-1-1
where C(a,
(1 = L(a, 0) -2 / a
E 7 72 ,
02)1/(a-1).
Applying both lemmas and the formula ET7 2/.
r(j
-
2/a)
, '
we obtain the main result.
for j > 2/a,
CHAPTER 3
12
Theorem 3.3.1 If a E (1,2), 13 E ( — 1 , 1 ) , then for n > a/2 we have
Eix - x, I 2 = 147,(a„)• where IV,,( , i3) C (a, ,3)14,(a), V";,( 0 ) =
E r(i 2/a)/h(i)•
3=n+i
It is not easy to handle the above formula in computer calculations, so we propose an asymptotic estimate.
Theorem 3.3.2 If a E (1,2), )3 E ( — 1 , 1 ) , then for n > a/2 we have EIX — X.1 2 R.(0, /3 ), where R. (0, ,13 )
= c( a, O)sn(a),
E - 2/a)
S„(a)
-2 l °
.
j=n+1
llere the relation means that with respect to n, functions 11'n ( R,(a,,3) are asymptotically the same, i.e.
3) and
c -2 .9„(a) < 1 7„(a) < lim
— 2/ ) 2 /' r(.7 — 2 /a)/ 1 (J) = 1.
It is also possible to obtain some other estimates.
Theorem 3.3.3 If n > a/2, P {(X
>0 and p E (1,a), then
X n l >
17-2Rn(a, / 3 ) ,
E {IX - Vd9 1/P 5 {Rn(a, 0)} 1/2 -
Now we are going to present some results of computer experirnents that allowed us to obtain quantitative information on the rate of convergence of the LePage series to a-stable random variables and to check their usefulness in the construction of computer simulation algorithms.
Hypothetical algorithm. Stable random variable X S (1 . 0) can he approximated by the sums X, = E .7= , ,) rj 1/° . In order to obtain a statistical (approximate) sample {)t fixed natural M, it is enough to do the following:
rri-=1
of X with
43
A. JANICKI and A. WERON
• fix an appropriate (large enough) natural number n; • according to the definition of discrete random variables e .„ construct their , for j = 1,2, ... , n; statistical samples {Csi m ' m=-1 • notice that each 7 7 can be represented as a sum of j exponentially distributed independent random variables with mean parameter A = 1, so the method of computation of samples obvious;
{ rim)
M
for j = 1,2, ... ,n is
• construct as a final result the corresponding sample for the sum defining X„.
Unfortunately, as we shall in the next section, this algorithm is very costly as far as the time of calculations is concerned, even for small values of n.
3.4 Convergence of LePage Random Series Let us present the results of computer experiments concerning the speed of convergence of LePage series. Precise quantitative information on the rate of convergence of LePage sums X, to X give functions C(a, S,(a) and Rn (a, 0) defined below. The number series S. converges awfully slowly. Thus, applying some techniques that accelerate the convergence of number series, we propose the following approximate algorithm S„( a)
1 - (n v+ 1- 2/a) -2 /❑ + 2
a 2 - a
(n v+ 1- 2/a ) ( ' -2) /'
E (7 - 2 /a) -2/' ,
=n-1-1
where n > 2/a and v is an appropriately chosen positive integer. The best thing to do is to make use of IBM PC/386 graphics to demonstrate how these functions depend on a, 0 and n. To obtain nicer technical effects we decided to present in Fig. 3.4.1 the function C(a, 0) = min {C(a, 0), 0.5} instead of C(a, 0). It is not difficult to notice that the function C (a. 0) depends only on the sequence of discrete random variables e l , .... The behavior of this function reflects perfectly what we should expect looking closely at the definition of the characteristic function of a stable random variable (see Chapter 2, Section 2.4). We are able to see the subset of the rectangle [1,2] x [-1, 1] of "good" (a,0) and two subsets of "troublesome" (a, 0). In particular, if a = 1, then the only acceptable value of /3 is /3 = 0.
11
CHAPTER 3
1.01,0.99: 0.5
.ft ■w...
fta.. ,,, la4W. M.* AreAS4.. ..... sk w.L.,44,.,,.
.ng - ... ■- ..
ff:smm.,rourawe= ..
Awovrmsov.Immosw,:,;:...~.....
Z ''.
Aw.mwan
2 13,
Figure 3.1.1. Function C(a,,3)
-u st.
3
min {C(o, 3), 0.5}.
Remark 3.4.1 It is not difficult to notice that S.,(o) depends only on the sequence
IT„+1
-2 / a
T„+2 -2/ ',
}
and the only cause of very bad behavior of
E X — X„ 1 2 (especially for a close to 2) is the presence of arrival times 7- 1 ,12 ,
of the Poisson process in the LePage representation of X.
Figures 3.4.2 and 3.4.3 contain the graphs of 1?,,(0, = min {R,(a, 3), 0.1} for it =- 100 and n = 10000. They allow us to see how slowly {X„} converges to X and how this convergence depends on parameters a, /3. Ily comparing them one can see that, roughly speaking, the approximation X„ of X is acceptable in practice only for (a, /3) such that (a — 1 — 6) 2 + /3 2 /p < b, with small r`i > 0 and p
Computer experiments indicate that methods based on the LePage series representations arc riot the most suitable means of generating stable random variables. Figures 3.1.4 and 3.4.5 illustrate this situation. They present histograms of X„, which should approximate the densities of the stable random variable X = X (a, /3). For a = 1.2, 3 = 0.3 and a = 1.2, = 0.15, respectively. and n = 100, we obtained rather poor results. According to the situation presented in Fig.3.4.2, one can check that for values of a, /3 slightly different from those chosen above the histograms might he even worse. Nevertheless, the mathematical fact of very slow convergence of the LePage series for a large part of the possible values of parameters a, (as suggested by Figs. 3.1.2 and 3.4.3) forces us to look for other, less wasteful as far as computer time is concerned, methods.
45
A. JANICKI and A. WERON
t .01.0 .99, 0 .1 )
CONNWEIMIMIKOWNIKIHILiINEMIMMENN,
ASIHWANZYRINMMAr arMar/Ob•IM•rOW,Her IPMAKINWM4Mar MMMMM aleiranwrawrs
/1411.1.1
IMIlly. 4ICM I,INUNIOW .0. W,IIYIlf NIM5071•1 . 11F...../111r MIN. OVINWIWIVMO IfIl.,I Ir farMV■■■■.•14,1”. Ilr.M.H./..M. 0 .I, ,17111ararrn I NMIIIRMWMar
ZOV
4111 WOW _,...: e
:0■41PArlaYlr. : 14.1.41MAII 1 , 0.11 1.04•Mg..”11,72NMIY:FMO , ,r, .WW...••■•■1••• awrattmswarors ..wm,
.A.
Mff
Yr., ..40.4,Amm.wormr..mmmwmmumcwmw rs ....S.Ammm■mvxmax.d.ww.unnw.Amw
ARI IMINIIIIral4.11..raWANINIM ISoNSInNIN IIMME, 114.0"Iirl..14•NraWININIPM■14.10:1141,1•4K MK/ . OTMT NV 47,17•7M, Z •1 ' M.W.O.MJNO .v./M Nfti 0 NMII I/ IOW rrINIVICINEWHAINMALONZI INIMMiriiNN, dINIZN I rdrG.IIIWJWINSIWISIIIAMOrf ...ParinnhIMMII,MIHN, I 0 NIMIYMR.11151. WI L1,1511HOSERINIMMMJIRMOSII MAINFIRIMMIWNIMIANUNIMIM IIPAVAINNIMINI ■WINIINIVIHMIMA MMIZIRMUMI Ma•NrdIJKS WarN • ,..,....... -........m., ..,■••■=,
47/7.111Mri• rW. .7/Tria
Vili
"'2
.O D. 0 DB O )
Figure 3.4.2. Function /1 100 (0e , ,(3) = min {limo(a03), 0.1}.
Figure 3.4.3. Function
iii0000(a, 0) =
min {Ri0000(ct, 0), 0.1}.
46
CHAPTER 3
- 0.375
0.25
^ 0.125
5
2(
Figure 3.4.4. The histogram of X 100 and the density of X for a = 1.2, 0 = 0.30.
- 0.375
- 0.25
Figure 3.4.5. The histogram of X 100 and the density of X for a = 1.2,
d = 0.45.
47
A. JANICKI and A. WERON
3.5 Computer Generation of a—Stable Distributions When we start working with a-stable distributions, the main problem is that, except for a few values of four parameters describing the characteristic function, their density functions are not known explicitly. (The most interesting exceptions are presented in Chapter 2.) As we know, the LePage series representations are not the most suited for an application in computer calculations, so our aim is to describe now a few of the possible general techniques of constructing and computer simulating stable random variables.
Application of the fast Fourier transform. Taking into account the definition describing characteristic functions of a-stable random variables, we can apply the Fourier transform to obtain densities, namely f(x) =
r
e-'(t)dt.
In order to construct a computer representation of f, we have to calculate a finite number of values f(xk) of f. Omitting the detailed description of a numerical method applied to solve this problem, let us only mention that it is necessary to define a proper set of points x k , find a criterion to decide how to approximate the infinite integral defining Fourier transform by a sum of integrals on intervals 12kr,2(k 1)7r1 and to adjust to our needs one of the methods of numerical integration in such a way that the application of the fast Fourier transform (FFT method) would be possible. Now we are in a position to propose an effective algorithm to generate a stable random variable X: • starting from a density function construct numerically the inverse F -1 (y) of the probability distribution, • generate a random variable -y uniformly distributed on (0, l) and finally compute X = F -1 (7).
Application of gamma distribution.
Let us recall that in LePage
representation 00
j.1
of stable variable X .90,(1,0, 0), where e, denote discrete random variables and 7, - the random variables with densities
fi(x)=
-
Tho ,,,o (x )/( j
—
1)
!•
18
CHAPTER 3
An obvious procedure generating the sample {ri m) for j = 1, 2, ..., m=-1
sists in calculating
r3( ml = - log
(
T1
con-
ri u,(-)) .1
(1)("0} denotes the statistical sample of the random variwhere {Ur, able U distributed uniformly on (0, 1).
Remark 3.5.1 In Bratley, Fox and Schrage (1987) one can find the suggesSchrneiser, tion that variance reduction techniques (see e.g., Marsaglia (1977) or, Lal (1980)) perform much better. Taking this into account we still insist that computer methods of construction of a--stable random variables based on the LePage series representations, even with the best possible generators of gamma distribution, are not well suited to computer simulations of stable variates. The mathematical fact of very slow convergence of LePage sums definitively kills such methods.
Series description of a distribution function. I3ergstrOm (see BergstrOm (1952)) obtained the following formulas:
IV2k — 1 01 ) 2k-1
1 1 F,(x) - + — 70
2
k=1
(2k - 1)!
or
FA') = 1 + / { k=1
k .
1) k gk)x-'s 0 in
( kirct} 2 j
for the distribution function of the random variable SA1,0,0). Partial sums of these series can probably be applied with care in constructing approximate values of the distribution function F„(x).
Direct method. The best method of computer simulation of a very important class of symmetric a stable random variable X - SA1,0,0) for a E (0,2] consists in the following: • generate a random variable V uniformly distributed on (-7/2, 7/2) and an exponential random variable W with mean 1; • compute X =
sin(aV) x cos(V - aV) } (1- ' )/ ' {cos(V)} 1 /0
(3.5.1)
The formula (3.5.1) is generalized below by (3.5.2).
Tail probabilities from samples. In practical simulations an important question is what size of statistical sample is good enough to expect
49
A. JANICKI and A. WERON
acceptable accuracy in Monte-Carlo-type calculations of some parameters. In order to give an idea of what one should expect when working with a-stable random variables, we present here two tables containing values of tail probabilities calculated on the basis of statistical samples 5'; representing random variables S,(1, 0,0) and generated by the direct method described above for a few different values of the parameter a. The first table contains the result obtained for two different samples of the size 2000, the second - of the size 4000. Comparing the numbers included in Tables 3.5.1, 3.5.2 and 3.6.1 one can conclude, that when working with the IBM PC built-in function rand(), a reasonable choice of a sample is somewhere between 2000 and 4000 (the result for 1000 "trials" is poorer). Unfortunately, the exactness of computer calculations is not impressive (see Remark 3.5.2). The only way to improve them is to work with generators with much larger periods (see some propositions above in this chapter) and samples bigger in size, but it would consume much more of computer program execution time, which is a very significant factor in complicated calculations. Table 3.5.1. Tail Probabilities from the sample of 2000 "trials". a 1.7 1.2 0.8 0.5 0.3
P1.5,7, > 0.3)
0.403 0.413 0.402 0.355 0.364
0.412 0.417 0.393 0.373 0.353
P{S; > 3.0)
P{S; > 30.0)
0.038 0.076 0.138 0.164 0.225
0.000 0.005 0.023 0.057 0.139
0.034 0.079 0.129 0.175 0.231
0.000 0.006 0.022 0.061 0.128
Table 3.5.2. Tail Probabilities from the sample of 4000 "trials". a 1.7 1.2 0.8 0.5 0.3
P{S; 0.409 0.408 0.397 0.380 0.345
> 0.3) 0.416 0.413 0.409 0.363 0.346
P{,5,7: 0.034 0.087 0.129 0.194 0.223
> 3.0) 0.037 0.082 0.134 0.181 0.223
P{S„7 > 30.0} 0.000 0.000 0.005 0.005 0.022 0.025 0.071 0.073 0.132 0.141
Computer generator of skewed a-stab le variables. In the chapters that follow we develop mainly the methods and algorithms involving symmetric stable variables (13 0) (e.g., symmetric stable random measures, stochastic integrals with respect to such measures, symmetric stable stationary processes, etc.). The algorithm providing skewed stable random variables Y 0, 0) with a E (0,1) U (1,2] and Q E [-I, 1] consists in the following:
50
CI IA PT ER 3 • generate a random variable V uniformly distributed on (-7r/2, 7r/2) and an exponential random variable \V with mean 1; • compute = D eo x
sin(a(V Coo)) x cos(V — a(V
{cos(V)P/ '
(3.5.2)
and
= , 43
arc tan(0 tan(ra/2)) 1—
1-- al
[cos(arc tan(0 tan(7ra/2)))1 -1 /'.
Generalizing the result of Kanter (1975) or slightly modifying the algorithm of Chambers, Mallows and Stuck (1976), one can see that Y belongs to the class of S„(1, 3, 0) random variables.
We regard the method defined by (3.5.1) and (3.5.2) as a good technique of computer simulation of a-stable random variables, stochastic measures and processes of different kinds. Of course, it has its own limitations in applicability as any computer technique has. Here we provide some information on this subject.
Remark 3.5.2 Let us mention the following sources of possible computer instability or errors: 1. computer arithmetic works on the finite set of rational numbers (not on the real line IR); 2. computer generators provide pseudo- random numbers which are not really random (appropriate methods of statistical testing provide useful information on the quality of obtained results); .1. computer graphics provides a finite number of "pixels" on a computer screen (not a continuum in the form of a rectangle in IR x IR); v. mathematical and numerical instability of all calculations connected with a -stable random variables, when parameter a approaches 0 or when a converges to 1. with 3 0.
51
A. JANICKI and A. WERON
3.6 Exact Formula for Tail Probabilities According to Feller (1971), the asymptotic behavior of tail probabilities of the symmetric random variable X S„(a, 0, 0) is described by = D„o- ',
urn PP{X > oo
where
1
D, = - (f 2 °'
sin(x) dx)
Without loss of generality we can restrict ourselves in the sequel to the case of X = Sc, (which means that X ti Sc,(1, 0, 0) ). The following result gives an exact explicit formula, which serves as a basis for two algorithms: an applicable algorithm of computation of tail probabilities and a method of computer simulation of a-stable variables and random measures.
Theorem 3.6.1 Let us define in the square of (x, y) E (0,1) x (0, 1) the function sin(a7r(x - ))
fc,(x,Y)
=
cos((1 - a)71-(x - 2))) /"log(y) Icos(ir(x - 2))} 1
(3.6.1)
Then we have P{S, > where
= I{(x,y); f„(x,y)>
(3.6.2)
denotes the volume of a set A in IR 2 .
A formula more general then (3.6.1) concerning skewed stable variables can be easily derived from (3.5.2). It was Kanter (1975) who noticed that a certain integral formula dealing with totally skewed to the right stable random variables (0 = 1 and a E (0, 1)) derived by Ibragimov and Chernin (1959) implies a simulation method given in (3.5.2), for this special case. Then Chambers, Mallows and Stuck (1976) noticed that a formula of Zolotarev (1966) can be used similarly to give a simulation method for the general case. In the five following figures we present graphs of the function fc,A(x,Y)
min {Mx,Y), A}, max {Mr, y), A}, --
if f„(x,y) 0, if f„(x , y) < 0,
for fixed value A = 3 and five different values of the parameter a. We hope that the series of data presented below (Figures 3.6.1 - 3.6.4 and Table 3.6.1) illustrates exactly how tail probabilities change with a. In each figure this probability is equal to the 2-dimensional volume of a flat upper part of the function f;,.
52
CHAPTER 3
Figure 3.6.1. Function
7
= f1 7 (x,y); P{S1 . 7 >
= 0.0362.
Figure 3.6.2. Function .0.2 = f;,'.2 (x,y); P {S 1 . 2 > 3} = 0.0795.
A. JANICKI and A. WERON
53
Figure 3.6.3. Function fo 5 =
P{S0.5 > 3} = 0.1835.
Figure 3.6.4. Function f j 3 = fL(x,y); P{S0 . 3 > 3} = 0.2297. ( .
CHA PTER 3
54 Table 3.6.1. Table of Stable Tail Probabilities a 2.0 1.9 1.8 1.7 1.6 1.5 1.4 1.3 1.2 1.1 1.0 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0.01
P{S,, > 0.3} 0.4160 0.4160 0.4158 0.4156 0.4152 0.4147 0.4140 0.4131 0.4118 0.4099 0.4075 0.4036 0.3986 0.3918 0.3832 0.3733 0.3622 0.3507 0.3388 0.3267 0.3163
P{S, > 3.0} 0.0169 0.0228 0.0293 0.0362 0.0436 0.0516 0.0601 0.0695 0.0795 0.0904 0.1027 0.1156 0.1300 0.1461 0.1638 0.1835 0.2054 0.2297 0.2563 0.2849 0.3130
P{S,,> 30.0} 0.0000 0.0000 0.0000 0.0000 0.0002 0.0009 0.0017 0.0030 0.0048 0.0071 0.0106 0.0156 0.0228 0.0330 0.0475 0.0677 0.0956 0.1334 0.1828 0.2449 0.3088
Remark 3.6.1 The numbers included in the table presented here pale 3.6.1) give an idea of an extension of the well-known "rule of 3 a's" for normal standard distributions to the case of stable variables. (Remember that S2 V(0, 2); if X At(0, 1), then PIX > = P{S2 > 41 }.) Without developing any necessary mathematical formalism let us mention that lirrlSa = Z, where Z is described by the following conditions: P{Z = 0} = p. P{Z = +oo} = q/2, P{Z = -oo} = q/2, with p > 0, q > 0 and p + q = I. When looking at the data presented in this section one can imagine what is going on when we simulate stable variables on a computer for changing values of the parameter a.
55
A. JANICKI and A. WERON
3.7 Density Estimators Computer algorithms for constructing various random variates often involve approximate methods of representation of random variables with the aid of artificially produced finite statistical samples, so we are interested in statistical methods of data analysis such as constructions of empirical cumulative distribution functions or kernel probability density estimates and so on. Here we are not interested in statistical methods of estimation of parameters of a-stable random variables from a given statistical sample. The reader interested in these kinds of problems can find some information on the subject in Feuerverger, McDunnough (1981). The results of computer experiments with maximum likelihood estimations can provide additional important information on constructed variates. In this section we will discuss the important and very interesting problem of approximation of univariate density functions f = f(x). There are some very well known monographs concerning this subject. Let us mention Noether (1967), Tapia and Thompson (1978), Cs61.0 and Revesz (1981), Devroye and GyOrfi (1985), etc. Our aim is to recall some simple, useful methods describing kernel density estimators. Let us suppose that on a probability space (12,,1, P) we are given a sequence {F, 1 , e2, ...} of i.i.d. random variables distributed according to the law described by the unknown density function f = f(x). To abbreviate the notation let us define E r, = ..., The observed sequence of values (or realizations) of E n , i.e. its statistical sample we denote by E(n) 1) n) or, in full notation, 1.-.(n)(w) = {0)(w), ...,en)(w)}. A value of the density f estimator for any fixed x E IR is denoted by fn (x; w), when we view it as a random variable on (52,F) depending on E n (w), or simply by fn (x) when we regard it as an approximate value of the density f, derived from a fixed sample EN.
=W
, ...,
e }
-
E
In most cases in which we are interested in (n) will be obtained as a result of computer simulation of a-stable variates with the use of the direct method, described in Section 3.5. We will emphasize general methods and theoretical facts suitable in this context. The simplest particular example of a nonparametric density estimator belonging to the class of kernel density estimators represents commonly used histograms.
Histograms. Suppose we are given a statistical sample E(n). Let us fix appropriately a finite interval [a, b] contained in the support of an unknown density f. Let us fix N E IN and introduce a set of mesh points x, = a + ih, i = 0, N, dividing the interval [a, b] into N subintervals of equal length h (b—a)/N. A histogram is a function ft, = fn (x), constant on each of subintervals [x„ x,.“) and defined as follows.
CHAPTER 3
56 For i = 0,1, ...,N — 1 and for x E [xi, ii-1-1) define
f,(r)
K„(xi, x i+1 ) Tth
where function K,(x i , r, +1 ) counts how many of the data values of the intervals, i.e.
K„(x i , x i+1 ) = #{k;
are in each
(k) E [ii, ii+i ) }.
A bar graph of f,, gives an approximation of the graph of the unknown density function f. Joining middles of bars over intervals one can obtain continuous, piecewise linear approximation of the density f. Now we are going to present a few methods providing algorithms for calculating kernel density estimators. We will assume that we are given a continuous kernel function K(u) on IR, satisfying conditions
f
K (u)
= 1;
K (u) > 0 for u E IR.
Appropriate and commonly used kernel functions are the following: 1. rectangular:
K(u) =
2. triangular:
K(u)
1 2'
0,
if if
mul < 1, > 1;
1
if
3. Gaussian:
K (u) = (27r) -1 i 2 e - " 2 / 2 ;
.1. "optimal":
K (u ) =- {
5. biweight:
K ( 11 ) = { i ;,/,
0, 0
:
V6,
if lid > N/;
0,
4 ■3/
<
( 1
us2
if
) '
( 1 .72)
lui
^ v,
if lid > V:7;; 2
if lu < VT', if 1 .11 1 > e.
We will also assume that we are given a sequence of positive real numbers ° 1 such that 11),,I,',_ lim b, = 0, lim nb r, = oo. n
n
From the well known results on the asymptotic behavior of such density estimators (see, e.g. Devroy (1987)) it follows that in practical computer calculations it is reasonable to choose
b, = cn -115 where c stands for an appropriately chosen constant.
57
A. JANICKI and A. WERON
Rosenblatt—Parzen kernel density estimator. Starting from a given statistical sample E (n) , the method provides for any fixed x E IR an approximate value fn (x) = fn (x; co) of f(x) in the following form x - l) n ). t.i 0, n K( fn (x) = n -E
(3.7.1)
Overlooking a method of constructing a bar graph of any histogram, we can think of the height of the bar for a particular interval [x„ x 1+1 ) as a quantity proportional to the average number of total data that are in that interval. In practical realization of a more general kernel density estimator like (3.7.1) the range should also be divided into intervals, but these intervals are allowed to overlap, and the aim is to estimate the density at the center point x of each interval of the form [x - b n , x b n ]. Instead of just counting the number of points in the interval, the method assigns a non-negative real number to each point C(i) in this interval: "throws" Cl') close to the center of the interval get highest possible values; other, farther and farther from the center, gain less and less of the weight coefficient, according to the rule defined by kernel function.
Wolverton—Wagner—Yamato recursive kernel density estimator. The method is just a recursive version of the previous one and consists in the following fn(x)
n
n
K(
X
ei)
(3.7.2)
)•
The recursive formula is obvious 1
n-1
fn(x)= fn-1
(x) nb,
K(
x— I co)
).
Now we are going to justify these methods recalling only a few facts from the vast literature related to the problems of convergence of nonparametric density estimators. We do not pretend to present them in the most general possible form. Our aim is to recall some theorems on convergence of methods described above, applicable when a-stable laws are discussed.
Theorem 3.7.1 Let us suppose that an unknown density function f = f(x) and a kernel K = K(u) are continuous and bounded on R. Then for the Rosenblatt-Parzen method (3.7.1) we have 1. for any x
E IR
lim E f„(x) = f(x);
tz-00
2. for any x
E
lim fn (x) = f(x),
n-■co
in probability,
58
CHAPTER 3
E,7_
3. if for any positive 6 the series '
E
R
exp(-8nb„) converges, then for any
fn(r) = f(x)} = 1;
P 4. if for any positive 6 the series
P
1
{ li
E:
i
exp(-15nb,,D converges, then
m suplif,(x) — f(x)I; x E
= 0} = 1;
n—o(x)
5. if the density f has continuous and bounded second derivative f" and K =
K(u) is an even function satisfying the condition fiR u 2 K(u) du < oo, then for any x E R
E f.(x) — f(x) = q.,, f 2(x) + o(b; )• i
Theorem 3.7.2 Let an unknown density function f = f(x) and a kernel K = K(u) be continuous and bounded on R. Then for the Wolverton-Wagner Yamato method (3.7.2) we have I. for any x E R lim E f,(x) = f (x);
n
2. for any x E urn fn (x)
n —•oo
3 if ,
log lo sn
f(x),
in probability;
= oc, then P{lincro f,.,(x) = f(x)) = 1;
4. if the density f has continuous and bounded second derivative f" and K =
f
K(u) is an even function satisfying the condition uR u 2 K(u) du < o o, and
E:
= oo, then for any x E
f"(x) E f.(r) f(x) =
n
i=1
Now we present some graphical results of computer experiments that allow us to demonstrate what we should expect doing some statistics out of samples of a-stable random variables. Figures 3.7.1-3.7.3 show, in particular, that one has to work with at least a few thousands of approximate paths of stable (and Gaussian too) stochastic processes in order to obtain a minimum of appropriate accuracy required.
59
A. JANICKI and A. WERON
Figure 3.7.1. Density of S1.2 (1,0,0) and histograms for three sample sizes: 1000, 2000, 4000.
-0.3
-0.2
-0 .1
—2
0
Figure 3.7.2. Density of S 0 . 8 (1,0,0) and histograms for three sample sizes: 2000, 4000, 8000.
60
CHAPTER 3
Figure 3.7.3. Density of S0 . 7 (1,1,0) and kernel density estimator and histogram for the sample of 8000 "trials".
Figure 3.7.1. Density of S 0 . 7 (1, 0.7, 0) and kernel density estimator and histogram for the sample of 8000 "trials".
A. JANICKI and A. WERON
61
Figure 3.7.5. Density of S1.3(1,1,0) and kernel density estimator and histogram for the sample of 8000 "trials".
Figure 3.7.1 represents the density of the random variable S 1 , 2 (1, 0, 0) and three histograms obtained from 1000, 2000, 4000 "trials" and 20, 40, 80 subintervals of the interval [-4,4], respectively (with tails properly cut off). Figure 3.7.2 presents the density and histograms of S0.8(1,0,0), produced with 2000, 4000, 8000 "trials" and 20, 40, 80 subintervals, so comparing it with Figure 3.7.1 one can see what happens when the size of a statistical sample is doubled. Figures 3.7.3 - 3.7.5 include graphs of three totally skewed and skewed astable random variables, their density estimators obtained by the application of the Rosenblatt-Partzen method with "optimal" kernel and n = 8000, and histograms as well. Figures 3.7.1 - 3.7.5 show that computer methods of simulation of a-stable random variates demand statistical samples of large sizes, especially when high accuracy is needed. The quality of the kernel estimator heavily depends on the chosen value of the parameter bn . Acceptable graphs were obtained for values of b 8000 close to 0.2.
62
CIIAPTER 3
Remark 3.7.1 The reason of representing Figures 3.7.6-3.7.12 is at least threefold: • they indicate that the world of bivariate a-stable vectors is surprisingly reach; • they confirm that smoothing techniques of statistical data are efficient (the densities were obtained by application of the kernel density estimator acting on the 2-dimensional sample produced by the computer generator of astable random variables); • they suggest the possibility of application of a-stable random vectors in modeling of, non-Gaussian in nature, real life problems.
'0.4•••■•■ftemamm.
arwmissafsawromfar
Figure 3.7.6. Approximate density function of the vector (X, Y) with X, Y S1 .3(1.0, 0.0,0.0) on the rectangle [-10,10] x [-10,10].
A. JANICKI and A. WERON
63
Figure 3.7.7. Approximate density function of the vector (X, Y) with X, Y S0 . 7 (1.0, 0.0, 0.0) on the rectangle [-10,10] x [-10, 10].
mmar.H.armarr.-■ mmanr..wwwww4,nmawm.......W r.acrm■maw .+zr
N41 4*kame.wi . AMOWYPFaVF. AWNI.IRA4
W4rif
sargr.rs.■
.E.Nqwf.r m,stain00
aWr---•amummr. ■•••• —•...
M.Nwhzvmv Awssmmswa ...awmEwasw
0./Fau ta•■■••
Figure 3.7.8. Approximate density function of the vector (X — o i Y X + Y) with X, Y 50.7(1.0,0.0,0.0) on the rectangle [-10,10] x [-10,10]. ,
61
CHAPTER 3
Figure 3.7.9. Approximate density function of the vector (X, Y) with So . 7 ( 1.0, 1.0, 0.0) on the rectangle [-2, 8] x [-2, 8].
Figure 3.7.10. Approximate density function of the vector (X — - 1 1 1', X + So.7( 1.0, 1.0, 0.0) on the rectangle [-2, 8] x [-2, 8]. withh
65
A. JANICKI and A. WERON
Figure 3.7.11. Approximate density function of the vector (X — with X, Y S0 . 7 (1.0,0.7,0.0) on the rectangle [-6,4] x
X Y)
Figure 3.7.12. Approximate density function of the vector (X — ,15.Y, X with X, Y S1 . 3 (1.0,1.0, 0.0) on the rectangle [-8,2] x [-8,2].
Y)
Chapter 4 Stochastic Integration 4.1 Introduction Now our aim is to introduce briefly a few basic notions of stochastic analysis and to make a few remarks on their usefulness in the book. We consider only real-valued stochastic processes with continuous time, i.e. our main object of study will be random functions X = {X(t) : t > 0) defined on the set R + = [0, co), with values in appropriate spaces of random variables or finite dimensional random vectors. Many processes, including d-dimensional Brownian motion and d-dimensional a-stable Levy motion, can be defined in terms of their finite-dimensional distributions irrespective of their probability spaces, avoiding modern axiomatic probability theory setting. There are many textbooks, especially oriented towards engineering applications or statistical methods, written in this style. Trying to avoid unnecessary complications, however, we have to rely sometimes on facts and theorems concerning stochastic processes involving evaluation of conditional expectations not only with respect to finite families of random variables but with respect to appropriate a-fields of events. (We recommend an inexperienced reader to check Karlin and Taylor (1975), where this subject is carefully introduced into investigation of some classes of stochastic processes.) So, let us briefly recall the main notions of stochastic analysis which we find useful in the sequel, using the simplest possible formulation. We take as given a usual complete probability space (52,1, P), together with a filtration {Ti }, i.e., a nondecreasing family of sub-a-fields of 1 (F, C ,T; C ,F for 0 < s < t < co), which is assumed to satisfy the usual conditions of right-continuity and inclusion of all P-null sets. A stochastic process X = f X(t,c,.)) : t > 0,w e (or in shortened notation: {X(t) : t > 0)) with values in R d is a function X : IR + x S2 —> R d such that for each t > 0, X(t) = X(t, •) is a measurable function from (11,1) into R d equipped with the a-field of Borel sets B(IR d ), i.e. the smallest a-field containing all open sets of F. X is said to be adapted (to {,Pt }) if for each t > 0, X(t) is a measurable function from (1,.F) into R d ; X is said to be cadlag (after the French: continu a droite, limite a gauche) if its sample paths {t X(t,w) : w E are right-continuous with finite left 67
CHAPTER rl
68
limits. All martingales will be assumed to have cadlag paths. A sernimartingale is a cadlag adapted stochastic process that can be decomposed as the stun of a cadlag local martingale and a cadlag adapted process whose paths are locally of finite variation. Given a stochastic process X, the simplest choice of a filtration is that generated by the process itself, i.e. the family = a(X,, : 0 < s < t), the smallest a-field with respect to which X, is measurable for every ,5 c [0, t]. This will be a typical situation in the sequel. As we have mentioned already, our main tool of investigation of a-stable processes is a stochastic integral with respect to an a-stable stochastic measure. A vast class of stochastic processes, especially important from the point of view of ergodic theory, consists of a-stable processes that can he represented by stochastic integrals in the following form
X(t) -= Jf (t, ․ ) dL„(s), where f = f(t, s) denotes a deterministic function satisfying appropriate conditions and {L 0 (1): t > 0} stands for a-stable L6vy motion. Concentrating our attention on real valued diffusion processes that solve stochastic differential equations of different kinds and leaving aside the discussion of maybe sometimes more important and relevant stochastic integrals, we would like to explain how the class of a -stable processes is situated among the vast family of processes studied in textbooks on stochastic analysis. It is not so commonly understood that a vast class of
IR"
valued diffusion
processes {X(t) : t > 0} driven by a stable stochastic measure, with given drift and dispersion coefficients, can he described by the following stochastic differential equation
d X(t) a(X(t—)) dt + c(t) t > 0, X(0) = X o . that can be rewritten in the following integral form
.V(t) = X 0 a(X(s—)) ds +
J c(s) dL,(s);
one can consider still more general equation of the form
X(t) = X 0 +
j
a(X(s—)) ds +
j
c(X(s—)) dL,(s).
To the contrary, thanks to ItO's theory, it is commonly understood that any
IR"
valued diffusion process {X(t) : t > 0} driven by the Wiener process (Brow-
nian motion), with given drift and dispersion coefficients, can he obtained as a solution of the following stochastic differential equation
X(t) = X 0 +
a(X(s)) ds +
c(X(s)) dB(s),
A. JANICKI and A. WERON
69
where {B(t)} stands for a Brownian motion process. The theory of such stochastic differential equations (see Arnold (1974) or Kallianpur (1980)) has been developed for a long time. It is clear that stochastic differential equations involving stochastic integrals with a Levy motion as an integrator includes the above equation as a special case. Still more general are the so-called stochastic differential equations with jumps. In the case of real-valued process the problem is to find the solution {X(t) : t E [0, oo)} of the equation
f(X(s-),x) N(ds,dx), X(t) = Xo + I o 112\-( 0) where N (ds, dx) is a Poisson measure of a suitable point process with a given intensity measure ds dv(x). All types of stochastic equations described above are special cases of general stochastic differential equations driven by semimartingales, i.e. equations of the form
X(t) = Xo + f(X(s-)) dY(s), where {Y(1)} stands for a given semimartingale process. There is a vast literature concerning this topic (see, for example, Protter (1990) and the bibliography therein).
4.2 Ito Stochastic Integral For a given complete probability space (0,,,T, P) (with a filtration {Ft : t > 0}), let us shortly list some properties of martingales.
Definition 4.2.1 Let {X(t) : t E [0, 00)) be a real-valued process, adapted to the filtration {.Ft } and such that EIX(t)I < oo for all t > 0. We say that {X(t)} is a martingale if V i >„
E
(X(t)1F5) = X(s). (4.2.1)
It is known that if a process {X(t)} is a martingale such that E ix(t)IP < oo for p > 1, then
{ sup IX(s)I A} < EIX(t)IP - AP a<st
(4 .2.2)
For p > 1, estimation (4.2.2) can be sharpened to
E
P
sup Ix(t)IP <3 t
Wiener processes.
(
P
1
E Ix(t)IP
(4.2.3)
Let us recall the definition of the standard realvalued Wiener process, equivalent to the definition 2.2.1 of a Brownian motion process.
E
CHAPTER 4
70
Definition 4.2.2 The standard one—dimensional Wiener process is a process {W(t): t > 0} (or in full notation: {W t > 0, cv E 42}), satisfying the following conditions W (t 1 ), ...,W (t „) is a Gaussian vector with mean 0;
( ) V (ii) V t ,
E W(t)W(s) = min{t, ․ );
(iii) P {w : W(-,c,") is a continuous function} = 1. Let us notice that W(0) = 0,
E w(1)2 = t,
(4.2.4)
Vo5t,<, 2
(4.2.5)
The last statement follows from the equality
E (1'V(t 2 ) — iv(ti),Tv(t4) — 4V(t3)) minft 2 ,t 4 1 — mit- {t h t 4 } —
t3} + min{t 1 ,1 3 )
0,
which shows that random variables W(t ) — W(t i ) and W(t ) — 14 . (1 3 ) are uncorrelated. 2
4
Let g t denote the a algebra generated by {W(s) : s E (0, 2]). We have
V t>, E [w(t)Igsl = W(s).
(4.2.6)
Indeed, 44"(t) — 41/(s) is independent of all W(T) for r c [0, s], and thus {W(t)} is a martingale with respect to Ig t }, which means that we have
E [(w(t) — w(s))'Igd = t
(4.2.7)
This equation characterizes martingales with mean 0 which satisfy the definition of the Wiener process. Moreover, we have the following theorem due to L6vy.
Theorem 4.2.1 Let {W(t) : t > 0} denote a real valued continuous process such that W(0) = 0. Let this process be a martingale with respect to an increasing family of a -algebras : t > 0) and such that t>.s>o
E [(W(t) —1/17 (s)) 2 iTsi = t
s-
(4.2.8)
Thcn {W(t)} is a Wiener process. For the proof the interested reader is referred to Doob (1953).
Definition 4.2.3 The standard, n—dimensional Wiener
process is the vector-valued process {W(1) : t > 0) composed of n scalar Wiener processes {Wi (t)}'i L,} such that
wi ww(,)
min{t,s}, for i, j
1 2, ..., n. ,
(4.2.9)
A. JANICKI and A. WERON
71
In a more general setting, the IRn-valued Wiener process can be defined as the continuous {..rt } martingale which starts from 0 at 0 a.s. and such that
E [(W(t) — w(s),w(t)— w(s))I.F.1 = (t — s) I,
(4.2.10)
where I denotes the identity matrix. As usual, we can take for the filtration {,i} the family of c-algebras generated by {W(s) : 0 < s < t}.
Stochastic integral with respect to Wiener process. With a given increasing family 1.7; : t a [0, T]} we fix a continuous stochastic process {W(t) : t E [0, T]} which is an {Ft }-martingale, vanishes at 0 with probability 1, and satisfies condition (4.2.10). Let us introduce for p > 1 the space of real valued and measurable adapted (equivalence classes of) processes {OM = LPw(0,T) =-
:10(t)IP dt < oo a.s.}
(4.2.11)
0
and the space
LP y(0,T) = {0 E LPw(0,T): E
0
T
14)(or di) < 00} .
(4.2.12)
In the obvious way one can define the spaces LPw(0, T; IRn) and LP r(0, T; IRn). Let us notice that LPF.(0, T; 11r) is contained in L'((0, T) x f dt dP; Rn). When p = 2 we have an important special case of the Hilbert space
a cl L 2 y(0,T; IRn). Let N denote an integer tending to oo, and let T = T/N. With any fixed process {4:0(t)} we can associate a process with "finite number of values" { (t)} defined as follows 0,40
1 j*" -
T
1(s) ds for t
E
[(n - 1)r, nr) and 1 < n < N.
(4.2.13)
(n-1)r
The sequence {cD r } converges to 1 in the space L 2 ((0, T); L 2 (1t,F,P;Rn)). It is also clear that (D T a so we have 0, 4 in the space This means that all "simple processes" O r define a dense subspace in the Hilbert space
a,
a.
a.
Definition 4.2.4 Let 0 E be a simple process, i.e. a process such that 0(t) = 0„ for t E [t,,,,t n+i ) and n = 0,1, ..., N -1,
(4.2.14)
for a given partition 0 = t 0 < t 1 < < 1 N = T • of [0, T] and where 0„ are .stn -measurable. It is natural to define the Ito stochastic integral for such processes as finite sums of the following form N-1
I = I(CD)
E(4)„, w(t7,+,) — w(in)). n=0
(4.2.15)
72
CHAPTER 4
We have
E low
N -1 ln) E1 4),, 1 2 E
(
J
0(01 2 dt.
(4.2.16)
0
Indeed, for t n+i < t,, we have E(q) ., W(t,,+.1) — W(tn))( 4),,, ,W(tm.+1))
= E co„tv(t„ +1 )- 1 (t,))( 0 -, Elw(tm+,) - w(t )11 -,„,1)) = 0, because E[W(tm+1)1.Ft_] = W(tm). We also have
El(4).,1v(t.+i)- w(t,,))1 2
=
tv(1,),117(1„+i)- W(G3-Ftnl ) (1),,,, (1), )}
E {(( (tn+1
/”.) E
according to (4.2.10). Now it is clear that the operator / = /(4)) acts as a linear operator from a dense subspace of 3 into L 2 (C1,F, P). It is also continuous with respect to the norm of a. We can thus formulate the following definition. f((b) defined in Definition 4.2.4 can be linearly extended onto all space so passing to the limit with an appropriately constructed sequence of simple processes converging to (I) we obtain
Definition 4.2.5 The operator I
a,
( (I) )
I (t1)(s),dW (s)).
(1.2.17)
The random variable I(4)) is by definition the Ito stochastic integral of (1).
incidentally, we also obtained the following properties of this integral.
Proposition 4.2.1 The stochastic integral described by (4.2.17) defines a linear operator acting from the space properties
a into 1,
2 (Q,,F,
V4, E3 E 1(4.)= o ;
P), which has the following
V ri, Ea E 1(4)) 2 =114.11i; V 4),,v E3
E
I(4)) IN) =
E I ((1)(s), *(s)) ds.
(4.2.18) (4.2.19) (4.2.20)
73
A. JANICKI and A. WERON
Stochastic integral as a stochastic process. We want to discuss briefly some properties of the process
t 40)(0 = i (43(s), dW (s)), t a [0, T],
(4.2.21)
o
defined for (1) E a = 1,270, T; IR"). We can assume that we have chosen a separable version of the process defined above. This process is also an it -martingale because
E
[I(0)(1)1.7 31= I(0)(3)+ .
E
t [f (0(4 dw(u))1-7 31= 1(0)(3). -
3
We have also
E
1(0)(0 2
= E
f
14)(s)1 2 ds,
and, thanks to properties (4.2.2) and (4.2.3) of martingales, we get
P{ sup
o
E sup
0
(0(s) dW(s)) > a} 5 — 12 a '
f t (4)(s),dW(s)) 2
E I0 T
0(4 2 ds,
(4.2.22)
T
<4
E ff
10(8)1 2 ds.
(4.2.23)
4.3 a—Stable Stochastic Integrals of Deterministic Functions Denote by (0,1", P) the underlying probability space and by L°(1 ,.P, P) the set of all real random variables defined on it. Let (E, E, in) be a measure space, let
# : E --- (-1,11 be a measurable function, and let £o = {A a E : m(A) < oo } be the subset of E that contains sets of finite m-measure.
Definition 4.3.1 An independently scattered a-additive set function M: E0 a A -- M(A) EL°(St,.F,P) such that for each A E E0 M(A) --, .5., ((m(A))I/', m(A) j /3(x) dm(x), 0) is called an ot-stable random measure on (E, £) with control measure m and skewness intensity #. Measure M is called an Sot S random measure if the skewness intensity 0 is zero.
CHAPTER 4
74 Now we want to define an a--stable stochastic integral 1(f) =
f(x) dM(x)
with respect to an a-stable random measure on (E,E) for all measurable functions f : E —* IR satisfying the condition
fEj f(x) I' dm(s) < oo,
(4.3.1)
i.e.. for all f E La(E,E,m).
The first step. For a simple function f (x) belonging to E0 , we put 1(f) = f f(x) dM(x) =
c.i./A.,(x) with disjoint sets A 3
a,M(A,).
(4.3.2)
The map 1(f) is obviously linear on the linear space of simple functions f . Since the random measure M is independently scattered, the a-stable random variables: MOO, M(A„) are independent and, consequently, 1(f) is a stable. say 1 (f)
S.(ain Of, tif) •
The second step. Consider now any function f from the space L a (E,E, m), i.e., from the linear space of all functions satisfying (4.3.1). It is easy to notice that there exists a sequence of simple functions If (')}„'°_, such that
f ( ' ) (s)
f(x) for a.a. x c E;
f ( " ) (x)l< g(x), for any n, x and some g a L a (E, E. m). The sequence of integrals {/(P 0 )}„, 1 , 2 ,.., is well defined by (4.3.2). It is a Cauchy sequence in the complete space of a-stable random variables with the metric induced by converges in probability. So, there exists a random variable I( f) which is the limit of 11(f ( n ) )1 in this space.
Definition 4.3.2
Therefore an cr stable stochastic integral of any function f a La(E, E, in) is defined by the following formula 1( f)
dr
lim 1(f ( ' ) ) in probability.
(4.3.3)
71. -1,X)
This definition does not depend on the choice of the approximating sequence is linear in f. Thus, for any fd from La(E,E, in), the random vector ( /(f2),..., I( fd)) is a-stable with the characteristic function
{ft )) and 1(f) „
C3 .11
•
°d) =
75
A. JANICKI and A. WERON
I E 0.7 f,(x) (1 — iii(x)sign (E 0.ifi(x)) tan(ra/2)) dm(x)} .
exp
E 3=1 '
3=1
We refer the reader to Samorodnitsky and Taqqu (1993) for more details. Now we recall some basic properties of an a-stable integral. (In the sequel the stochastic integral is discussed in more general setting.)
Theorem 4.3.1 Let the sequence of integrals X, = fE f,(x) dM(x), for j = 1,2, ..., and X = fE f(x) dM(x) be defined by f, and f from the space L a (E, E, m), respectively, where M denotes an a-stable random measure with control measure rn. Then X = lim; „ X; in probability if and only if f = J , in the corresponding space L a (E,E,m). .
Theorem 4.3.2 Let be given two stochastic integrals X, = fE f,(x) dM(x), for j = 1,2, where M denotes an a-stable random measure with control measure rn. Then X 1 and X2 are independent if and only if 1112 ==_ 0 m-a.e. on E for 0 < < 2, or Cov(X i , X2) -=- 0 for a = 2. Theorem 4.3.3 Let be given two stochastic integrals X, = fE f,(x) dM(x), for j = 1,2, where M denotes an SaS random measure with control measure m. If 1 < a < 2, then the covariation X21„ = fE fl f2' -1 'dm(x) is well defined and X2 is James orthogonal to X i if and only if [X 1 , = 0. In the next few sections we present constructions of more general stochastic integrals. Stochastic a-stable integrals defined in this section play, however, such an important role in our investigations, that in what follows we present another approach to the construction of this integral based on the Poisson representation of underlying a-stable random measures.
4.4 Infinitely Divisible Processes Let be given a filtered probability space (ft .F, {.Ft}o
Definition 4.4.1 An adapted process X= {X(t)}o
X has increments independent of the past; that is, X(t) — X(s) is independent of ,F„ 0 < s < t < co;
2. X has stationary increments; that is, X(t) — X(s) has the same distribution as X(t — s), 0 < s < t < oo; 3. {X(t)} is continuous in probability; that is, the limit is taken in probability.
X(t) = X(s)
and
CHAPTER 4
76
If we take the Fourier transform of each X(t), we get a function f (t, u) = ft (u) defined by
ft(0)
E{e ox(0 ),
where fo (u) = 1, and ft+s (n) = ft (u)f,(u), and ft (u) 0 for every (t,u). Using the (right) continuity in probability we conclude that ft (u) = e t'l'(') for some continuous function 0(u) with '(0) = 0. (The Bochner Theorem can be used to show the converse: if 0 is continuous, ii , (0) = 0, and if for all t > 0, Mu) = e '''(u satisfies i ; — u i ) > 0, for all finite al, .., a n then there exists a Levy process corresponding to the function f.) In particular, it follows that if X is a Levy process then for each t > 0, X(t) has an infinitely divisible distribution. Conversely, it can be shown that for each infinitely divisible distribution there exists a Levy process X such that p is the distribution of X( 1 ). -
-
E ,.
)
Theorem 4.4.1 Let X be a Levy process. There exists a unique modification Y of X which is coding and also a Levy process. PROOF. Let Al t" = ' f. : (x,,( ; ) . For each fixed u E C), the rational in R, the process (:1.1,u) 0<2< ,s is a complex valued martingale (relative to {.7;}). It can be checked that 111' has a version with cadlag paths for each u. Let Ou. be the null set such that for w E 0„ the map t W(w) is right continuous with left limits. Let 0 = E Qe.• Then P(0) = 0. We first show that the paths of X cannot explode a.s. The process {Mt } t>o is a (complex-valued) martingale for any real u and thus for a.a. w the functions t (w) and I eux(t,w) with t E Q are the restrictions to (:). f of cadlag functions. Let O = {(w, u) e 11 x IR : eu x(t '"' ) t E (:)}.
One can check that 9 is a measurable set and we see that f /19(w, u)P(ak...) = 0 for each u e R. By the Fubini Theorem
f
c.
u)duP(dw) =
=
hence we conclude that for a.a. w the function t c." -Y(t. "9 , t c (Q + is a restriction of a cadlag function for almost all it E IR. We can conclude that the function t X(t,w), t E CO + , is the restriction of a cadlag function for every such w. It is enough to make use of Lemma 4.4.1, which is proven below. Next, choose w V 0 and suppose that s X(s,w) has two or more distinct accumulation points, say x and y, when s increases (respectively, decreases) to t. Choose an it E (L) such that u(y — x) 2 2r 77/ for all integers m. This then contradicts the assumption that w CI, whence a --+ X(s,w) can have only unique limit points. Set limn a X(s) tt on 520 and i = 0 on 0, all t. Since .F1 contains all P-null sets of .F and ITtlo
❑
A. JANICKI and A. WERON
77
Now we have to prove the lemma which was used in the above theorem, making use of a purely probabilistic method.
Lemma 4.4.1 Let {x,} be a sequence of real numbers such that e"`'" converges as n —÷ co for almost all u E R. Then {x n } converges to a finite limit.
PROOF. We will verify the following Cauchy criterion: x n converges if for any increasing sequences nk and mk limk_„„ o (x„ — = 0. Let U be a random variable which has the uniform distribution on [0,1]. For any real t, by hypothesis e aux„ k and e'tux".k converge a.s. to the same limit. Thus we have lim k—000
e ttU(snk
-X,”k) =
1 a.s.
and therefore the characteristic functions converge, i.e. urn E{e "(rn ' z '' )u } = 1 ,
k—000
for all t E R. Consequently (x„„ —x„, k )U converges to zero in probability, whence = 0, as claimed. ❑ limk,(Xn k — We can henceforth always assume that we are using the (unique) cadlag version of any given Levy process. Levy processes provide us with examples of filtrations that satisfy the "usual hypotheses", as the next theorem shows.
Theorem 4.4.2 Let X be a Levy process and let gt = V Ar, where {.71 }o
{gt} 0
is right continuous.
PROOF. We must show fit, = fit, where g,, = nu>tg.- Note that since the filtration g is increasing, it suffices ffi to show that G -t = nn>19t1-1. Thus we can take countable limits and it follows that if we take s i , ...s n < t then for (u 1 , ...u n ) we have E
e i(uix(so+...+unx(,)) cd, e
E(equix(si)+...+unx(30) I gt+}
qu i x(8 1 )+.-+u,,,x(3,0)
For vn > t and (u 1 , u n ) we present the proof only for n = 2 for notational convenience. Therefore, let z > v > t, and suppose that u 1 , u 2 are given. We have E { ei(u , x(o+u2x( , )) I g t+ 1 = li m E {,;(„,x(o-Fu2x(z» 'g uy } wit
_ { e juix(v) e,.. iu2 x(z 1 lim) lim wit E h(u2) I 9 '1
iu2x(z) E e iu,x(v) efz(u2) = lim t ./..( 72 2) 1 cw } wit
l im E {e-ix(v) wit
eiu2x(v)
Mu2)
f=(u2) I Cul ,
CHAPTER 4
78 noticing that comes
xrp
m„)
,,u2x(v)
is a martingale. Combining terms, the above be-
E{e "xm+ x" g=+) = lira tv i t E {e''''+ (
-
-)
x u L—(.2) I g.) (
)
and the same martingale argument yields E c io.x(.0+.2x(=)) g t+ ) = li r, e t(u, +.2 )xoo f,(lii +
11 2 )f„, (u2 ) =
,(
u14-.2 ) x m ,
which ends the proof. Let us recall two important definitions.
Definition 4.4.2 A probability measure on R, or a real-valued random variable V with law p, is said to be infinitely divisible if for any n > I there is a probability measure p n such that p = p;',7 or equivalently if Y has the law of the sum of 7/ independent identically distributed random variables. It is easy to see that Gaussian, Poisson or Cauchy variables are infinitely divisible.
Definition 4.4.3 We say that a measure p satisfies the Levy-Kchintehine formula with the Levy measure v if its Fourier transform 11 is of the form ii(0) = exp{0(0)}, with 00) = ib0 c02 + 2
(c
1
i0x 1 + x2
v(dx)
where b E R, c > 0 and v is a Radon measure on R\{0} {0} such that x2
1 + x2
v(dx) < oo.
It seems worthwhile to state a few elementary facts about Levy processes which will be used in the sequel. Levy processes have been widely studied in their own right because their properties often hint at properties of general Markov processes. In what follows below we deal only with real-valued Levy processes. Obviously, if X is a Levy process then any random variable X(t) is infinitely divisible. Conversely, it was proved by Levy that any infinitely divisible r.v. Y may be imbedded in a unique convolution send-group, in other words, there exists a Levy process X such that Y =d X(1). This can be proved as follows. By analytical methods, one can show that p is infinitely divisible if and only if it satisfies the Levy Kchintchine Formula. For every t E R + the function exp(ti(0)) is now clearly the Fourier transform of a probability measure p t and plainly tit * p s = fit+, and limtio Pt = Eo which proves Levy's theorem.
79
A. JANICKI and A. WERON
The different terms which appear in the Levy-Kchintchine Formula have a probabilistic significance which will be further emphasized in the sequel. If c = 0 and v = 0 then 12 eb and the corresponding semi-group is that of transformation at speed b; if b = 0 and v = 0, the semi-group is that of a multiple of the Brownian motion and the corresponding Levy process has continuous paths; if b = 0, c = 0, we get a "pure jump" process. Every Levy process is obtained as a sum of independent process of the three types above. Thus, the Levy measure accounts for the jumps of X and the knowledge of v permits to give a probabilistic construction of X.
Remark 4.4.1 Notice that Levy processes include Brownian motion, the Poisson process and a-stable Levy motion processes.
4.5 Stochastic Integrals with ID Integrators Before introducing integrals of deterministic functions with respect to stochastic measures it is convenient to consider the idea of an integral with respect to a general vector-valued measure. Assume that E is an arbitrary set and let E0 be an algebra of subsets of E i.e. for any A, B E £0 we have AUBE E0 and E\AGEo . Now, let be a complete linear metric space with distance 11x — Y11 for x, y E and let
a,
A: £0
9
II)
A A(A) E
be an additive set function which means that A(AUB) = A(A)+A(B) whenever A, BE£o , and A fl B= O. If one wants to construct a rich enough theory of integration with respect to A, the immediate natural question is: under what conditions can A be extended to a cr-additive set function or, in other words, a-valued measure, on the cr-field E = a(£0 )? The measure, whenever it exists, will be also denoted by A. One can prove that A can be extended to an a-valued measure if and only if the following condition is satisfied: if A n E £0 and lim sup A n = 0, then lim A(A n ) = 0. (4.5.1) n—■oo
71—.00
In the set of all real-valued functions f defined on the measure space (E, E) let us distinguish the class E = E(E0) of step functions on E which are £o measurable, i.e.
f(s) =
E uA,(,),
where 0, E R, and A, E eo . For such f the obvious definition of the integral is
f dA =
E 4000.
CHAPTER 4
80
In order to extend this construction of the integral to wider classes of real valued functions defined on the measure space (E, E) in a general case one can make use of the following functional
PA(f) = sup illfE v f
v a E(£0 ), Il < 1)
(4.5.2)
defined for f C E(E0 ). In what follows we restrict ourselves to the case of A taking values in subspaces of L°(CI,T, P). We will refer to it as an additive set function or a stochastic measure. The following property of pA and the integral f f dA with f E E(E0 ) is directly related to the question of extendability of A to such a measure.
Theorem 4.5.1 Let a = LP(Q,.F,P), 0 < p < oo, and A : Et) 3 be an additive stochastic set function. Then A can be extended to an •a valued stochastic measure A: E = .7(4) if and only if for each sequence of functions fr, a E(eo) with Ifn(s)i < 1, and such that lim n , fn (s) = 0 for all s E E, we have lim„„ pA(f„) 0. For the proof we refer the reader to Kwapien and Woyczyriski (1992). In view of the above results, throughout the remaining part of this section A will be assumed to satisfy the condition formulated in the theorem. This assumption permits us to introduce the following definition of A -integrability. —■ IR is said to be A integrable if there exists a sequence f„ a E(E0 ) such that:
Definition 4.5.1 Function f : (i) for any s E E, f„(s) (ii) pA(f„ —
f(s) as n
co;
0, as n, m —■ co.
For an A-integrable function f, condition (ii) implies, that there exists an element If E 3 such that i f — fE f„dAll —■ 0 as n oo and we can define the integral of f with respect to A by the formula f dA =
I.
Since not every bounded measurable function is a pointwise limit of a sequence of step functions, the above definition has to be augmented in the following non -essential way. First define a mapping "V from the family of subsets A C F into IR' by the formula
E pA(I ,), DO
A'(B) inf
A
where the infimum is taken over all the sequences {A i } C E ° such that A C Ut Ai. Next, an E -measurable function f is said to be A-integrable if there exists a function f satisfying Definition 4.5.1 and such that .
.
Atl(fs a E f(s)
f (s))) = O.
:
81
A. JANICKI and A. WERON In this case we define f dA
A
y dA.
It is easy to prove that the augmentation of Definition 4.5.1 is correct, i.e. that The class of all Athe value of fE f dA does not depend on the choice of integrable functions will be denoted by L(A). It follows from Kalton, Peck and Roberts (1982) that each stochastic measure A has a control measure A, i.e. a positive measure A on (E,E) such that A(A) = 0 if and only if A°(A) = 0. If A is a control measure for A, then Definition 4.5.1 can be easily modified to include all A-integrable functions. Namely, (i) has to be replaced by the condition
I.
for A - almost every s E E fn (s)
f(s) as n
co.
(4.5.3)
A more important comment is that the above definition of f f dA does not depend on the choice of a sequence { fn }. Basic properties of the integral defined in this way are gathered in the following.
Proposition 4.5.1 (i) If f, g E L(A) and a, b E IR, then
I
E (af
(ii) If f E L(A) and Ig(s)I 5 (iii)
bg)dA -= a fdA b gdA.
If(s)1, s E E, then g E L(A).
If f„, g a L(A) and then
g(s) and lim.„_ 00 fn (s)
f(s) for all s E E,
lim f fn dA = f dA.
n--koo
(iv) In order to extend formula (4.5.2) onto 1-measurable functions f one can write g if') • E L(11), IgI PA(f) = sup flifEgdAli Indeed, if f E L(A), then
PAM= suP{IllEvfdAll:v E EA), Ivl 1} = where {fn } C E(X() ) is any sequence approximating f, satisfying condition (4.5.3). Moreover, f E L(A) if and only i f 1)113 pA(E f) = 0. (v) If {f„} C L(A) and Urn PA fn T1,771.-.00
) =
0,
then there exists an f a L(A) such that
lim - f) = 0. non, PA(
CHAPTER 4
82
For the proof we refer the reader to Kwapieri and Woyczyriski (1992). Now we present a series of examples of stochastic measures which are considered in this book.
Example 4.5.1 Purely discrete stochastic measure. First let us give a very simple, but illuminating, example of a purely discrete random measure. Let E = T = IN, No be the algebra of subsets of IN generated by single points {n}, n a IN, and let e2 •.., be a sequence of random variables in .1.°(11, P) such that the series Sn converges in probability. If A E Yo, then we define A(A) = E •„•
>
n E .4
is easy to see that A extends to a a-additive stochastic measure with values converges unconditionally, in L°(C1,,F, P) if and only if the series converges in L'(C2,,F, P). i.e., for each subsequence {n k } C IN the series flj By the Kashin-Nlaurey-Pisier Theorem this is the case if and only if for each bounded sequence {6,} C IR the series converges. Thus it follows that the sequence {0,} is an A-integrable function on IN if and only if the series converges unconditionally. In the case when {„} is a sequence of independent random variables the Three Series Theorem implies that the sequence {O n } C IR is A-integrable if and only if It
E E ,
E 0,4.,
E 0„e„
c.0
EXn(fn)
<
n=1
where )(r) = I ENA1+
EN42 •
r
E
IR.
We recall that above and in what follows we use
JAI = X, if PO 5- 1, and EX] =
if h
)(
11 > 1.
(4.5.4)
as a centering function easier to work with rather than any other possible centering function that is needed in the Levy representation of appropriate measures.
Example 4.5.2 Independently scattered stochastic measure. T, where Let E = T [0, 7], EP be the algebra generated by intervals (s, s, t E R, and let {X(t) : t E T} be a process with independent increments and X(0) = 0 a.s. Then the formula A((s,tp = X(t) — X(s) defines an additive set function A on 6' 0 with values in L'(5 prove that A extends to a stochastic measure if and only if k
sup E 1 Ext. — o
<
P). One can
83
A. JANICKI and A. WERON
Eei.x(t), where t E T, is or, equivalently, if for each u E R the function g(t, u) of bounded variation on T. Such a measure is called an independently scattered stochastic measure since for any disjoint A, B E E, random variables A(A) and A(B) are independent.
Example 4.5.3 Predictable processes. Let (S1, F, P) be a probability space with filtration {.Ft }, E ir, where T= [0, Let us define E T x fl, and let E,o be the (predictable) algebra generated by If {X(t) : t a T} is an {,Ft }-adapted sets (s, t] n T x A, where s,t ET and A E process, then the formula A((s, t] x A) = (X(t) — X(s))IA defines an additive stochastic set function on Eo with values in L°(SZ,.F, P). It can be shown that A extends to a stochastic measure if and only if for each e > 0 there exists an s > 0 such that
As it turns out, this condition characterizes X as a semimartingale. Let us notice that in the case when E is a a-algebra of subsets of E and A is a stochastic measure taking values in LP(C1,,F, P), 0 < p < oo, Definition 4.5.1 is equivalent to the following
Definition 4.5.2 A function f : E
R is said to be integrable with respect to A if there exists a sequence {f, i } of step functions from E such that
(i) for each t E T, the sequence fn (t)
f(t) as n
oo;
(ii) for each A a 5, the sequence {fA f„dA} converges in LP(C1,,7, P) as n oo.
If f is integrable with respect to A, then we put
L
f dA = lim f fn dA. n^ao
A
For more details we refer the reader to Kwapieri and Woyczyiiski (1992).
4.6 Levy Characteristics Let X = {X(t) : t T}, where T = [0, T] with T < oo, be a real stochastic process with independent increments, i.e. such that for each n E IN and any 0 = to < 1 1 < < < T, random variables di = X(t i ) —
i = 1,2, ...,n,
CHAPTER 4
84 are independent. We will always assume that the process X is cadlag. Denote X• = sup IX(t)l•
LET
In this case the set of points of stochastic discontinuity of X is at most countable. Recall that a process X is said to be stochastically continuous at t a T if iiX(i) — X(s)I10 = 0. Let 7rn = {{a} : 0 = to < < t'k' n = T}, n = 1,2, ..., oo, be a normal sequence of partitions of T, i.e. max k It k —t k I -4 0 as n which is also assumed to be nested, i.e. 7r" C rn+i, n = 1,2, ... . For each n = 1,2, ... let us consider the sequence of increments -
=
- x(tz_ i ),
k = 1 , , kn .
Then it is not difficult to verify that for each .s > 0 we have P(X*
>
s)
3sup P(IX(t)I > s/3).
<
tE
T
(4.6.1)
We will write that f a R0 if the function f : IR --*R satisfies the conditions: If(s)1 5 c for all x, f(x)
0 for Ix( 5_ r,
(4.6.2)
for some r, c > 0. Now, for fixed f from R0 , we define bn(t) =
on(i)=
E
k:t1'<e
P.(i)
E adn,
(4.6.3)
kn
Elda2-( Eidn)2,
E
Ef(4).
(4.6.4) (4.6.5)
knGt
Proposition 4.6.1 Assume that {7r"} is a normal nested sequence of partitions of T such that all points of stochastic discontinuity of X are contained in Uncc--) er n . Then (i) for each t a T, limits
b(t)
lim v.—oo
(4.6.6)
0(t)
lim u n (t), .—.0
(4.6.7)
p(t) = lim p n (t),
(4.6.8)
.-.0
exist and the convergence is uniform on T;
A. JANICKI and A. WERON kn SUPn E Ek= 1
85
E If (4 ) 5 1/ c3P_(px;>:>,2)2); 1
(iii) sup n e IN Ek:i I Eida O(tk) b(q_1))1 = 0
.
It follows from the above proposition that the function b is of bounded variation if and only if k
E I Eixt, — xt—,11
sup o
Definition 4.6.1
(i) The function b(t) = lim n
j Gt
is called the first Levy characteristic of the process (ii)
(4.6.9)
< 00.
X.
The second Levy characteristic of the process X is a measure it on (IR \ {0}) x T determined by the following condition: for any t E T and any continuous function f a R 0 one has t
!Rio
(iii)
f(,),(ds,dx)=
71-.00
E f (4). k:tj:
For the process X, for which the first Levy characteristic b is a function of bounded variation, the third Levy characteristic c is a function defined by the formula
c(t) =-- v(t) — I I ([4 2 p(ds , dx). IR\ {(24
(4.6.10)
Let us introduce the following set of functions R --= { f :
IR
IR; f is bounded, continuous, f(0)
there exist real numbers f(0), J(0) 1 lim( f (x ) — i(0)x)I x 2 —0 f ( )}. x—q) 2
Proposition 4.6.2
Let
X
0, such that
and {rn} be as in Proposition 4.6.1. Then for
each f E R
lim
tt—■oo
E k:tr,
E f (4) = 1(0)b(i) + 2 f(0)c(t) f
uniformly in t a T.
R\f0) o
f (x) p(ds, dx),
86
CHAPTER 4
The three Levy characteristics b, p and c fully determine the process X. Moreover, if X is stochastically continuous then Levy characteristics determine its characteristic function via the Levy-Khintchine Formula Eeitu(s) = exp ib(t)0 c(t)0 2 +
2
R ./0 hvo)
(el'9 — 1 — in xi) p(ds , dx)} .
This fact follows from Proposition 4.6.2, applied to the function f (x) = e'er — 1. Moreover, c is of bounded variation on T if and only if for each fixed 0 E IR the function Eetex(t) is of bounded variation on T.
4.7 Stochastic Processes as Integrators Now we discuss the integration with respect to general stochastic independently scattered measures defined by increments of given stochastic processes. So, let us fix T = [0, T] and Er, as the algebra generated by intervals (s, t] nT, where s, t E R. It means that we have the measurable space (E, £), where E = T and E = (10 ). Let {X(t) : t ET} be a process with independent increments and X(0) = 0 and, finally, let A((s , t]) = X(t) — X (s),
define the associated additive stochastic set function on with values in the space L°(C1,,F, P). The goal here is to give necessary and sufficient conditions for A to be extendable to a a--additive stochastic independently scattered measure, and to describe deterministic functions integrable with respect to A. To simplify the notation we will suppress dependence on A in favor of X, unless mentioning the underlying stochastic measure is absolutely necessary. So, we shall write about X-integrable functions instead of A-integrable, Lde i (X) instead of Viet (A) , px instead of pA, etc. Now we introduce on (E, E) the control measure A of A by the formula A(ds) = Idb(s)I dc(s) L vo ix 2 ]] p(ds, dx),
(4.7.1)
where b, p and c are Levy characteristics of X and b is assumed to be of bounded variation. In this way we obtain the measure space (E, 6, A). Applying the Radon-Nikodym Theorem and disintegrating p, we obtain functions b(s), c(s) on E and a measure p such that db(s) = b(s)A(ds), dc(s) = c(s)A(ds), p(ds, dx) = p(s, dx)A(ds).
Furthermore, for s E E and x E IR, let k(s, x) = AR\ {0} 1xur p(s, du) + c(s)x 2 ,
(4.7.2)
87
A. JANICKI and A. WERON
1(s, x) = { AR\{0) (1xu]] - 44) p(s, du) + b(s)x
(4.7.3)
and define W(s, x) = k(s, x) + sup /(s, y). IY151.1
(4.7.4)
Then zG satisfies the assumptions required in the theory of Musielak-Orlicz spaces (we refer the reader to Musielak (1983)), so we can consider the following Musielak-Orlicz space , E , A) = { f : Tx( f) = IE W(s, f (s)Nds) < oo} The functional klix, called modular induces on (E , E, .X) a topology of a complete linear metric space in which step functions are dense. Now we are ready to formulate the theorem which gives a complete characterization of processes X, for which the measure A extends to a a-additive stochastic measure and gives a complete description of deterministic A-integrable functions.
Theorem 4.7.1 Let X be a stochastic process with independent increments. (i)
The additive stochastic set function Agenerated by X extends to a stochastic measure if and only if the Levy characteristic b is a function of bounded variation.
(ii) If Ais a stochastic measure generated by X, then A is a control measure for A, and a function f : E ->1 R is A-integrable if and only if f E LO(E,E, A). If the condition mentioned above is satisfied one can define the stochastic integral of f with respect to X as a process I(t) =
fax, t ET,
with cadlag sample paths. If f is a step function then the definition of this process is obvious. If f E L(X), and { fn } is a sequence of simple functions as in Definition 4.5.1, then the defining condition px(ffl - hi ) -> 0 and the inequality (4.6.1) imply than sup, E T I L'(fT, - fm ) dX1 -> 0, which gives the uniform
convergence of processes /n (t) = fo ft,dX to the desired process I(t). It is also clear that for two different sequences defining the integral process, the limiting processes have a.s. identical sample paths.
Example 4.7.1 Processes with stationary independent increments.
CHAPTER 4
88
The theory of integration simplifies when X has stationary increments i.e. if the distribution law of X(t) — X(s) depends only on t — s. In this case b(t) = bt, c(t) = ct and u(ds,dx) = v(dx)ds, where b, c are fixed constants and v is a fixed positive measure on R such that a = fiRvo ixrv(dx) < oo. So we see than A(ds) = icds, where K = (I b l + a),
v(dx), c(s) = k -1 c, b(s) = tc -1 b,
p(ds) =
k(x) = K -1 1(x) = K
(I
WO}
ixur v(du) cx 2 ) ,
1 0) (EXtlfi — Xitil ) v(du) bx)
1
and
x) = 0(x) = k(x) + sup /(y)• Since -
x[[u]]
x 2 R111 2
< 1 and, for each u
lim iri—oo
— x[[ul = 0, xl[uP
then from the Lebesgue Bounded Convergence Theorem it follows than
fru]] — x [tufi 1 (ftxul — 44) \(du) = lim lim , gur A(du) = 0. x 2 gulfiRy(o) lx1-00 LW)/ Therefore, if process X has a nontrivial Gaussian component or, equivalently, if c 0 then 1b(s,x) = I,b(x) eixi2 for large x, which means that c. Thus in this case the class of A-integrable functions Ldet(x) coincides with L 2 (dt).
Example 4.7.2 a-stable Levy motion. Consider a process X with a-stable independent stationary increments, for 0 < a < 2. For a = 2 (with c 0, v = 0) the process is a Brownian motion and in this case L d ' t (X) L 2 (dt). For 0 < a < 2, we have c = 0 and v(dx) = g(x) dx, where g ( x ) =
for x > 0; for x < 0,
riixt
r21x1
for some r 1 , r 2 > 0. Process X is symmetric if and only if r 1 = r 2 . By elementary calculations we get ixr. 2 r2 k(x) = K a(2 — a) Furthermore, for a 1 and Ix' > 1, 1(x)
=
+ r2 04)
1 —
a
sgn(x)+
tc
89
A. JANICKI and A. WERON and, for a = 1 and
> 1, + r2 /(x) = x
b
log lx1 + - x.
Thus we see than only three essentially different situations arise when one tries to characterize spaces of integrable functions with respect to a-stable processes. < 1 and r i = r2, or 0 < a < 1, 7- 1 r 2 and < 2, or 0 < (A) Let 1 < b = (r i - r 2 )/a. In this case 01x1 for large lx1 and some constant 0, and, as a consequence, L d e'(X) =
La (dt). (13) Let a
1, r 1 r 2 , and b
(ri - r2)/a. In this case 0(x)
01x1
for large Ix' and some constant 0, so that L d e t (X)
L 1 (dt).
(C) Let a = 1, r 1 r 2 . In this case
tb(x)^, for large ix' and some 0', which implies that Ldet
r
A)
if : 17 1 .1- 110g + Idt < co.
If we consider the integration with respect to stochastic measures generated by processes with independent increments, which have the finite p-th moment for a certain p > 0, it is natural to construct the integral with respect to a stochastic measure with values in the Banach space LP (ft, F, P), rather than in
L°(SI, , P). To be more exact, for a given process X with independent increments, we are interested in the case when the associated additive set function A extends to a measure with values in LP(Q,F, P). As before, for L'(!/,,r, P)-valued stochastic measures, the fundamental question will be : what is the class of X-integrable functions? In order to distinguish them from the elements of the class L°(11,..F,P) we call such functions (p,X)-integrable functions. Obvious necessary condition for extendability of A to a stochastic measure with values in LP(CI, F, P) are that A extends to a stochastic measure in L°(CI, F , P), and that EIX(t)IP < co for all t E T. Before stating the main theorem characterizing (p, X)-integr able functions we need some preliminary results.
CHAPTER 4
90
Proposition 4.7.1 If {X(t) : t E T}, where T = [0, T], is a process with independent increments and cadlag paths, then the following three conditions are
equivalent: (i) E1X(T)IP < oo; (ii) E(X . )P < co; dx) < oo.
(iii) AR\ { o } Ar lx1PI{I x i >i }
We shall assume that the process {X(t) : t a T} satisfies any of the above equivalent conditions and that its Levy characteristic b is of bounded variation. Let h p : R IR+ be defined by the formula IxIP,
With the quantities 1, A, p, k, we need now
kp(s, x) =
if Ix' <1, if Ix( > 1.
x 2 ,
hp (x) =
1,1.,
introduced at the beginning of this section
Lo} h
p (ux)
x) = 1(s, x)
p(s, du),
kp (s , x).
(4.7.5) (4.7.6)
The function O p satisfies the conditions assuring that the functional
Tp.x(f) = f (3)) A(ds)
(4.7.7)
is a modular and step functions are dense in the defined above MusielakOrlicz space L'PP(E , £, A). Thus, we have the following characterization of Aintegrable functions.
Theorem 4.7.2 An additive set function A extends to a stochastic measure
with values in LP(D,T, P) if and only if the Levy characteristic b is of finite variation and EIX(T)IP < oo. Furthermore, f : T —+ IR is (p,X)-integrable if and only if ilix(f) < oo.
4.8 Integrals of Deterministic Functions with ID Integrators Let A= {A(A) : A a £} be an infinitely divisible random measure (in shortened notation, ID random measure), i.e. A(A) is an ID random variable from L°(51,/, P) for every A E 5. So its characteristic function can be written in the following Levy form:
re-(A(A))(0) = exp{ik(0)}
(4.8A)
91
A. JANICKI and A. WERON with 1
(eiex - 1 - i0[[x]p p(A,dx)} ,
W(0) = { i0b(A)- 292c(A) - 0 2 c(A)
where -oo < b(A) < oo, 0 < c(A) < oo and p(A,.) is a Levy measure on R. The next proposition (Urbanik and Woyczyriski (1967)) states that there is a one-to-one correspondence between the class of ID random measures and the class of parameters b, c and p. This result provides also a measure A, the control measure of A. Next, it follows that p(.,.) determines a unique measure on E x 8(R) which admits a factorization in terms of a family of Levy measures p(s, •), s e E on R and the measure A. This fact helps to derive another form of the characteristic function of G(A(A)) in terms of the measures p(s,•) and A. This form of the characteristic function allows us to obtain the characteristic function of the stochastic integral fE f dA.
Proposition 4.8.1 (i) Let A be an ID random measure with the characteristic function given by 4.8.1. Then b : E
R is a signed-measure; oo) is a measure;
p(A,•) is a Levy measure on R for every A E E; E 3 A
p(A, B) E [0, co) is a measure for every B E 8(R), whenever 0 (1B.
(ii) Let b, c and p satisfy the condition given in (i). Then there exists a unique (in the sense of finite-dimensional distributions) ID random measure A such that (4.8.1) holds. (iii) Let b, c and p be as in (i) and define A(A) = Ibl(A)+ c(A)min{1, r 2 } p(A, dx), A E E. IR\
{,}
Then A : E
[0, oo) is a measure such that A(A n ) probability for every {A n } C E;
0 implies A(A n )
0 in
if A(A;,) -4 0 in probability for every sequence {A:,} C E such that An C A n E E, then A(A n ) -+ 0.
Remark 4.8.1 Since A(E) < oo, n = 1,2,..., we can extend A to a a-finite measure on (E,E); we call A the control measure of A. Proposition 4.8.2 Let p be as in Proposition 4.8.1. Then there exists a function p : E x 13(R) -> [0, oo] such that (i) p(s, •) is a Levy measure on 8(R) for every s E E, (ii) p(•, B) is a Borel measurable function for every B E 13(R),
CHAPTER 4
92
Lx IR h(s, x) 1.1(ds,dx) =
(f
E
h(s,x)p(s,dx)) A(ds),
IR
for every e x 13(R)-measurable function h : E x R
[0, oo].
Using previous results one can obtain a very useful form of the characteristic function of A(A). Namely, it can be rewritten in the form
K(0, s) A(ds)} , A
G (A(A))(0) = exp ---
E 1,
(4.8.2)
A
where
0 2 cr 2 (s)
K(0, s) = iOa(s)
db a(s) = c-a(s),
(
JIR
eiox — 1 — i0Exp p(s, dx),
0.2(s) dc (s)
and p is given by Proposition 4.8.2. Moreover, we have (72(8)+
JRmin{l, x } p(s, dx) = 1 A — a.e. 2
Recall that, having a control measure A of the random measure A, we can define a A-integrable function f : (E, E) (IR, B(R)) as such, for which there exists a sequence {h} of simple functions such that
1.
f A — a.e.;
2. for any A a E the sequence { fA fn clA} converges in probability as n In this case we define
L
fdA = P — urn n .-.°°
r
oc.
fn dA.
A
The following proposition provides an explicit formula for the characteristic function of fE f dA.
Proposition 4.8.3 If f is A-integrable, then fE IK (0 f(s), ․ )I A(ds) < oo and ( fE f d A) (0) = exp {fE K(0 f (s), s) A(ds)} .
(4.8.3)
We are now ready to formulate the theorem which provides necessary and sufficient conditions for the existence of sfE fdA in terms of the deterministic characteristics of A.
93
A. JANICKI and A. WERON
IR be a 6-measurable function. Then f is A-integrable if and only if the following three conditions hold:
Theorem 4.8.1 Let f : E I- fE ll(s, r (s))1 Yds) < 00;
2. fE If(s)1 2 .9• 2 (8) A (ds) < oo; 3. fE ko (s, As)) A(ds) < oo, where 1(s, x) = fiRvol (Pu➢ - xiu➢ ) p(s, du) + xa(s), ko (s, x) = L \ {0} min{ 1, xu1 2 } p(s, du). Further, if f is A-integrable, then the characteristic function of fE f dA can be written as (fE f dA) (0) = exp iOaf 0 2 a 2 2
f
+ fiRvol (e'ex - 1 - i0ixi) p( f , dx) } '
where at
f
l(s, f (8)) A(ds),
= E l f (s)I 2 (s) A(ds),
and µ(f, B) = p({(s,x) E E x IR : f(s)x E B \ {0}}), B E B(R). As we already know, even in a more general case, one can identify the set of A-integrable functions as a certain Musielak-Orlicz modular space. We shall restrict ourselves here to the representation of ID processes and for such processes we shall determine the modular space and state the continuity of the mapping f fE f dA from this modular space into LP(St, 7, P). Under certain conditions the inverse of this map is also continuous. Let q be a non-negative number such that
EIA(A)I g < oo, for all A a 6.
(4.8.4)
Further, we shall assume that this condition is satisfied and q a [0, oo) is fixed (note that every A satisfies (4.8.4) for q = 0). Since, for ID distribution a with Levy measure G, the integral fiRvo lxig ii(dx) is finite if and only if f{m> , } I x[ G(dx) is finite, thus
fA x[fi>„ a p(s,dx)]
(ds) = J
lxiq p(A,dx) < oo,
for every A E 6, where p(A,.) is the Levy measure of r(A(A)). Hence
IxI° p(s,
< oo
A - -a.e.
94
CHAPTER 4
Without loss of generality we can assume that the last inequality holds for all s E E. Define for 0 < p < q, u E R and s e E,
x) = k p (s, x) + sup /(s, y), N1 ^ 1.1
where
kp (s,x) = I
.
(lux rirbidid>1)(ux) + lux1 214 , 1111
One can verify that the function 1,/),(•,•) has the following properties 1. for every s e E, il, p (s,-) is a continuous non-decreasing function on [, oo) with tkp (s, 0) = 0, 2. A({s :0„(s,u) = 0 for some u = u(s)
= 0,
3. ac>oVu>oV. eE Op(s, 2u) 5 CIP p (s, u). Now we define the Musielak-Orlicz space
L'I'P(E,E, A) = {f E L°(E,e; A) : f
f(s))A(ds) < oo).
The following properties L IPP(E,E, A) (once more we refer the reader to Musielak (1983)) for these and further facts concerning general Musielak-Orlicz spaces generated by functions which satisfy the above conditions) will be used in the sequel. The space L iPP(E,E, A) is a complete linear metric space with the F-norm defined by
= inf {c > 0 : fE iPp (s,c -1 f(s))A(ds) < c} . Simple functions are dense in L ikP(E,E, A) and the natural embedding of L (PP (E,E, A) into L ° (E, E, A) is continuous, where L°(E, E, A) is equipped with the topology of convergence in measure A on every set of finite A-measure. Finally, -÷ 0 if and only if fElkgs, fn (s))A(ds) 0.
Theorem 4.8.2 Let 0 < p < q. Then If : f is A-integrable and ElfE fdAr < c()} = rkP(E ' E ' A) ' and the linear mapping L'I'P(E,E, A) a f
L f dA E LP(11,.r, ,P)
is continuous (here LNE,E, A) = If : f is A-integrable}). Moreover, if
95
A. JANICKI and A. WERON
u) ) — a.e.,
30
0V.>0 1/(s, u)i < C )
then the mapping f space LP (CI, , P). In this case
(4.8.5)
fE f d A is an isomorphism from VI'P(E,E, A) into the
{fE f dA : f E L'bP(E, e, A)} = lin{ A(A) : A E quo2
,
1- , P)
Notice that this construction of the stochastic integral generalizes all constructions presented and mentioned in Section 4.3. Also the space EikP(E,E, A) of A—integrable functions does coincide with appropriate spaces of deterministic functions integrable with respect to an SaS, symmetric S(r, a), or centered S(r, a) random measure A. One can prove that the condition (4.8.5) is satisfied under any of the following two hypotheses on the ID random measure A and the real number p: 1. A is symmetric and 0 < p < q arbitrary, 2. EA(A) = 0 for all A and 1 < p < q. If A is a centered S(a) random measure, where 1 < a < 2, then El A(A)Iq < oo for any q < a, and EA(A) = 0 for every A E E. Hence the characteristic function of A(A) is of the form
(A(A))(0) = exp {-10 2 c(A) -F k
{o} (e
i9 s
—1— iOx) p(A, dx)}
= exp iOb(A) — . 1 .0 2 c(A)— IIR\10) (e' ex — 1 — 44) p(A, dx)} , where b(A) = fiRvol axl — x) p(A, dx), c(A) E 0 and p(A, •) is an S(a) Levy measure. If A is an S(a) random measure and 0 < a < 1, then
.C(A(A))(0) = exp
f
(e i " — 1) p(A, dx)}
exp {01)(A) +
J IR\ {0} (ei°' — 1 — iqx]]) p(A, dx)} ,
where b(A) = fiR\foAxl p(A, dx) and p(A, .) is an S a SLevy measure for every A E E. In view of the theorem we have
a(s) = I
IR\{ 0 }
11x1 p(A, dx) and 1(s, x) = f
give}
lux]] p(s, du) A — a.e.
Finally, if A is a centered S1S random measure, then A is symmetric and the characteristic function of A(A) is given by (4.8.1) with b c 7=- 0 and p(A, -) is a symmetric S1S Levy measure for every A E E. The following proposition states the fact that the conditional Levy measures p(s,-)) of an S(a) random measure A are S(a) measures.
96
CHAPTER 4
Proposition 4.8.4 (i) Let A be an S(a) random measure. Then dx, A - -a.s.,
p(s, dx) = c i (s).11R 4 (x)x -1 ' dx where c 1 , c_ 1 : E -4 [0, oo) are measurable.
(ii) Let A be a S(r, a) random measure. Then for A-almost all s E E p(s, B) =
r" p(s, (r! 13) fl A)) for all B
E B(R),
where A {x E IR : ri < Ix' < 1}. More generally, for A-almost all s e S, the following formulas hold
r f f (ri? x)p(s,dx), a
f (x)p(s, dx) =
fii>rt f (x)p(s, dx) =
E
r -k+1
r-I"
fri
f f (r i x)p(s, dx), a f
x)p(s , dx),
i=0
for every Borel non-negative function f and an arbitrary integer k.
Proposition 4.8.5 Let A be a centered S(a), or more generally, a centered S(r,ot) random measure. Then condition (4.8.5) holds for 0 < p < a and we have L'PP(E,S, A) = L'(E,E, A) up to a renormalization for every 0 < p < a. Consequently, there are positive constants C 1 and C2 depending only on p, r and a such that
cl
dA)'
(E
f dA
5 C2
(f
1
dA)'
for every f E L' (E, E, A).
4.9 Integrals with Stochastic Integrands and ID Integrators Now we are going to define I f YdX, where both the integrand and integrator are suitable stochastic processes. Of course, as we have already mentioned, we must limit the class of integrands and precisely describe the class of integrators. Let {,Ft }, E T be a filtration. We say that the process {X(t) : t E T} has independent increments with respect to the filtration {.fit } if it is it -measurable for every t e T and if, for each 0 < t < s < t o,„ the random variable X(s) - X(t) is independent of Ft . Let P0 be the algebra of subsets of T x SI generated by sets (s, t) x A, where .s, t E T and A E .F3 , and let P denote the o--algebra generated by Po.
97
A. JANICKI and A. WERON
Definition 4.9.1 The process Y is said to be a predictable process, if it is '1)- measurable as a function of (t,w). The process Y is said to be a predictable step process if it is a finite sum of processes of the form .1( ,, t )(t), t a T, where the random variable l is .7,-measurable. For such processes the definition of the integral is obvious. If n
Y(t) then
I
T YdX =
= k=1
k1(30‘,r;c1(i),
E G[X(rk) — X(sk)]• k.1
Notice that not every predictable step process is a 'P o -step function. Nevertheless, each predictable step process on bounded T x Q is a uniform limit of Po -processes. Therefore, for a predictable step process Y we can define
px(Y) = sup
v EPI
f VY dX11 0 , f
where P 1 denotes the class of all predictable step processes V such that IV! < 1. The a-algebra T={AxD:AE A} is contained in 7), so that each deterministic measurable process is predictable. Obviously, if the stochastic additive set function A generated by X on P o extends also to a a-additive stochastic measure on P, then it also extends to a stochastic measure on T, and therefore the Levy characteristic b is a function of bounded variation. It also follows that, conversely, if the Levy characteristic b is of bounded variation, then A extends to a a-additive stochastic measure on P. Before we formulate a formal theorem providing the description of predictable processes which are X-integrable, let us recall that L d e i (dX) denotes the class of deterministic functions which are integrable with respect to the process X. Analogously, by L" a (dX) we will denote the class of processes which are integrable with respect to X
Theorem 4.9.1 Let {X(t) : t E T} be a process with independent increments. Then the associated additive stochastic set function A extends to a aadditive stochastic measure on P if and only if the Levy characteristic b is of bounded variation. In such case the following statements are equivalent I. A predictable process Y is X-integrable, i.e. Y E L" d (dX); 2. For almost every C■J E Q the deterministic function Y(., w) is integrable with respect to X, i.e. Y (• ,w) E Ld e t (dX); 3. For almost every w E SI, Y(., CO) E Vb (Chi). Let us now make some remarks about stochastic integrals with respect to the Brownian motion. We begin with a fundamental result which is obtained by direct computation involving step processes and the standard approximation procedure.
98
CHAPTER 4
Theorem 4.9.2 Let W be a process with {Id
-independent increments which is also a Brownian motion process, and let F be an {Id-predictable process such that E fir F 2 (t)dt < oo. Then
E
E (.1
and
7
7
FdW = 0,
Fdw) = E f
7
F 2 (t) dt.
Let us return now to Example (4.5.3). So, consider (R.F,P) with the filtration F t,1 t E (0,21. Set T = [0, T] x 12 and let Po be the "predictable" algebra generated by sets (s, t] nT x A, where s, t E [0, T] and A a ,F,. If {X(t) : t E [0, T]) is an {,F,}--adapted process, then the formula .
A((s, tj x A) = (X(t) - X(s))/A, defines an additive stochastic set function on P o with values in L°(11,I,P). Further, we shall assume that the filtration is right continuous and that all the sample paths of X are in D(T).
Definition 4.9.2 We shall say that the process X has property (B) if for each E > 0 there exists an s > 0 such that for any sequence 0 = t o < t i < < I„ = T we have
(
k.i
Ea[X(4) - X(tk-IMITt h _,), > 5 e.
Let Ir n = {trk }, where k = 1,2, ..., k„ and n = 1,2, ..., be a sequence of nested, normal partitions of the interval T. To define characteristics of a process X, which we shall call Jacod-Grigelionis characteristics and which are analogous to Levy 's characteristics for processes with independent increments, put
=kqz E (f(drki) k:ez
(4.9.1)
bn(t)
,
,
(4.9.2) (4.9.3)
where we use the abbreviation FL' = Ft z, and where f is, throughout the remainder of this section, a fixed function ffom
= If E 11(x) — POI < Kl[fs —
for some lc > 0},
99
A. JANICKI and A. WERON
with RAJ defined by (4.6.2). As before, = X(tk) — X(tk_ i ), Recall that a sequence of processes {Z,,(t) : t E T} is uniformly convergent in probability if there exists a process Z such that
ihn
— Zr(T)110 = 0,
n—. o0
where (Zn — Z)*(T) = sup I(Z„(t) — Zm(t)l,
eT
which is equivalent to lim fl,t71—.00
II(Zn — Zm)`(T)110 = 0.
Theorem 4.9.3 If process X has property (B) and is quasi-left continuous then, for each t
E
T, limits in probability 6(0 = lira b n (t),
(4.9.4)
ro(t) = lirn ro n (t),
(4.9.5)
p(t) = lim p n (t),
(4.9.6)
n—too
exist and the convergence in probability is uniform on T. Moreover, if f E 74 is such that If (x)I < c for some c > 0 and f(x) = 0 for Ix' < r and some r > 0 then, for each s > 0 and n E IN, p(p:
>
s)
< 2s + s
c P(X .
2'
Remark 4.9.1
1. In the proof of the uniform convergence in probability of the sequence {p n (t)} the fact that process X satisfies assumption (B) is not used.
2. The limit processes
b, tu, and i have a.s. continuous sample paths.
3. Property (B) implies that the limiting process sample paths of bounded variation.
b =
: t E T} has a.a.
Now we can define the Jacod-Grigelionis characteristics of a process X.
Jacod—Grigelionis characteristics. The process b defined by (4.9.4) is called the first Jacod-Grigelionis characteristic of the process X. Hence it is a predictable process with sample paths that are a.s. continuous and of bounded variation. The second Jacod-Grigelionis characteristic is a random measure it defined as follows. For a fixed family of functions f E 74 which separate points,
100
CHAPTER 4
choose subsequences of sequences {b„}, {tp„} and {p n } so that they are convergent a.s. uniformly on T. One can prove, using Theorem 4.9.3 that if function f is as above, then there exists a unique measure p on T x (R \ {0}) such that
lim
E
t
E
(w) =vol fiR f(x)p(ds,dx,co).
k:C,`
Moreover, the process on the right hand side is a.s. predictable, its a.a. sample paths are continuous and, additionally,
fiRvo} fo
[kr p(ds,dx,w) < oo a.e.
The predictability of the process defined by the above double integral justifies labeling the measure p predictable since, for each Borel set A C R \ {0} the process {/.((0, t] x A:tET) is predictable. The third Jacod-Grigelionis characteristic is a process C = {c(t)} defined by equation
c(t) = ►v(t) -
f(x) p(ds,dx), L1{0} fo
which is a predictable process with nondecreasing sample paths. The following result summarizes the properties of the Jacod Grigelionis characteristics. (The class 7Z appearing below was introduced in Section 4.6.)
Theorem 4.9.4 For each f ER. we have lim
n—.00
E E(f(da.77_,)
ictZ
1
f(0)b(t) + 2 - f (0)c(t) +
IRV()) o
f (x)p(ds, dx).
As we observed before, the Levy characteristics determine the distribution of a process with independent increments. This is no longer true for the Jacod-Grigelionis characteristics and general processes. The only exception is the situation when all the characteristics b, p and C are deterministic. Then the process X has {Ft }-independent increments. This fact is known as the Grigelionis Theorem. In general, the best analog of the Levy-Khinchine Formula that can be obtained states that the process described by
Eciexto - exp {-i0b(t) - 0 2 c(t) -fiRvo} (e i9' - 1 - iOx) p(dt, dx)} is a local L 2 -martingale. By the Bichteler-Dellacherie Theorem, a quasi-left continuous process X has property (B) if and only if it is a semimartingale in the classical sense, i.e. it is a sum of two processes with sample paths in D(T): a local L 2 -martingale and a process that has a.a. sample paths of bounded variation.
101
A. JANICKI and A. WERON
4.10 Diffusions Driven by Brownian Motion In this section we will discuss general stochastic differential equations driven by a Brownian motion process. Next, we give an explicit formula for solutions of linear systems and present an Ornstein-Uhlenbeck process as an example of such solution.
General theorem on existence of solutions. Let f = f (x , t) and g = g(x,t) be measurable functions on IRn x [0, 7] with values in and £(11r , IRn), respectively. Let {W(t)} denote the standard m-dimensional Wiener process. We are looking for a stochastic process {X(t) : t E [0, TD which solves a stochastic differential equation of the form dX(t) = f (X (t), t) dt Of course, if g(x , t) differential equation
(g(X (t), t), dW (t)).
0, then this equation becomes a well-known ordinary
d
dt (t) = f(X(t),t). — Uniqueness of the solution is insured by an initial condition. To be more precise, we have to introduce an increasing family {.Ft } of o-algebras, with respect to which the process {W(t)} is an {,F,} martingale and to formulate the problem with the use of stochastic integrals introduced in Section
4.2.
Definition 4.10.1 The process {X(t)} with values in IR' satisfying the conditions • {X(t)} is adapted to -1.7 0; -
• {X(t)} is continuous;
• and solving the equation X(t) =I f(X(s), ․ ) ds-1-
E [0, 7] (4.10.1)
(g(X(s), ․ ),dW(s)), t
for a given .Fo -measurable random variable will be called a solution of the stochastic differenctial equation (4.10.4 We will (as is commonly understood) also write
dX(t) = f (X (t),t) dt
(g(X (1), t), dW (t)), t > 0; X(0) =
(4.10.2)
Let us formulate and prove a theorem on existence and uniqueness of a solution to this problem.
CHAPTER 4
102
Theorem 4.10.1 We suppose that Vx,y E R" Vt
Vt
E[0,71 If (s, t)
001
f (Y
+ lg(s , t) — g(y,
< Lix — yl,
If (x 01 2 + Ig(x , 01 2 r1 2 (1 +
EW 2 < 00.
(4.10.3) (4.10.4)
(4.10.5)
Then there exists a solution {X (t) : t E [0, oo)} of the stochastic differential equation 4-10.1, and such that E
sup
0
IX(t)1 2 5 C (1 + E11 2 )
(4.10.6)
where the constant C depends only on K and T. This solution is uniquely determined. PROOF. Uniqueness. If {X t (t)} and {X2 (t)} are two solutions of (4.10.1) then for all t E [0, T] we have t
X i (t) — X2(t) = f [f (X2(s), s) — f (X 2 (s), s)] ds
(4.10.7)
+ f (g(Xi(s), s) — g(X2(s), s), dW (s)) and thus PC1 (t) — X2(t)I 2 2
ot
[i(X1(s), s) — PX2(s), s)1 ds
12
+ 2 {f (g(X (s), s) — g(X2(s), s), dW (s))} By applying inequality (4.2.16) we obtain
EIX1(t)
—
X2(1)1 2 5 2t f Eif(Xt(s), s) — f (x2(s), 5)1 2 ds +2 f t Elg(Xi(s), s) — g(X2(s), s)I 2 ds.
If we define = EIXt(t) — X2(t)1 2 and make use of (4.10.3), then we have 0(t) 5 2(T + 1) L 2 jf t 0(s) ds and we derive from the Gronwall Inequality that OM 0 and V t E[0,711X1(t) — X2(1)1= 0, a.s.,
(4.10.8)
103
A. JANICKI and A. WERON
which gives X 1 (t) = X2 (t) a.s. for all t E [0, T], thanks to the continuity of the processes in question. Existence. We define the sequence (4.10.9)
X ° (t) -..÷: e,
t t (4.10.10) Xfl(t) = + i f(Xn - 1 (s), s) ds + I (g(X"' (s), s), dW (3)), 0 o which is correct since {g(Xn -1 (t),t)} defines a process from L 2 w (0, T; IRn). The argument from the first part of the proof gives Eixn4-1(t)
t
xn(012 < m
(4.10.11)
0 EIX n (S) — Xn-1(s)12 ds,
where M = 2(T + 1)L 2 . By iterating (4.10.11) we obtain ElxTh+1(t)— xn(t)I2
r
< Mn
(fi
— s)n- i
n 1 J o —
Elx (s) - - 1 1
)!
2
ds.
(4.10.12)
But E1X 1 (s)
—
f 1 2 < MK 2 T(1 + E1e1 2 ),
hence 7 ::' . EIX n+1 (t)— Xn(t)1 2 < C —
(4.10.13)
On the other hand, sup 1Xn÷ 1 (t) — X n (t)I
0
5 io 1.1(xn(s), ․ )— f(Xn T
'
-1 (s),
s)I ds
and thanks to (4.2.23) we get
E sup ixn+ 1 (0— xn(t)1 2 0
T
T
5 2T L 2 E i ix.(3)— x" 1 (8)12 ds + M E I IXn(s) — Xn -1 (s)12 ds o o < M Tn-1 (n — 1)! • Thus, we have cc
EP n.1
{ sup 1Xn+ 1 (t) — Xn(t)1 > 1 i' 0< t
f
cc, Eneici n=1
T n-1 .
(n— 1)!
(4.10.14)
The series on the right hand side of this inequality converges, which means that the series 00
+> (xn+i(t) — xn(i) ) n.0
104
CHAPTER 4
converges a.s. uniformly with respect to t. There exists a continuous process {X(t)} such that
X°(t)
X(t)
uniformly with respect to t.
(4.10.15)
It remains to show that this process solves our problem. From (4.10.10) we have X(0) = Observe that EiX n (t)1 2 E162 + KT I (1+ EiX n -1(s)I2) ds
10 f t + EIX n-1 (s)I2 ) ds} , EiXn(t)I 2 < (1 + Eier) M
tt Elxn-1(s)12 ds,
and by repeating this argument recursively, we get finally
EIxn(t)1 2 5_ (1+ E16 2 ) 1 M+M 2 t+...+ M" -1 n! < M (1 + Eier) • This allows us to pass to the limit with n -> ao in (4.10.10) and gives (4.10.1), and also (4.10.6).
❑
Ornstein—Uhlenbeck process. Let us start with the observation, that the Ornstein-Uhlenbeck process {X(t); t > 0} defined by X(t) = e -At X(0) + j C A( ` - ' ) dB(s),
A > 0,
> 0,
with a fixed X(0) = X0 , and with a given Brownian motion {B(t); t > 0}, is a diffusion process, i.e. that it can be considered as a solution to the equation (4.10.1) with drift and dispersion coefficients defined as f(s, X(s)) = -AX(s) and g(s, X(s)) 1.2 2 . Figures 4.10.1 - 4.10.3 show four approximate trajectories of the Ornstein Uhlenbeck processes {X(t); t E [0, 1]} with X(0) Ar(0, 1), for three different values of A: A = 1, A = 2 and A = 4 with the same value of = 2. In all cases the trajectories are included in the same rectangle (t, X(t)) E [0, 1] x [-2, 2]. As in all figures in this section the trajectories are represented by thin lines. The two pairs of quantile lines defined by p 1 = 0.1 and p 2 = 0.25 show that only for the case A = 2 and p = 2 (Fig. 4.10.2) they are "parallel". This means that the quantile lines are time invariant, demonstrating the stationarity of the corresponding Ornstein-Uhlenbeck process (only in this case we have Var X0 = 1 = Moreover, the field of directions of the ordinary differential equation dx -Ax(t) dt inserted in these figures helps to estimate the proper value of the parameter A assuring stationarity of the process (in Fig. 4.10.1 it is too small, in Fig. 4.10.3 it is too large). This observation helps to estimate this parameter in more complicated situations, e.g., when we work with a-stable Ornstein-Uhlenbeck processes, assuming it and X0 to be fixed.
A. JANICKI and A. WERON
105
= 2.
Figure 4.10.1. Case of A = 1,
\ \ \ \ \ \ \ \ \ \ \ \ \ \ \
4
\ N \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ N. N. \ \ \ \ \ \ \ N. \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ 'i
\ N \ \ \ N i , ... \ \ N N N N N N N \ N. N. N. N. N. N. N. \ N. \ \ N. \ \ , • k \ \'l , , \ \ \ \ \ \ \ 'N. \ \ \ \ \ 7 Ns. '..N. \ N.N. N. -...N.N.N.
N.N. \ N. \ N. N. \ \ N.N.N.N.
\N.
N. N. N. N.. N. N. N. \ N. , '......
\ N.N.N.
N. ,, ..i. N. N. N. N.
tx
......-..
4 V..
,
■
' A V? . 11 oal
i
N.
N. N.
\ \ \
\ \ \ \ \ \ \ \
, , \ , `S. S •-... ,...
■ \
II
N. N. N. '.... \ N. N. N.
..
..... \ \ \ \ \ \
••■ \
\
__ .... __
III
\
\
\
\
\
\
dila/
rir
TAI
'
I I 11 -- --
--
..-
. .-. ...- ..-..,
...- ..-- ..... ....- ....- "-)....- ........., ..., ..... ,....., .....
.....- ....- ... ........, r -
r r r r r
r r r r
....-
.-- ..-- ..--
....
;
'IY
I
....- ..-- ..-- ..
..-.
..., ..-, ..., ....,
.............,
...-• r r r r r r r r r r r r r r r i r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r I r r r // ../ ../ ../ .../ r r r r r "-et ./..for ....' .../ ..." .../ ../ ....
..."' .../ ...- .., .., ..., .../Y e..Gr' ..., ...'
...,
.././././././"."."/"./...•
/
r
r r r r r r r r r r r . r r r r r r r r r r I r r r r r r r r r r
..." ....' ..., ../ .../././
r r I r r r r
./.././/t
7'61
. i f
,
1
../ .." / ...• .../ ../ .,/ ./ ..." ..." ..., ./
I ///././..././
Figure 4.10.2. Case of A = 2, it = 2.
106
CHAPTER 4
\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \
\\\\\\\\\\\\\\\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ [ \\\\\\\\\\\\\\ \\\\ ■\\\\\\\\\ 6,,
,s\\\'\'''. N"\.\\\ . \\\\NN\
11 l......
111t ....\\\\\\\\\
\\\\\\\\\\\\\\\\\\\\\\ \ \ \ \ \ \ \ \ 1 \ \ \ \ \ \ \ \ \ \ \ \ \ \\\1\\\\\\\\\\\\\\\\\\ \ \\\\\\\\\\\\\\\\\\\\ \\\\\\\\\\\\\\\\\\\\ \\\\\\\\\\\\\\\\\\\\ \\\\\\\.\\.\\\NN\\\NN \\\\\,..\\N\ \\N\N\N\ \ \\\\\\\\\\\\N".\\\ ,..
-
A4
...,......,..... ............■,.■■
////
....,......„„
//iii//// //
//////// / ////// ( / /////////////////•//////// / / /////////////////// //////// / /// /////////////////////////////// /// /////////////////////////////// ///////
/-1V /
•••••••••••••••••••••••••••••••••••••••
//////l/////////////////////////1/•••••
////////611/...4e//////_6/e///////i1A7W////// /////////".".,,,,0-1/.//Z/PY,, ,, /ll/l/yr//•••• /1////••••,/////////1/////////“////////
Figure 4.10.3. Case of = 4, it = 2.
Systems of linear stochastic equations. A very important subclass of R d -valued diffusion processes {X(t) : t E [0, T]} driven by an IRP-valued Brownian motion process {B(t) : t > 0} is defined by a system of d scalar linear stochastic equations of the form dX(t) = (f(t) g(t)X(t)) dt h(t) dB(t),
(4.10.16)
with X(0) = X 0 , where f, g, h are given vector-, or matrix-valued functions with values in IR d , R d x IR d and IR d x RP, respectively. Let us mention a few of features of linear stochastic differential equations that make them so important. • The class of stationary Gaussian processes can be derived as a family of solutions of appropriately defined linear stochastic equations. • Assuming some regularity of coefficient functions (to simplify the exposition let us assume them to be continuous on [0, T] ), solutions of such equations can be expressed in the following explicit form involving stochastic integrals
X(t) = G(t) (X(0) + I G -1 (s)f(s) ds
G-1(s)h(s) dB(s)) ,
for t E [0, T], where G = G(t) is an IR d x IR d -valued function and is defined as a fundamental matrix of the linear deterministic system dt
G(t) = g(t)G(t),
for t E [0, T],
A. JANICKI and A. WERON
107
i.e., its solution with the following initial condition G(0) = I. • It is possible to get additional information on a solution. For example, using the ItO Formula one can derive deterministic differential equations describing the evolution in time of first and second moments of diffusions in question. • It is quite easy to extend some methods and facts concerning the equation (4.10.16) to linear stochastic equations with respect to other classes of stochastic measures. • A large variety of physical problems can be modeled by means of such systems of stochastic equations.
4.11 Diffusions Driven by a—Stable Levy Motion We have already defined an a-stable stochastic measure on Rand an a-stable stochastic integral
I(f) = f f(u) dL„,(u)• A
Thus, we are in a position to describe diffusions driven by a-stable Levy motion in terms of such integrals. We are looking for a real-valued stochastic process {X(t) : t E [0, T]} such that dX(t) = a(t, X(t)) dt c(t) dL c,(t), X(0) = X0 , (4.11.1) with t E [0, T] and X0 - a given stable random variable. Strictly speaking, it means that the following "integral" equation should be satisfied
X(t) = X0 +
J
t
a(s, X(s—)) ds
c(s) dL,(s).
(4.11.2)
The more general problem, involving stochastic integrands and integrators, can be writen in the following setting
X(t) = Xo f / a(s, X (s —)) ds
Jo
c(s, X (s—)) dL a,(s).
(4.11.3)
Notice that more general than equations (4.11.2) and (4.11.3) are the so called stochastic differential equations with jumps, involving stochastic integrals with respect to Poisson random measures of suitable point processes with given deterministic intensity measures (see Ikeda and Watanabe (1981)). In turn,
108
CHAPTER 4
all these stochastic equations are special cases of general stochastic differential equations driven by semimartingales, i.e. equations of the form
X(t) = X0 + I t f (X (s—)) dY (s),
(4.11.4)
where {Y(t)} stands for a given semimartingale process. There is a vast literature concerning this topic (see for example Protter (1990) and the bibliography therein). To see that the differential equation (4.11.3) driven by a-stable Levy motion is a special case of the equation (4.11.4) with a semimartingale as an integrator it is enough to notice that a-stable Levy motion can serve as an example of a semimartingale.
Remark 4.11.1 The Levy motion can serve as an example of a semimartingale. Regarding processes having independent increments without a Brownian component, i.e., processes with the Laplace exponent of the form E[e x t)] = e - 'c ( z )t , we have -
(
tc(z) = bz + (1 — zxI{ x ,i r i
where v is the Uvy measure satisfying the inequality f 4R (x 2 A 1) v(dx) < +oo, b being the (non-canonical) drift. In the case of a-stable process {X(t)} with 1 < a < 2 we have v(dx) = c a x - ° 'dx/I'(1 — a) and thus k(z) = c foc° (1 — zx — e - ") x - °` dx, where e is a positive constant and the drift is defined by b r"-°` dx. Moreover, f (Ix' A 1) v(dx) is infinite, so the process {X(t) : t > 0} is a totally discontinuous martingale with infinite variance (for detailed information we refer the reader to Jacod (1979), Protter (1990) or Kwapieri and Woyczyriski (1992)). This fact allows us to obtain theorems on existence of solutions of stochastic differential equations (4.11.2) or (4.11.3), driven by stable measures. It is enough to employ corresponding theorems concerning semimartingales. Often we will be interested in a linear version of this equation, i.e. we will discuss the a-stable diffusions described by the equation
X(t) = X0 + (a(s) + b(s)X(s)) ds + c(s) dL a (s). (4.11.5) t
Equation (4.11.5) is of independent interest because, as is easily seen, the general solution belongs to the class of a-stable processes. It may be expressed in the following form
X(t) = 4)(t, 0)X0 + f cl)(t, ․ ) a(s) ds + where (1)(t, s) = exp
b(u) du}.
(1)(t, s) c(s) dL a (s),
109
A. JANICKI and A. WERON
a—stable Ornstein—Uhlenbeck process. Let us consider a simplified version of Equation (4.11.5), namely a linear stochastic equation of the form (4.11.6) dVa(t) = —A Va (t) dt + d L a (t), Va(0) = Vo . Analogously to the Gaussian case, the solution of Equation (4.11.6) can be given in the following explicit form
Va (1) = e -at 17,,(0) + I t e -A( ' - ' ) dL a (s). o Remark 4.11.2 In the case of a = 2, a solution to (4.11.6) is represented by an Ornstein-Uhlenbeck process with Gaussian distribution. From the point of view of stochastic modeling such a system response is Gaussian and a fluctuation-dissipation relation can be satisfied (see Gardner (1985)). If {L a (t) : t > 01 is a non-Gaussian stable process (a e (1,2)) then the response of the system is of the a-stable form. In this case the system response has infinite variance, which corresponds to the situation when the particle with the velocity Va (t) and subject to linear damping A has infinite kinetic energy. Thus, the fluctuations supply an infinite amount of energy, which can not be balanced by the linear dissipation. This means that the fluctuation must be regarded as external and no fluctuation-dissipation relation can be imposed on the system. (See West and Seshardi (1982) for more details.)
Moreover, in the case of Equation (4.11.6) it is possible to describe the characteristic function of the response of the system 0 = 0 (t , 0) as a solution of the following simple partial differential equation of evolution
ao
a
+ A 0 Y ° = —6°' ma 0-
From these solutions one can derive an explicit formula for the probability density in the Gaussian (a = 2) and Cauchy (a = 1) cases.
Chapter 5 Spectral Representations of Stationary Processes 5.1 Introduction In this chapter we discuss some classes of stochastic processes which can be represented by stochastic integrals of deterministic functions with respect to astable or infinitely divisible stochastic measures. The results presented here are extensively applied in Chapter 10 to the study of ergodic properties of a-stable and infinitely divisible processes.
Definition 5.1.1 We say that a process X has the representation Y if X -!=1 Y, i.e. if the processes X and Y have the same finite-dimensional distributions. When discussing spectral integral representations of stochastic processes we will rely mainly on the results of Hardin (1982) and Rajput and Rositiski (1989). In general the problem is to find for a given stochastic process X = {X(t) : t E T} a measurable space (E, £), a random measure A and measurable functions ft such that {X(t) : t E T} '=-1 If ft dA :JET} .
(5.1.1)
Definition 5.1.2 The map t -- Jr, defined by (5.1.1) is called a spectral representation of the process X. There are two main reasons that make such representations useful in answering various questions about the process X. (a) Many problems of interest about X can be reformulated in terms of nonrandom functions ft and the measure A (or in terms of certain parameters characterizing A, e.g. its Levy characteristics). (b) These reformulated questions can be effectively answered by making use of the rich structure of the metric linear space of functions generated by {f t }
111
112
CHAPTER 5
and the fact that A possesses properties very similar to X, but admits much simpler probabilistic structure. Many authors constructed spectral representations for special subclasses of infinitely divisible processes (see Urbanik (1968), Maruyama (1970), Schilder (1970), Kuelbs (1973), Hardin (1982), Rosiriski (1986), Rajput and RamaMurthy (1987)). Finally, Rajput and Rosiriski (1989) established that for any given infinitely divisible process X there exist a family of non-random functions fi and an infinitely divisible random measure A such that (5.1.1) holds and the following conditions are satisfied: (i) the measure A retains properties similar to X, for example, if X belongs to a known class of processes, such as s-stable or self-decomposable processes, then A belongs to the corresponding class of random measures; (ii) the functions ft belong to a linear topological space, which has a similar structure as the linear space of the process X. In addition to the above representations, which are valid only in law, they also obtained spectral representations which are valid almost surely. Of particular interest is a vast class of stationary processes (e.g. moving averages, harrnonizable processes, etc.), so important from the point of view of ergodic theory. Thus, at the end of this section let us recall this basic definition.
Definition 5.1.3 An arbitrary stochastic process {X(t) : t ET} is called stationary if and only if the joint distribution functions
Ft ,
t „(x i
,
x„) = P{X(t i ) <
•••, X(tn) 5 xn}
(5.1.2)
have the property
= for all n = 1,... and all 1 1 ,...,t„ such that t i < < t„ and all t„ t,+ h ET with any 11 > 0. In other words, the joint distribution function of X(1 1 ),..., X(t,,) depends only on the differences 1 2 -11,6 - t2, to in-1.
5.2 Gaussian Stationary Processes In this section we briefly discuss Gaussian stationary Markov processes.
Definition 5.2.1 Let A > 0 and let {B(t) : t E R} be a Brownian motion process defining corresponding stochastic Gaussian measure on R. The process X(t) = -
oo
e -\( ` - ' ) dB(s),
t E R,
is called a Gaussian Ornstein-Uhlenbeck process.
(5.2.1)
113
A. JANICKI and A. WERON
According to Definition 5.1.3, stationarity of a stochastic process implies stationarity in the wide sense for an L 2 -process, i.e., the process with finite second moments, since
E[X(5)X(t)] = f f xy dFs,t(x,Y)= f f xY dF34 h,t+h(x, Y) -
=
E[X(s + 10X( 1 + -
01,
and, similarly,
E[X(t)] = E[X(t + h)]. The converse is not true in general; however, it holds for stationary Gaussian processes. This follows directly from the formula for the probability density of an n-tuple of jointly Gaussian and linearly independent variables, or from the form of the joint characteristic function, which for jointly Gaussian variables X = [X(t i ), X(t 2 ),...,X(t n )] is given by
(Do)) = Efe,pc,o) ,j e_xp{i(0,mx) -
( 9 , 1( x( 0 )))•
This formula depends only on the mean vector mx and the covariance matrix Moreover, if they are translation-invariant then the probability density and the characteristic function are translation-invariant.
Kx.
Example 5.2.1 A thermal-noise voltage. As discussed in Gardner(1986), a thermal-noise voltage is appropriately modeled as a stationary Gaussian process assuming that the environment of noisy resistance is time-invariant. Furthermore, it is shown there that the covariance function is given by CO
Kx(r) = No f h(t + r)h(t) dt, where h(t) is the impulse response of the voltmeter used to measure the noise voltage waveform and No = 2KTR, where K is the Boltzmann constant, T is the temperature (in degrees Kelvin) of the resistor, B is the bandwidth (in Hertz) of the voltmeter, and R is the resistance (in ohms). This result is based on the physical assumption that the response time of the voltmeter is much larger than the mean relaxation time of free electrons within the resistance. If
h(t) = { oe
-at
if t > 0, otherwise,
then {X(t) : t > 0} is the Ornstein-Uhlenbeck process (cf., also ItO (1944b)). Now let us prove the Doob Theorem characterizing stationary Markov Gaussian processes.
114
CHAPTER 5
Theorem 5.2.1 If {X(t) : t
a R} is a real-valued stationary Gaussian process with mean 0 and variance 1, then it is a Markov process if and only if its covariance function has the form
r(t) = K x (t) = exp(-Altp, A > 0.
(5.2.2)
PROOF. Necessity. For the process {X(t)} with joint densities W we have W(Xi ,11; X2,12; X3, 13)W(X2 7 12) = W(21,
X2, /2)W(X2, 12; s37 1 3),
(5.2.3)
and these four densities can be easily computed. First, 1 2 e12/2. TTr
W(x2, t2) =
Next, since X(t) has mean 0 and variance 1, the two-dimensional density takes the form det A -(eilli-1-2anxix2-f-a224)/2 W(Xi , t1; X2, 1 2) = 22r e where I -1 1 7'112 A = [r(11 - = [ ri 2 which means that ( 1 2ri2xix2 + 4 ) 1 exp 1221 ✓1 - r? 2 2
W(x i ,t i ; xa, t2) = and W(x 2 , t 2 ; x 3 , t 3 ) =
( 1 1 exp 2 22r.V1 - r23
- 2r 23 x 2 x 3 +
1 - r 23
It is also clear that W(xi,ti;
x2,12; x3,13) =
1
V(2203
exp( - 2- (x, Bx))
with the matrix B of the form 1
B =
r12 r13 1 r 23 r13 r 23 1 r12
and
1 21 3 + 2r 12 r 13 r23 . Substituting all these densities into (5.2.3) with det B =
1 -r23
xi =
-
x2 = X3 = 0
115
A. JANICKI and A. WERON
we get (1 - r,2 2 (1 - 7.2 3 ) = 1 - 7-2 3 - r1 2 -r13
2r12r13r23,
Or
(r 13 - r i2 r 23 ) 2 = 0, or else r12r23 = 0. This, by setting s t 2 - t i and t = t 3 - t 2 , becomes r(s)r(t)
r(s
t).
This functional equation has only one continuous solution of the form (5.2.2). Sufficiency. In order to complete the proof it is enough to check that the family of Gaussian densities with mean 0 and the covariance matrix ( rii ) = satisfies the conditions W(X1, t1; •••;
to -I-1)
P(Xn-I-1, tn-I-11x7L)
tn) • ' • P(x2, t2IXI, tl)W(Xi, tl)
and P (x ;IA , t i+i lx i , t i )P(x i ,
4_1) dxi = P(xi + i, t i-f-i I x1-1, ti-1),
which is not a complicated task (see e.g. Iranpour and Chacon (1987), p. 176). This ends the proof.
❑
Remark 5.2.1 By replacing the process {B(t)} in (5.2.1) by an a-stable
Levy motion {L„(t) : t a R} we obtain the definition of an a-stable OrnsteinUhlenbeck process. The Doob Theorem cannot be extended to the case when a a (0, 2). The example below shows that in this case there are two such processes: the Ornstein-Uhlenbeck and the reverse Ornstein-Uhlenbeck processes which are
stationary and Markovian.
Example 5.2.2 Two SaS Ornstein-Uhlenbeck processes. Let A > 0 and M be a SaS random measure, 0 < a < 2, with Lebesgue control measure. The process X(t)
=
f
M(dx), -oo < t < oo
is called an SaS Ornstein-Uhlenbeck process. {X(t)} is a moving average process with f (x) = exp(-)1s)/[0 , 00 )(x), see Example ??, and hence it is stationary. To
CHAPTER 5
116
To see this observe that for any 1 1 , ...t n h E P and real a l , ..., a n we have ,
II
j= 1
ajX(tj
Ea
h)licc: =
a ;
f(t; + h - x)
dx
j.i
CO
E aif (t
;
- y)
dy
j=1
T1
= II Eai x (ti) E . j=1
So the finite dimensional distributions of the process are shift invariant. Note also that for any fixed s < t,
X(1) - e -A( ` - ' ) X (s) =
M(dx)
is an SaS random variable independent of o(X(u) : u < s). This implies that the SaS Ornstein-Uhlenbeck process is also a Markov process. The Doob Theorem shows that in the Gaussian case (a = 2) the Ornstein-Uhlenbeck process is the only stationary Markov Gaussian process. However, in the case of 0 < a < 2, there is another stationary Markov SaS process. It can be given by the following formula
X(t) =
CA(x—t)
M(dx),
—CD < t < CO.
It is called the reverse SaS Ornstein-Uhlenbeck process. Using the same argument as above, we conclude that it is also a Markov process. The Doob Theorem shows that for a = 2 the Ornstein-Uhlenbeck process and the reverse Ornstein-Uhlenbeck process are identical, which can also be verified by computing the covariances. It turns out that, in contrast to the Gaussian case, these two processes are different when 0 < a < 2. To see this, let X 1 and X2 be the Ornstein-Uhlenbeck and the reverse Ornstein-Uhlenbeck processes, respectively. Fix s < t and evaluate the spectral measure F 1 of the SaS random vector (X l (s), X i (t)) and the spectral measure F2 of the SaS random vector (X 2 (s), X2 (t)) and observe that they are different (cf., Samorodnitsky and Taqqu (1993), Chapter 3). The uniqueness of the spectral measure implies that (X i (s),X i (t)) (X2 (s),X 2 (t)). Therefore, the Ornstein-Uhlenbeck and the reverse Ornstein-Uhlenbeck processes are different for 0 < a < 2.
5.3 Representation of a—Stable Stochastic Processes We are concerned here with the spectral representations of SaS processes X = {X(t) : t ET} in the form of a-stable stochastic integrals.
117
A. JANICKI and A. WERON
Definition 5.3.1 A stochastic process X is called symmetric a-stable or Levy SaS or, shortly, SaS process for a E (0, 2], if for every n E IN and any a 1 ,...,a, a IR, t 1 , a IR, the random variable Y aiX(t,) has a symmetric stable distribution with index a. Let X be an SaS process, a a (0, 2]. For an SaS random variable Y, set = cVa- Then defines a norm in the case 1 < a < 2 and a quasi-norm in the case 0 < a < 1 on the space lin{X(t) : t E R}, metrizing the convergence in probability. Then, for Y a lin{X(t) : t E IR} we have = exP(-
ior
Taking the closure of the linear span lin{X(t) : t E E} with respect to the norm (quasi-norm) II • IL, in the space L o (X) C L°(S1,T,P) we obtain the space L c,(X).
Definition 5.3.2 We say that the process X is separable in probability if there exists a countable set To c T such that the set of random variables {X(t) : t E To} is a dense subset of {X(t) : t a T} with respect to the topology of convergence in probability. It is not difficult to show that X is separable if and only if L o (X) is separable. Here we will consider only stochastic processes that are separable in probability.
Theorem 5.3.1 Let X = {X(t) : t ET} be an SaS process and let {M(s) : s E [0, 1]} be an a-stable Uvy process. Then there exists a set of functions : t E T} C La[0, 1] such that the process
ff
ol
ft (s) dM(s)} t (5.3.1) ET
is stochastically equivalent to X. PROOF. It is shown in Schilder (1970) that each finite dimensional subspace of L « (X) imbeds linearly and isometrically into La[0, 1]. This implies that there exists a measure space (E, e, m) and a linear isometric imbedding of L « (X) into L"(E,E,rri)), (see Bretagnolle, Dacunha-Castelle and Krivine (1966)). The space L « (X) is separable since X is separable and therefore we may choose (E, , rn) to be [0,1] with the Lebesgue measure. It follows from the fact that under separability condition of Definition 5.3.2, the space La (E , m) is isometric to either La[0, 1], (L a [0,1] ED in„ or (L"[0, 1] e ),„ (cf., Lacey (1974), p. 128). Consequently, we may represent the characteristic function of the process X as
E exP E aiX(t;)) = exP (- II E d
,
(5.3.2)
118
CHAPTER 5
where {ft : t E T} C La[0,1]. Conversely, the Kolmogorov Theorem implies that for any choice of functions {f t } in La [0, 1], formula (5.3.1) defines an ft is SaS process which is a representation of {X(t) : t E T}, so the map t ❑ its spectral representation. The spectral representations were the subject of many works. If we do not require the separability condition then we lose the stochastic integral representation and the luxury of working exclusively in La [0,1], but there still exist a measure space (S, Bs, u) and a spectral representation t ft a L'(S,13s, ti) satisfying (5.3.2). The concept of a minimal spectral representation introduced by Hardin (1982) (see also Rosinski (1993)) leads to the uniqueness of the spectral representation.
Definition 5.3.3 Let Fx denote the closed linear span of {ft : t E T} in L'[0,1] and let p(F) denote the "ratio" a-field of Fx defined by the formula I denote the Lebesgue measure of the p(Fx) = cr{f/ g : f,g E Fx } . We let Al Borel set A C [0,1], considered with the induced afield. A spectral representation t -+ f t is called a minimal spectral representation if the following conditions are satisfied: WO there is no set B of positive measure such that ft = 0 a.e. on B for all t; (M2) to every Borel set B which is almost disjoint from the atoms of p(Fx), there corresponds a set B' a p(Fx) such that IB A /3'1 = 0; (M3) whenever B is an atom of p(Fx), then f t is a.e. constant on B for all t.
Theorem 5.3.2 (i) Every SaS process has a minimal spectral representation.
L and t -> g t are minimal spectral representations for a given (ii) If t non-Gaussian SaS process then there exists an isometric automorphism A of L'[0,1[ such that Aft = g t for all t E T. PROOF. (1) Let {g t : t E T} be the spectral representation of the process in question. Let Gx = lin{gt : t E T} and let g be a normalized function which has full support in G x ( see H ar di n (1981)). Define a new measure space (E0, eo, by setting Eo = supp(g), Eo = {A n E0 : IA E p(Gx)} and dp(s) = Ig(s)IP ds. i) has at most countably many atoms, say Ai, A2, (Eo , Set A = We define a measure algebra isomorphism T of (E0 , 4, ti) into ([0, 1], B([0, 1]), A). Start by setting xo = 0, x. = ELI 11 (Ak), and define T(A n ) = We can extend T to cr(A i , A 2 , ...) in an obvious way. Consider a measure space (E' II') where E' = E\A,e -= {B\A : B E E} and A' denotes p restricted to E\A. It is a non-atomic separable measure space with total mass 1 - E n> µ(A n ) 1 — a, and hence (by Halmos (1950)) there exists a measure algebra isomorphism T of (E', , it') into ([a, 1], B([a,1]), A), which we use to define T for sets in E‘. For general sets B EE we set TB = T(B nA)uT(B\A). It is easy to see that T thus defined is a measure algebra isomorphism of (E 0 , eo p) 1, B a B Qa, nil, A). onto ([0,1],a{lx,,I,x„),B : n ....
,
119
A. JANICKI and A. WERON
Now define ft = T(gt /g), where T denotes the canonical map on measurable functions induced by our isomorphism (Doob (1953)). It appears that : t ET} is a minimal representation. It is a spectral representation since T is measure-preserving. For g E Gx we have 1E E 1in{g t /g} L . (E04,0 , and thus /pm = TIE0 E Fx which shows that (M 1 ) is satisfied. Condition (M 2 ) is satisfied since p(Fx) = (7 (Fx) = T(E) = xn), B : n 1,B E B([a, 1 ]))• Finally, (M3) holds since if B is an atom of p(Fx), then f = f / I( 01 ] must be a.e. constant when restricted to B. (2) With the previous notations let us consider the map f t -+ g i . This map induces an isometry U of Fx onto Gx which admits a unique isometric extension U to the subspace {g E La([0, 1]) : g = rf, f E Fx, r is p(Fx) measurable} . Further U must have the form U(rf) = (Tr)(U f), where T is a regular set isomorphism of p(Fx) onto p(Gx) (see Hardin (1981)). Now, let h have full support in Fx. To extend U to the desired isometric automorphism we need only to extend T to the regular set isomorphism T of B([0,1]) onto itself such that R defined by Rf =T(f/h)Uh is isometric. One can do this as follows. Let A1, A2, ... be all atoms of p(Gx). Since T is a regular set isomorphism, setting B, = TA ; gives a listing of the atoms of p(Gx). Then (Halmos (1950)) there exists a measure algebra isomorphism between (A„B(Ai), and (B„B(B,), *,1)• Let A o = [0,1]\ At, B o = [0,1]\ 1 B,. Note that T(A0) = Bo and that, by (M3 ), T maps A o onto Bo . Now define T by T(B) = T(B fl A 0 ) U [U, > , T,(B fl AO]. It is easy to see that T is a regular set isomorphism of B([0,1D onto itself which extends T. Now one has only to show that R is isometric. It follows from (M 2 ) that it is enough to show that for arbitrary Borel set B in A o the equality DR/silo = ii/Bila holds. Let i > 0. By (M3 ), h must be a.e. equal to some constant c, on A i , Uh must be a.e. equal to some constant di on Bi and the relationship between c, and d, is expressed by cP(Ai) = = 'AMU OH: dP(Bi).
For B c A i , i > 1, it is easy to check that R
a
1
IIT(/B/h)- Uhl': = - • T IB • Uh A(Ai) 1 A(B;) d,
ITB ' d ,.
= a
A(Ai) A(Bi)
a
A(TB) = A(B) = HMI: •
This ends the proof.
❑
Example 5.3.1 The SaS Lévy motion. It is easy to check that each SaS Levy motion has the minimal representation t /A t ]. For this, let X(t) = l c° I( 0•i )(x) dM(x) =
dM(x), t 0,
CHAPTER 5
120
where M is SaS on [0, oo), with control measure dm(x) = dx. Then X(0) = 0 a.s. and
X(t) — X(s) = I dM(x) = M([s,t1) S c,(It — then
If 0 < t i < t 2 < <
(X (t2)
-
, 0,0).
x(t i ), x(t 3 ) — X (t 2 ), ..., X (tn) — X (t,1)) =
t3 dM(x), f dM(x),...,
dM(x))
Utit, The components of this random vector are independent because the integrands have disjoint supports. Hence, {X(t) : t > 0} is a process which starts at 0, has stationary independent increments, and is SaS-distributed. Therefore, it is the SaS Levy motion.
Example 5.3.2 Mean zero Gaussian processes. Each mean zero Gaussian process {X(t) : t E T} on the probability space P) can be represented by
(t) = jX(t, co) dG(w), where G is the canonical independently scattered Gaussian random measure on the underlying probability space. Since the characteristic functions of {X(t) : t a T} and {X(t) t T} coincide, these processes are stochastically equivalent. To see this observe that Eexp {i
aj(t;)}
exp {-- Var 2
exp
1
[E apo.ol
}
E ajakCov(X(tj),X(tk))} • j,k
If the process {X(t) : t T} satisfies the separability condition then the underlying probability space can be chosen separable, cf., Breiman (1968) for such a construction. This space must be also nonatomic since Gaussian variables take on no constant value with positive probability. By the isomorphism theorem, one may find {ft : t a T} C L 2 10,11 stochastically equivalent to {X(t) : t E T}. The calculation above shows that the spectral representation of the original Gaussian process {X(t) : t E T} has the form t ft a L 2 [0,1]. Thus, the representation of {X(t) : t a T} by the mapping t X(t) is not very useful.
Example 5.3.3 Sub-stable processes.
121
A. JANICKI and A. WERON
An SaS process X = {X(t) : t ET) will be called sub-stable if there exist a' > a and a Sa'S process Y = {Y(t) : t € T}, called a governing process, such that - log
Eexp( i E
a,X(t,) = -log
i
E exp i Ea,Y(t,) )1 1
a /a'
,
for all a, and t i . If a' = 2 then X is called sub-Gaussian. Sub-stable processes exist in great profusion. Let {Y(t) : t E T} be any Sa'S process, where 0 < a < a', and let A be a positive p-stable random variable independent of the process Y and having the Laplace transform E exp(-uA) =exp(-1u1P), where p = afa'. Set t ET.
=
X(t)
Then the process X is a sub-stable process with the governing process Y. Inbd real, 0 real, deed, for any d > 1, t i ,...,td E T, a
EexP {i 0 Ex(t.i)} j=1
= EE
d
[exp {it921 1 /'' E
bi y(t i )} IA]
i=1
= Eexp { - AP
E biY(ti)11.1 i= 1
= exp {-10ril
E bj y(tAr,,} i=1
To find its spectral representation, let (ft, T, P) denote the probability space on which Y is defined, let M be an SaS random measure on (lt,1) with control measure P, and let c,„,,„, be a constant depending only on a and a' such that if A is an a' random variable with characteristic function Eexp(iOA) = exp(-klOr), then ( ElAr) 1 /' = - log
Hence
E exp (iEopc(w)
H
lo g Eexp
k ala'
= El
[C (
OjY(ti))1 ala'
El E
EceY(tmr.
The calculation above shows that Eexp
Eo.,x(t ))
exp (-11
Ee.,(cy(wir)
122
CHAPTER 5
which establishes the following spectral representation
J
{X(t) :t ET} = {c Y (I, co)dM(w) : t ET} . Here, similarly as in Example 5.3.2, one can use the separability condition and, by the Isomorphism Theorem, find {f t , t E T} C LQ[0,1] stochastically equivalent to Y. However, this spectral representation is not minimal! Although p(F) is nonatomic, it is properly contained in o(F), and we are not able to map p(F) isomorphically onto the Borelian a-field on [0,1] without altering the distribution of { ft , t . If a = 2 then the sub-Gaussian process X(t) = A 1 / 2 G(t), t E T, where G(t) is a Gaussian process and A is a SIS random variable independent from the process G(t), has the following representation:
{X(t): t E T} =
G(t,w)dM(w) : t
ET}
,
where d ( EIN(0, 1)11 1 /a. Now we are interested in the problem of uniqueness of the spectral representation under an additional measurability condition. The following theorem constitutes one of the main results in Rosinski (1993).
Theorem 5.3.3 Let T be a separable metric space. Let (fP ) }, E r contained
in La(Si , B s, p,) (i = 1,2) be two representations of the same ScrS real (complex) process {X(t )} E T. Assume that the mapping (t, s) J1` ) (s) is Borel measurable, i = 1,2. Then, for every a-finite Borel measure A on T, there exist Borel functions : S2 Si and h : S2 -> IR (C) such that ft(2) (s) = h(s).ft(1) (0( 8 )) A /1 2 a.e. (5.3.3) Hardin (1981) introduced functions with full support to establish equimeasurability of certain mappings. Since we will use a similar method in the proof, we recall the definition and some basic facts on functions with full support. Let F be a collection of real (or complex) functions on some measure space (S, p). We say that a function g has full support in F if g E F and pe(s : f(s) 0 and g(s) = 0)) = 0 for each f E F. From Lemmas 3.2 and 3.4 of Hardin (1981) one can derive the following
Lemma 5.3.1 Let F be a closed subspace of LP(p), 0 < p < oo. (i) If F is separable or if p is a-finite then there exists a function of full support in F. (ii) Let U : F LP(u) be a linear isometry. If 0 < p < 2 and g has full support in F then Ug has full support in U(F).
123
A. JANICKI and A. WERON
PROOF of Theorem 5.3.3. Let F, be the closure in La (Si , Ci s it i ) of linffP ) : t E i = 1,2. Since the families UP ) } t E T (i = 1,2) represent the same SaS process, the mapping UfP = f1 2) , t E T, extends to a linear isometry of F1 onto F2. By Lemma 5.3.1 there exists a function ,g1 E F1 with full support in F1 and 9 2 = Ug 1 has full support in F2. Let ,,
)
i = 1,2.
0},
= Is E S, : g,(s)
Without loss of generality, we may assume that A is a finite measure. Define Borel maps e : L°(T, ST, A) and o : S2 —> L'(i, ST, A) by [( 3 )]( 1 ) =
8 E
(s)
and
(2)
f (a)
[9(s)](t) =
tE
T,
if s E S2: otherwise,
.g2(3) ' 0,
where t E T. We will prove that t -1 1/1 0 C
I/2 0
n -1
(5.3.4)
where v(ds) = Ig,(s)la p,(ds). Since v2(S2 — S?) = 0, it is enough to show that for every n > 1, t 1 , E T, B E 1/1({3 E SI) :
=
(
ft(i1) (s)/gi(s),...,e(s)/gi(s))
V2(1 3 E S2 (L(12) ( 8 )/92( 3 )1
..
E B))
• ftnS)/g2(S)) E B}).
(5.3.5)
We have, for every n > 1, a l , ... a n E IR (C), n
4.1
1. +Ea; .7=1
a f)8) p (
g (s )
Vi(C1.5) =
Igi(s)
Ea f41)(s)r p i (ds) ;
2 =1
n
ct,f41))1Ica'
= 11U(g1 j=1 =
Ig2(8)
E 3
=1
a3i42) (s)r it2(ds)
i+ y- a,.d(s) ' , 92(5) td
a
v2(ds).
Thus, (5.3.5) follows from the Rudin Theorem (see, e.g., Hardin (1981)) which proves (5.3.4). Applying Theorem 2.2 from Rosiriski (1993) for A = cr(0 we infer that there exists a Borel function 4) : S2 ST such that for v 2 -almost all s E S2, 9(S) e(4,(s)) in LQ(T, Brff , A).
124
CHAPTER 5
By the Fubini Theorem we get j.;(2) (s) 92(s)
e ms))
A 0 v 2 - a.e.
(5.3.6)
91(0(s)) Put h(s) g2 (s)/g i (ek(s)) if s E sT, and h(s) = 0 otherwise. Since )1 2 is equivalent to v 2 on 4 , (5.3.6) implies (5.3.3) on T x 4. Since ft(2) (s) = 0 A 0 p 2 -a.e. on T x (S2 - S2), (5.3.3) holds true on T x (S2 - SD. This completes the proof of Theorem 5.3.3. ❑ Condition (5.3.3) implies that there exists a set T o C T with it(T -T o ) = 0 such that for every t e TO f
t(2) (s) = h(s).11 1) (Os))
p 2 - a.e.
(5.3.7)
A natural question is whether one can remove the auxiliary measure A from the statement of Theorem 5.3.3 to have (5.3.7) valid for every t ET. The answer is no. Indeed, let S i = [0, 1], z 1 = Leb, f t(1) (s) I[0,1h(t)(8), t E T = [0, 1];
S2 = {0}, it 2 = 8o, and f( 2) (0) = 1. Then (5.3.7) fails for t = 0(0) and
any choice of 0. However, under some separability conditions on the spectral representation, formula (5.3.7) is proven for every t ET in Rosinski (1993) as Theorem 4.1. Theorem 5.3.3 can be used to distinguish various classes of stable processes or to identify processes within the same class. Its usefulness for this purpose will be demonstrated in the following examples taken from Rosinski (1993).
Example 5.3.4 Disjointness of moving averages and harmonizable processes. Suppose that there is an SaS process which possesses both harmonizable and moving average representations, i.e., f e's Z(ds) and-oo f f(t - s) dM(s), where the SaS measure Z(.) is necessarily complex-valued. (A complex random variable is SaS if its real and imaginary parts are jointly SaS). Using Theorem 5.3.3 for fp) (s ) = e t' , ft(2) , .s ,) = f(t - s), with t,s E R and f E V(R), we get f (t — s) = h(s)e" ( s ) A ® A - a.e.,
where A denotes the Lebesgue measure on R. Integrating the a-th power of the magnitude of both sides of this equation with respect to t over R, we get the left-hand side finite and the right-hand side infinite, unless h(s) = 0. Therefore, the process in question must be a zero process.
Example 5.3.5 Kanter Theorem and its generalizations. Suppose that an SaS process possesses two moving average representations, e(s) = f(t s) and ft(2) (s) = g(t s), f,g E La(IR). In view of Theorem 5.3.3,
g(t s) = h(s)f(t O(s))
A 0 A - a.e.
125
A. JANICKI and A. WERON
Fix s = s o for which the above equation holds for A-almost all t, and put u = t s o . Then g(u) h(s o )f (u +
uo) for A — almost all u,
where u o = 0.(s o ) — s o . Therefore
AR Ig(u)r
I f (u - u0)1' IR
du = Ih(so)ia
= Ih(so)I a f
IR
I g (u)r
du,
which yields Ih(s o )I = 1. This proves the Kanter Theorem (e.g., Kanter (1975)) in both real and complex cases. Notice that the above argument works for arbitrary metrizable separable locally compact Abelian groups (instead of IR) with Haar measure A. The non-Abelian case is also simple. Using the same argument and multiplicative notation, we get g(u) = h(s o )f
(un o ) for A — almost all u,
where A denotes the left invariant Haar measure on the group, say, G. We have Lig(u)rA(du)
ih(so)i a If(uuo)l a A(du) c
if (Or
= Ih(s0)110(u 0 1 )r
A(du)
✓
= Ih( 5 0)11 0 (Unr 1 I I g(u)r A(du), where A is the modular function on G determined by A (x)A(Bx) A(B) for every B E BG. Hence, h(s o ) = e[0(u0 1 )] 1 /' with lel = 1. Consequently, g(u) = e[A(11 0-1 )] 11 ' f (uu o ) for A — almost all u.
This generalization of the Kanter Theorem was obtained earlier (without the assumption on metrizability or separability of G) by Hardin and Pitt (1983) by more complicated methods.
Example 5.3.6 Generalized moving averages. Let v be a a-finite measure on X. Given f Lebesgue measure on IR d , put
E L a (X x R d , v ® A),
where A is
X(t) = fA,xFtd f(x,t — s) M (dx , ds),
where M is an SaS random measure with the control measure v 0 A. Such process {X(t) : t EIR d } is called a generalized moving average (see Surgailis et al. (1992)). Suppose that we are given two representations of generalized moving average processes, e(x, ․ ) = f (x,t — s) and f,(21 (y, s) = g(y,t — s), where f E La (X x R d , v ®A) and g c La(y x Rd, p A), and X and y are Borel
CHAPTER 5
126
subsets of certain separable complete metric spaces. Define two measurable maps 4" : X —) La(R) and q : y —0 La(R) by (x) — f (x,
•)
Ilf(x,.)11.
and q(x) — g(Y '' ) v(dx) t )ltI: fvfo)) where IIkIIa = {fRd Ik(u)1* du}'/«, k E L a (R d ). Let vf(dx) =lifn(x,;1a and p9 (dy) = Ilg(y, •)t p(dy). Surgailis et al. (1992) have stil:0w and {e} represent the same process if and only if v f p9 o
(5.3.8)
on shift invariant symmetric Borel subsets of La(R d ). Using Theorem 5.3.3, we can get more explicit relationship between f and g. Namely, if { fP ) } and {fP ) } represent the same process, then by Theorem 5.3.3 there exist 0 : y x Rd —k X x R d y,.․ ) = (0 i (y, s), 0 2 (y, s)), and R (C, in the complex case) such that h : y x ,
g(y,t — s) = h(y, ․ )f(0 1 (y, ․ ),t — 02 (y, ․ )) for A p A-almost all t, y, s. Choose so such that for p A-almost all (y, t) g(y, t — so ) = h(y, so)i(01(Y, so), t
—
02(y, so))•
Define a(y) = 02(Y, so) — so, b(y) = 01(Y, se), and c(y) = h(Y,so)• Then g(y,u) = c(y)f(b(y),u a(y)) p A — a.e. Integrating with respect to u, we obtain c(y) Ie(y)I = 1. Therefore,
e(y)IIg(y, •)11 0 1If (b(y), •)IIV with
f (b(y), u — a(y)) g(y, u) — E(Y) 119(Y, ')II« Ilf(b(Y),')110,
p
A
a.e.
(5.3.9)
Using (5.3.8), we get v f o C I o o b) -1 (5.3.10) on shift invariant symmetric Borel subsets of L a (R d ). Conversely, if there exist measurable functions a : y Rd, b : y X, and e : y R (C) with Ie(y)I = 1 such that (5.3.9) and (5.3.10) hold then {e} and UP ) ) represent the same process.
Example 5.3.7 Series and integral representations of stable processes.
127
A. JANICKI and A. WERON
Let T = {1,2}. It is well-known (see, e.g., Linde (1987)) that there are
SaS processes (i.e., 2-dimensional SaS random variables) which do not admit
the following series representation: {X1 } i=1 , 2
{ ,=1
(5 .3. 1 1)
i=1,2
where 03 are i.i.d. standard SaS random variables and a„ E R. It can be interesting to examine this fact in the light of Theorem 5.3.3. Suppose that we are given a stochastic process =
J
1
f i (s) dM (s), i = 1,2,
(5.3.12)
where M is a real independently scattered SaS random measure with the control Lebesgue measure ,a. If the process (5.3.12) admits a representation (5.3.11) then by Theorem 5.3.3 (for A = b t + 82 ) there exist 0 : [0,1] - IN and h : [0, 1] -+ R (C) such that f,(s) = h(s)a,,,s( , ) ,
i = 1,2
for each s E [0, 1] - A o , where ,a(A0 = 0. Let A, = {s Therefore, for every j > 1 and s E A, n A,c„, 12(s) = h(s)a2,
E [0, 1] : 0(5)
= j}, j
1.
fi (s) a ,
provided a l , 0. Thus II and 12 restricted to A, n Af, are linearly dependent for each j > 1. We obtain the following conclusion. Proposition 5.3.1 A process X defined by (5.8.12) admits a series representation (5.3.11) if and only if there exists a partition frib> o of [0,1] such that fi and f2 are linearly dependent on each 7r,,, j > 1, and it(r o ) = 0. Any process defined by (5.3.12), and such that functions I I , 12 are linearly independent and analytic in some open subinterval of (0,1) does not admit series representation (5.3.11).
5.4 Structure of Stationary Stable Processes Now we present a theorem characterizing minimal representations due to Hardin (1982). Theorem 5.4.1 A non-Gaussian SaS process satisfying the separability condition is stationary if and only if it has a minimal representation of the form t -> ft = Pick, where ik is a fixed function in La[0,1] and {Pt : t E T} is a group of isometries on L' [0, 1].
CHAPTER 5
128
PROOF. Assume that the process is stationary and that t --0 ft is its minimal representation. Stationarity implies that for any fixed s E T the map t f3 .ft is another minimal representation for X, and also that the closed linear extension of the map U, : ft f,+t is an isometry of F onto F. By Hardin (1981), Theorem 4.2, each U. has a unique isometric extension U, to the space
F= {g E Lct[0, 1] :g = rf, f a F, and r is p(F)-measurable}, and
U,(g) = (T,r)(U, f), where T, is a regular set isomorphism of p(F) onto itself. It is easily seen that { Ut } has the group property on F, hence {it } has the group extension on I' From this one can conclude that {Tt } is a group of regular set isomorphism on p(F), i.e., T,T,A = Ts+t A for each A E p(F) since Ot h has full support in F. To extend the group {üt } on Fto a group of isometries Pt on all of L'[0, 1], we will extend {TO to a group of regular set isomorphism {rt } on the Borel a-field on [0, 1] and define Pt f = f / h)U t h. If we define {Pt } as above, then it clearly extends {f/t }. To see that {Pt } is isometric it suffices to show that II Pt IA 11=11lA II for an arbitrary Bore! set A contained in some atom A;, i > 0 of p(F). The identity can be checked by using the second and third condition in the definition of the minimal representation. It is also clear that {Pt } is a group. The required representation is then t 13,0, where cb = 10 . The "if" part of the theorem is obvious. ❑
Example 5.4.1 Doubly stationary processes. Let (S, 5, u) be an arbitrary (finite or infinite) measure space and let {Ft : t E be a collection of measurable functions on S. Now T is some group, usually understood to be Z or IR. Call {ft } stationary if the in-distribution of the vector (ft i +8, -•-,.ft„-f-3) is independent of s E G for each fixed choice of n and 1, E G. An SaS process will be called doubly stationary if it has the same distribution as some process
{X(t) =
r
fi (u)dZ(u) t a GI
where {ft } C L'(S, 5, p) is stationary and Z is the canonical independently scattered random measure on (S, L3, p). So they are, loosely speaking, those SaS processes whose spectral representations are themselves stationary, see Cambanis, Hardin and Weron (1987). It is obvious by checking characteristic functions that doubly stationary SaS processes are also stationary. Example (iv) below shows the converse does not hold. For stationary {ft } we may find, just as in the case of stationary processes, a group of measure-preserving transformations Ut of S = cr{ft } such that ft = Ut fo. (We also denote by IA the induced map on measurable functions.) Conversely, any group of measure-preserving set transformations defines
129
A. JANICKI and A. WERON
stationary functions {Ut fo } for arbitrary measurable fo . Thus an SaS process is doubly stationary if and only if it has a spectral representation as in Theorem 5.4.1, where the group {Pi } is induced by such group {U t }. This equivalent definition will be more useful for us, if not as picturesque. Now, we will illustrate this class of stationary processes with four special examples. (i) Every mean-zero stationary Gaussian process is doubly stationary. To see this, let {X(t)} be a mean-zero Gaussian process on (f2, P) and let Z be the canonical independently scattered Gaussian measure on (S,8,11) = (12,.F,P). Then {Y(t) = fo X (t, w)dZ (w)) is seen (by checking characteristic functions as in Example 5.3.2) to have the same distribution as {X(t)}. Hence it is doubly stationary. (ii) Every stationary sub-Gaussian process is doubly stationary. Let {X(t)} be a-sub-Gaussian on P), represented as X(t) =11 1 / 2 G(t), as in Example 5.3.3. As was seen there, {X(t)} is distributed as {Y(t) = cG(t,w)dZ(w)}, where Z is the canonical independently scattered SaS random measure on (12,,F, P) and c is a constant depending on a. The process {G(t)} is stationary since {X(t)} is. Thus {X(t)} is doubly stationary.
(iii) All SaS generalized moving averages are doubly stationary. In order to show that the SaS generalized moving averages defined in Example 5.3.6 are also doubly stationary, it is enough to check that their spectral kernel f (-,t - -) is stationary with respect to the control measure v ® A, i.e., the measure (v ® A) o (f (•, t 1 + r - •),..., + r - •)) -1 on 112n is independent of T. Indeed, for all B E 8(112n) using the fact that A is the Lebesgue measure we have (v0 A){(x, ․ ): (f(x,t i T
-
s),...,f(x,t, + r - s)) E B}
=
Afs : (f(x,t i + r - s),..,, f(x,t,„ + r - s)) E B}v(dx)
=
A{u : (f(x, - u),..., f(x,t,„ - u))
= (v
A){(x, s) : (f (x, t i - s),
E
Blv(dx)
f(x,t i, - s)) E B}.
Let us also observe that in the Gaussian case (a = 2) the generalized moving averages coincide with the usual moving averages since EX(t)X(e) = f f f
f(x, t - s)f(x,t' - s)ds} v(dx)
1
exp i(t - t',u)IF(x,u)i 2 du} v(dx )
27
1
2T IR =
IR
exp i(t - t', u)f.(u)du
g(t - s)g(t' - s)ds,
130
CHAPTER 5
where F(x, u) is the L2 -Fourier transform of f (x, -), a function f,(u) defined by 1,(u) = fx IF(x,u)I 2 v(dx) belongs to Ll (dA) since we have fi R f.(u)du = VFir fx if (x,t)1 2 dtv(dx) < oo, and where g E L 2 (dA) is the L 2 -Fourier transform of (f.) 112 E L 2 (dA); so that {X(t) : t E R} =
{I
g(t - s)t;(ds) : t a R} ,
where stands for a Gaussian white noise. In the non-Gaussian stable case (0 < a < 2) the generalized moving averages form a larger class than the usual moving averages since, as it was shown in Surgailis at a/. (1992) sums of independent SaS usual moving averages are distinct from the usual moving averages. (iv) There exists a stationary SaS process which is not doubly stationary. For simplicity we take a = 1, although this example may be altered easily to work for each a E (0,2). Define Pt : V[0,1) -0 L 1 [0,1] for real t by (Ftf)(x) = 2 t x 3*-1 f (x 2 `).
It is easily checked that {P1 } is a strongly continuous group of linear isometries, so that 1 {X1 =
Pt ilo mdZ : t E IR)
is a stationary a-stable process continuous in probability. Here, Z is the Cauchy motion on [0,1] (the canonical S1S independent increments process on [0,1]). We claim that {X(t)} is not doubly stationary. Thus, if {X(t)} were doubly stationary, we could find a measure space (S, E, 1.1), a group of measure-preserving set maps U 1 : E ---0 E and a function g(t) E La(p) such that t -0 Ut g is a spectral representation for {X(t)}. Since t Pt 11[0 , 1 ] is also a spectral representation for {X(t)}, so we have
E
Pi, foilVp,11=
E a,ut ig il L a (m)
for all choices of a, and t,. Hence the map Pi /lo m --0 Ut g extends to a linear isometry of /in{PeAo,11}La[ 03 1 onto lin{Ut g} L a w . This isometry in fact extends to all of L a [0,1] by Hardin (1981), Corollary 4.3, since P0 /1 0 , 1 1 = /pm and Pi Ao,ii(x) = 2x are both in sp{Pt lio , 1 ]). Call this extension V. Again by Hardin (1981), Corollary 4.3, V has the form (V f)(x) = h(x)(W f)(x),
where .1,b is induced by a regular set isomorphism of the Sorel a-field of (0,1] with Lebesgue measure to (E, /4). Since VPdio , i i = Ut g, we have Ut g = V Pt 1[0 , 1 1= V(2 t id2t-1 ) =- 14)(2' - 1) = 2 1 11[0(id)r t-1 ,
where id(x) = x. Since 0 < id < 1 a.e., thus 0 < /kid) < 1 p-a.e. If 0 < x < 1 then 2tx 2 ` - ' -k 0 as t oo. But Ut g must be equidistributed for all t (since Ut
A. JANICKI and A. WERON
131
is measure-preserving), and 2th[0(id)] 2 ` -1 is not by the above, since by choosing t large enough we may, for any c > 0, force 1.1{1290(id)) 2 ` -1 1 < e) as close to tt(S) as desired if 1.1(S) < co. Thus the process (X(t)) has no doubly stationary representation on a space of finite measure. However, it has a moving average (and hence doubly stationary) representation on R. Namely, let (E 1 , el , A i ) and (E2 , £2 , A2) denote Lebesgue measure on [0,1] and R, respectively, with the corresponding Borel o-fields. Define (Ei,ei, AI) by Ai) : 4,tix
=
t EIR,x E [0, 1].
((4)1)-1)t EIR is a group of regular set isomorphisms which inThen (01), E D? duces the group (LP) of isometries as described in Lamperti (1958). Similarly, define V, : (E2, £2, ,N 2 ) (E2 , e2, A 2 ) by = x
t,
t E IR, X E IR;
((4);) 1), EIR is a group of regular set isomorphisms which prethen (01), EIR serve Lebesgue measure. Define' : R -4 [0,1] by -
1Yx = 2 -2 ',
t E IR, x € IR,
and define the regular set isomorphism 1/, = 1Y -1 . One can check directly that
t E IR,
Vl/ = T , and that therefore 0 1 , 02 and 1/) satisfy
(5.4.1)
0.75 1 = 0216.
Now define the positive isometrics induced by the set isomorphisms by
U,f = (0;) 11 " • (0,f),
i = 1,2,
W f = (Or a (O• (Note that (U1 , 1) represents the SotS process defined in this example.) Then for all IA in LP(Pi),
wUJA = [01(0 ' ) • Cb id lia • 401A U2W/A =
[0(4) • 0 11a • /0
9
0A
It now follows from Equation (5.4.1) and an application of the chain rule that
W U1 = U2W. Thus (U2 , W1) represents the same of shift operators, i.e.
SaS process as (U1 ,1). But U2 is the group
Iff(x) = f(x t),
t E R, f E L1(112),
132
CHAPTER 5
so the process given in the example is a moving average. The above discussion shows that the question of whether there exists a stationary SaS process which do not admit doubly stationary representation has a measure theoretical character. Gross and Weron (1993) constructed an example of such process (actually a class of examples for every a E (0,2) ) by using an example of Ornstein (1960) of a nonsingular transformation on [0, 1] which does not admit a a-finite invariant measure equivalent to Lebesque measure. This example is constructed in the following four steps. 1. Establish a relation between the a-field p(L i ) and the Radon-Nidodym derivatives of a regular set isomorphism. 2. Describe a nonsingular point transformation r on [0,1] with Lebesgue measure m, due to Ornstein (1960), which does not admit a a-finite, invariant, equivalent measure; then, using Step 1, show that this particular example can be taken so that p(L i ) = B[om• 3. Use a result of Hardin (1981) to show that, if the process is represented by another isometry induced by a measure-preserving transformation T on some measure space (E, E, A), then there is a regular set isomorphism E such that Or -1 = Ti. Bl ot ] 4. Conclude that the SaS sequence represented by the isometry ti n induced by r and the function f = 1,
U g=h•(g o r) where h is any function satisfying Ihr stationary.
= d(rn oT -1 )1dm, cannot be doubly
Example 5.4.2 Automorphisrns defining stationary processes. With a given (S, B.s, 1 1 ), let
5,
S
t E IR
(5.4.2)
be a collection of Borel maps such that the following conditions hold Uo = / p - a.e.
11„ o
= U„ + ,
p - a.e.,
p o
p,
for every u, v E IR
for every t E R.
Let E t : S --* {
-
1,1}
({izi = 1}, resp.),
be a collection of Borel maps such that 60
1
p - a.e.,
t E IR,
(5.4.3)
133
A. JANICKI and A. WERON E u -f u = E u E t, o Uu — a.e., for every u, v E IR.
Let fo E La(S, B s ,
(5.4.4)
It is easy to verify that ft(s) = Et(s){
4 dc (s)}11'
(5.4.5)
fo(Ut(s))
is a representation of a stationary ScrS process {X(t)}, E R. Representation (5.4.5), in conjunction with the uniqueness results, indicates how rich the class of stationary ScvS processes actually is. Each group of automorhisms { U t } which preserve sets of measure 0 and a family of multipliers {E t } produce a (virtually different) class of stationary process. The classes of moving average and harmonizable processes correspond to the cases Ut (s) = t s, e t 1, and Ut et(s) = e' 3 , respectively; thus these two classes cover very little of the spectrum of possible stationary stable processes. The class of doubly stationary processes corresponds to the case when the automorphism {U t } is a measure—preserving transformation and then formula (5.4.5) takes the form ft (s) = e t (s)fo (Ut (s)). Ilence, it is clear why moving average and harmonizable processes are doubly stationary. Now we prove a theorem which shows that each stationary SaS process has such representation as described in Example 5.4.2.
Theorem 5.4.2 An SoS stochastic process {X (t)}, €
IR is
stationary if and
only if it admits spectral representation (5.4.5). PROOF. In view of Theorem 5.4.1 (Hardin (1982)) it is enough to prove that every group of linear isometrics (Pt)t E IR on La (S, Bs, it) has the form
Ptf(s) = Et(s) {
d(µ o 11= t1 )
(s)
1 11 '
PUt(s))•
(5.4.6)
Since Pi is an isometry, the collections of functions {Pd. } f E and {f} f EL a can be viewed as representations of the same SoS process indexed by La = La(S, Bs, it). Let u, v E IR be fixed. From Theorem 4.1 of Rosinski (1993) it follows that there exist functions U„, U,,, : S S, and h,,„ h,,, h u+ ,, : S —> IR (C) such that for every f E La
P„ f = h„ f (1.1„), modulo
f =
f (L4), and
P,, + „, f = 11„ + „, f (U„ + „),
(5.4.7)
For every f E La, we have (modulo it)
h,, + „ f (U„ + „) = P„ + „ f = P„(P„f) 13„[14,f(U„)] = kh„(U,,)f (U„(U„)). Let f 1B, where B E Bs, A(B) < oo. From the above equalities we get
h t, + „/B(Uu+ „) = 10„(U„)/B(1.1„(U.„))
— a.e.
(5.4.8)
134
CHAPTER 5
Notice that h u+t, 0, p - a.e. Indeed, if pets : 12.-4-.(s) = 0}) > 0, then for o} with 0 < p(A) < 00, ti Pu +,,(L a ) by (5.4.7). every A C {s : h u+ „(s) is onto. Therefore, (5.4.8) implies This contradicts that
(0,71 .(B) -
-
(B)) = 0.
(U. o
Since
- (Uu o U„) -I (B i n K„
{s : Uu+ ,(s) (Uu o Uv )(s)} = U U [(k+v(Bi n
ni
)]
,
where {A} is a sequence of balls in S with centers in a countable dense set and with positive rational radii, and { K n } is a sequence of sets of finite p-measure such that S = U n Kn , we infer that
p - a.e.
Uu o 11„
Uu+t,
(5.4.9)
Since Po is the identity map, an argument similar to the above gives Uo (s) = s and h o (s) = 1, p - a.e. Using (5.4.8) with B = Ka , and (5.4.9), and letting n co, we get (5.4.10) p - a.e. h u+,, = huhv(Uu) Now, for every B
E Bs
with p(B) < co we have
p(U:,1(B)
=
I
IB (U_ t )dp
= j ib ( U_ t )11: = liPt /B(U_OC, iiht/B(U-t o Ut)11`,," =
ihe JB
This completes the proof of (5.4.3) and establishes the relation
d(p Put
o
U: t1 ) dp
ihtr,
h t (s) et(s Iht(s)i •
Then (5.4.10) yields (5.4.4) and ends the proof of (5.4.6).
❑
5.5 Self—similar a—Stable Processes Self-similar (ss) processes are processes that are invariant under suitable translations of time and scale. It is well known that the Brownian motion is ss and the Gaussian Ornstein-Uhlenbeck process is its corresponding stationary process. The first paper giving a rigorous treatment of general ss processes is Lamperti (1962), where a fundamental relationship between stationary and ss processes was proved. Self-similar processes are also related to limit theorems, random walks in random scenery, statistical physics, and fractals. Interested reader is referred to a bibliographical guide by Taqqu (1986) and to a survey by Maejima (1989).
135
A. JANICKI and A. WERON
Definition 5.5.1 Let T be (-oo,00), [0, oo) or [0,1]. A real-, or complexvalued stochastic process X = {X(t)}„T is said to be H-self-similar (H-ss) if all finite-dimensional distributions of {X(ct)} and {cH X(t)} are the same for every c > 0, and to have stationary increments (si ) if the finite-dimensional distributions of (X(t 6) - X(b)) do not depend on b E T.
According to Lamperti (1962), there is the following relationship between stationary and ss-processes.
Proposition 5.5.1 If {Y(t)} is a continuous in probability stationary process and if for some H > 0 X(t) = t H Y(log t), for t > 0, X(0) = 0, then X(t) is H-ss. Conversely, every nontrivial ss-process with X(0) = 0 is obtained in this way from some stationary process {Y(t)}.
One instance of this relationship has been used by Doob (1953) to deduce properties of the stationary Ornstein-Uhlenbeck velocity process from those of the Brownian motion. The attractive feature of the above proposition is that this relationship preserves the Markov property but not stationarity. Thus from the viewpoint of stationary SaS processes it is interesting to know examples of SaS 33-processes other than the Brownian motion.
Examples. (1) H > max(1, 1/a). Such H-ss si SaS processes do not exist. This is a consequence of the following two properties of ss si non-degenerate processes: (i) if 0 < 7
< 1 and EIX(1)r < oo, then
H<
lfy (see Maejima ( 1986 ));
(ii) if EIX(t)I < oo, then H < 1. If we apply these to a-stable processes X, for which EIX(1)1" < oo for all 7 < a, we see that H < max(1,1/ a). (2) H = 1/a.
(2.1) a = 2. The Brownian motion: {B(1)}t>o. (2.2) 0 < a < 2. The a-stable Levy motion: {Z,r (t)} t > 0 . Here, by astable Levy motion we mean the 1/a-ss si a-stable process with independent increments. (2.3) 1 < a < 2. The log-fractional stable process (see Kasahara, Maejima and Vervaat (1988)):
X1 (t)
=J
^
log
t
-
s
dZor (s).
(2.4) 1 < a < 2. The sub-Gaussian process (see Kasahara, Maejima and Vervaat (1983)): X2 (t) = Z 1 / 2 /3“,,(t), where Z is a positive strictly a/2-stable random variable and BH is an H-ss si 2-stable (Gaussian) process independent of Z. In fact, BH is the fractional Brownian motion defined below.
136
CHAPTER 5
(2.5) 1 < a < 2. The (complex-valued) harmonizable fractional stable process (see Cambanis and Maejima (1989)):
/ X3(t) =
0, 11 All 2 / dM,,(A),
e itA oo
2.`
where Ma is a complex SaS motion. (2.6) a = 1. A linear function with random slope: X4 (t) = tX(1).
(3) 0 < H < 1, 0 < a < 2, H 1/a. (3.1) a = 2. The fractional Brownian motion (see Mandelbrot and Van Ness (1968)): BH(t
)
= +
C[1. W — s)H-1/2 — (_s)11-1/2}dB(s)
o
(t — s) 11-1 / 2 dB(s)1,
where B is the standard Brownian motion and C is a normalizing constant assuring EIBH(t)1 2 = 1. (3.2) 0 < a < 2. The linear fractional stable process (see e.g., Maejima (1983)): [a
X5(1) =
+ b{(t —
{
(t — s) 1,1-1 /' — (—s) 1,1-1 /'} —(
S) H-1/ 11 dZ,(s),
where a, b e IR with ab 0, x + = max(x, 0), x_ = max(—x, 0) and Z, is an a-stable motion. (3.3) 0 < a < 2. The (complex-valued) harmonizable fractional stable process (see Cambanis and Maejima (1989)): Xs(t) —
61" —
is
1 ( aA + b.11-H-1/a) -H-1/a)dif/c,(A),
where a, b E IR and if4a is the same as in (2.5).
(4) 0 < H < 1/a, 0 < < 2. (4.1) Substable processes (see Hardin (1982)):
X 7 (t) = Z 1 h3 Y(t), where (Y(t)) is an H-ss si symmetric 0-stable process (0 < < 2) and Z is a positive strictly a//3-stable random variable (so 0 < a < 0), independent of (Y(t)). As special cases we have
X8 (t) = Z 1 / 2 BH(t) and X9 (t) = Z 1 °4(0, where
BH is the fractional Brownian motion and Zo is the 0-stable motion.
137
A. JANICKI and A. WERON
(4.2) Recently, Takenaka (1992) has constructed a class of H-ss si a-stable processes, X 10 , say, for any 0 < H < 1/a, 0 < a < 2, by means of integral geometry. His process can also be constructed by using the stable integral in the following way. = { bounded Borel sets in R 2+ } and let Let R 2+ = {(x,y) : x > 0,y E IR}, {M(A) : A E .71 denote a family of SaS random measures such that
(i) E[exp{i0M(A)}] = expl-nr(A)101"1, where m(dxdy) = (ii) M(A,),j
x H- 2 dx ay,
1,- • • , n, are mutually independent if A3 n A k
(/),
k, and
(iii) M(U ; A ; ) =- E j M(A 2 ) a.s. for any disjoint family {A ; , j = 1, 2, • • -}. Let further c(t; x, y) be the indicator function of {(x, y) IYI < ly - t < x}, where A means the symmetric difference of two sets. Then X10(t) =
c(t; x, y) dM(x, y)
A {(x, y)
(5.5.1)
is an H-ss si SaS process. This class seems new, or at least different from the other examples above. This fact has been proved by Sato (1989), who determined the supports of their Levy measures.
Sample path properties. If an H-ss si SaS process {X(t)}, E irsatisfies 1/a < H < 1, then it has a sample continuous version, which can be shown by Kolmogorov's moment criterion. The sample path properties examined in the literatures can be listed as follows: Property I : There exists a sample continuous version. Property II : Property I does not hold, but there is a version whose sample paths are right-continuous and have left limits. Property III: Any version of the process is nowhere bounded, i.e., unbounded on every finite interval. The examples in the previous section are classified as follows: Property I : B, X 2 , X3, X4, BM, X5 for 1/a < H < 1, X6, X8. Property II : Z,„ Xg, Xio. Property III : Xi , X5 for 0 < H < 1/a. Proofs are needed to justify the classifications of X i , X 3 , X 5 for 0 < H < 1/a, X6 and X 10 . They can be based on Theorem 5.5.1 below, due to Nolan (1989). Let an SaS process X = {X(t)}, E q^be given by X(t)= j f (t, u) dW„,(u), where T is a finite interval, (U,11, rn) is some a-finite measure space, f : Tx U --■ IR is a function with the property that for each t E T, f (t, -) e La (U, , m), and IV, is an SaS random measure with control measure m such that
E[exp{iOWm (A)}] = exP{ -rn(A)101'}, A E
138
CHAPTER 5
We assume X is continuous in probability and take a separable version of X. A kernel fo (t, u) is a modification of f (t, u) if for all t E T, fo (t, •) = f (t, •) m - a.e. on U. Then X 0 = (X0 (t) = fu Mt, u) dWm (u)) is a version of X. When 1 < < 2, define /3 by 1/a + 1/# = 1. For c > 0 and d a metric or pseudo-metric on T, let
Ho(d; 6 ) =
(log N(d; 0) 10 , log + log N(d;c),
2 < < oo;
Q = co
,
where N (d; e) N (T , d; e) is the minimum number of d-balls of radius c with centers in T that cover T. Let
d x (t, ․ )
(-l og [ E e .(x0)-x(.0)01)..
We consider three conditions on the kernel f(t,u) and one condition on
11,3(dx; E): (C1) f has a modification Jo such that for every u E U, fo(t, u) is continuous; suPt €170 If((,u)1 is in La(U,U,m), where T o C T is a countable separant for X that is dense in T;
(C2) f"(u) = (C3)
( s,up t 11. 1.1 (t,u dx) (t, f()s,u)i s ) .
-
dm(u) < co;
(C4) 00
.11,3(dx; e- ) de < co. According to Nolan (1989), we obtain the following theorem.
Theorem 5.5.1 Let 0 < a < 1. (i) X has Property I if and only if (Cl) and (C2) hold. (ii) X has a version with discontinuous, bounded sample paths if and only if
(CI) fails to hold and (C2) holds. (iii) X has Property III if and only if (C2) fails to hold. Let 1 < a < 2. (iv) If (CI), (C2), (CE) and (CO are fulfilled, then X has Property I. Following Kono and Maejima (1991), we give now the proofs for the above classification of the listed examples. PROOFS. (1) The fact that X 1 and X5 for 0 < H < 1/a have Property III is verified by Theorem 5.5.1 (iii) above, or by Theorem 4 of Rosinski (1989).
A. JANICKI and A. WERON
139
(2) Recall X6(t) = where
J f(t,A)difi ,(A), 0 < t < 1, c
e itA
to (aA l+-11-1 / a bA 1-1"/').
f(t, A) =
(When H = 1/a, X6 = X3.) Let f (t, A) = g(t, A) + ih(t, A) and ltdc, =M^ 11 + iM,f,.2) . Then X6 (t) = I (gdMV — hdA1,1, 2) )-F i I (hdM1 1) gdX 2) ). Obviously h and g satisfy (C1). Observe that g* and h* are in L'(R, B,dx), satisfying (C2). Hence, when 0 < a < 1, it follows from Theorem 5.5.1 (i) that X6 has Property I. If X is H-ss si SaS, then dx (t, s)
Cii — si ll
for some positive constant C, and thus, when T = [0, 1], N(dx;e) =
Cae-1/H] + 1) c
if e < 1, if e > 1.
Hence, when 1 < a < 2, we have (C4). Condition (C3) is also satisfied. Thus, by Theorem 5.5.1 (iv), we conclude that X6 has Property I. (3) When 0 < a < 1, we can apply Theorem 5.5.1 (ii) to show that X 10 has Property II. Recall that Xio (t) =
IR 2+
c(t; x, y)dM (x , y).
Applying now Theorem 5.5.1 (ii) with U = IR 2+ , it = (x, y), dm(u) Wm = M we see that c•; x, y) does not satisfy (C1). However, since
dxdy,
sup c(t; x, y) = c(1; x, y), t €10.11
(C2) is fulfilled. Hence, when 0 < a < 1, X 10 has a version with discontinuous, bounded sample paths. By an observation due to Vervaat (1985), H-ss si processes with such versions have Property II. In the case 1 < a < 2, we arrive at the same conclusion if we represent the stochastic integral X 10 (t) by the pathwise integral after the integration by parts. ❑
Remark 5.5.1 For 1/a < H < 1, the processes X5 and X8 cannot be discriminated by Property I. More delicate path properties exhibit them as different. Takashima (1989) has recently proved that for any e > 0, lirn sup
IX6 (t)I
tio tH(log 1/0.,
a.s.
140
CHAPTER 5
However, X8 has the form X8 = Z 112 13H, where Z and BH are independent. Hence, it follows from the law of the iterated logarithm for BH (cf., Marcus (1968)) that
lim sup
IX8(t)I
tH(2 log log 1/00
< oo
a.s.
Let Al
= I( H, a) : a = 2, 0 < H < 1/2), = {(H,a) : 0 < a < 2, 0 < H < 1/2}, B l = {(H,a) : -=- 2, 1/2 < H < 1 }, B2 = {(H,a) : 1/H < < 2, 1/2 < H < 1}, B3 = {(H,a) : a -= 1/H, 1/2 < H <1}, B4 = {(H,a) :0 < a <1/ H, 1/2 < H < 1}, A2
C2
=
{(H, a) : a --= 1/11, H > 1} {(H,a) : 0 < a < 1/ H, H > 1}.
Following Kono and Maejima (1991) one can systematize the different contingencies of a and H, existence of appropriate processes, and validity of path properties by the following picture of the (H, a) plane. cc
-2 B
-1
2
A2 B4
C2
0
H)
❑
0.5
1
Figure 5.5.1. Subregions of the plane of (H, a).
Chapter 6 Computer Approximations of Continuous Time Processes 6.1 Introduction The aim of this chapter is to provide some constructive computer methods designed to approximate and visualize the main classes of stochastic processes discussed in this book. It turns out that with the use of suitable statistical estimation techniques, computer simulation procedures and numerical discretization methods it is possible to construct approximations of stochastic integrals with stable measures as integrators. As a consequence we obtain an effective, general method giving approximate solutions for a wide class of stochastic differential equations involving such integrals. Application of computer graphics provides interesting quantitative and visual information on those features of stable variates which distinguish them from their commonly used Gaussian counterparts. It is possible to demonstrate evolution in time of densities with heavy tails of appropriate processes, to visualize the effect of jumps of trajectories, etc. We try to demonstrate that stable variates can be very useful in stochastic modeling of problems of different kinds, arising in science and engineering, which often provide better description of real life phenomena than their Gaussian counterparts. First, we focus our attention on diffusion processes described as solutions of stochastic differential equations with respect to both Gaussian and stable measures. As a particular case we obtain approximate representations of stochastic integrals. Next, we describe the method of approximation and simulation of stochastic processes represented by stochastic integrals of deterministic functions with respect to stochastic measures. We present moving averages processes as examples of stationary SaS processes, which are so important from the point of view of ergodic theory of stochastic processes. Computer methods of construction of stochastic processes involve at least two kinds of discretization techniques: discretization of the time parameter and an approximate representation of random variates with the aid of artificially 141
CHAPTER 6
142
produced finite-time series data sets or statistical samples. Statistical methods of data analysis such as constructions of empirical cumulative distribution functions or kernel probability density estimates, regression analysis, etc., provide powerful and very useful tools for practical investigation of interesting properties of different classes of stochastic processes. By applying IBM PC graphics we attempt to demonstrate the good results they can provide. (Keeping in mind technical abilities of such computers we restrict ourselves to R-, or R 2 -valued processes.)
6.2 Approximation of Diffusions Driven by Brownian Motion Now our aim is to present some methods of numerical approximation and computer simulation of solutions of Ito-type stochastic differential equations. Applying some statistics we describe a method of computer visualization of stochastic processes that satisfy these equations. Let us start the discussion of methods leading to computer construction of diffusion processes with the simplest, but very important in applications, particular case.
Approximation of It6—type stochastic integral of deterministic function. We are interested in a method of construction of an univariate stochastic process {X(t) : t a [0, 7]} defined in the following way
X(t) =
f(s) dB(s),
t E [0,T],
(6.2.1)
where f = f(t) is a given, say, continuous function on [0, T] and {B(t) : t E [0, +oo)} is the Brownian motion. Let us fix a positive integer I E IN and introduce a regular mesh of points {t,} discretizing the time interval [0, T]
t, = ir,
for i = 0, 1,
/, where T = T/I.
(6.2.2)
Definition 6.2.1 We approximate the process IX(t) : t a [0, T]) described by (6.2.1) by a discrete-time process
1. Xo = 0
defined in the following way:
a.s.;
2. for i = 1, 2, ..., I define XT. = XL, + f(t.--1)A13,
(6.2.3)
where ABT denotes the stochastic (Gaussian) measure of an interval [4_ 1 ,4), i.e., in this special case, simply the Gaussian random variable defined by ABT = B([4_1, ti)) = B(4) - B(4_1)NrrAl (0,1) = N(0, r); (6.2.4) .
A. JANICKI and A. WERON
143
3. the sequence {ABT; i = 1,...,/} is an i.i.d. sequence. In particular we have
= f f(s) dB(s) = X (T)
E f(ti_ )AB;. i
(6.2.5)
Someone looking for continuous time approximation of the process {X(t)} can derive from the above definition the following formula X'(t) = X;:_ i for t e [ii-1, ti)1
(6.2.6)
with i = 1, 2, ..., I.
Simulation of univariate stochastic processes. Now we de scribe rather general technique of computer simulation of univariate stochastic processes {X(t) : t E [0, 7]) with independent identically distributed increments by a discrete time process of the form {XT. }; 0 , defined by the formula XT. = XL 1 Y,',
(6.2.7)
with a given X; and where V's form a sequence of i.i.d. random variables. In computer calculations each random variable Xi defined by (6.2.7) is represented by its N independent realizations, i.e. a random sample {XT(n)}„N_„. So, let us fix N E N large enough. The algorithm consists in the following: 1. simulate a random sample {X,;(n)}„N_, for XJ; 2. for i = 1,2, ..., I simulate a random sample {AL, Q7 ,(n)}„N_, for a-stable random variable A 3. for i = 1, 2, ..., I compute the random sample {Y,r(n)}„N_, of X;(n) = X,r_ 1 (n)-1- Y,r(n), n = 1,2,...,N;
Kr and
4. construct kernel density estimators L = fil•N = f,I.N(x) of the densities of X(t,), using for example the optimal version of the Rosenblatt-Parzen =,N (x). method, and their distribution functions F, = Observe that we have produced N finite time series of the form {X;(n)} 1 , for n = 1, 2,..., N. We regard them as "good" approximations of the trajectories of the process {X(t); t E [0, T]}.
Visualization of univariate stochastic processes. In order to obtain a graphical approximation of the integral {X(t); t E [0, T]} defined by (6.2.1) we propose the following: 1. fix a rectangle [0,
x [c, d] that should include the trajectories of {X(t)};
144
CHAPTER 6
2. for each n = 1, 2, ..., n m ,, x (with fixed n max << N) draw the line segments determined by the points (t,_ 1 , X,r i (n)) and (t„ X,"(n)) for i = 1,2, ..., /, constructing n,max approximate trajectories of the process X (thin lines on all figures); 3. fix a few values of a "probability parameter" p, from (0, 1/2) for j = 1, 2, ..., J and for each of them compute 2 quantiles: = F2 -1 (p„) and gir;ilar = — pi for all i = 1,2, ..., I; then draw the line segments determined by the points (t;_1 cizino), ) and (t,_ 1 , (t;, q!;,3„ r ) for i = 1, 2, ..., / and j = 1,2, J, constructing J (varying in time) prediction intervals (thick lines on all figures) that determine subdomains of IR 2 to which the trajectories of the approximated process should belong with probabilities 1 — 2p, at any fixed moment of time t = t,. Each line obtained in this way we call quantile line.
Remark 6.2.1 On the computer screen an interval [0,T] is represented by a few hundreds of pixels, i.e. computer screen "points" (working with VGA graphics cart one has exactly 640 pixels). Computer experiments with Brownian motion processes {X(t)} proved that simulating them on a finite interval [0, T] with the mesh consisting of 1000, 10000, 100000 subintervals (some number of time steps is performed within 1 pixel size) the pictures of approximate trajectories look very much alike. An argument acceptable for statisticians, physicists and engineers, even for mathematicians, is that graphical approximations of such strange functions as the trajectories of Brownian motion are acceptable for a human eye. Experiments with meshes of 100 or 300 subintervals usually give poor results. It is an obvious observation that some features of graphs of trajectories constructed on a computer heavily depend on a proper scaling of both axes. For example, self-similarity of trajectories of Brownian motion can be seriously distorted in the case of an interval [0, T] with T much too small or much too large in comparison with the chosen intervals to represent the values of X(t).
Examples of stochastic integrals. In Chapter 2 we have already presented a few examples of computer visualizations of stochastic processes obtained by this technique and we believe they provide some interesting quantitative and qualitative information on stochastic processes. Here we present 3 examples. Each of them is described by 2 figures. The first includes a number of approximate trajectories (20, 20, 50, respectively) and 3 pairs of quantile lines (our dynamical histogram) defined by p 1 = 0.05, p 2 = 0.15, p 3 = 0.25 and 50 trajectories, the second - the histogram and kernel density estimator (see Chapter 3) of the last calculated value X(T) of the process. In all cases we have chosen 1=2000, N=2000. Example 6.2.1 (Integral (i).)
145
A. JANICKI and A. WERON In order to obtain the Brownian motion it is enough to notice that
B(t) = fo t dB(s), t
E [0,
(6.2.8)
T).
Invoking the next two examples we want to demonstrate that there is a vast class of very interesting processes defined very simply. Their existence is not acknowledged in applications. Computer methods provide a deeper insight into their structure.
Example 6.2.2 (Integral (ii).) T.
(6.2.9)
t E [0, T].
(6.2.10)
cos(s)dB(s), t
X(t) =
E [0,
Example 6.2.3 (Integral (iii).)
X(t) =
f
Cs dB(s),
One can observe how quickly this process starts to behave like a stationary process or even trivially stationary (all trajectories practically become constant) fort large enough.
Approximation of stochastic integrals of random functions. Here we are going to point out some well-known but very important and in some sense surprising facts concerning constructions of the"Riemann type" integral sums approximating stochastic integrals of a random function, i.e. processes {X(t) : t E [0,n defined by
X(t)
= fo t f(s,B(s)) dB(s),
t E [0, T],
(6.2.11)
where f = f(t,x) is a given, say, continuous function on [0, T] x IR and {B(t) : t E [0, +CO) is the standard Brownian motion, or by
X(t)
f (s, B (2) (5)) dB (1) (s),
t E [0, T],
(6.2.12)
where {B( 1) (t) : t E [0, d-oo)} and {B (2 )(t) : t e [0, +co)} are two independent copies of the standard Brownian motion. When constructing appropriate sums approximating such stochastic integrals one has to carefully distinguish between (I) the 116 stochastic integral or forward integral that is obtained as a limit of
sums XT, = XL, + f(t i _ i ,B(ti_ i )) L B,
(6.2.13)
with respect to a given infinite sequence of appropriately chosen meshes,
146
CHAPTER 6
(b) the backward integral that is obtained as a limit of sums
f(ti, B(t,)) AB:
XT, =
(6.2.14)
the Stratonovich stochastic integral defined by
Xtr =
+ f (ti-i, B(t,--1)) + f (16 B( 1 0) AB:". 2
(6.2.15)
One can even try convex linear sums of the form ./VZ =
( (1 - A)f(t,_ i , B(t,_ 1 )) + A f (t„ B(t,)) ) AB: ,
with A E [0, 1].
Example 6.2.4 (Integral (iv).) We are going to demonstrate how stochastic integrals of random functions depend on definitions of their partial sums. It is well known that in the limit we obtain
(I) fo B(s) dB(s) = (13.2 (t) - t), (b) fo B(s) dB(s) = 1(B 2 (t)+ t), (S)
fo B(s) dB(s) = .1B 2 (t),
respectively. We have chosen this example to test the correctness and accuracy of the developed method of computer simulation and visualization of stochastic integrals and diffusion processes. It is not difficult to check that the random variable 2'- B 2 (t) has gamma distribution, i.e. its density is defined by x-tize-x/t
f(x) = N/7" 0
if x > 0, otherwise,
for > 0. The density is unbounded, so this is a hard test of "classical" versions of kernel density estimators. Figures 6.2.7-6.2.10 present graphically the Ito and Stratonovich integrals from Example 6.2.4.
Remark 6.2.2 The convergence of processes {X 7 (1)} to {X(1)} for t E [0,7] when r -+ 0 follows from the definition of the Ito stochastic integral. It follows also from the theorems on convergence of approximations for diffusion processes that are presented below.
A. JANICKI and A. WERON
147
Figure 6.2.1. Visualization of the integral (i) (Brownian motion).
- 0.15
0
5
Figure 6.2.2. Histogram and kernel density estimator of B(8) ( integral (i)).
148
CHAPTER 6
Figure 6.2.3. Visualization of the integral (ii).
- 0.225
0.
f5
3
Figure 6.2.4. Histogram and kernel density estimator of X(8) for integral (ii).
A. JANICKI and A. WERON
149
i1
C i
_
. . ...„....,......____ ......,...„„.„,.,.....„...„.. , „ „ ,v.,, 4
it
4 Apiroillr+7,• , • ,
._,_.___---_ ,
4
007.------ - • 111, 114007, , .. ' ' IV/0"f T'' r k 1Wv,N.
Figure 6.2.5. Visualization of the integral (iii).
+ -5
Figure 6.2.6. Histogram and kernel density estimator of X(4) for integral (iii).
150
CHAPTER 6
Figure 6.2.7. Visualization of the Ito integral (iv).
•
Figure 6.2.8. Estimators of X(4) of (iv) for ILO integral.
A. JANICKI and A. WERON
Figure 6.2.9. Visualization of the Stratonovich integral (iv).
Figure 6.2.10. Estimators of X(4) for Stratonovich integral (iv).
151
152
CHAPTER 6
Remark 6.2.3 In Section 3.5 we made a remark on four possible sources of errors of computer calculations and simulations. Now we have two new types of errors induced by approximation: 1. discretization of the time interval [0,T] and approximation of {X(t)} by {X0; 2. statistical approximation of random variables Xi by their statistical samples {XT(n)}„Nr__,.
Approximation of univariate diffusions driven by Brownian motion. According to the description of this class of stochastic processes in Section 4.10, we are interested in constructive computer methods of solution of the ItO-type stochastic differential equation of the following form
dX(t) = a(t, X(t)) dt
b(t, X(t)) dB(t)
for I E [0, T],
(6.2.16)
with X(0) = X0 given Gaussian random variable. In order to describe the simplest possible method (Euler- like method) of approximation of the equation (6.2.16) it is enough to rewrite it in the following integral form
X(t)
+
a(s, X(s)) ds
b(s, X(s)) dB(s),
(6.2.17)
and to modify slightly the method presented in Definition 6.2.1.
Definition 6.2.2 With a fixed regular mesh on [0, 7'] we approximate the process {X(t) : t e [0, T]} by a discrete time process {XT. }L o defined in the following way: 1. Xj N(µ, a 2 ); 2. for i = 1,2,...,/,
X tr. XL, +
X(ti_i)) T
X(t1_1))AN,
(6.2.18)
where, as before, ABT denotes the stochastic Gaussian measure of an interval (t,_ 1 , t,) of the form = B((t,_ 1 , t,)) 3. the sequence {AB,; i =
N(0,, r);
I} being a given i.i.d. sequence.
There are (as in the case of ordinary differential equations) some methods of higher order of approximation. We recall here two examples of such methods (see, e.g., Pardoux and Talay (1985) or Yamada (1976)).
153
A. JANICKI and A. WERON
Definition 6.2.3 With a fixed regular mesh on [0,7] we approximate the process {X(t) : t E[0,7]) by a discrete time process {X;:}f.„, defined by 1. Xj
Ar(it,a-2 ); 1, 2, ..., I,
2. for i
Xt +
= XL, +
X(11-1)) r + b( 1 1-1, X(tx--1))AB:
bi (t i _ i , X(ti_ i ))b(ti_ i , X(t,_ 1 ))(A/3;) 2 ,
where (t, x) a(t, x) - -111(t, x) b(t, x) and, as before, LBT denotes the stochastic Gaussian measure of an interval (ti_ 1 ,1,) of the form ABT = B((ti_i,ti))
r (0 r); sequence.
1,..., I) being a given
3. the sequence {AB[; i
Definition 6.2.4 With a fixed regular mesh on [0, T] we approximate the process {X(t) : t a [0,7]} by a discrete time process VOL, defined in the following way: 1. Xj-N (µ, a 2 ); 1, 2, ..., /,
2. for i =
X(4-1)) r + 44-1, X ( t t -1 )) A13 :1
- 1) 1 (ti-1 X(ti.-1))b(ti-1, X(ti.-.1))(AB,r ) 2
2 fa i (ti_ i , X(t1-1))b(li-i, X(ti-1)) a(ti_„ X(ti-MY(ti-1, X( 1 1-1)) 1 X(t,_1)))11.6,/3T +- b 2 (t,_„ 2 2 X(t i _ i ))a i (t,_„ X(t,_ 1 )) 72 1 1- i b2 (t,_„ X(t,-1))a n (li-i, X( 1 1-1)))
where Ti(t,x) = a(t, x) - lib'(t,x)b(t,x) and LBT denotes the stochastic Gaussian measure of an interval (t i _ i ,t i ) of the form ABT = B((ti_ i , ti))
(0, r);
3. the sequence {ABT; i =1,...,1} being a given i.i.d. sequence.
Remark 6.2.4 In the above scheme one can replace the sequence of {.ABir}
1,,F-u,), where Ili satisfy E(ui) 2 =1, E(u,) 3 = 0,
by any sequence of i.i.d. random variables
Eui=o, E(ui) 4 = 3 ,
E( 11.) 5 = 0 ,
E(Ui ) 6 < co.
One can choose, for example, discrete random variables distributed according to the following law
P{U
} =
1'
= -Vd} = - P{LIi 0} = 6
2 3
154
CHAPTER 6
Remark 6.2.5 In all cases described above, having at our disposal {X,T,)!_Td , we can construct a continuous time process XT(t) =
for t
E
ti),
(6.2.19)
with i = 1, 2, ..., I and XT (T) =
Convergence of approximations of Gaussian diffusions. Now we want to recall some theorems on convergence of approximate solutions of stochastic differential equations defined above in Definitions 6.2.2, 6.2.3, 6.2.4. The proofs can be found in Pardoux and Talay (1985) or