Andreas E. Kyprianou
Introductory Lectures ´ on Fluctuations of Levy Processes with Applications With 22 Figures
123
Andreas E. Kyprianou Department of Mathematical Sciences University of Bath Bath BA2 7AY UK e-mail:
[email protected]
The background text on the front cover is written in old (pre-1941) Mongolian scripture. It is a translation of the words ‘stochastic processes with stationary and independent increments’ and should be read from the top left hand corner of the back cover to the bottom right hand corner of the front cover.
Mathematics Subject Classification (2000): 60G50, 60G51, 60G52
Library of Congress Control Number: 2006924567
ISBN-10 3-540-31342-7 Springer Berlin Heidelberg New York ISBN-13 978-3-540-31342-7 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable for prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2006 Printed in Germany The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: Erich Kirchner, Heidelberg Typesetting by the author and SPi using a Springer LATEX macro package Printed on acid-free paper
SPIN 11338987
41/3100/SPi - 5 4 3 2 1 0
Preface
In 2003 I began teaching a course entitled L´evy processes on the AmsterdamUtrecht masters programme in stochastics and financial mathematics. Quite naturally, I wanted to expose my students to my own interests in L´evy processes; that is, the role that certain subtle behaviour concerning their fluctuations play in explaining different types of phenomena appearing in a number of classical models of applied probability. Indeed, recent developments in the theory of L´evy processes, in particular concerning path fluctuation, have offered the clarity required to revisit classical applied probability models and improve on well established and fundamental results. Whilst teaching the course I wrote some lecture notes which have now matured into this text. Given the audience of students, who were either engaged in their ‘afstudeerfase’1 or just starting a Ph.D., these lecture notes were originally written with the restriction that the mathematics used would not surpass the level that they should in principle have reached. Roughly speaking that means the following: experience to the level of third year or fourth year university courses delivered by a mathematics department on -
foundational real and complex analysis, basic facts about Lp spaces, measure theory, integration theory and measure theoretic probability theory, elements of the classical theory of Markov processes, stopping times and the Strong Markov Property. - Poisson processes and renewal processes, - Brownian motion as a Markov process and elementary martingale theory in continuous time.
For the most part this affected the way in which the material was handled compared to the classical texts and research papers from which almost all of the results and arguments in this text originate. A good example of this is 1
The afstudeerfase is equivalent to at least a European masters-level programme.
VIII
Preface
the conscious exclusion of calculations involving the master formula for the Poisson point process of excursions of a L´evy process from its maximum. There are approximately 80 exercises and likewise these are pitched at a level appropriate to the aforementioned audience. Indeed several of the exercises have been included in response to some of the questions that have been asked by students themselves concerning curiosities of the arguments given in class. Arguably the exercises are at times quite long. Such exercises reflect some of the other ways in which I have used preliminary versions of this text. A small number of students in Utrecht also used the text as an individual reading/self-study programme contributing to their ‘kleinescripite’ (extended mathematical essay) or ‘onderzoekopdracht’ (research option); in addition, some exercises were used as (take-home) examination questions. The exercises in the first chapter in particular are designed to show the reader that the basics of the material presented thereafter is already accessible assuming basic knowledge of Poisson processes and Brownian motion. There can be no doubt, particularly to the more experienced reader, that the current text has been heavily influenced by the outstanding books of Bertoin (1996) and Sato (1999), and especially the former which also takes a predominantly pathwise approach to its content. It should be reiterated however that, unlike the latter two books, this text is not intended as a research monograph nor as a reference manual for the researcher. Writing of this text began whilst I was employed at Utrecht University, The Netherlands. In early 2005 I moved to a new position at Heriot Watt University in Edinburgh, Scotland, and in the final stages of completion of the book to The University of Bath. Over a period of several months my presence in Utrecht was phased out and my presence in Edinburgh was phased in. Along the way I passed through the Technical University of Munich and The University of Manchester. I should like to thank these four institutes and my hosts for giving me the facilities necessary to write this text (mostly time and a warm, dry, quiet room with an ethernet connection). I would especially like to thank my colleagues at Utrecht for giving me the opportunity and environment in which to develop this course, Ron Doney during his two-month absence for lending me the key to his office and book collection whilst mine was in storage and Andrew Cairns for arranging to push my teaching duties into 2006 allowing me the focus to finalise this text. Let me now thank the many, including several of the students who took the course, who have made a number of remarks, corrections and suggestions (minor and major) which have helped to shape this text. In alphabetical order these are: Larbi Alili, David Applebaum, Johnathan Bagley, Erik Baurdoux, M.S. Bratiychuk, Catriona Byrne, Zhen-Qing Chen, Gunther Cornelissen, Irmingard Erder, Abdelghafour Es-Saghouani, Serguei Foss, Uwe Franz, Shota Gugushvili, Thorsten Kleinow, Pawel Kliber, Claudia Kl¨ uppelberg, V.S. Korolyuk, Ronnie Loeffen, Alexander Novikov, Zbigniew Palmowski, Goran Peskir, Kees van Schaik, Sonja Scheer, Wim Schoutens, Budhi Arta Surya, Enno Veerman, Maaike Verloop, Zoran Vondraˇcek. In particular I would also
Preface
IX
like to thank, Peter Andrew, Jean Bertoin, Ron Doney, Niel Farricker, Alexander Gnedin, Amaury Lambert, Antonis Papapantoleon and Martijn Pistorius rooted out many errors from extensive sections of the text and provided valuable criticism. Antonis Papapantoleon very kindly produced some simulations of the paths of L´evy processes which have been included in Chap. 1. I am most grateful to Takis Konstantopoulos who read through earlier drafts of the entire text in considerable detail, taking the time to discuss with me at length many of the issues that arose. The front cover was produced in consultation with Hurlee Gonchigdanzan and Jargalmaa Magsarjav. All further comments, corrections and suggestions on the current text are welcome. Finally, the deepest gratitude of all goes to Jagaa, Sophia and Sanaa for whom the special inscription is written.
Edinburgh June 2006
Andreas E. Kyprianou
Contents
1
L´ evy Processes and Applications . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 L´evy Processes and Infinite Divisibility . . . . . . . . . . . . . . . . . . . . . 1 1.2 Some Examples of L´evy Processes . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.3 L´evy Processes and Some Applied Probability Models . . . . . . . . 14 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
2
The L´ evy–Itˆ o Decomposition and Path Structure . . . . . . . . . . 2.1 The L´evy–Itˆo Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 Poisson Random Measures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.3 Functionals of Poisson Random Measures . . . . . . . . . . . . . . . . . . . 2.4 Square Integrable Martingales . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.5 Proof of the L´evy–Itˆ o Decomposition . . . . . . . . . . . . . . . . . . . . . . 2.6 L´evy Processes Distinguished by Their Path Type . . . . . . . . . . . 2.7 Interpretations of the L´evy–Itˆo Decomposition . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
33 33 35 41 44 51 53 56 62
3
More Distributional and Path-Related Properties . . . . . . . . . . 3.1 The Strong Markov Property . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.2 Duality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.3 Exponential Moments and Martingales . . . . . . . . . . . . . . . . . . . . . Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
67 67 73 75 83
4
General Storage Models and Paths of Bounded Variation . . 87 4.1 General Storage Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 4.2 Idle Times . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 4.3 Change of Variable and Compensation Formulae . . . . . . . . . . . . 90 4.4 The Kella–Whitt Martingale . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 4.5 Stationary Distribution of the Workload . . . . . . . . . . . . . . . . . . . . 100 4.6 Small-Time Behaviour and the Pollaczek–Khintchine Formula . 102 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
XII
Contents
5
Subordinators at First Passage and Renewal Measures . . . . 111 5.1 Killed Subordinators and Renewal Measures . . . . . . . . . . . . . . . . 111 5.2 Overshoots and Undershoots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 5.3 Creeping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 5.4 Regular Variation and Tauberian Theorems . . . . . . . . . . . . . . . . . 126 5.5 Dynkin–Lamperti Asymptotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133
6
The Wiener–Hopf Factorisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139 6.1 Local Time at the Maximum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140 6.2 The Ladder Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147 6.3 Excursions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154 6.4 The Wiener–Hopf Factorisation . . . . . . . . . . . . . . . . . . . . . . . . . . . 157 6.5 Examples of the Wiener–Hopf Factorisation . . . . . . . . . . . . . . . . . 168 6.6 Brief Remarks on the Term “Wiener–Hopf” . . . . . . . . . . . . . . . . . 174 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174
7
L´ evy Processes at First Passage and Insurance Risk . . . . . . 179 7.1 Drifting and Oscillating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 7.2 Cram´er’s Estimate of Ruin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185 7.3 A Quintuple Law at First Passage . . . . . . . . . . . . . . . . . . . . . . . . . 189 7.4 The Jump Measure of the Ascending Ladder Height Process . . 195 7.5 Creeping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197 7.6 Regular Variation and Infinite Divisibility . . . . . . . . . . . . . . . . . . 200 7.7 Asymptotic Ruinous Behaviour with Regular Variation . . . . . . . 203 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 206
8
Exit Problems for Spectrally Negative Processes . . . . . . . . . . . 211 8.1 Basic Properties Reviewed . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211 8.2 The One-Sided and Two-Sided Exit Problems . . . . . . . . . . . . . . . 214 8.3 The Scale Functions W (q) and Z (q) . . . . . . . . . . . . . . . . . . . . . . . . 220 8.4 Potential Measures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 223 8.5 Identities for Reflected Processes . . . . . . . . . . . . . . . . . . . . . . . . . . 227 8.6 Brief Remarks on Spectrally Negative GOUs . . . . . . . . . . . . . . . . 231 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
9
Applications to Optimal Stopping Problems . . . . . . . . . . . . . . . 239 9.1 Sufficient Conditions for Optimality . . . . . . . . . . . . . . . . . . . . . . . . 240 9.2 The McKean Optimal Stopping Problem . . . . . . . . . . . . . . . . . . . 241 9.3 Smooth Fit versus Continuous Fit . . . . . . . . . . . . . . . . . . . . . . . . . 245 9.4 The Novikov–Shiryaev Optimal Stopping Problem . . . . . . . . . . . 249 9.5 The Shepp–Shiryaev Optimal Stopping Problem . . . . . . . . . . . . . 255 9.6 Stochastic Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
Contents
XIII
10 Continuous-State Branching Processes . . . . . . . . . . . . . . . . . . . . . 271 10.1 The Lamperti Transform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271 10.2 Long-term Behaviour . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274 10.3 Conditioned Processes and Immigration . . . . . . . . . . . . . . . . . . . . 280 10.4 Concluding Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293 Epilogue . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 371
1 L´ evy Processes and Applications
In this chapter we define a L´evy process and attempt to give some indication of how rich a class of processes they form. To illustrate the variety of processes captured within the definition of a L´evy process, we explore briefly the relationship of L´evy processes with infinitely divisible distributions. We also discuss some classical applied probability models, which are built on the strength of well-understood path properties of elementary L´evy processes. We hint at how generalisations of these models may be approached using more sophisticated L´evy processes. At a number of points later on in this text we handle these generalisations in more detail. The models we have chosen to present are suitable for the course of this text as a way of exemplifying fluctuation theory but are by no means the only applications.
1.1 L´ evy Processes and Infinite Divisibility Let us begin by recalling the definition of two familiar processes, a Brownian motion and a Poisson process. A real-valued process B = {Bt : t ≥ 0} defined on a probability space (Ω, F, P) is said to be a Brownian motion if the following hold: (i) (ii) (iii) (iv) (v)
The paths of B are P-almost surely continuous. P(B0 = 0) = 1. For 0 ≤ s ≤ t, Bt − Bs is equal in distribution to Bt−s . For 0 ≤ s ≤ t, Bt − Bs is independent of {Bu : u ≤ s}. For each t > 0, Bt is equal in distribution to a normal random variable with variance t.
A process valued on the non-negative integers N = {Nt : t ≥ 0}, defined on a probability space (Ω, F, P), is said to be a Poisson process with intensity λ > 0 if the following hold: (i) The paths of N are P-almost surely right continuous with left limits. (ii) P(N0 = 0) = 1.
2
1 L´evy Processes and Applications
(iii) For 0 ≤ s ≤ t, Nt − Ns is equal in distribution to Nt−s . (iv) For 0 ≤ s ≤ t, Nt − Ns is independent of {Nu : u ≤ s}. (v) For each t > 0, Nt is equal in distribution to a Poisson random variable with parameter λt. On first encounter, these processes would seem to be considerably different from one another. Firstly, Brownian motion has continuous paths whereas a Poisson process does not. Secondly, a Poisson process is a non-decreasing process and thus has paths of bounded variation over finite time horizons, whereas a Brownian motion does not have monotone paths and in fact its paths are of unbounded variation over finite time horizons. However, when we line up their definitions next to one another, we see that they have a lot in common. Both processes have right continuous paths with left limits, are initiated from the origin and both have stationary and independent increments; that is properties (i), (ii), (iii) and (iv). We may use these common properties to define a general class of stochastic processes, which are called L´evy processes. Definition 1.1 (L´ evy Process). A process X = {Xt : t ≥ 0} defined on a probability space (Ω, F, P) is said to be a L´evy process if it possesses the following properties: (i) (ii) (iii) (iv)
The paths of X are P-almost surely right continuous with left limits. P(X0 = 0) = 1. For 0 ≤ s ≤ t, Xt − Xs is equal in distribution to Xt−s . For 0 ≤ s ≤ t, Xt − Xs is independent of {Xu : u ≤ s}.
Unless otherwise stated, from now on, when talking of a L´evy process, we shall always use the measure P (with associated expectation operator E) to be implicitly understood as its law. The term “L´evy process” honours the work of the French mathematician Paul L´evy who, although not alone in his contribution, played an instrumental role in bringing together an understanding and characterisation of processes with stationary independent increments. In earlier literature, L´evy processes can be found under a number of different names. In the 1940s, L´evy himself referred to them as a sub-class of processus additif (additive processes), that is processes with independent increments. For the most part however, research literature through the 1960s and 1970s refers to L´evy processes simply as processes with stationary independent increments. One sees a change in language through the 1980s and by the 1990s the use of the term “L´evy process” had become standard. From Definition 1.1 alone it is difficult to see just how rich a class of processes the class of L´evy processes forms. De Finetti (1929) introduced the notion of an infinitely divisible distribution and showed that they have an intimate relationship with L´evy processes. This relationship gives a reasonably
1.1 L´evy Processes and Infinite Divisibility
3
good impression of how varied the class of L´evy processes really is. To this end, let us now devote a little time to discussing infinitely divisible distributions. Definition 1.2. We say that a real-valued random variable Θ has an infinitely divisible distribution if for each n = 1, 2, ... there exist a sequence of i.i.d. random variables Θ1,n , ..., Θn,n such that d
Θ = Θ1,n + · · · + Θn,n d
where = is equality in distribution. Alternatively, we could have expressed this relation in terms of probability laws. That is to say, the law µ of a realvalued random variable is infinitely divisible if for each n = 1, 2, ... there exists ∗ another law µn of a real valued random variable such that µ = µ∗n n . (Here µn denotes the n-fold convolution of µn ). In view of the above definition, one way to establish whether a given random variable has an infinitely divisible distribution is via its characteristic exponent. Suppose that Θ has characteristic exponent Ψ (u) := − log E(eiuΘ ) for all u ∈ R. Then Θ has an infinitely divisible distribution if for all n ≥ 1 there exists a characteristic exponent of a probability distribution, say Ψn , such that Ψ (u) = nΨn (u) for all u ∈ R. The full extent to which we may characterise infinitely divisible distributions is described by the characteristic exponent Ψ and an expression known as the L´evy–Khintchine formula. Theorem 1.3 (L´ evy–Khintchine formula). A probability law µ of a realvalued random variable is infinitely divisible with characteristic exponent Ψ, eiθx µ (dx) = e−Ψ (θ) for θ ∈ R, R
if and only if there exists a triple (a, σ, Π), a∈ R, σ ≥ 0 and Π is a where measure concentrated on R\{0} satisfying R 1 ∧ x2 Π(dx) < ∞, such that 1 Ψ (θ) = iaθ + σ 2 θ2 + (1 − eiθx + iθx1(|x|<1) )Π(dx) 2 R for every θ ∈ R. Definition 1.4. The measure Π is called the L´evy (characteristic) measure. The proof of the L´evy–Khintchine characterisation of infinitely divisible random variables is quite lengthy and we choose to exclude it in favour of moving as quickly as possible to fluctuation theory. The interested reader is referred to Lukacs (1970) or Sato (1999), to name but two of many possible references. A special case of the L´evy–Khintchine formula was established by Kolmogorov (1932) for infinitely divisible distributions with second moments.
4
1 L´evy Processes and Applications
However it was L´evy (1934) who gave a complete characterisation of infinitely divisible distributions and in doing so he also characterised the general class of processes with stationary independent increments. Later, Khintchine (1937) and Itˆ o (1942) gave further simplification and deeper insight to L´evy’s original proof. Let us now discuss in further detail the relationship between infinitely divisible distributions and processes with stationary independent increments. From the definition of a L´evy process we see that for any t > 0, Xt is a random variable belonging to the class of infinitely divisible distributions. This follows from the fact that for any n = 1, 2, ..., Xt = Xt/n + (X2t/n − Xt/n ) + · · · + (Xt − X(n−1)t/n )
(1.1)
together with the fact that X has stationary independent increments. Suppose now that we define for all θ ∈ R, t ≥ 0, Ψt (θ) = − log E eiθXt then using (1.1) twice we have for any two positive integers m, n that mΨ1 (θ) = Ψm (θ) = nΨm/n (θ) and hence for any rational t > 0, Ψt (θ) = tΨ1 (θ) .
(1.2)
If t is an irrational number, then we can choose a decreasing sequence of rationals {tn : n ≥ 1} such that tn ↓ t as n tends to infinity. Almost sure right continuity of X implies right continuity of exp{−Ψt (θ)} (by dominated convergence) and hence (1.2) holds for all t ≥ 0. In conclusion, any L´evy process has the property that for all t ≥ 0 E eiθXt = e−tΨ (θ) , where Ψ (θ) := Ψ1 (θ) is the characteristic exponent of X1 , which has an infinitely divisible distribution. Definition 1.5. In the sequel we shall also refer to Ψ (θ) as the characteristic exponent of the L´evy process. It is now clear that each L´evy process can be associated with an infinitely divisible distribution. What is not clear is whether given an infinitely divisible distribution, one may construct a L´evy process X, such that X1 has that distribution. This latter issue is affirmed by the following theorem which gives the L´evy–Khintchine formula for L´evy processes. Theorem 1.6 (L´ evy–Khintchine formula for L´ evy processes). Suppose that a ∈ R, σ ≥ 0 and Π is a measure concentrated on R\{0} such that 2 (1 ∧ x )Π(dx) < ∞. From this triple define for each θ ∈ R, R
1.2 Some Examples of L´evy Processes
1 Ψ (θ) = iaθ + σ 2 θ2 + 2
R
5
(1 − eiθx + iθx1(|x|<1) )Π(dx).
Then there exists a probability space (Ω, F, P) on which a L´evy process is defined having characteristic exponent Ψ. The proof of this theorem is rather complicated but very rewarding as it also reveals much more about the general structure of L´evy processes. Later, in Chap. 2, we will prove a stronger version of this theorem, which also explains the path structure of the L´evy process in terms of the triple (a, σ, Π).
1.2 Some Examples of L´ evy Processes To conclude our introduction to L´evy processes and infinite divisible distributions, let us proceed to some concrete examples. Some of these will also be of use later to verify certain results from the forthcoming fluctuation theory we will present. 1.2.1 Poisson Processes For each λ > 0 consider a probability distribution µλ which is concentrated on k = 0, 1, 2... such that µλ ({k}) = e−λ λk /k!. That is to say the Poisson distribution. An easy calculation reveals that iθ eiθk µλ ({k}) = e−λ(1−e ) k≥0
n λ iθ = e− n (1−e ) .
The right-hand side is the characteristic function of the sum of n independent Poisson processes, each of which with parameter λ/n. In the L´evy–Khintchine decomposition we see that a = σ = 0 and Π = λδ1 , the Dirac measure supported on {1}. Recall that a Poisson process, {Nt : n ≥ 0}, is a L´evy process with distribution at time t > 0, which is Poisson with parameter λt. From the above calculations we have E(eiθNt ) = e−λt(1−e
iθ
)
and hence its characteristic exponent is given by Ψ (θ) = λ(1 − eiθ ) for θ ∈ R. 1.2.2 Compound Poisson Processes Suppose now that N is a Poisson random variable with parameter λ > 0 and that {ξi : i ≥ 1} is an i.i.d. sequence of random variables (independent of N )
6
1 L´evy Processes and Applications
with common law F having no atom at zero. By first conditioning on N , we have for θ ∈ R, n N λn E(eiθ i=1 ξi ) = E(eiθ i=1 ξi )e−λ n! n≥0
=
R
n≥0
−λ
=e
e
iθx
R
n λn F (dx) e−λ n!
(1−eiθx )F (dx)
.
(1.3)
0 Note we use the convention here that 1 = 0. We see from (1.3) that N ξ are infinitely divisible with triple a = distributions of the form i=1 i −λ 0<|x|<1 xF (dx), σ = 0 and Π(dx) = λF (dx). When F has an atom of unit mass at 1 then we have simply a Poisson distribution. Suppose now that {Nt : t ≥ 0} is a Poisson process with intensity λ and consider a compound Poisson process {Xt : t ≥ 0} defined by Xt =
Nt i=0
ξi , t ≥ 0.
Using the fact that N has stationary independent increments together with the mutual independence of the random variables {ξi : i ≥ 1}, for 0 ≤ s < t < ∞, by writing Nt ξi Xt = Xs + i=Ns +1
it is clear that Xt is the sum of Xs and an independent copy of Xt−s . Right continuity and left limits of the process N also ensure right continuity and left limits of X. Thus compound Poisson processes are L´evy processes. From the calculations in the previous paragraph, for each t ≥ 0 we may substitute formula for a Nt for the variable N to discover that the L´evy–Khintchine compound Poisson process takes the form Ψ (θ) = λ R (1 − eiθx )F (dx). Note in particular that the L´evy measure of a compound Poisson process is always finite with total mass equal to the rate λ of the underlying process N . Compound Poisson processes provide a direct link between L´evy processes and random walks; that is discrete time processes of the form S = {Sn : n ≥ 0} where n ξi for n ≥ 1. S0 = 0 and Sn = i=1
Indeed a compound Poisson process is nothing more than a random walk whose jumps have been spaced out with independent and exponentially distributed periods.
1.2 Some Examples of L´evy Processes
7
1.2.3 Linear Brownian Motion Take the probability law 2 2 1 µs,γ (dx) := √ e−(x−γ) /2s dx 2 2πs
supported on R where γ ∈ R and s > 0; the well-known Gaussian distribution with mean γ and variance s2 . It is well known that
1 2 2
eiθx µs,γ (dx) = e− 2 s θ +iθγ R 1 s 2 2 γ n − ( √ ) θ +iθ n = e 2 n
showing again that it is an infinitely divisible distribution, this time with a = −γ, σ = s and Π = 0. We immediately recognise the characteristic exponent Ψ (θ) = s2 θ2 /2 − iθγ as also that of a scaled Brownian motion with linear drift, Xt := sBt + γt, t ≥ 0, where B = {Bt : t ≥ 0} is a standard Brownian motion; that is to say a linear Brownian motion with parameters σ = 1 and γ = 0. It is a trivial exercise to verify that X has stationary independent increments with continuous paths as a consequence of the fact that B does. 1.2.4 Gamma Processes For α, β > 0 define the probability measure µα,β (dx) =
αβ β−1 −αx x e dx Γ (β)
concentrated on (0, ∞); the gamma-(α, β) distribution. Note that when β = 1 this is the exponential distribution. We have ∞ 1 eiθx µα,β (dx) = β (1 − iθ/α) 0 n 1 = β/n (1 − iθ/α) and infinite divisibility follows. For the L´evy–Khintchine decomposition we have σ = 0 and Π(dx) = βx−1 e−αx dx, concentrated on (0, ∞) and a = 1 − 0 xΠ(dx). However this is not immediately obvious. The following lemma
8
1 L´evy Processes and Applications
proves to be useful in establishing the above triple (a, σ, Π). Its proof is Exercise 1.3. Lemma 1.7 (Frullani integral). For all α, β > 0 and z ∈ C such that ℜz ≤ 0 we have ∞ 1 − (1−ezx )βx−1 e−αx dx 0 = e . (1 − z/α)β To see how this lemma helps note that the L´evy–Khintchine formula for a gamma distribution takes the form ∞ 1 (1 − eiθx ) e−αx dx = β log(1 − iθ/α) Ψ (θ) = β x 0 for θ ∈ R. The choice of a in the L´evy–Khintchine formula is the necessary quantity to cancel the term coming from iθ1(|x|<1) in the integral with respect to Π in the general L´evy–Khintchine formula. According to Theorem 1.6 there exists a L´evy process whose L´evy– Khintchine formula is given by Ψ , the so-called gamma process. Suppose now that X = {Xt : t ≥ 0} is a gamma process. Stationary inde t−s where pendent increments tell us that for all 0 ≤ s < t < ∞, Xt = Xs + X
Xt−s is an independent copy of Xt−s . The fact that the latter is strictly positive with probability one (on account of it being gamma distributed) implies that Xt > Xs almost surely. Hence a gamma process is an example of a L´evy process with almost surely non-decreasing paths (in fact its paths are strictly increasing). Another example of a L´evy process with non-decreasing paths is a compound Poisson process where the jump distribution F is concentrated on (0, ∞). Note however that a gamma process is not a compound Poisson process on two counts. Firstly, its L´evy measure has infinite total mass unlike the L´evy measure of a compound Poisson process, which is necessarily finite (and equal to the arrival rate of jumps). Secondly, whilst a compound Poisson process with positive jumps does have paths, which are almost surely nondecreasing, it does not have paths that are almost surely strictly increasing. L´evy processes whose paths are almost surely non-decreasing (or simply non-decreasing for short) are called subordinators. We will return to a formal definition of this subclass of processes in Chap. 2. 1.2.5 Inverse Gaussian Processes Suppose as usual that B = {Bt : t ≥ 0} is a standard Brownian motion. Define the first passage time τs = inf{t > 0 : Bt + bt > s},
(1.4)
1.2 Some Examples of L´evy Processes
9
that is, the first time a Brownian motion with linear drift b > 0 crosses above level s. Recall that τs is a stopping time1 with respect to the filtration {Ft : t ≥ 0} where Ft is generated by {Bs : s ≤ t}. Otherwise said, since Brownian motion has continuous paths, for all t ≥ 0, {τs ≤ t} = {Bu + bu > s} u∈[0,t]∩Q
and hence the latter belongs to the sigma algebra Ft . Recalling again that Brownian motion has continuous paths we know that Bτs + bτs = s almost surely. From the Strong Markov Property,2 it is known that {Bτs +t + b(τs + t) − s : t ≥ 0} is equal in law to B and hence for all 0 ≤ s < t, τt = τs + τ t−s ,
where τ t−s is an independent copy of τt−s . This shows that the process τ := {τt : t ≥ 0} has stationary independent increments. Continuity of the paths of {Bt + bt : t ≥ 0} ensures that τ has right continuous paths. Further, it is clear that τ has almost surely non-decreasing paths, which guarantees its paths have left limits as well as being yet another example of a subordinator. According to its definition as a sequence of first passage times, τ is also the almost sure right inverse of the path of the graph of {Bt + bt : t ≥ 0} in the sense of (1.4). From this τ earns its name as the inverse Gaussian process. According to the discussion following Theorem 1.3 it is now immediate that for each fixed s > 0, the random variable τs is infinitely divisible. Its characteristic exponent takes the form Ψ (θ) = s( −2iθ + b2 − b) b 2 for all θ ∈ R and corresponds to a triple a = −2sb−1 0 (2π)−1/2 e−y /2 dy, σ = 0 and b2 x 1 Π(dx) = s √ e− 2 dx 3 2πx concentrated on (0, ∞). The law of τs can also be computed explicitly as µs (dx) = √
s
2πx3
1
esb e− 2 (s
2
x−1 +b2 x)
for x > 0. The proof of these facts forms Exercise 1.6. 1
We assume that the reader is familiar with the notion of a stopping time for a Markov process. By definition, the random time τ is a stopping time with respect to the filtration {Gt : t ≥ 0} if for all t ≥ 0, {τ ≤ t} ∈ Gt .
2
The Strong Markov Property will be dealt with in more detail for a general L´evy process in Chap. 3.
10
1 L´evy Processes and Applications
1.2.6 Stable Processes Stable processes are the class of L´evy processes whose characteristic exponents correspond to those of stable distributions. Stable distributions were introduced by L´evy (1924, 1925) as a third example of infinitely divisible distributions after Gaussian and Poisson distributions. A random variable, Y , is said to have a stable distribution if for all n ≥ 1 it observes the distributional equality d (1.5) Y1 + · · · + Yn = an Y + bn ,
where Y1 , . . . , Yn are independent copies of Y , an > 0 and bn ∈ R. By subtracting bn /n from each of the terms on the left-hand side of (1.5) one sees in particular that this definition implies that any stable random variable is infinitely divisible. It turns out that necessarily an = n1/α for α ∈ (0, 2]; see Feller (1971), Sect. VI.1. In that case we refer to the parameter α as the index. A smaller class of distributions are the strictly stable distributions. A random variable Y is said to have a strictly stable distribution if it observes (1.5) but with bn = 0. In that case, we necessarily have d
Y1 + · · · + Yn = n1/α Y.
(1.6)
The case α = 2 corresponds to zero mean Gaussian random variables and is excluded in the remainder of the discussion as it has essentially been dealt with in Sect. 1.2.3. Stable random variables observing the relation (1.5) for α ∈ (0, 1) ∪ (1, 2) have characteristic exponents of the form πα sgn θ) + iθη, (1.7) Ψ (θ) = c|θ|α (1 − iβ tan 2 where β ∈ [−1, 1], η ∈ R and c > 0. Stable random variables observing the relation (1.5) for α = 1, have characteristic exponents of the form 2 Ψ (θ) = c|θ|(1 + iβ sgn θ log |θ|) + iθη, π
(1.8)
where β ∈ [−1, 1] η ∈ R and c > 0. Here we work with the definition of the sign function sgn θ = 1(θ>0) − 1(θ<0) . To make the connection with the L´evy–Khintchine formula, one needs σ = 0 and c1 x−1−α dx for x ∈ (0, ∞) Π (dx) = (1.9) c2 |x|−1−α dx for x ∈ (−∞, 0), where c = c1 + c2 , c1 , c2 ≥ 0 and β = (c1 − c2 )/(c1 + c2 ) if α ∈ (0, 1) ∪ (1, 2) and c1 = c2 if α = 1. The choice of a ∈ R in the L´evy–Khintchine formula is then implicit. Exercise 1.4 shows how to make the connection between Π and Ψ with the right choice of a (which depends on α). Unlike the previous examples, the distributions that lie behind these characteristic exponents are heavy tailed in the sense that the tails of their distributions decay slowly enough to zero so that they only have moments strictly less than α. The
1.2 Some Examples of L´evy Processes
11
value of the parameter β gives a measure of asymmetry in the L´evy measure and likewise for the distributional asymmetry (although this latter fact is not immediately obvious). The densities of stable processes are known explicitly in the form of convergent power series. See Zolotarev (1986), Sato (1999) and (Samorodnitsky and Taqqu, 1994) for further details of all the facts given in this paragraph. With the exception of the defining property (1.6) we shall generally not need detailed information on distributional properties of stable processes in order to proceed with their fluctuation theory. This explains the reluctance to give further details here. Two examples of the aforementioned power series that tidy up to more compact expressions are centred Cauchy distributions, corresponding to α = 1, β = 0 and η = 0, and stable- 12 distributions, corresponding to α = 1/2, β = 1 and η = 0. In the former case, Ψ (θ) = c|θ| for θ ∈ R and its law is given by 1 c dx (1.10) π (x2 + c2 ) for x ∈ R. In the latter case, Ψ (θ) = c|θ|1/2 (1 − isgn θ) for θ ∈ R and its law is given by 2 c √ e−c /2x dx. 3 2πx Note then that an inverse Gaussian distribution coincides with a stable- 12 distribution for a = c and b = 0. Suppose that S(c, α, β, η) is the distribution of a stable random variable with parameters c, α, β and η. For each choice of c > 0, α ∈ (0, 2), β ∈ [−1, 1] and η ∈ R Theorem 1.6 tells us that there exists a L´evy process, with characteristic exponent given by (1.7) or (1.8) according to this choice of parameters. Further, from the definition of its characteristic exponent it is clear that at each fixed time the α-stable process will have distribution S(ct, α, β, η). In this text, we shall henceforth make an abuse of notation and refer to an α-stable process to mean a L´evy process based on a strictly stable distribution.
Necessarily this means that the associated characteristic exponent takes the form c|θ|α (1 − iβ tan πα 2 sgn θ) for α ∈ (0, 1) ∪ (1, 2) Ψ (θ) = c|θ| + iη. for α = 1, where the parameter ranges for c and β are as above. The reason for the restriction to strictly stable distribution is essentially that we shall want to make use of the following fact. If {Xt : t ≥ 0} is an α-stable process, then from its characteristic exponent (or equivalently the scaling properties of strictly stable random variables) we see that for all λ > 0 {Xλt : t ≥ 0} has the same law as {λ1/α Xt : t ≥ 0}.
12
1 L´evy Processes and Applications
1.2.7 Other Examples There are many more known examples of infinitely divisible distributions (and hence L´evy processes). Of the many known proofs of infinitely divisibility for specific distributions, most of them are non-trivial, often requiring intimate knowledge of special functions. A brief list of such distributions might include generalised inverse Gaussian (see Good (1953) and Jørgensen (1982)), truncated stable (see Tweedie (1984), Hougaard (1986), Koponen (1995), Boyarchenko and Levendorskii (2002a) and Carr et al. (2003)), generalised hyperbolic (see Halgreen (1979)), Meixner (see Schoutens and Teugels (1998)), Pareto (see Steutel (1970) and Thorin (1977a)), F -distributions (see Ismail (1979)), Gumbel (see Johnson and Kotz (1970) and Steutel (1973)), Weibull (see Johnson and Kotz (1970) and Steutel (1970)), lognormal (see Thorin (1977b)) and Student t-distribution (see Grosswald (1976) and Ismail (1977)). Despite our being able to identify a large number of infinitely divisible distributions and hence associated L´evy processes, it is not clear at this point what the paths of L´evy processes look like. The task of giving a mathematically precise account of this lies ahead in Chap. 2. In the meantime let us make the following informal remarks concerning paths of L´evy processes. Exercise 1.1 shows that a linear combination of a finite number of independent L´evy processes is again a L´evy process. It turns out that one may consider any L´evy process as an independent sum of a Brownian motion with drift and a countable number of independent compound Poisson processes with different jump rates, jump distributions and drifts. The superposition occurs in such a way that the resulting path remains almost surely finite at all times and, for each ε > 0, the process experiences at most a countably infinite number of jumps of magnitude ε or less with probability one and an almost surely finite number of jumps of magnitude greater than ε, over all fixed finite time intervals. If in the latter description there is always an almost surely finite number of jumps over each fixed time interval then it is necessary and sufficient that one has the linear independent combination of a Brownian motion with drift and a compound Poisson process. Depending on the underlying structure of the jumps and the presence of a Brownian motion in the described linear combination, a L´evy process will either have paths of bounded variation on all finite time intervals or paths of unbounded variation on all finite time intervals. Below we include five computer simulations to give a rough sense of how the paths of L´evy processes look. Figs. 1.1 and 1.2 depict the paths of Poisson process and a compound Poisson process, respectively. Figs. 1.3 and 1.4 show the paths of a Brownian motion and the independent sum of a Brownian motion and a compound Poisson process, respectively. Finally Figs. 1.5 and 1.6 show the paths of a variance gamma process and a normal inverse Gaussian processes. Both are pure jump processes (no Brownian component as described above). Variance gamma processes are discussed in more detail later in Sect. 2.7.3 and Exercise 1.5, normal inverse Gaussian
1.2 Some Examples of L´evy Processes
13
2.5
2.0
1.5
1.0
0.5
0.0 0.0
0.2
0.4
0.6
0.8
1.0 iθ
Fig. 1.1. A sample path of a Poisson process; Ψ (θ) = λ(1 − e ) where λ is the jump rate.
0.8 0.6 0.4 0.2 0.0 −0.2 −0.4 0.0
0.2
0.4
0.6
0.8
1.0
Fig. 1.2. A sample path of a compound Poisson process; Ψ (θ) = λ R (1−eiθx )F (dx) where λ is the jump rate and F is the common distribution of the jumps.
processes are L´evy processes whose jump measure is given by Π(dx) = (δα/π|x|) exp{βx}K1 (α|x|)dx for x ∈ R where α, δ > 0, β ≤ |α| and K1 (x) is the modified Bessel function of the third kind with index 1 (the precise definition of the latter is not worth the detail at this moment in the text). Both experience an infinite number of jumps over a finite time horizon. However, variance gamma processes have paths of bounded variation whereas normal inverse Gaussian processes have paths of unbounded variation. The reader should be warned however that computer simulations ultimately can only
14
1 L´evy Processes and Applications 0.2
0.1
0.0
−0.1
0.0
0.2
0.4
0.6
0.8
1.0
Fig. 1.3. A sample path of a Brownian motion; Ψ (θ) = θ2 /2. 0.4
0.3
0.2
0.1
0.0
−0.1 0.0
0.2
0.4
0.6
0.8
1.0
Fig. 1.4. A sample path of the independent sum of a Brownian motion and a compound Poisson process; Ψ (θ) = θ2 /2 + R (1 − eiθx )F (dx).
depict a finite number of jumps in any given path. All figures were very kindly produced by Antonis Papapantoleon for the purpose of this text.
1.3 L´ evy Processes and Some Applied Probability Models In this section we introduce some classical applied probability models, which are structured around basic examples of L´evy processes. This section provides a particular motivation for the study of fluctuation theory that follows in
1.3 L´evy Processes and Some Applied Probability Models
15
0.2
0.0
−0.2
−0.4
0.0
0.2
0.4
0.6
0.8
1.0
Fig. 1.5. A sample path of a variance gamma processes. The latter has characteristic exponent given by Ψ (θ) = β log(1 − iθc/α + β 2 θ2 /2α) where c ∈ R and β > 0.
0.6
0.4
0.2
0.0
−0.2 −0.4 −0.6 0.0
0.2
0.4
0.6
0.8
1.0
Fig. path of a normal inverse Gaussian process; Ψ (θ) = 1.6. A sample δ( α2 − (β + iθ)2 − α2 − β 2 ) where α, δ > 0, |β| < α.
subsequent chapters. (There are of course other reasons for wanting to study fluctuation theory of L´evy processes.) With the right understanding of particular features of the models given below in terms of the path properties of the underlying L´evy processes, much richer generalisations of the aforementioned models may be studied for which familiar and new phenomena may be observed. At different points later on in this text we will return to these models and reconsider these phenomena in the light of the theory that has
16
1 L´evy Processes and Applications
been presented along the way. In particular all of the results either stated or alluded to below will be proved in greater generality in later chapters. 1.3.1 Cram´ er–Lundberg Risk Process Consider the following model of the revenue of an insurance company as a process in time proposed by Lundberg (1903). The insurance company collects premiums at a fixed rate c > 0 from its customers. At times of a Poisson process, a customer will make a claim causing the revenue to jump downwards. The size of claims is independent and identically distributed. If we call Xt the capital of the company at time t, then the latter description amounts to Xt = x + ct −
Nt i=1
ξi , t ≥ 0,
where x > 0 is the initial capital of the company, N = {Nt : t ≥ 0} is a Poisson process with rate λ > 0, and {ξi : i ≥ 1} is a sequence of positive, independent and identically distributed random variables also independent of N . The process X = {Xt : t ≥ 0} is nothing more than a compound Poisson process with drift of rate c, initiated from x > 0. Financial ruin in this model (or just ruin for short) will occur if the revenue of the insurance company drops below zero. Since this will happen with probability one if P(lim inf t↑∞ Xt = −∞) = 1, an additional assumption imposed on the model is that lim Xt = ∞.
t↑∞
A sufficient condition to guarantee the latter is that the distribution of ξ has finite mean, say µ > 0, and that λµ < 1, c the so-called net profit condition. To see why this presents a sufficient condition, note that the Strong Law of Large Numbers and the obvious fact that limt↑∞ Nt = ∞ imply that Xt lim = lim t↑∞ t t↑∞
Nt x +c− t t
Nt
i=1 ξi
Nt
= c − λµ > 0,
Under the net profit condition it follows that ruin will occur only with probability less than one. Fundamental quantities of interest in this model thus become the distribution of the time to ruin and the deficit at ruin; otherwise identified as
1.3 L´evy Processes and Some Applied Probability Models
17
τ0− := inf{t > 0 : Xt < 0} and Xτ − on {τ0− < ∞} 0
when the process X drifts to infinity. The following classic result links the probability of ruin to the conditional distribution η(x) = P(−Xτ − ≤ x|τ0− < ∞). 0
Theorem 1.8 (Pollaczek–Khintchine formula). Suppose that λµ/c < 1. For all x ≥ 0, 1 − P(τ0− < ∞|X0 = x) = (1 − ρ) ρk η k∗ (x), (1.11) k≥0
where ρ = P(τ0− < ∞). Formula (1.11) is missing quite some details in the sense that we know nothing of the constant ρ, nor of the distribution η. It turns out that the unknowns ρ and η in the Pollaczek–Khintchine formula can be identified explicitly as the next theorem reveals. Theorem 1.9. In the Cram´er–Lundberg model (with λµ/c < 1), ρ = λµ/c and 1 x F (y, ∞)dy, (1.12) η(x) = µ 0 where F is the distribution of ξ1 .
This result can be derived by a classical path analysis of random walks. This analysis gives some taste of the general theory of fluctuations of L´evy processes that we will spend quite some time with in this book. The proof of Theorem 1.9 can be found in Exercise 1.8. The Pollaczek–Khintchine formula together with some additional assumptions on F gives rise to an interesting asymptotic behaviour of the probability of ruin. Specifically we have the following result. Theorem 1.10. Suppose that λµ/c < 1 and there exists a 0 < ν < ∞ such that E e−νX1 = 1, then P τ0− < ∞ ≤ e−νx
for all x > 0 where Px (·) denotes P(·|X0 = x). If further, the distribution of F is non-lattice, then lim e
x↑∞
νx
Px τ0−
<∞ =
λν c − λµ
0
∞
−1 xe F (x, ∞)dx νx
where the right-hand side should be interpreted as zero if the integral is infinite.
18
1 L´evy Processes and Applications
In the above theorem, the parameter ν is known as the Lundberg exponent. See Cram´er (1994a,b) for a review of the appearance of these results. In more recent times, authors have extended the idea of modelling with compound Poisson processes with drift and moved to more general classes of L´evy processes for which the measure Π is concentrated on (−∞, 0) and hence processes for which there are no positive jumps. See for example Huzak et al. (2004a,b), Chan (2004) and Kl¨ uppelberg et al. (2004). It turns out that working with this class of L´evy processes preserves the idea that the revenue of the insurance company is the aggregate superposition of lots of independent claims sequentially through time offset against a deterministic increasing process corresponding to the accumulation of premiums, even when there are an almost surely infinite number of jumps downwards (claims) in any fixed time interval. We will provide a more detailed interpretation of the latter class in Chap. 2. In Chaps. 4 and 7, amongst other things, we will also re-examine the Pollaczek–Khintchine formula and the asymptotic probability of ruin given in Theorem 1.10 in light of these generalised risk models. 1.3.2 The M/G/1 queue Let us recall the definition of the M/G/1 queue. Customers arrive at a service desk according to a Poisson process and join a queue. Customers have service times that are independent and identically distributed. Once served, they leave the queue. The workload, Wt , at each time t ≥ 0, is defined to be the time it will take a customer who joins the back of the queue at that moment to reach the service desk, that is to say the amount of processing time remaining in the queue at time t. Suppose that at an arbitrary moment, which we shall call time zero, the server is not idle and the workload is equal to w > 0. On the event that t is before the first time the queue becomes empty, we have that Wt is equal to Nt ξi − t, (1.13) w+ i=1
where, as with the Cram´er–Lundberg risk process, N = {Nt : t ≥ 0} is a Poisson process with intensity λ > 0 and {ξi : i ≥ 0} are positive random variables that are independent and identically distributed with common distribution F and mean µ < ∞. The process N represents the arrivals of new customers and {ξi : i ≥ 0} are understood as their respective service times that are added to the workload. The negative unit drift simply corresponds to the decrease in time as the server deals with jobs. Thanks to the lack of memory property, once the queue becomes empty, the queue remains empty for an exponentially distributed period of time with parameter λ after which a new arrival incurs a jump in W, which has distribution F . The process proceeds as the compound Poisson process described above until the queue next empties and so on.
1.3 L´evy Processes and Some Applied Probability Models
19
The workload is clearly not a L´evy process as it is impossible for Wt : t ≥ 0 to decrease in value from the state zero where as it can decrease in value from any other state x > 0. However, it turns out that it is quite easy to link the workload to a familiar functional of a L´evy process, which is also a Markov process. Specifically, suppose we define Xt equal to precisely the same L´evy process given in the Cram´er–Lundberg risk model with c = 1 and x = 0, then Wt = (w ∨ X t ) − Xt , t ≥ 0, where the process X := {X t : t ≥ 0} is the running supremum of X, hence X t = supu≤t Xu . Whilst it is easy to show that the pair (X, X) is a Markov process, with a little extra work it can be shown that W is a Strong Markov Process (this is dealt with in more detail in Exercise 3.2). Clearly then, under P, the process W behaves like −X until the random time τw+ := inf{t > 0 : Xt > w}. The latter is in fact a stopping time since {τw+ ≤ t} = {X t ≥ w} belongs to the filtration generated by the process X. At the time τw+ , the process W = {Wt : t ≥ 0} first becomes zero and on account of the Strong Markov Property and the lack of memory property, it remains so for a period of time, which is exponentially distributed with parameter λ since during this period w ∨ X t = X t = Xt . At the end of this period, X makes another negative jump distributed according to F and hence W makes a positive jump with the same distribution and so on thus matching the description in the previous paragraph; see Fig. 1.7.
w
Process X
0
Process W
w 0 Busy period
Busy period
Fig. 1.7. Sample paths of X and W .
Busy period
20
1 L´evy Processes and Applications
Note that this description still makes sense when w = 0 in which case for an initial period of time, which is exponentially distributed, W remains equal to zero until X first jumps (corresponding to the first arrival in the queue). There are a number of fundamental points of interest concerning both local and global behavioural properties of the M/G/1 queue. Take for example the time it takes before the queue first empties; in other words τw+ . It is clear from a simple analysis of the paths of X and W that the latter is finite with probability one if the underlying process X drifts to infinity with probability one. Using similar reasoning to the previous example, with the help of the Strong Law of Large Numbers it is easy to deduce that this happens when λµ < 1. Another common situation of interest in this model corresponds to the case that the server is only capable of dealing with a maximum workload of z units of time. The first time the workload exceeds the buffer level z σz := inf{t > 0 : Wt > z} therefore becomes of interest. In particular the probability of {σz < τw+ } which corresponds to the event that the workload exceeds the buffer level before the server can complete a busy period. The following two theorems give some classical results concerning the idle time of the M/G/1 queue and the stationary distribution of the work load. Roughly speaking they say that when there is heavy traffic (λµ > 1) eventually the queue never becomes empty and the workload grows to infinity and the total time that the queue remains empty is finite with a particular distribution. Further, when there is light traffic (λµ < 1) the queue repeatedly becomes empty and the total idle time grows to infinity whilst the workload process converges in distribution. At the critical value λµ = 1 the workload grows to arbitrary large values but nonetheless the queue repeatedly becomes empty and the total idle time grows to infinity. Ultimately all these properties are a reinterpretation of the long-term behaviour of a special class of reflected L´evy processes. Theorem 1.11. Suppose that W is the workload of an M/G/1 queue with arrival rate λ and service distribution F having mean µ. Define the total idle time ∞ I=
0
1(Wt =0) dt.
(i) Suppose that λµ > 1. Let
ψ(θ) = θ − λ
(0,∞)
(1 − e−θx )F (dx), θ ≥ 0,
and define θ∗ to be the largest root of the equation ψ(θ) = 0. Then3 P (I ∈ dx|W0 = w) = (1 − e−θ 3
∗
w
)δ0 (dx) + θ∗ e−θ
∗
(w+x)
dx.
Following standard notation, the measure δ0 assigns a unit atom to the point 0.
1.3 L´evy Processes and Some Applied Probability Models
21
(ii) If λµ ≤ 1 then I is infinite with probability one. Note that the function ψ given above is nothing more than the Laplace exponent of the underlying L´evy process Xt = t −
Nt i=1
ξi , t ≥ 0
which drives the process W and fulfils the relation ψ(θ) = log E(eθX1 ). It is easy to check by differentiating it twice that ψ is a strictly convex function, which is zero at the origin and tends to infinity at infinity. Further ψ ′ (0+) < 0 under the assumption λµ > 1 and hence θ∗ exists, is finite and is in fact the only solution to ψ(θ) = 0 other than θ = 0. Theorem 1.12. Let W be the same as in Theorem 1.11. (i) Suppose that λµ < 1. Then for all w ≥ 0 the virtual waiting time has a stationary distribution, lim P(Wt ≤ x|W0 = w) = (1 − ρ)
t↑∞
where η(x) =
1 µ
0
∞
ρk η ∗k (x),
k=0
x
F (y, ∞)dy and ρ = λµ.
(ii) If λµ ≥ 1 then lim supt↑∞ Wt = ∞ with probability one. Some of the conclusions in the above two theorems can already be obtained with basic knowledge of compound Poisson processes. Theorem 1.11 is proved in Exercise 1.9 and gives some feeling of the fluctuation theory that will be touched upon later on in this text. The remarkable similarity between Theorem 1.12 part (i) and the Pollaczek–Khintchine formula is of course no coincidence. The principles that are responsible for the latter two results are embedded within the general fluctuation theory of L´evy processes. Indeed we will revisit Theorems 1.11 and 1.12 but for more general versions of the workload process of the M/G/1 queue known as general storage models. Such generalisations involve working with a general class of L´evy process with no positive jumps (that is Π(0, ∞) = 0) and defining as before Wt = (w ∨ X t ) − Xt . When there are an infinite number of jumps in each finite time interval the latter process may be thought of as modelling a processor that deals with an arbitrarily large number of small jobs and occasional large jobs. The precise interpretation of such a generalised M/G/1 workload process and issues concerning the distribution of the busy period, the stationary distribution of the workload, time to buffer overflow and other related quantities will be dealt with later on in Chaps. 2, 4 and 8.
22
1 L´evy Processes and Applications
1.3.3 Optimal Stopping Problems A fundamental class of problems motivated by applications from physics, optimal control, sequential testing and economics (to name but a few) concern optimal stopping problems of the form: Find v(x) and a stopping time, τ ∗ , belonging to a specified family of stopping times, T , such that ∗
v(x) = sup Ex (e−qτ G(Xτ )) = Ex (e−qτ G(Xτ ∗ ))
(1.14)
τ ∈T
for all x ∈ R ⊆ R, where X is a R-valued Markov process with probabilities {Px : x ∈ R} (with the usual understanding that Px is the law of X given that X0 = x), q ≥ 0 and G : R → [0, ∞) is a function suitable to the application at hand. The optimal stopping problem (1.14) is not the most general class of such problems that one may consider but will suffice for the discussion at hand. In many cases it turns out that the optimal strategy takes the form τ ∗ = inf{t > 0 : (t, Xt ) ∈ D}, where D ⊂ [0, ∞) × R is a domain in time–space called the stopping region. Further still, there are many examples within the latter class for which D = [0, ∞) × I where I is an interval or the complement of an interval. In other words the optimal strategy is the first passage time into I, τ ∗ = inf{t > 0 : Xt ∈ I}.
(1.15)
A classic example of an optimal stopping problem in the form (1.14) for which the solution agrees with (1.15) is the following taken from McKean (1965), v(x) = sup Ex (e−qτ (K − eXτ )+ ),
(1.16)
τ ∈T
where now q > 0, T is the family of stopping times with respect to the filtration Ft := σ(Xs : s ≤ t) and {Xt : t ≥ 0} is a linear Brownian motion, Xt = σBt + γt, t ≥ 0 (see Sect. 1.2.3). Note that we use here the standard notation y + = y ∨ 0. This particular example models the optimal time to sell a risky asset for a fixed value K when the asset’s dynamics are those of an exponential linear Brownian motion. Optimality in this case is determined via the expected discounted gain at the selling time. On account of the underlying source of randomness being Brownian motion and the optimal strategy taking the simple form (1.15), the solution to (1.16) turns out to be explicitly computable as follows. Theorem 1.13. The solution (v, τ ∗ ) to (1.16) is given by τ ∗ = inf{t > 0 : Xt < x∗ },
1.3 L´evy Processes and Some Applied Probability Models
where ∗
ex = K
23
Φ(q) , 1 + Φ(q)
Φ(q) = ( γ 2 + 2σ 2 q + γ)/σ 2 and (K − ex ) if x < x∗ ∗ ∗ v(x) = (K − ex )e−Φ(q)(x−x ) if x ≥ x∗ . The solution to this problem reflects the intuition that the optimal time to stop should be at a time when X is as negative as possible taking into consideration that taking too long to stop incurs an exponentially weighted penalty. Note that in (−∞, x∗ ) the value function v(x) is equal to the gain function (K − ex )+ as the optimal strategy τ ∗ dictates that one should stop immediately. A particular curiosity of the solution to (1.16) is the fact that at x∗ , the value function v joins smoothly to the gain function. In other words, ∗
v ′ (x∗ −) = −ex = v ′ (x∗ +). A natural question in light of the above optimal stopping problem is whether one can characterise the solution to (1.16) when X is replaced by a general L´evy process. Indeed, if the same strategy of first passage below a specified level is still optimal, one is then confronted with needing information about the distribution of the overshoot of a L´evy process when first crossing below a barrier in order to compute the function v. The latter is of particular interest if one would like to address the question as to whether the phenomenon of smooth fit is still to be expected in the general L´evy process setting. Later in Chap. 9 we give a brief introduction to some general principles appearing in the theory of optimal stopping and apply them to a handful of examples where the underlying source of randomness is provided by a L´evy process. The first of these examples being the generalisation of (1.16) as mentioned above. All of the examples presented in Chap. 9 can be solved (semi-) explicitly thanks to a degree of simplicity in the optimal strategy such as (1.15) coupled with knowledge of fluctuation theory of L´evy processes. In addition, through these examples, we will attempt to give some insight into how and when smooth pasting occurs as a consequence of a subtle type of path behaviour of the underlying L´evy process. 1.3.4 Continuous-State Branching Processes Originating in part from the concerns of the Victorian British upper classes that aristocratic surnames were becoming extinct, the theory of branching processes now forms a cornerstone of classical applied probability. Some of the earliest work on branching processes dates back to Watson and Galton (1874). However, approximately 100 years later, it was discovered by Heyde
24
1 L´evy Processes and Applications
and Seneta (1977) that the less well-exposed work of I.J. Bienaym´e, dated around 1845, contained many aspects of the later work of Galton and Watson. The Bienaym´e–Galton–Watson process, as it is now known, is a discrete time Markov chain with state space {0, 1, 2, ...} described by the sequence {Zn : n = 0, 1, 2, ...} satisfying the recursion Z0 > 0 and Zn−1
Zn =
(n)
ξi
i=1
for n = 1, 2, ... where {ξ (n) : i = 1, 2, ...} are independent and exponentially 0 distributed on {0, 1, 2, ...}. We use the usual notation i=1 to represent the empty sum. The basic idea behind this model is that Zn is the population count in the nth generation and from an initial population Z0 (which may be randomly distributed) individuals reproduce asexually and independently with the same distribution of numbers of offspring. The latter reproductive properties are referred to as the branching property. Note that as soon as Zn = 0 it follows from the given construction that Zn+k = 0 for all k = 1, 2, ... A particular consequence of the branching property is that if Z0 = a + b then (1) (2) (2) (1) Zn is equal in distribution to Zn + Zn where Zn and Zn are independent with the same distribution as an nth generation Bienaym´e–Galton–Watson process initiated from population sizes a and b, respectively. A mild modification of the Bienaym´e–Galton–Watson process is to set it into continuous time by assigning life lengths to each individual which are independent and identically distributed with parameter λ > 0. Individuals reproduce at their moment of death in the same way as described previously for the Bienaym´e-Galton-Watson process. If Y = {Yt : t ≥ 0} is the {0, 1, 2, ....}valued process describing the population size then it is straightforward to see that the lack of memory property of the exponential distribution implies that for all 0 ≤ s ≤ t, Ys (i) Yt−s , Yt = i=1
(i)
where given {Yu : u ≤ s} the variables {Yt−s : i = 1, ..., Ys } are independent with the same distribution as Yt−s conditional on Y0 = 1. In that case, we may talk of Y as a continuous-time Markov chain on {0, 1, 2, ...}, with probabilities, say, {Py : y = 0, 1, 2, ...} where Py is the law of Y under the assumption that Y0 = y. As before, the state 0 is absorbing in the sense that if Yt = 0 then Yt+u = 0 for all u > 0. The process Y is called the continuous time Markov branching process. The branching property for Y may now be formulated as follows. Definition 1.14 (Branching property). For any t ≥ 0 and y1 , y2 in the state space of Y , Yt under Py1 +y2 is equal in law to the independent sum (1) (2) (i) Yt + Yt where the distribution of Yt is equal to that of Yt under Pyi for i = 1, 2. So far there appears to be little connection with L´evy processes. However a remarkable time transformation shows that the path of Y is intimately linked
1.3 L´evy Processes and Some Applied Probability Models
25
to the path of a compound Poisson process with jumps whose distribution is supported in {−1, 0, 1, 2, ...}, stopped at the first instant that it hits zero. To explain this in more detail let us introduce the probabilities {πi : i = −1, 0, 1, 2, ...}, where πi = P (ξ = i + 1) and ξ has the same distribution as the typical family size in the Bienaym´e–Galton–Watson process. To avoid complications let us assume that π0 = 0 so that a transition in the state of Y always occurs when an individual dies. When jumps of Y occur, they are independent and always distributed according to {πi : i = −1, 0, 1, ...}. The idea now is to adjust time accordingly with the evolution of Y in such a way that these jumps are spaced out with inter-arrival times that are independent and exponentially distributed. Crucial to the following exposition is the simple and well-known fact that the minimum of n ∈ {1, 2, ...} independent and exponentially distributed random variables is exponentially distributed with parameter λn. Further, that if eα is exponentially distributed with parameter α > 0 then for β > 0, βeα is equal in distribution to eα/β . Write for t ≥ 0, t Jt = Yu du 0
set
ϕt = inf{s ≥ 0 : Js > t} with the usual convention that inf ∅ = ∞ and define Xt = Yϕt
(1.17)
with the understanding that when ϕt = ∞ we set Xt = 0. Now observe that when Y0 = y ∈ {1, 2, ...} the first jump of Y occurs at a time, say T1 (the minimum of y independent exponential random variables, each with parameter λ > 0) which is exponentially distributed with parameter λy and the size of the jump is distributed according to {πi : i = −1, 0, 1, 2, ...}. However, note that JT1 = yT1 is the first time that the process X = {Xt : t ≥ 0} jumps. The latter time is exponentially distributed with parameter λ. The jump at this time is independent and distributed according to {πi : i = −1, 0, 1, 2, ...}. Given the information G1 = σ(Yt : t ≤ T1 ), the lack of memory property implies that the continuation {YT1 +t : t ≥ 0} has the same law as Y under Py with y = YT1 . Hence if T2 is the time of the second jump of Y then conditional on G1 we have that T2 − T1 is exponentially distributed with parameter λYT1 and JT2 − JT1 = YT1 (T2 − T1 ) which is again exponentially distributed with parameter λ and further, is independent of G1 . Note that JT2 is the time of the second jump of X and the size of the second jump is again independent and distributed according to {πi : i = −1, 0, 1, ...}. Iterating in this way it becomes clear that X is nothing more than a compound Poisson process with arrival rate λ and jump distribution F (dx) =
∞
i=−1
stopped on first hitting the origin.
πi δi (dx)
(1.18)
26
1 L´evy Processes and Applications
A converse to this construction is also possible. Suppose now that X = {Xt : t ≥ 0} is a compound ∞ Poisson process with arrival rate λ > 0 and jump distribution F (dx) = i=−1 πi δi (dx). Write It =
0
t
Xu−1 du
and set θt = inf{s ≥ 0 : Is > t}.
(1.19)
again with the understanding that inf ∅ = ∞. Define Yt = Xθt ∧τ − 0
where τ0− = inf{t > 0 : Xt < 0}. By analysing the behaviour of Y = {Yt : t ≥ 0} at the jump times of X in a similar way to above one readily shows that the process Y is a continuous time Markov branching process. The details are left as an exercise to the reader. The relationship between compound Poisson processes and continuous time Markov branching processes described above turns out to have a much more general setting. In the work of Lamperti (1967a, 1976b) it is shown that there exists a correspondence between a class of branching processes called continuous-state branching processes and L´evy processes with no negative jumps (Π(−∞, 0) = 0). In brief, a continuous-state branching process is a [0, ∞)-valued Markov process having paths that are right continuous with left limits and probabilities {Px : x > 0} that satisfy the branching property in Definition 1.14. Note in particular that now the quantities y1 and y2 may be chosen from the non-negative real numbers. Lamperti’s characterisation of continuous-state branching processes shows that they can be identified as time changed L´evy processes with no negative jumps precisely via the transformations given in (1.17) with an inverse transformation analogous to (1.19). We explore this relationship in more detail in Chap. 10 by looking at issues such as explosion, extinction and conditioning on survival.
Exercises 1.1. Using Definition 1.1, show that the sum of two (or indeed any finite number of) independent L´evy processes is again a L´evy process. 1.2. Suppose that S = {Sn : n ≥ 0} is any random walk and Γp is an independent random variable with a geometric distribution on {0, 1, 2, ...} with parameter p. (i) Show that Γp is infinitely divisible. (ii) Show that SΓp is infinitely divisible.
1.3 Exercises
27
1.3 (Proof of Lemma 1.7). In this exercise we derive the Frullani identity. (i) Show for any function f such that f ′ exists and is continuous and f (0) and f (∞) are finite, that
∞ b f (ax) − f (bx) dx = (f (0) − f (∞)) log , x a 0 where b > a > 0. (ii) By choosing f (x) = e−x , a = α > 0 and b = α − z where z < 0, show that ∞ −αx 1 − (1−ezx ) β dx xe 0 = e β (1 − z/α) and hence by analytic extension show that the above identity is still valid for all z ∈ C such that ℜz ≤ 0. 1.4. Establishing formulae (1.7) and (1.8) from the L´evy measure given in (1.9) is the result of a series of technical manipulations of special integrals. In this exercise we work through them. In the following text we will use the gamma function Γ (z), defined by ∞ tz−1 e−t dt Γ (z) = 0
for z > 0. Note the gamma function can also be analytically extended so that it is also defined on R\{0, −1, −2, ...} (see Lebedev (1972)). Whilst the specific definition of the gamma function for negative numbers will not play an important role in this exercise, the following two facts that can be derived from it will. For z ∈ R\{0, −1, −2, ...}√the gamma function observes the recursion Γ (1 + z) = zΓ (z) and Γ (1/2) = π. (i) Suppose that 0 < α < 1. Prove that for u > 0, ∞ (e−ur − 1)r−α−1 dr = Γ (−α)uα 0
and show that the same equality is valid when −u is replaced by any complex number w = 0 with ℜw ≤ 0. Conclude by considering w = i that ∞ (1 − eir )r−α−1 dr = −Γ (−α)e−iπα/2 (1.20) 0
as well as the complex conjugate of both sides being equal. Deduce (1.7) by considering the integral ∞ (1 − eiξθr )r−α−1 dr 0
for ξ = ±1 and θ ∈ R. Note that you will have to take a = η − x1(|x|<1) Π (dx), which you should check is finite. R
28
1 L´evy Processes and Applications
(ii) Now suppose that α = 1. First prove that
1 − cos θ eiθx (1 − |x|)dx = 2 θ2 |x|<1 for θ ∈ R and hence by Fourier inversion, ∞ 1 − cos r π dr = . 2 r 2 0 Use this identity to show that for z > 0, ∞ π 1 (1 − eirz + izr1(r<1) ) 2 dr = z + iz log z − ikz r 2 0 for some constant k ∈ R. By considering the complex conjugate of the above integral establish the expression in (1.8). Note that you will need a different choice of a to part (i). (iii) Now suppose that 1 < α < 2. Integrate (1.20) by parts to reach ∞ (eir − 1 − ir)r−α−1 dr = Γ (−α)e−iπα/2 . 0
Consider the above integral for z = ξθ, where ξ = ±1 and θ ∈ R and deduce the identity (1.7) in a similar manner to the proof in (i) and (ii). 1.5. Prove for any θ ∈ R that exp{iθXt + tΨ (θ)}, t ≥ 0 is a martingale where {Xt : t ≥ 0} is a L´evy process with characteristic exponent Ψ . 1.6. In this exercise we will work out in detail the features of the inverse Gaussian process discussed earlier on in this chapter. Recall that τ = {τs : s ≥ 0} is a non-decreasing L´evy process defined by τs = inf{t ≥ 0 : Bt + bt > s}, s ≥ 0, where B = {Bt : t ≥ 0} is a standard Brownian motion and b > 0. (i) Argue along the lines of Exercise 1.5 to show that for each λ > 0, 1
2
eλBt − 2 λ t , t ≥ 0 is a martingale. Use Doob’s Optimal Stopping Theorem to obtain 1
2
E(e−( 2 λ
+bλ)τs
) = e−λs .
Use analytic extension to deduce further that τs has characteristic exponent Ψ (θ) = s( −2iθ + b2 − b) for all θ ∈ R.
1.3 Exercises
29
2
(ii) Defining the measure Π(dx) = (2πx3 )−1/2 e−xb /2 dx on x > 0, check using (1.20) from Exercise 1.4 that ∞ (1 − eiθx )Π(dx) = Ψ (θ) 0
for all θ ∈ R. Confirm that the triple (a, σ, Π) in the L´evy–Khintchine b 2 formula are thus σ = 0, Π as above and a = −2sb−1 0 (2π)−1/2 e−y /2 dy. (iii) Taking 2 −1 2 1 s µs (dx) = √ esb e− 2 (s x +b x) dx 2πx3 on x > 0 show that ∞ ∞ √ √ s 2 − 1 ( √s − (b2 +2λ)x)2 √ e−λx µs (dx) = ebs−s b +2λ e 2 x dx 2πx3 0 0 ∞ √ √ 2λ + b2 − 21 ( √su − (b2 +2λ)u)2 bs−s b2 +2λ e =e du. 2πu 0 Hence by adding the last two integrals together deduce that ∞ √ 2 e−λx µs (dx) = e−s( b +2λ−b) 0
confirming both that µs (dx) is a probability distribution as well as being the probability distribution of τs . 1.7. Show that for a simple Brownian motion B = {Bt : t > 0} the first passage process τ = {τs : s > 0} (where τs = inf{t ≥ 0 : Bt ≥ s}) is a stable process with parameters α = 1/2 and β = 1. 1.8 (Proof of Theorem 1.9). As we shall see in this exercise, the proof of Theorem 1.9 follows from the proof of a more general result given by the conclusion of parts (i)–(v) below for random walks. (i) Suppose that S = {Sn : n ≥ 0} is a random walk with S0 = 0 and jump distribution µ. By considering the variables Sk∗ := Sn − Sn−k for k = 0, 1, ..., n and noting that the joint distributions of (S0 , ..., Sn ) and (S0∗ , ..., Sn∗ ) are identical, show that for all y > 0 and n ≥ 1, P (Sn ∈ dy and Sn > Sj for j = 0, ..., n − 1) = P (Sn ∈ dy and Sj > 0 for j = 1, ..., n). [Hint: it may be helpful to draw a diagram of the path of the first n steps of S and to rotate it by 180◦ .] (ii) Define T0− = inf{n > 0 : Sn ≤ 0} and T0+ = inf{n > 0 : Sn > 0}.
30
1 L´evy Processes and Applications
By summing both sides of the equality P (S1 > 0, ..., Sn > 0, Sn+1 ∈ dx) = P (S1 > 0, ..., Sn > 0, Sn ∈ dy)µ(dx − y) (0,∞)
over n show that for x ≤ 0, P (ST − ∈ dx) = 0
[0,∞)
V (dy)µ(dx − y),
where for y ≥ 0, V (dy) = δ0 (dy) +
n≥1
P (Hn ∈ dy)
and H = {Hn : n ≥ 0} is a random walk with H0 = 0 and step distribution given by P (ST + ∈ dz) for z ≥ 0. 0 (iii) Embedded in the Cram´er–Lundberg model is a random walk S whose increments are equal in distribution to the distribution of ceλ − ξ1 , where eλ is an independent exponential random variable with mean 1/λ. Noting (using obvious notation) that ceλ has the same distribution as eβ where β = λ/c show that the step distribution of this random walk satisfies
∞ e−βu F (du) e−βz for z ≥ 0 µ(z, ∞) = 0
and µ(−∞, −z) = E(F (eβ + z)) for z > 0, where F is the tail of the distribution function F of ξ1 and E is expectation with respect to the random variable eβ . (iv) Since upward jumps are exponentially distributed in this random walk, use the lack of memory property to reason that V (dy) = δ0 (dy) + βdy. Hence deduce from part (iii) that P (−ST − > z) = E F (eβ ) + 0
∞
x
βF (eβ + z)dz
and so by writing out the latter with the density of the exponential distribution, show that the conclusions of Theorem 1.9 hold.
1.3 Exercises
31
1.9 (Proof of Theorem 1.11). Suppose that X is a compound Poisson process of the form Nt ξi , Xt = t − i=1
where the process N = {Nt : t ≥ 0} is a Poisson process with rate λ > 0 and {ξi : i ≥ 1} positive, independent and identically distributed with common distribution F having mean µ. (i) Show by analytic extension from the L´evy–Khintchine formula or otherwise that E(eθXt ) = eψ(θ)t for all θ ≥ 0, where ψ(θ) = θ − λ (1 − e−θx )F (dx). (0,∞)
Show that ψ is strictly convex, is equal to zero at the origin and tends to infinity at infinity. Further, show that ψ(θ) = 0 has one additional root in [0, ∞) other than θ = 0 if and only if ψ ′ (0) < 0. θ∗ X
+
(ii) Show that {eθXt −ψ(θ)t : t ≥ 0} is a martingale and hence so is {e t∧τx : t ≥ 0} where τx+ = inf{t > 0 : Xt > x}, x > 0 and θ∗ is the largest root described in the previous part of the question. Show further that P(X ∞ > x) = e−θ
∗
x
for all x > 0. (iii) Show that for all t ≥ 0,
0
t
1(Ws =0) ds = (X t − w) ∨ 0,
where Wt = (w ∨ X t∞) − Xt . (iv) Deduce that I := 0 1(Ws =0) ds = ∞ if λµ ≤ 1. (v) Assume that λµ > 1. Show that P(I ∈ dx; τw+ = ∞|W0 = w) = (1 − e−θ
∗
w
)δ0 (dx).
Next use the lack of memory property to deduce that P(I ∈ dx; τw+ < ∞|W0 = w) = θ∗ e−θ
∗
(w+x)
dx.
1.10. Here we solve a slightly simpler optimal stopping problem than (1.16). Suppose, as in the aforementioned problem, that X is a linear Brownian motion with scaling parameter σ > 0 and drift γ ∈ R. Fix K > 0 and let −
v(x) = sup Ex (e−qτa (K − e a∈R
Xτ − + a
) ),
(1.21)
32
1 L´evy Processes and Applications
where τa− = inf{t > 0 : Xt < a}. (i) Following similar arguments to those in Exercise 1.5 shows that {exp{θXt − ψ(θ)t} : t ≥ 0} is a martingale, where ψ(θ) = σ 2 θ2 /2 + γθ. (ii) By considering the martingale in part (i) at the stopping time t ∧ τx+ and then letting t ↑ ∞, deduce that √ 2 + 2 2 E(e−qτx ) = e−x( γ +2σ q−γ)/σ and hence deduce that for a ≥ 0, −
E(e−qτ−a ) = e−a(
√
γ 2 +2σ 2 q+γ)/σ 2
.
−
(iii) Let v(x, a) = Ex (e−qτ−a (K − exp{Xτ − })). For each fixed x differentiate −a v(x, a) in the variable a and show that the solution to 1.21 is the same as the solution given in Theorem 1.13. 1.11. In this exercise, we characterise the Laplace exponent of the continuous time Markov branching process Y described in Sect. 1.3.4. (i) Show that for φ > 0 and t ≥ 0 there exists some function ut (φ) > 0 satisfying Ey (e−φYt ) = e−yut (φ) , where y ∈ {1, 2, ....}. (ii) Show that for s, t ≥ 0, ut+s (φ) = us (ut (φ)). (iii) Appealing to the infinitesimal behaviour of the Markov chain Y show that ∂ut (φ) = ψ(ut (φ)) ∂t and u0 (φ) = φ where ψ(q) = λ (1 − e−qx )F (dx) [−1,∞)
and F is given in (1.18).
2 The L´ evy–Itˆ o Decomposition and Path Structure
The main aim of this chapter is to establish a rigorous understanding of the structure of the paths of L´evy processes. The way we shall do this is to prove the assertion in Theorem 1.6 that given any characteristic exponent, Ψ , belonging to an infinitely divisible distribution, there exists a L´evy process with the same characteristic exponent. This will be done by establishing the socalled L´evy–Itˆo decomposition which describes the structure of a general L´evy process in terms of three independent auxiliary L´evy processes, each with different types of path behaviour. In doing so it will be necessary to digress temporarily into the theory of Poisson random measures and associated square integrable martingales. Understanding the L´evy–Itˆo decomposition will allow us to distinguish a number of important general subclasses of L´evy processes according to their path type. The chapter is concluded with a discussion of the interpretation of the L´evy–Itˆ o decomposition in the context of some of the applied probability models mentioned in Chap. 1.
2.1 The L´ evy–Itˆ o Decomposition According to Theorem 1.3, any characteristic exponent Ψ belonging to an infinitely divisible distribution can be written, after some simple reorganisation, in the form 1 2 2 Ψ (θ) = iaθ + σ θ 2 Π(dx) iθx + Π(R\(−1, 1)) (1 − e ) Π(R\(−1, 1)) |x|≥1 +
0<|x|<1
(1 − eiθx + iθx)Π(dx)
(2.1)
for all θ 2∈ R where a ∈ R, σ ≥ 0 and Π is a measure on R\{0} satisfying (1 ∧ x )Π(dx) < ∞. Note that the latter condition on Π implies that R
34
2 The L´evy–Itˆ o Decomposition and Path Structure
Π(A) < ∞ for all Borel A such that 0 is in the interior of Ac and particular that Π(R\(−1, 1)) ∈ [0, ∞). In the case that Π(R\(−1, 1)) = 0 one should think of the second bracket in (2.1) as absent. Call the three brackets in (2.1) Ψ (1) , Ψ (2) and Ψ (3) . The essence of the L´evy–Itˆo decomposition revolves around showing that Ψ (1) , Ψ (2) and Ψ (3) all correspond to the characteristic exponents of three different types of L´evy processes. Therefore Ψ may be considered as the characteristic exponent of the independent sum of these three L´evy processes which is again a L´evy process (cf. Exercise 1.1). Indeed, as we have already seen in Chap. 1, Ψ (1) and Ψ (2) correspond, respectively, to (1) a linear Brownian motion with drift, X (1) = {Xt : t ≥ 0} where (1)
Xt
= σBt − at, t ≥ 0 (2)
and a compound Poisson process, say X (2) = {Xt (2) Xt
=
Nt i=1
(2.2) : t ≥ 0}, where,
ξi , t ≥ 0,
(2.3)
{Nt : t ≥ 0} is a Poisson process with rate Π(R\(−1, 1)) and {ξi : i ≥ 1} are independent and identically distributed with distribution Π(dx)/Π(R\(−1, 1)) concentrated on {x : |x| ≥ 1} (unless Π(R\(−1, 1)) = 0 in which case X (2) is the process which is identically zero). The proof of existence of a L´evy process with characteristic exponent given by (2.1) thus boils down to showing the existence of a L´evy process, X (3) , whose characteristic exponent is given by Ψ (3) . Noting that (1 − eiθx + iθx)Π(dx) 0<|x|<1
=
n≥0
λn
2−(n+1) ≤|x|<2−n
+iθλn
(1 − eiθx )Fn (dx)
2−(n+1) ≤|x|<2−n
xFn (dx)
,
(2.4)
where λn = Π({x : 2−(n+1) ≤ |x| < 2−n }) and Fn (dx) = Π(dx)/λn (again with the understanding that the nth integral is absent if λn = 0). It would appear from (2.4) that the process X (3) consists of the superposition of (at most) a countable number of independent compound Poisson processes with different arrival rates and additional linear drift. To understand the mathematical sense of this superposition we shall need to establish some facts concerning Poisson random measures and related martingales. Hence Sects. 2.2 and 2.3 are dedicated to the study of the latter processes. The precise construction of X (3) is given in Sect. 2.5.
2.2 Poisson Random Measures
35
The identification of a L´evy process, X as the independent sum of processes X (1) , X (2) and X (3) is attributed to L´evy (1954) and Itˆ o (1942) (see also Itˆo (2004)) and is thus known as the L´evy–Itˆ o decomposition. Formally speaking and in a little more detail we quote the L´evy–Itˆo decomposition in the form of a theorem. Theorem 2.1. (L´evy–Itˆ o decomposition) Given any a ∈ R, σ ≥ 0 and measure Π concentrated on R\{0} satisfying (1 ∧ x2 )Π(dx) < ∞, R
there exists a probability space on which three independent L´evy processes exist, X (1) , X (2) and X (3) where X (1) is a linear Brownian motion with drift given by (2.2), X (2) is a compound Poisson process given by (2.3) and X (3) is a square integrable martingale with an almost surely countable number of jumps on each finite time interval which are of magnitude less than unity and with characteristic exponent given by Ψ (3) . By taking X = X (1) + X (2) + X (3) we see that the conclusion of Theorem 1.6 holds, that there exists a probability space on which a L´evy process is defined with characteristic exponent 1 Ψ (θ) = aiθ + σ 2 θ2 + (1 − eiθx + iθx1(|x|<1) )Π(dx) (2.5) 2 R for θ ∈ R.
2.2 Poisson Random Measures Poisson random measures turn out to be the right mathematical mechanism to describe the jump structure embedded in any L´evy process. Before engaging in an abstract study of Poisson random measures however, we give a rough idea of how they are related to the jump structure of L´evy processes by considering the less complicated case of a compound Poisson process. Suppose then that X = {Xt : t ≥ 0} is a compound Poisson process with a drift taking the form Xt = dt +
Nt i=1
ξi ,
t ≥ 0,
where d ∈ R and as usual {ξi : i ≥ 1} are independent and identically distributed random variable with common distribution function F . Further, let {Ti : i ≥ 0} be the times of arrival of the Poisson process N = {Nt : t ≥ 0} with rate λ > 0. See Fig. 2.1.
36
2 The L´evy–Itˆ o Decomposition and Path Structure
Fig. 2.1. The initial period of a sample path of a compound Poisson process with drift {Xt : t ≥ 0} and the field of points it generates.
2.2 Poisson Random Measures
37
Suppose now that we pick any set in A ∈ B[0, ∞) × B(R\{0}). Define N (A) = #{i ≥ 0 : (Ti , ξi ) ∈ A} =
∞
1((Ti ,ξi )∈A) .
(2.6)
i=1
Clearly since X experiences an almost surely finite number of jumps over a finite period of time it follows that N (A) < ∞ almost surely where for t ≥ 0, A ⊆ B[0, t) × B(R\{0}). Lemma 2.2. Choose k ≥ 1. If A1 , ..., Ak are disjoint sets in B[0, ∞) × B(R\{0}) then N (A1 ), ..., N (Ak ) are mutually independent and Poisson distributed with parameters λi := λ Ai dt × F (dx), respectively. Further, for P-almost every realisation of X, N : B[0, ∞) × B(R\{0}) → {0, 1, 2, ...} ∪ {∞} is a measure.1 Proof. First recall a classic result concerning the Poisson process {Nt : t ≥ 0}. That is, the law of {T1 , ..., Tn } conditional on the event {Nt = n} is the same as the law of an ordered independent sample of size n from the uniform distribution on [0, t]. (Exercise 2.2 has the full details). This latter fact together with the fact that the variables {ξi : i = 1, ..., k} are independent and identically distributed with common law F implies that conditional on {Nt = n}, the joint law of the pairs {(Ti , ξi ) : i = 1, ..., k} is that of n independent bivariate random variables with common distribution t−1 ds × F (dx) on [0, t] × R ordered in time. In particular, for any A ∈ B[0, t] × B(R\{0}), the random variable N (A) conditional on the event {N t = n} is a Binomial random variable with probability of success given by A t−1 ds × F (dx). A generalisation of this latter statement for the k-tuple (N (A1 ), ..., N (Ak )), where A1 , ..., Ak are mutually disjoint and chosen from B[0, t] × B(R), is the following. Suppose k k that A0 = {[0, t] × R}\{A1 ∪ ... ∪ Ak }, i=1 ni ≤ n, n0 = n − i=1 ni and λ0 = A0 λds × F (dx) = λt − λ1 − ... − λk then (N (A1 ), ..., N (Ak )) has the following multinomial law P(N (A1 ) = n1 , ..., N (Ak ) = nk |Nt = n)
n k n! λi i = . n0 !n1 !...nk ! i=0 λt 1
Specifically, P-almost surely, N (∅) = 0 and for disjoint A1 , A2 , ... in B[0, ∞) × B(R\{0}) we have N
i≥1
Ai
=
i≥1
N (Ai ).
38
2 The L´evy–Itˆ o Decomposition and Path Structure
Integrating out the conditioning on Nt it follows that P(N (A1 ) = n1 , ..., N (Ak ) = nk ) =
n k λi i n! n! n0 !n1 !...nk ! i=0 λt
e
n −λt (λt)
e
−λ0
k ni n≥Σi=1
=
k
k ni n≥Σi=1
=
k
i=1
e−λi
(λ0 )(n−Σi=1 ni ) k n )! (n − Σi=1 i
k
i=1
e
−λi
(λi )ni ni !
(λi )ni ni !
showing that N (A1 ), ..., N (Ak ) are independent and Poisson distributed as claimed. To complete the proof for arbitrary disjoint A1 , ..., Ak , in other words to remove the restriction on the time horizon, suppose without loss of generality that A1 belongs to B[0, ∞) × B(R\{0}). Write A1 as a countable union of disjoint sets and recall that the sum of an independent sequence of Poisson random variables is Poisson distributed with the sum of their rates. If we agree that a Poisson random variable with infinite rate is infinite with probability one (see Exercise 2.1), then the proof is complete. Finally the fact that N is a measure P-almost surely follows immediately from its definition. Lemma 2.2 shows that N : B[0, ∞) × B(R\{0}) → {0, 1, ...} ∪ {∞} fulfils the following definition of a Poisson random measure. Definition 2.3 (Poisson random measure). In what follows we shall assume that (S, S, η) is an arbitrary σ-finite measure space. Let N : S → {0, 1, 2, ...} ∪ {∞} in such a way that the family {N(A) : A ∈ S} are random variables defined on the probability space (Ω, F, P). Then N is called a Poisson random measure on (S, S, η) (or sometimes a Poisson random measure on S with intensity η) if (i) for mutually disjoint A1 , ..., An in S, the variables N (A1 ), ..., N (An ) are independent, (ii) for each A ∈ S, N (A) is Poisson distributed with parameter η(A) (here we allow 0 ≤ η(A) ≤ ∞), (iii) P-almost surely N is a measure. In the second condition we note that if η(A) = 0 then it is understood that N (A) = 0 with probability one and if η(A) = ∞ then N (A) is infinite with probability one.
2.2 Poisson Random Measures
39
In the case of (2.6) we have S = [0, ∞) × {R\{0}} and dη = λdt × dF . Note also that by construction of the compound Poisson process on some probability space (Ω, F, P), all of the random variables 1((Ti ,ξi )∈A) for each A ∈ B[0, ∞) × B(R\{0}) are F-measurable and hence so are the variables N (A). We complete this section by proving that a Poisson random measure as defined above exists. This is done in Theorem 2.4, the proof of which has many similarities to the proof of Lemma 2.2. Theorem 2.4. There exists a Poisson random measure N as in Definition 2.3. Proof. First suppose that S is such that η(S) < ∞. There exists a standard construction of an infinite product space, say (Ω, F, P ) on which the independent random variables N and {υ1 , υ2 , ...} are collectively defined such that N has a Poisson distribution with parameter η(S) and each of the variables υi have distribution η(dx)/η(S) on S. Define for each A ∈ S, N N (A) = 1(υi ∈A) i=1
so that N = N (S). As for each A ∈ S and i ≥ 1, the random variables 1(υi ∈A) are F-measurable, then so are the random variables N (A). When presented with mutually disjoint sets of S, say A1 , ..., Ak , a calculation identical to the one given in the proof of Lemma 2.2 shows again that k η(Ai )ni e−η(Ai ) P (N (A1 ) = n1 , ..., N (Ak ) = nk ) = ni ! i=1
for non-negative integers n1 , n2 , ..., nk . Returning to Definition 2.3 it is now clear from the previous calculation together with the assumption that η is non-atomic that conditions (i)–(iii) are met by N . In particular, similar to the case dealt with in Lemma 2.2, the third condition is automatic as N is a counting measure by definition. Next we turn to the case that (S, S, η) is a σ-finite measure space. The meaning of σ-finite is that there exists a countable disjoint exhaustive sequence of sets B1 , B2 , ... in S such that 0 < η(Bi ) < ∞ for each i ≥ 1. Define the measures ηi (·) = η(· ∩ Bi ) for each i ≥ 1. The first part of this proof shows that for each i ≥ 1 there exists some probability space (Ωi , Fi , Pi ) on which we can define a Poisson random measure, say Ni , in (Bi , S ∩ Bi , ηi ) where S ∩ Bi = {A ∩ Bi : A ∈ S} (the reader should verify easily that S ∩ Bi is indeed a sigma algebra on Bi ). The idea is now to show that N (·) = Ni (· ∩ Bi ) i≥1
40
2 The L´evy–Itˆ o Decomposition and Path Structure
is a Poisson random measure on S with intensity η defined on the product space (Ω, F, P) := (Ωi , Fi , Pi ). i≥1
First note that it is again immediate from its definition that N is P-almost surely a measure. In particular with the help of Fubini’s Theorem, for disjoint A1 , A2 , ..., we have ⎞ ⎛ ⎞ ⎛ N (Aj ∩ Bi ) Ni ⎝ Aj ∩ Bi ⎠ = N⎝ Aj ⎠ = i≥1
j≥1
=
j≥0 i≥1
=
j
i≥1 j≥1
N (Aj ∩ Bi )
N (Aj ).
j≥0
Next, for each i ≥ 1. we have that Ni (A ∩ Bi ) is Poisson distributed with parameter ηi (A ∩ Bi ); Exercise 2.1 tells us that under P the random variable N (A) is Poisson distributed with parameter η(A). The proof is complete once we show that for disjoint A1 , ..., Ak in S the variables N (A1 ), ..., N (Ak ) are all independent under P. However this is obvious since the double array of variables {Ni (Aj ∩ Bi ) : i = 1, 2, ... and j = 1, ..., k} is also an independent sequence of variables.
From the construction of the Poisson random measure, the following two corollaries should be clear. Corollary 2.5. Suppose that N is a Poisson random measure on (S, S, η). Then for each A ∈ S, N (· ∩ A) is a Poisson random measure on (S ∩ A, S ∩ A, η(· ∩ A)). Further, if A, B ∈ S and A ∩ B = ∅ then N (· ∩ A) and N (· ∩ B) are independent. Corollary 2.6. Suppose that N is a Poisson random measure on (S, S, η), then the support of N is P-almost surely countable. If in addition, η is a finite measure, then the support is P-almost surely finite. Finally, note that if η is a measure with an atom at, say, the singleton s ∈ S, then it is intuitively obvious from the construction of N in the proof of Theorem 2.4 that P(N ({s}) ≥ 1) > 0. Conversely, if η has no atoms then P(N ({s}) = 0) = 1 for all singletons s ∈ S. For further discussion on this point, the reader is referred to Kingman (1993).
2.3 Functionals of Poisson Random Measures
41
2.3 Functionals of Poisson Random Measures Suppose as in Sect. 2.2 that N is a Poisson random measure on the measure space (S, S, η). As N is P-almost surely a measure, the classical theory of Lebesgue integration now allows us to talk of f (x)N (dx) (2.7) S
as a well defined [0, ∞]-valued random variable for measurable functions f : S → [0, ∞). Further (2.7) is still well defined and [−∞, ∞] valued for signed measurable f provided at most one the integrals of f + = f ∨ 0 and f − = (−f )∨ 0 is infinite. Note however, from the construction of the Poisson random measure in the proof of Theorem 2.4 the integral in (2.7) may be interpreted as equal in law to f (υ)mυ , υ∈Υ
where Υ is the support of N (which from Corollary 2.6) is countable, and mυ is the multiplicity of points at υ. Recalling the remarks following Corollary 2.6 if η has no atoms then mυ = 1 for all υ ∈ N . We move to the main theorem of this section which is attributed to Kingman (1967) who himself accredits the earlier work of Campbell (1909, 1910). Theorem 2.7. Suppose that N is a Poisson random measure on (S, S, η). Let f : S → R be a measurable function. (i) Then X=
f (x)N (dx)
is almost surely absolutely convergent if and only if (1 ∧ |f (x)|)η(dx) < ∞.
(2.8)
S
(ii) When condition (2.8) holds, then (with E as expectation with respect to P) E eiβX = exp − (1 − eiβf (x) )η(dx) (2.9) S
for any β ∈ R. (iii) Further
E (X) =
f (x)η(dx) when
S
S
and
E X
2
=
S
2
f (x) η(dx) +
S
|f (x)|η(dx) < ∞
(2.10)
2 f (x)η(dx) when f (x)2 η(dx) < ∞. S
(2.11)
42
2 The L´evy–Itˆ o Decomposition and Path Structure
Proof. (i) We begin by defining simple functions to be those of the form n
f (x) =
fi 1Ai (x) ,
i=1
where fi is constant and {Ai : i = 1, ..., n} are disjoint sets in S and further η (A1 ∪ ... ∪ An ) < ∞. For such functions we have X=
n
fi N (Ai )
i=1
which is clearly finite with probability one since each N (Ai ) has a Poisson distribution with parameter η(Ai ) < ∞. Now for any θ > 0 we have (using the well known fact that the characteristic function of a Poisson distribution with parameter λ > 0 is exp{−λ(1 − e−θ )}), n E e−θX = E e−θfi N (Ai )
=
i=1 n
i=1
exp −(1 − e−θfi )η(Ai )
= exp −
n i=1
(1 − e
−θfi
)η(Ai ) .
Since 1 − e−θf (x) = 0 on S\(A1 ∪ ... ∪ An ) we may thus conclude that E e−θX = exp − (1 − e−θf (x) )η(dx) . S
Next we establish the above equality for a general positive measurable f. For the latter class of f, there exists a pointwise increasing sequence of positive simple functions {fn : n ≥ 0} such that limn↑∞ fn = f, where the limit is also understood in the pointwise sense. Since N is an almost surely σ-finite measure, the monotone convergence theorem now implies that lim fn (x) N (dx) = f (x) N (dx) = X n↑∞
almost surely. An application of bounded convergence followed by an application of monotone convergence again tells us that for any θ > 0,
E e−θX = E exp −θ f (x) N (dx)
= lim E exp −θ fn (x) N (dx) n↑∞
2.3 Functionals of Poisson Random Measures
43
−θfn (x) )η(dx) = lim exp − (1 − e n↑∞
S
= exp − (1 − e−θf (x) )η(dx) .
(2.12)
S
Note that the integral on the right-hand side of (2.12) is either infinite for all θ > 0 or finite for all θ > 0 accordingly, with the cases that X = ∞ with probability one or X = ∞ with probability less than one, respectively. If (1 − e−θf (x) )η(dx) < ∞ for all θ > 0 then as, for each x ∈ S, (1 − e−θf (x) ) ≤ S −f (x) (1 − e ) for all 0 < θ < 1, dominated convergence implies that lim (1 − e−θf (x) )η(dx) = 0 θ↓0
S
and hence dominated convergence applied again in (2.12) as θ ↓ 0 tells us that P(X = ∞) = 0. In conclusion we have that X < ∞ if and only if S (1−e−θf (x) )η(dx) < ∞ for all θ > 0 and it can be checked (see Exercise 2.3) that the latter happens if and only if (1 ∧ f (x))η(dx) < ∞. S
Note that both sides of (2.12) may be analytically extended by replacing θ by θ − iβ for β ∈ R. Then taking limits on both sides as θ ↓ 0 we deduce (2.9). Now we shall remove the restriction that f is positive. Henceforth assume as in the statement of the theorem that f is a measurable function. We may write f = f + − f − where f + = f ∨ 0 and f − = (−f ) ∨ 0 are both measurable. The sum X can be written X+ − X− where X+ = f (x)N+ (dx) and X− = f (x)N− (dx) S
S
and N+ = N (· ∩ {x ∈ S : f (x) ≥ 0) and N− = N (· ∩ {x ∈ S : f (x) < 0). From Corollary 2.5 we know that N+ and N− are both Poisson random measures with respective intensities η(· ∩ {f ≥ 0}) and η(· ∩ {f < 0}). Further, they are independent and hence the same is true of X+ and X− . It is now clear that X converges absolutely almost surely if and only if X+ and X− are convergent. The analysis of the case when f is positive applied to the sums X+ and X− now tells us that absolute convergence of X occurs if and only if (1 ∧ |f (x)|)η(dx) < ∞ (2.13) S
and the proof of (i) is complete.
44
2 The L´evy–Itˆ o Decomposition and Path Structure
To complete the proof of (ii), assume that (2.13) holds. Using the independence of X+ and X− as well as the conclusion of part (i) we have that for any θ ∈ R, E eiθX = E eiθX+ E e−iθX− = exp −
{f >0}
× exp −
(1 − eiθf
{f <0}
(1 − e
+
(x)
)η(dx)
−iθf − (x)
iθf (x) = exp − (1 − e )η(dx)
)η(dx)
S
and the proof of (ii) is complete. Part (iii) is dealt with similarly as in the above treatment; that is first by considering positive, simple f , then extending to positive measurable f and then to a general measurable f by considering its positive and negative parts. The proof is left to the reader.
2.4 Square Integrable Martingales We shall predominantly use the identities in the Theorem 2.7 for Poisson random measures on ([0, ∞) × R, B[0, ∞) × B(R), dt × Π(dx)) where Π is a measure concentrated on R\{0}. We shall be interested in integrals of the form xN (ds × dx), (2.14) [0,t]
B
where B ∈ B(R). The relevant integrals appearing in (2.8)–(2.11) for the above functional of the given Poisson random measure can now be checked to take the form t (1 ∧ |x|)Π(dx), t (1 − eiβx )Π(dx), B B x2 Π(dx), |x|Π(dx), and t t B
B
with the appearance of the factor t in front of each of the integrals being a consequence of the involvement of Lebesgue measure in the intensity of N . The following two lemmas capture the context in which we use sums of the form (2.14). The first may be considered as a converse to Lemma 2.2 and the second shows the relationship with martingales. Lemma 2.8. Suppose that N is a Poisson random measure on ([0, ∞) × R, B[0, ∞) × B(R), dt × Π(dx)) where Π is a measure concentrated on R\{0} and B ∈ B(R) such that 0 < Π(B) < ∞. Then
2.4 Square Integrable Martingales
Xt :=
[0,t]
B
45
xN (ds × dx), t ≥ 0
is a compound Poisson process with arrival rate Π(B) and jump distribution Π(B)−1 Π(dx)|B . Proof. First note that since Π(B) < ∞ by assumption, from Corollary 2.6 we know that almost surely, Xt may be written as the sum over finite number of points for each t > 0. This explains why X = {Xt : t ≥ 0} is right continuous with left limits. (One may also see finiteness of Xt from Theorem 2.7 (i)). Next note that for all 0 ≤ s < t < ∞, xN (ds × dx) Xt − X s = (s,t]
B
which is independent of {Xu : u ≤ s} as N gives independent counts over disjoint regions. Further, according to Theorem 2.7 (ii) we have that for all θ ∈ R, E(eiθXt ) = exp −t
B
(1 − eiθx )Π(dx) .
(2.15)
When put together with the fact that X has independent increments this shows that E(eiθXt ) E eiθ(Xt −Xs ) = E(eiθXs ) = exp −(t − s) (1 − eiθx )Π(dx) B = E eiθXt−s
and hence that increments are stationary. Finally, we identify from (2.15) that the L´evy–Khintchine exponent of X corresponds to that of a compound Poisson process with jump distribution and arrival rate given by Π(B)−1 Π(dx)|B and Π(B), respectively. Since two L´evy processes with the same increment distributions must be equal in law (as all the finite dimensional distributions are determined by the increment distributions and this in turn determines the law of the process) then the L´evy process X must be a compound Poisson process. Lemma 2.9. Suppose that N and B are as in the previous lemma with the additional assumption that B |x|Π(dx) < ∞.
(i) The compound Poisson process with drift Mt := xN (ds × dx) − t xΠ(dx), t ≥ 0 [0,t]
B
B
46
2 The L´evy–Itˆ o Decomposition and Path Structure
is a P-martingale with respect to the filtration
(ii) If further,
Ft = σ (N (A) : A ∈ B[0, t] × B (R)) , t > 0. B
(2.16)
x2 Π(dx) < ∞ then it is a square integrable martingale.
Proof. (i) First note that the process M = {Mt : t ≥ 0} is adapted to the filtration {Ft : t ≥ 0}. Next note that for each t > 0, E(|Mt |) ≤ E
[0,t]
B
|x|N (ds × dx) + t
B
|x|Π(dx)
which, from Theorem 2.7 (iii), is finite because B |x|Π(dx) is. Next use the fact that M has stationary independent increments to deduce that for 0 ≤ s ≤ t < ∞, E(Mt − Ms |Fs )
= E(Mt−s ) xN (ds × dx) − (t − s) xΠ(dx) =E [s,t]
B
B
=0
where in the final equality we have used Theorem 2.7 (iii) again. (ii) To see that M is square integrable, we may yet again appeal to Theorem 2.7 (iii) together with the assumption that B x2 Π(dx) < ∞ to deduce that 2 E Mt + t xΠ(dx) =t x2 Π(dx) B
B
+t
2
B
2 xΠ(dx) .
Recalling from the martingale property that E(Mt ) = 0, it follows by developing the left-hand side in the previous display that E(Mt2 ) = t x2 Π(dx) < ∞ B
as required.
The conditions in both Lemmas 2.8 and 2.9 mean that we may consider sets, for example, of the form Bε := (−1, −ε)∪(ε, 1) for any ε ∈ (0, 1). However it is not necessarily the case that we may consider sets of the form B = (−1, 0)∪(0, 1). Consider for example the case that Π(dx) = 1(x>0) x−(1+α) dx+ 1(x<0) |x|−(1+α) for α ∈ (1, 2). In this case, we have that B |x|Π(dx) = ∞
2.4 Square Integrable Martingales
47
whereas B x2 Π(dx) < ∞. It will turn out to be quite important in the proof of the L´evy–Itˆo decomposition to understand the limit of the martingale in Lemma 2.8 for sets of the form Bε as ε ↓ 0. For this reason, let us now state and prove the following theorem. Theorem 2.10. Suppose that N is as in Lemma 2.8 and (−1,1) x2 Π(dx) < ∞. For each ε ∈ (0, 1) define the martingale xN (ds × dx) − t xΠ(dx), t ≥ 0 Mtε = [0,t]
Bε
Bε
Ft∗
and let be equal to the completion of s>t Fs by the null sets of P where Ft is given in (2.16). Then there exists a martingale M = {Mt : t ≥ 0} with the following properties, (i) for each T > 0, there exists a deterministic subsequence {εTn : n = 1, 2, ...} with εTn ↓ 0 along which εT
P( lim sup (Ms n − Ms )2 = 0) = 1, n↑∞ 0≤s≤T
(ii) it is adapted to the filtration {Ft∗ : t ≥ 0}, (iii) it has right continuous paths with left limits almost surely, (iv) it has, at most, a countable number of discontinuities on [0, T ] almost surely and (v) it has stationary and independent increments. In short, there exists a L´evy process, which is also a martingale with a countable number of jumps to which, for any fixed T > 0, the sequence of martingales {Mtε : t ≤ T } converges uniformly on [0, T ] with probability one along a subsequence in ε which may depend on T . Before proving Theorem 2.10 we need to remind ourselves of some general facts concerning square integrable martingales. In our account we shall recall a number of well established facts coming from quite standard L2 theory, measure theory and continuous time martingale theory. The reader is referred to Sects. 2.4, 2.5 and 9.6 of Ash and Dol´eans-Dade (2000) for a clear account of the necessary background. Fix a time horizon T > 0. Let us assume as in the above theorem that (Ω, F, {Ft∗ : t ∈ [0, T ]}, P) is a filtered probability space in which the filtration {Ft∗ : t ≥ 0} is complete with respect to the null sets of P and right continuous in the sense that Ft∗ = s>t Fs∗ . Definition 2.11. Fix T > 0. Define M2T = M2T (Ω, F, {Ft∗ : t ∈ [0, T ]}, P) to be the space of real valued, zero mean right-continuous, square integrable P-martingales with respect to the given filtration over the finite time period [0, T ]. One luxury that follows from the assumptions on {Ft∗ : t ≥ 0} is that any zero mean square integrable martingale with respect to the latter filtration
48
2 The L´evy–Itˆ o Decomposition and Path Structure
has a right continuous version which is also a member of M2T . Recall that M ′ = {Mt′ : t ∈ [0, T ]} is a version of M if it is defined on the same probability space and {∃t ∈ [0, T ] : Mt′ = Mt } is measurable with zero probability. It is straightforward to deduce that M2T is a vector space over the real numbers with zero element Mt = 0 for all t ∈ [0, T ] and all ω ∈ Ω. In fact, as we shall shortly see, M2T is a Hilbert space2 with respect to the inner product M2T .
M, N = E (MT NT ) ,
where M, N ∈ It is left to the reader to verify the fact that ·, · forms an inner product. The only mild technical difficulty in this verification is showing that for M ∈ M2T , M, M = 0 implies that M = 0, the zero element. Note however that if M, M = 0 then by Doob’s Maximal Inequality, which says that for M ∈ M2T ,
2 E sup Ms ≤ 4E MT2 , 0≤s≤T
we have that sup0≤t≤T Mt = 0 almost surely. Since M ∈ M2T is right continuous it follows necessarily that Mt = 0 for all t ∈ [0, T ] with probability one. As alluded to above, we can show without too much difficulty that M2T is a Hilbert space. To do that we are required to show that given {M (n) : n = 1, 2, ...} is a Cauchy sequence of martingales taken from M2T then there exists an M ∈ M2T such that ! ! ! ! (n) − M! → 0 !M 1/2
as n ↑ ∞ where · := ·, · .To this end let us assume that the sequence of processes M (n) : n = 1, 2, ... is a Cauchy sequence, in other words, " 2 #1/2 (m) (n) → 0 as m, n ↑ ∞. E MT − MT (k)
Necessarily then the sequence of random variables {MT : k ≥ 1} is a Cauchy sequence in the Hilbert space of zero mean, square integrable random variables defined on (Ω, FT , P), say L2 (Ω, FT , P), endowed with the inner product M, N = E(M N ). Hence there exists a limiting variable, say MT in L2 (Ω, FT , P) satisfying 1/2 (n) →0 E (MT − MT )2 2
Recall that ·, · : L × L → R is an inner product on a vector space L over the reals if it satisfies the following properties for f, g ∈ L and a, b ∈ R; (i) af + bg, h = a f, h + b g, h for all h ∈ L, (ii) f, g = g, f , (iii) f, f ≥ 0 and (iv) f, f = 0 if and only if f = 0. For each f ∈ L let ||f || = f, f 1/2 . The pair (L, ·, ·) are said to form a Hilbert space if all sequences, {fn : n = 1, 2, ...} in L that satisfy ||fn − fm || → 0 as m, n → ∞, so called Cauchy sequences, have a limit which exists in L.
2.4 Square Integrable Martingales
49
as n ↑ ∞. Define the martingale M to be the right continuous version3 of E (MT |Ft∗ ) for t ∈ [0, T ] and note that by definition ! ! ! (n) ! − M! → 0 !M
as n tends to infinity. Clearly it is an Ft∗ -adapted process and by Jensen’s inequality 2 E Mt2 = E E (MT |Ft∗ ) ≤ E E MT2 |Ft∗ = E MT2
which is finite. Hence Cauchy sequences converge in M2T and we see that M2T is indeed a Hilbert space. We are now ready to return to Theorem 2.10.
Proof (of Theorem 2.10). (i) Choose 0 < η < ε < 1, fix T > 0 and define M ε = {Mtε : t ∈ [0, T ]}. A calculation similar to the one in Lemma 2.9 (ii) gives ⎛ 2 ⎞ ε xN (ds × dx) ⎠ E (MT − MTη )2 = E ⎝ [0,T ]
=T
η≤|x|<ε
x2 Π(dx).
η≤|x|<ε
Note however that the left-hand side above is also equal to ||M ε − M η ||2 (where as in the previous discussion, || · || is the norm induced by the inner product on M2T ). Thanks to the assumption that (−1,1) x2 Π(dx) < ∞, we now have that limε↓0 ||M ε − M η || = 0 and hence that {M ε : 0 < ε < 1} is a Cauchy family in M2T . As M2T is a Hilbert space we know that there exists a martingale M = {Ms : s ∈ [0, T ]} ∈ M2T such that lim ||M − M ε || = 0. ε↓0
An application of Doob’s maximal inequality tells us that in fact " # lim E sup (Ms − Msε )2 ≤ 4 lim ||M − M ε || = 0. ε↓0
3
0≤s≤T
ε↓0
(2.17)
Here we use the fact that {Ft∗ : t ∈ [0, T ]} is complete and right continuous.
50
2 The L´evy–Itˆ o Decomposition and Path Structure
From this one may deduce that the limit {Ms : s ∈ [0, T ]} does not depend on T . Indeed suppose it did and we adjust our notation accordingly so that {Ms,T : s ≤ T } represents the limit. Then from (2.17) we see that for any 0 < T′ < T, " # lim E ε↓0
sup (Msε − Ms,T ′ )2 = 0
0≤s≤T ′
as well as lim E ε↓0
"
sup
0≤s≤T ′
(Msε
2
− Ms,T )
#
≤ lim E ε↓0
"
sup 0≤s≤T
(Msε
2
− Ms,T )
#
= 0,
where the inequality is the result of a trivial upper bound. Hence using that for any two sequences of real numbers {an } and {bn }, supn a2n = (supn |an |)2 and supn |an +bn | ≤ supn |an |+supn |bn |, we have together with an application of Minkowski’s inequality that E
"
sup (Ms,T ′ − Ms,T )2
0≤s≤T ′
#1/2
≤ lim E ε↓0
"
0≤s≤T ′
+ lim E ε↓0
=0
sup (Msε − Ms,T ′ )2
"
#1/2
sup (Msε − Ms,T )2
0≤s≤T ′
#1/2
thus showing that the processes M·,T and M·,T ′ are almost surely uniformly equal on [0, T ′ ]. Since T ′ and T may be arbitrarily chosen, we may now speak of a well defined martingale limit M = {Mt : t ≥ 0}. From the limit (2.17) we may also deduce that there exists a deterministic subsequence {εTn : n ≥ 0} along which εT
lim sup (Ms n − Ms )2 = 0
εT n ↓0
0≤s≤T
P-almost surely. This follows from the well established fact that L2 convergence of a sequence of random variables implies almost sure convergence on a deterministic subsequence. εT
(ii) Fix 0 < t < T . Clearly as Mt n is Ft∗ -measurable, and by part (i) the latter sequence has an almost sure limit as n ↑ ∞, then by standard measure theory its limit is also Ft∗ -measurable.
(iii) As the paths of M ε are right continuous with left limits, almost sure uniform convergence (along a subsequence) on finite time intervals implies that the limiting process, M , also has paths which are right continuous with left limits. We are using here the fact that, if D[0, 1] is the space of functions f : [0, 1] → R which are right continuous with left limits, then D[0, 1] is a closed space under the metric d(f, g) = supt∈[0,1] |f (t)−g(t)| for f, g ∈ D[0, 1]. See Exercise 2.4 for a proof of this fact.
2.5 Proof of the L´evy–Itˆ o Decomposition
51
(iv) According to Corollary 2.6 there are at most an almost surely countable number of points in the support of N . Further, as the measure dt×Π(dx) has no atoms then N is necessarily {0, 1} valued on time–space singletons.4 Hence every discontinuity in {Ms : s ≥ 0} corresponds to a unique point in the support of N , it follows that M has at most a countable number of discontinuities. Another way to see there are at most a countable number of discontinuities is simply to note that functions in the space D[0, 1] have discontinuities of the first kind5 and hence there are necessarily a countable number of such discontinuities; see Exercise 2.4. (v) Uniform almost sure convergence along a subsequence also guarantees convergence in distribution for a collection of fixed times along the same subsequence. This shows that M has stationary independent increments since for any 0 ≤ u ≤ v ≤ s ≤ t ≤ T < ∞ and θ1 , θ2 ∈ R, dominated convergence gives E(eiθ1 (Mv −Mu ) eiθ2 (Mt −Ms ) ) εT n
= lim E(eiθ1 (Mv n↑∞
εT
εT
εT
−Mun ) iθ2 (Mt n −Ms n )
e
εT n
)
εT n
= lim E(eiθ1 Mv−u )E(eiθ2 Mt−s ) n↑∞
= E(eiθ1 Mv−u )E(eiθ2 Mt−s ) thus concluding the proof.
2.5 Proof of the L´ evy–Itˆ o Decomposition As previously indicated in Sect. 2, we will take X (1) to be the linear Brownian motion (2.2) defined now on some probability space (Ω # , F # , P # ). Given Π in the statement of Theorem 2.1 we know from Theorem 2.4 that there exists a probability space, say (Ω ∗ , F ∗ , P ∗ ), on which may construct a Poisson random measure N on ([0, ∞) × R, B[0, ∞) × B(R), dt × Π(dx)). We may think of the points in the support of N as having a time and space co-ordinate, or alternatively, as points in R\{0} arriving in time. Now define (2) xN (ds × dx), t ≥ 0 Xt = [0,t]
|x|≥1
and note from Lemma 2.8 that since Π(R\(−1, 1)) < ∞ that it is a compound Poisson process with rate Π(R\(−1, 1)) and jump distribution 4
If one reconsiders the construction of a general Poisson random measure on (S, S, η) in the proof of Theorem 2.4, then one sees that if η has atoms, it is possible that the points which contribute to the support of N may lie on top of one another. If η has no atoms then the aforementioned points are almost surely distinct. 5 A discontinuity of the first kind of f at x means that f (x+) and f (x−) both exist but are not equal to one another.
52
2 The L´evy–Itˆ o Decomposition and Path Structure
Π(R\(−1, 1))−1 Π(dx)|R\(−1,1) . (We may assume without loss of generality that Π(R\(−1, 1)) > 0 as otherwise we may simply take the process X (2) as the process which is identically zero.) Next we construct a L´evy process having only small jumps. For each 1 > ε > 0 define similarly the compound Poisson process with drift (3,ε) = xN (ds × dx) − t xΠ(dx), t ≥ 0. (2.18) Xt [0,t]
ε≤|x|<1
ε≤|x|<1
(2)
(As in the definition of X we shall assume without loss of generality Π({x : |x| < 1}) > 0 otherwise the process X (3) may be taken as the process which is identically zero). Using Theorem 2.7 (ii) we can compute its characteristic exponent, (1 − eiθx + iθx)Π (dx) . Ψ (3,ε) (θ) := ε≤|x|<1
According to Theorem 2.10 there exists a L´evy process, which is also a square integrable martingale, defined on (Ω ∗ , F ∗ , P ∗ ), to which X (3,ε) converges uniformly on [0, T ] along an appropriate deterministic subsequence that it is at this point that we are using the assumption that in ε. Note 2 x Π(dx) < ∞. It is clear that the characteristic exponent of this latter (−1,1) L´evy process is equal to (1 − eiθx + iθx)Π(dx). Ψ (3) (θ) = |x|<1
From Corollary 2.5 we know that for each t > 0, N has independent counts over the two domains [0, t] × {R\(−1, 1)} and [0, t] × (−1, 1). It follows that X (2) and X (3) are independent. Further the latter two are independent of X (1) which was defined on another probability space. To conclude the proof of the L´evy–Itˆo decomposition in line with the statement of Theorem 2.1, define the process (1)
Xt = Xt
(2)
+ Xt
(3)
+ Xt , t ≥ 0.
(2.19)
This process is defined on the product space (Ω, F, P) = (Ω # , F # , P # ) × (Ω ∗ , F ∗ , P ∗ ), has stationary independent increments, has paths that are right continuous with left limits and has characteristic exponent Ψ (θ) = Ψ (1) (θ) + Ψ (2) (θ) + Ψ (3) (θ) 1 = iaθ + σ 2 θ2 + (1 − eiθx + iθx1(|x|<1) )Π(dx) 2 R as required.
Let us conclude this section with some additional remarks on the L´evy–Itˆo decomposition.
2.6 L´evy Processes Distinguished by Their Path Type
53
Recall from (2.4) that the exponent Ψ (3) appears to have the form of the infinite sum of characteristic exponents belonging to compound Poisson processes with drift. Thus suggesting that X (3) may be taken as the superposition of such processes. We now see from the above proof that this is exactly the case. Indeed moving ε to zero through the sequence {2−k : k ≥ 0} shows us that in the appropriate sense of L2 convergence (3,2−k ) lim Xt = lim xN (ds × dx) − t xΠ(dx) k↑∞
k↑∞
= lim
k↑∞
[0,t]
k−1 i=0
2−k <|x|<1
[0,t]
2−k <|x|<1
2−(i+1) <|x|<2−i
−t
xN (ds × dx)
xΠ(dx) .
2−(i+1) <|x|<2−i
It is also worth remarking that the definition of X (2) and X (3) in the proof of the L´evy–Itˆo decomposition accordingly, with the partition of R\{0} into R\(−1, 1) and (−1, 1)\{0} is to some extent arbitrary. The point is that one needs to deal with the contribution of N to the path of the L´evy process which comes from points which are arbitrarily close to the origin in a different way to points which are at a positive distance from the origin. In this respect one could have redrafted the proof replacing (−1, 1) by (α, β) for any α < 0 and β > 0, in which case one would need to choose a different value of a in the definition of X (1) in order to make terms add up precisely to the expression given in the L´evy–Khintchine exponent. To be more precise, if for example (1) α < −1 and β > 1, then one should take Xt = a′ t + σBt where xΠ(dx) − xΠ(dx). a′ = a − α<|x|≤−1
1≤|x|<β
The latter also shows that the L´evy–Khintchine formula (2.1) is not a unique representation and indeed the indicator 1(|x|<1) in (2.1) may be replaced by 1(α<x<β) with an appropriate adjustment in the constant a.
2.6 L´ evy Processes Distinguished by Their Path Type As is clear from the proof of the L´evy–Itˆo decomposition, we should think of the measure Π given in the L´evy–Khintchine formula as characterising a Poisson random measure which encodes the jumps of the associated L´evy process. In this section we shall re-examine elements of the proof of the L´evy–Itˆo decomposition and show that, with additional assumptions on Π corresponding to restrictions on the way in which jumps occur, we may further identify special classes of L´evy processes embedded within the general class.
54
2 The L´evy–Itˆ o Decomposition and Path Structure
2.6.1 Path Variation It is clear from the L´evy–Itˆo decomposition that the presence of the linear Brownian motion X (1) would imply that paths of the L´evy process have unbounded variation. On the other hand, should it be the case that σ = 0, then the L´evy process may or may not have unbounded variation. The term X (2) , being a compound Poisson process, has only bounded variation. Hence in the case σ = 0, understanding whether the L´evy process has unbounded variation is an issue determined by the limiting process X (3) ; that is to say the process of compensated small jumps. Reconsidering the definition of X (3) it is natural to ask under what circumstances xN (ds × dx) lim ε↓0
[0,t]
ε≤|x|<1
exists almost surely without the need for compensation. Once again, the answer is given by Theorem 2.7 (i). Here we are told that xN (ds × dx) < ∞ [0,t]
if and only if directly via (3)
Xt
=
0<|x|<1
[0,t]
0<|x|<1
|x|Π(dx) < ∞. In that case we may identify X (3)
0<|x|<1
xN (ds × dx) − t
0<|x|<1
xΠ(dx), t ≥ 0.
(3) will be of bounded variation if and only if This also tells us that X |x|Π(dx) < ∞. The latter combined with the general integral condi0<|x|<1 tion R (1 ∧ x2 )Π(dx) < ∞ in the light of the L´evy–Itˆo decomposition yields the following Lemma.
Lemma 2.12. A L´evy process with L´evy–Khintchine exponent corresponding to the triple (a, σ, Π) has paths of bounded variation if and only if (1 ∧ |x|)Π(dx) < ∞. (2.20) σ = 0 and R
Note that the finiteness of the integral in (2.20) also allows for the L´evy– Khintchine exponent of any such bounded variation process to be re-written as follows (2.21) Ψ (θ) = −idθ + (1 − eiθx )Π(dx), R
where the constant d ∈ R relates to the constant a and Π via xΠ(dx) . d=− a+ |x|<1
2.6 L´evy Processes Distinguished by Their Path Type
In this case, we may write the L´evy process in the form Xt = dt + xN (ds × dx), t ≥ 0. [0,t]
55
(2.22)
R
In view of the decomposition of the L´evy–Khintchine formula for a process of bounded variation and the corresponding representation (2.22), the term d is often referred to as the drift. Strictly speaking, one should not talk of drift in the case of a L´evy process whose jump part is a process of unbounded variation. If drift is to be understood in terms of a purely deterministic trend, then it is ambiguous on account of the “infinite limiting compensation” that one sees in X (3) coming from the second term on the right hand side of (2.18). From the expression given in (1.3) of the Chap. 1 we see that if X is a compound Poisson process with drift then its characterisitic exponent takes the form of (2.21) with Π(R) < ∞. Conversely, suppose that σ = 0 and Π has finite total mass, then we know from Lemma 2.8 that (2.22) is a compound Poisson process with drift d. In conclusion we have the following lemma. Lemma 2.13. A L´evy process is a compound Poisson process with drift if and only if σ = 0 and Π(R) < ∞. Processes which are of bounded variation but which are not compound Poisson processes with drift are sometimes referred to as generalised compound Poisson processes (with drift). This is because they are structurally the same as compound Poisson processes in that they may be represented in the form of (2.22). This is of course not true for L´evy processes of unbounded variation, even if the Gaussian component is zero. 2.6.2 One-Sided Jumps Suppose now that Π(−∞, 0) = 0. From the proof of the L´evy–Itˆo decomposition, we see that this implies that the corresponding L´evy process has no negative jumps. If further we have that (0,∞) (1∧x)Π(dx) < ∞, σ = 0 and, in the representation (2.21) of the characteristic exponent, d ≥ 0, then from the representation (2.22) it becomes clear that the L´evy process has non-decreasing paths. Conversely, suppose that a L´evy process has non-decreasing paths then necessarily it has bounded variation. Hence (0,∞) (1 ∧ x)Π(dx) < ∞, σ = 0 and then it is easy to see that in the representation (2.21) of the characteristic exponent, we necessarily have d ≥ 0. Examples of such a process were given in Chap. 1 (the gamma process and the inverse Gaussian process) and were named subordinators. Summarising we have the following. Lemma 2.14. A L´evy process is a subordinator if and only if Π(−∞, 0) = 0, xΠ(dx) ≥ 0. (1 ∧ x)Π(dx) < ∞, σ = 0 and d = − a + (0,1) (0,∞)
56
2 The L´evy–Itˆ o Decomposition and Path Structure
For the sake of clarity, we note that when X is a subordinator, further to (2.21), its L´evy-Khinchine formula may be written Ψ (θ) = −idθ + (1 − eiθx )Π(dx), (2.23) (0,∞)
where necessarily d ≥ 0. If Π(−∞, 0) = 0 and X is not a subordinator, then it is referred to in general as a spectrally positive L´evy process. A L´evy process, X, will then be referred to as spectrally negative if −X is spectrally positive. Together the latter two classes of processes are called spectrally one-sided. Spectrally onesided L´evy processes may be of bounded or unbounded variation and, in the latter case, may or may not possess a Gaussian component. Note in particular that when σ = 0 it is still possible to have paths of unbounded variation. When a spectrally positive L´evy process has bounded variation then it must take the form Xt = −dt + St , t ≥ 0 where {St : t ≥ 0} is a pure jump subordinator and necessarily d > 0 as otherwise X would conform to the definition of a subordinator. Note that the above decomposition implies that if E(X1 ) ≤ 0 then E(S1 ) < ∞ as opposed to the case that E(X1 ) > 0 in which case it is possible that E(S1 ) = ∞. A special feature of spectrally positive processes is that, if τx− = inf{t > 0 : Xt < x} where x < 0, then P(τx− < ∞) > 0 and hence, as there can be no downwards jumps, P(Xτx− = x|τx− < ∞) = 1 with a similar property for first passage upwards being true for spectrally negative processes. A rigorous proof of the first of the above two facts will be given in Corollary 3.13 at the end of Sect. 3.3. It turns out that the latter fact plays a very important role in the simplification of a number of theorems we shall encounter later on in this text which concern the fluctuations of general L´evy processes.
2.7 Interpretations of the L´ evy–Itˆ o Decomposition Let us return to some of the models considered in Chap. 1 and consider how the understanding of the L´evy–Itˆo decomposition helps to justify working with more general classes of L´evy processes. 2.7.1 The Structure of Insurance Claims Recall from Sect. 1.3.1 that the Cram´er–Lundberg model corresponds to a L´evy process with characteristic exponent given by
2.7 Interpretations of the L´evy–Itˆ o Decomposition
Ψ (θ) = −icθ + λ
(−∞,0)
57
(1 − eiθx )F (dx),
for θ ∈ R. In other words, a compound Poisson process with arrival rate λ > 0 and negative jumps, corresponds to claims, having common distribution F as well as a drift c > 0 corresponding to a steady income due to premiums. Suppose instead we work with a general spectrally negative L´evy process. That is a process for which Π(0, ∞) = 0 (but not the negative of a subordinator). In this case, the L´evy–Itˆo decomposition offers an interpretation for large scale insurance companies as follows. The L´evy–Khintchine exponent may be written in the form 1 2 2 iθx σ θ + −iθc + (1 − e )Π(dx) Ψ (θ) = 2 (−∞,−1] iθx + (1 − e + iθx)Π(dx) (2.24) (−1,0)
for θ ∈ R. Assume that Π(−∞, 0) = ∞ so Ψ is genuinely different from the characteristic of a Cram´er–Lundberg model. The third bracket in (2.24) we may understand as a L´evy process representing a countably infinite number of arbitrarily small claims compensated by a deterministic positive drift (which may be infinite in the case that (−1,0) |x|Π(dx) = ∞) corresponding to the accumulation of premiums over an infinite number of contracts. Roughly speaking, the way in which claims occur is such that in any arbitrarily small period of time dt, a claim of size |x| (for x < 0) is made independently with probability Π(dx)dt + o(dt). The insurance company thus counterbalances such claims by ensuring that it collects premiums in such a way that in any dt, |x|Π(dx)dt of its income is devoted to the compensation of claims of size |x|. The second bracket in (2.24) we may understand as coming from large claims which occur occasionally and are compensated against by a steady income at rate c > 0 as in the Cram´er–Lundberg model. Here “large” is taken to mean claims of size one or more and c = −a in the terminology of the L´evy–Khintchine formula given in Theorem 1.6. Finally the first bracket in (2.24) may be seen as a stochastic perturbation of the system of claims and premium income. Since the first and third brackets in (2.24) correspond to martingales, the company may guarantee that its revenues drift to infinity over an infinite time horizon by assuming the latter behaviour applies to the compensated process of large claims corresponding to the second bracket in (2.24). 2.7.2 General Storage Models The workload of the M/G/1 queue was presented in Sect. 1.3.2 as a spectrally negative compound Poisson process with rate λ > 0 and jump distribution F
58
2 The L´evy–Itˆ o Decomposition and Path Structure
with positive unit drift reflected in its supremum. In other words, the underlying L´evy process has characteristic exponent Ψ (θ) = −iθ + λ (1 − eiθx )F (dx) (−∞,0)
for all θ ∈ R. A general storage model, described for example in the classic books of Prabhu (1998) and Tak´ acs (1966), consists of working with a general L´evy process which is the difference of a positive drift and a subordinator and then reflected in its supremum. Its L´evy–Khintchine exponent thus takes the form (1 − eiθx )Π(dx), Ψ (θ) = −idθ + (−∞,0)
where d > 0 and (−∞,0) (1 ∧ |x|)Π(dx) < ∞. As with the case of the M/G/1 queue, the reflected process Wt = (w ∨ X t ) − Xt , t ≥ 0 may be thought of the stored volume or workload of some system where X is the L´evy process with characteristic exponent Ψ given above and X is its running supremum. The L´evy–Itˆo decomposition tells us that during the periods of time that X is away from its supremum, there is a natural “drainage” of volume or “processing” of workload, corresponding to the downward movement of W in a linear fashion with rate d. At the same time new “volume for storage” or equivalently new “jobs” arrive independently so that in each dt, one arrives of size |x| (where x < 0) with probability Π(dx)dt + o(dt) (thus giving similar interpretation to the occurrence of jumps in the insurance risk model described above). When Π(−∞, 0) = ∞ the number of jumps are countably infinite over any finite time interval thus indicating that our model is processing with “infinite frequency” in comparison to the finite activity of the workload of the M/G/1 process. Of course one may also envisage working with a jump measure which has some mass on the positive half line. This would correspond negative jumps in the process W . This, in turn, can be interpreted as follows. Over and above the natural drainage or processing at rate d, in each dt there is independent removal of a “volume” or “processing time of job” of size y > 0 with probability Π(dy)dt + o(dt). One may also consider moving to models of unbounded variation. However, in this case, the interpretation of drift is lost. 2.7.3 Financial Models Financial mathematics has become a field of applied probability which has embraced the use of L´evy processes, in particular, for the purpose of modelling the evolution of risky assets. We shall not attempt to give anything like
2.7 Interpretations of the L´evy–Itˆ o Decomposition
59
a comprehensive exposure of this topic here, nor elsewhere in this book. Especially since the existing text books of Boyarchenko and Levendorskii (2002b), Schoutens (2003), Cont and Tankov (2004) and Barndorff–Nielsen and Shephard (2005) already offer a clear and up-to-date overview between them. It is however worth mentioning briefly some of the connections between path properties of L´evy processes seen above and modern perspectives within financial modelling. One may say that financial mathematics proper begins with the thesis of Louis Bachellier who proposed the use of linear Brownian motion to model the value of a risky asset, say the value of a stock (See Bachelier (1900, 1901)). The classical model, proposed by Samuleson (1965), for the evolution of a risky asset however is generally accepted to be that of an exponential linear Brownian motion with drift; St = seσBt +µt ,
t≥0
(2.25)
where s > 0 is the initial value of the asset, B = {Bt : t ≥ 0} is a standard Brownian motion, σ > 0 and µ ∈ R. This choice of model offers the feature that asset values have multiplicative stationarity and independence in the sense that for any 0 ≤ u < t < ∞, St = Su × S t−u
(2.26)
where S t−u is independent of Su and has the same distribution as St−u . Whether this is a realistic assumption in terms of temporal correlations in financial markets is open to debate. Nonetheless, for the purpose of a theoretical framework in which one may examine the existence or absence of certain economic mechanisms, such as risk-neutrality, hedging and arbitrage as well as giving sense to the value of certain financial products such as option contracts, exponential Brownian motion has proved to be the right model to capture the imagination of mathematicians, economists and financial practitioners alike. Indeed, what makes (2.25) “classical” is that Black and Scholes (1973) and Merton (1973) demonstrated how one may construct rational arguments leading to the pricing of a call option on a risky asset driven by exponential Brownian motion. Two particular points (of the many) where the above model of a risky asset can be shown to be inadequate concern the continuity of the paths and the distribution of log-returns of the value of a risky asset. Clearly (2.25) has continuous paths and therefore cannot accommodate for jumps which arguably are present in observed historical data of certain risky assets due to shocks in the market. The feature (2.26) suggests that if one would choose a fixed period of time ∆, then for each n ≥ 1, the innovations log(S(n+1)∆ /Sn∆ ) √ are independent and normally distributed with mean µ∆ and variance σ ∆. Empirical data suggests however that the tails of the distribution of the logreturns are asymmetric as well as having heavier tails than those of normal
60
2 The L´evy–Itˆ o Decomposition and Path Structure
distributions. The tails of the latter being particularly light as they decay like exp{−x2 } for large |x|. See for example the discussion in Schoutens (2003). Recent literature suggests that a possible remedy for these two points is to work with St = seXt , t ≥ 0 instead of (2.25) where again s > 0 is the initial value of the risky asset and X = {Xt : t ≥ 0} is now a L´evy process. This preserves multiplicative stationary and independent increments as well as allowing for jumps, distributional asymmetry and the possibility of heavier tails than the normal distribution can offer. A rather unsophisticated example of how the latter may happen is simply to take for X a compound Poisson process whose jump distribution is asymmetric and heavy tailed. A more sophisticated example however, and indeed quite a popular model in the research literature, is the so-called variance gamma process, introduced by Madan and Seneta (1990). This L´evy process is pure jump, that is to say σ = 0, and has L´evy measure given by Π(dx) = 1(x<0)
C Gx C e dx + 1(x>0) e−M x dx, |x| x
where C, G, M > 0. It is easily seen by computing explicitly the integral (1∧|x|)Π(dx) and the total mass Π(R) that the variance gamma process R\{0} has paths of bounded variation and further is not a compound Poisson process. It turns out that the exponential weighting in the L´evy measure ensures that the distribution of the variance gamma process at a fixed time t has exponentially decaying tails (as opposed to the much lighter tails of the Gaussian distribution). Working with pure jump processes implies that there is no diffusive nature to the evolution of risky assets. Diffusive behaviour is often found attractive for modelling purposes as it has the taste of a physical interpretation in which increments in infinitesimal periods of time are explained as the aggregate effect of many simultaneous conflicting external forces. Geman et al. (2001) argue however the case for modelling the value of risky assets with L´evy processes which have paths of bounded variation which are not compound Poisson processes. In their reasoning, the latter has a countable number of jumps over finite periods of time which correspond to the countable, but nonetheless infinite number of purchases and sales of the asset which collectively dictate its value as a net effect. In particular being of bounded variation means the L´evy process can be written as the difference to two independent subordinators (see Exercise 2.8). The latter two should be thought of the total prevailing price buy orders and total prevailing price sell orders on the logarithmic price scale. Despite the fundamental difference between modelling with bounded variation L´evy processes and exponential Brownian motion, Geman et al. (2001) also provide an interesting link to the classical model (2.25) via time change. The basis of their ideas lies with the following lemma.
2.7 Interpretations of the L´evy–Itˆ o Decomposition
61
Lemma 2.15. Suppose that X = {Xt : t ≥ 0} is a L´evy process with characteristic exponent Ψ and τ = {τs : s ≥ 0} is an independent subordinator with characteristic Ξ. Then Y = {Xτs : s ≥ 0} is again a L´evy process with characteristic exponent Ξ ◦ Ψ .
Proof. First let us make some remarks about Ξ. We already know that the formula E(eiθτs ) = e−Ξ(θ)s
holds for all θ ∈ R. However, since τ is a non-negative valued process, via analytical extension, we may claim that the previous equality is still valid for θ ∈ {z ∈ C : ℑz ≥ 0}. Note in particular then that since 1 2 2 ℜΨ (u) = σ u + (1 − cos(ux))Π(dx) > 0 2 R
for all u ∈ R, the equality
E(e−Ψ (u)τs ) = e−Ξ(Ψ (u))s
(2.27)
holds. Since X and τ have right continuous paths, then so does Y . Next consider 0 ≤ u ≤ v ≤ s ≤ t < ∞ and θ1 , θ2 ∈ R. Then by first conditioning on τ and noting that 0 ≤ τu ≤ τv ≤ τs ≤ τt < ∞ we have E eiθ1 (Yv −Yu )+iθ2 (Yt −Ys ) = E e−Ψ (θ1 )(τv −τu )−Ψ (θ2 )(τt −τs ) = E e−Ψ (θ1 )τv−u −Ψ (θ2 )τt−s ) = e−Ξ(Ψ (θ1 ))(v−u)−Ξ(Ψ (θ2 ))(t−s)
where in the final equality we have used the fact that τ has stationary independent increments together with (2.27). This shows that Y has stationary and independent increments. Suppose in the above lemma we take for X a linear Brownian motion with drift as in the exponent of (2.25). By sampling this continuous path process along the range of an independent subordinator, one recovers another L´evy process. Geman et al. (2001) suggest that one may consider the value of a risky asset to evolve as the process (2.25) on an abstract time scale suitable to the rate of business transactions called business time. The link between business time and real time is given by the subordinator τ . That is to say, one assumes that the value of a given risky asset follows the process Y = X ◦ τ because at real time s > 0, τs units of business time have passed and hence the value of the risky asset is positioned at Xτs . Returning to the example of the variance gamma process given above, it turns out that one may recover it from a linear Brownian motion by applying a time change using a gamma subordinator. See Exercise 2.9 for more details on the facts mentioned here concerning the variance gamma process as well as Exercise 2.12 for more examples of L´evy processes which may be written in terms of a subordinated Brownian motion with drift.
62
2 The L´evy–Itˆ o Decomposition and Path Structure
Exercises 2.1. The object of this exercise is to give a reminder of the additive property of Poisson distributions (which is also the reason why they belong to the class of infinite divisible distributions). Suppose that {Ni : i = 1, 2, ...} is an independent sequence of random variables defined on (Ω, F, P ) which are Poisson distributed with parameters λi for i = 1, 2, ..., respectively. Let S = N i≥1 i . Show that (i) if i≥1 λi < ∞ then S is Poisson distributed with parameter i≥1 λi and hence in particular P (S < ∞) = 1, (ii) if i≥1 λi = ∞ then P (S = ∞) = 1. 2.2. Denote by {Ti : i ≥ 1} the arrival times in the Poisson process N = {Nt : t ≥ 0} with parameter λ.
(i) By recalling that inter-arrival times are independent and exponential, show that for any A ∈ B([0, ∞)n ), n! 1 dt × ... × dtn . P ((T1 , ..., Tn ) ∈ A|Nt = n) = n (0≤t1 ≤...≤tn ≤t) 1 t A (ii) Deduce that the distribution of (T1 , ..., Tn ) conditional on Nt = n has the same law as the distribution of an ordered independent sample of size n taken from the uniform distribution on [0, t]. 2.3. If then show η is a measure on (S, S) and f : S → [0, ∞) is measurable that S (1 − e−φf (x) )η(dx) < ∞ for all φ > 0 if and only if S (1 ∧ f (x))η(dx) < ∞. 2.4. Recall that D[0, 1] is the space of functions f : [0, 1] → R which are right continuous with left limits. (i) Define the norm ||f || = supx∈[0,1] |f (x)|. Use the triangle inequality to deduce that D[0, 1] is closed under uniform convergence with respect to the norm || · ||. That is to say, show that if {fn : n ≥ 1} is a sequence in D[0, 1] and f : [0, 1] → R such that limn↑∞ ||fn − f || = 0 then f ∈ D[0, 1]. (ii) Suppose that f ∈ D[0, 1] and let ∆ = {t ∈ [0, 1] : |f (t) − f (t−)| = 0} (the set of discontinuity points). Show that ∆ is countable if ∆c is countable for all c > 0 where ∆c = {t ∈ [0, 1] : |f (t) − f (t−)| > c}. Next fix c > 0. By supposing for contradiction that ∆c has an accumulation point, say x, show that the existence of either a left or right limit at x fails as it would imply that there is no left or right limit of f at x. Deduce that ∆c and hence ∆ is countable. 2.5. The explicit construction of a L´evy process given in the L´evy–Itˆo decomposition begs the question as to whether one may construct examples of deterministic functions which have similar properties to those of the paths
2.7 Exercises
63
of L´evy processes. The objective of this exercise is to do precisely that. The reader is warned however, that this is purely an analytical exercise and one should not necessarily think of the paths of L´evy processes as being entirely similar to the functions constructed below in all respects. (i) Let us recall the definition of the Cantor function which we shall use to construct a deterministic function which has bounded variation and that is right continuous with left limits. Take the interval C0 := [0, 1] and perform the following iteration. For n ≥ 0 define Cn as the union of intervals which remain when removing the middle third of each of the intervals which make up Cn−1 . The Cantor set C is the limiting object, n≥0 Cn and can be described by C = {x ∈ [0, 1] : x =
αk
k≥1
3k
such that αk ∈ {0, 2} for each k ≥ 1}.
One sees then that the Cantor set is simply the points in [0, 1] which omits numbers whose tertiary expansion contain the digit 1. To describe the Cantor function, for each x ∈ [0, 1] let j(x) be the smallest j for which k αj = 1 in the tertiary expansion of k≥1 αk /3 of x. If x ∈ C then j(x) = ∞ and otherwise if x ∈ [0, 1]\C then 1 ≤ j(x) < ∞. The Cantor function is defined as follows f (x) =
1 2j(x)
j(x)−1
+
i=1
αj for x ∈ [0, 1]. 2i+1
Now consider the function g : [0, 1] → [0, 1] given by g(x) = f −1 (x) − at for a ∈ R. Here we understand f −1 (x) = inf{θ : f (θ) > x}. Note that g is monotone if and only if a ≤ 0. Show that g has only positive jumps and the value of x for which g jumps form a dense set in [0, 1]. Show further that g has bounded variation on [0, 1]. (ii) Now let us construct an example of a deterministic function which has unbounded variation and that is right continuous with left limits. Denote by Q2 the dyadic rationals. Consider a function J : [0, ∞) → R as follows. For all x ≥ 0 which are not in Q2 , set J(x) = 0. It remains to assign a value for each x = a/2n where a = 1, 3, 5, ... (even values of a cancel). Let −n 2 if a = 1, 5, 9, ... J(a/2n ) = −2−n if a = 3, 7, 11, ... and define f (x) =
J(x).
s∈[0,x]∩Q2
Show that f is uniformly bounded on [0, 1], is right continuous with left limits and has unbounded variation over [0, 1].
64
2 The L´evy–Itˆ o Decomposition and Path Structure
2.6. Suppose that X is a L´evy process with L´evy measure Π. (i) For each n ≥ 2 show that for each t > 0, xn N (ds × dx) < ∞ [0,t]
R
almost surely if and only if
|x|≥1
(ii) Suppose now that Π satisfies
[0,t]
R
|x|n Π(dx) < ∞.
|x|≥1
|x|n Π(dx) < ∞ for n ≥ 2. Show that
xn N (ds × dx) − t
R
xn Π(dx), t ≥ 0
is a martingale. 2.7. Let X be a L´evy process with L´evy measure Π. Denote by N the Poisson random measure associated with its jumps. (i) Show that P( sup |Xs − Xs− | > a) = 1 − e−tΠ(R\(−a,a)) 0<s≤t
for a > 0. (ii) Show that the paths of X are continuous if and only if Π = 0. (iii) Show that the paths of X are piece-wise linear if and only if it is a compound Poisson process with drift if and only if σ = 0 and Π(R) < ∞. [Recall that a function f : [0, ∞) → R is right continuous and piece-wise linear if there exist sequence of times 0 = t0 < t1 < ... < tn < ... with limn↑∞ tn = ∞ such that on [tj−1 , tj ) the function f is linear]. (iv) Now suppose that Π(R) = ∞. Argue by contradiction that for each positive rational q ∈ Q there exists a decreasing sequence of jump times for X, say {Tn (ω) : n ≥ 0}, such that limn↑∞ Tn = q. Hence deduce that the set of jump times are dense in [0, ∞). 2.8. Show that any L´evy process of bounded variation may be written as the difference of two independent subordinators. 2.9. This exercise gives another explicit example of a L´evy process; the variance gamma process, introduced by Madan and Seneta (1990) for modelling financial data. (i) Suppose that Γ = {Γt : t ≥ 0} is a gamma subordinator with parameters α, β and that B = {Bt : t ≥ 0} is a standard Brownian motion. Show that for c ∈ R and σ > 0, the variance gamma process
2.7 Exercises
65
Xt := cΓt + σBΓt , t ≥ 0 is a L´evy process with characteristic exponent Ψ (θ) = β log(1 − i
θc σ 2 θ2 + ). α 2α
(ii) Show that the variance gamma process is equal in law to the L´evy process (1)
Γ (1) − Γ (2) = {Γt
(2)
− Γt
: t ≥ 0},
where Γ (1) is a Gamma subordinator with parameters −1 1 c2 1c 1 σ2 (1) α = + and β (1) = β + 4 α2 2 α 2α and Γ (2) is a Gamma subordinator, independent of Γ (1) , with parameters −1 1c 1 c2 1 σ2 (2) − α = + and β (2) = β. 4 α2 2 α 2α 2.10. Suppose that d is an integer greater than one. Choose a ∈ Rd and let Π be a measure concentrated on Rd \{0} satisfying (1 ∧ |x|2 )Π(dx) Rd
where | · | is the standard Euclidian norm. Show that it is possible to construct a d-dimensional process X = {Xt : t ≥ 0} on a probability space (Ω, F, P) having the following properties. (i) The paths of X are right continuous with left limits P-almost surely in the sense that for each t ≥ 0, P(lims↓t Xs = Xt ) = 1 and P(lims↑t Xs exists) = 1. (ii) P(X0 = 0) = 1, the zero vector in Rd . (iii) For 0 ≤ s ≤ t, Xt − Xs is independent of σ(Xu : u ≤ s). (iv) For 0 ≤ s ≤ t, Xt − Xs is equal in distribution to Xt−s . (v) For any t ≥ 0 and θ ∈ Rd , E(eiθ·Xt ) = e−Ψ (θ)t and 1 Ψ (θ) = ia · θ + θ · Aθ + 2
Rd
(1 − eiθ·x + i(θ · x)1(|x|<1) )Π(dx), (2.28)
where for any two vectors x and y in Rd , x · y is the usual inner product and A is a d × d matrix whose eigenvalues are all non-negative.
66
2 The L´evy–Itˆ o Decomposition and Path Structure
2.11. Suppose that X is a subordinator. Show that it has a Laplace exponent given by − log E(e−qX1 ) = Φ(q) = dq + (1 − e−qx )Π(dx) (0,∞)
for q ≥ 0. Show using integration by parts that ∞ Φ(q) = dq + q e−qx Π(x, ∞)dx 0
and hence that the drift term d may be recovered from the limit lim
q↑∞
Φ(q) = d. q
2.12. Here are some more examples of L´evy processes which may be written as a subordinated Brownian motion. (i) Let α ∈ (0, 2). Show that a Brownian motion subordinated by a stable process of index α/2 is a symmetric stable process of index α. (ii) Suppose that X = {Xt : t ≥ 0} is a compound Poisson process with L´evy measure given by % $ Π(dx) = 1(x<0) e−a|x| + 1(x>0) e−ax dx for a > 0. Now let τ = {τs : s ≥ 0} be a pure jump subordinator with L´evy measure 2 π(dx) = 1(x>0) 2ae−a x dx. √ Show that { 2Bτs : s ≥ 0} has the same law as X where B = {Bt : t ≥ 0} is a standard Brownian motion independent of τ . (iii) Suppose now that X = {Xt : t ≥ 0} is a compound Poisson process with L´evy measure given by √ λ 2 −x2 /2σ2 Π(dx) = √ e dx σ π for x ∈ R. Show that {σBNt : t ≥ 0} has the same law as X where B is as in part (ii) and {Ns : s ≥ 0} is a Poisson process with rate 2λ independent of B. Further, the final part gives a simple example of L´evy processes which may be written as a subordinated L´evy process. (iv) Suppose that X is a symmetric stable process of index α ∈ (0, 2). Show that X can be written as a symmetric stable process of index α/β subordinated by an independent stable subordinator of index β ∈ (0, 1).
3 More Distributional and Path-Related Properties
In this chapter we consider some more distributional and path-related properties of general L´evy processes. Specifically we examine the Strong Markov Property, duality, moments and exponential change of measure. In Chap. 1 it was mentioned that any L´evy process X = {Xt : t ≥ 0} is assumed to be defined on a probability space (Ω, F, P). We now broaden this assumption. Henceforth any L´evy process X is assumed to be defined on a filtered probability space (Ω, F, F, P) where now the filtration F = {Ft : t ≥ 0}, defined by Ft = σ(Ft0 , O), Ft0 = σ(Xs : s ≤ t) and O is the set of null sets of P. Principally what will be of repeated use in making this assumption is the consequence that the filtration F becomes right continuous.1 That is to say for each t ≥ 0, & Fs . Ft = s>t
The proof of this fact is given in Exercise 3.1.
3.1 The Strong Markov Property Recall that X = {Xt : t ≥ 0} defined on the filtered space (Ω, F, F, P) is a Markov Process if for each B ∈ B(R) and s, t ≥ 0, P(Xt+s ∈ B|Ft ) = P(Xt+s ∈ B|σ(Xt )). 1
(3.1)
It is important to stress that, in general, completing the filtration of a stochastic process by the null sets of its measure is not sufficient to induce right continuity in the modified filtration.
68
3 More Distributional and Path-Related Properties
In addition, recall that a non-negative random variable, say τ , defined on the same filtered probability space (Ω, F, F, P) is called a stopping time if {τ ≤ t} ∈ Ft for all t > 0. It is possible that a stopping time may have the property that P(τ = ∞) > 0. In addition, for any stopping time τ , {τ < t} =
n≥1
{τ ≤ t − 1/n} ∈
n≥1
Ft−1/n ⊆ Ft .
However, given the right continuity of F, conversely we also have that any random time τ which has the property that {τ < t} ∈ Ft for all t ≥ 0, must also be a stopping time since {τ ≤ t} =
&
n≥1
{τ < t + 1/n} ∈
&
n≥1
Ft+1/n = Ft+ = Ft ,
where in the last equality we use the right continuity of the filtration. In other words, for a L´evy process whose filtration is right continuous we may also say that τ is a stopping time if and only if {τ < t} ∈ Ft for all t ≥ 0. Associated with a given stopping time is the sigma algebra Fτ := {A ∈ F : A ∩ {τ ≤ t} ∈ Ft for all t ≥ 0}. (Note, it is a simple exercise to verify that the above set of sets is a sigma algebra). A Strong Markov Process satisfies the analog of relation (3.1) in which the fixed time t may be replaced by any stopping time τ with respect to F; P(Xτ +s ∈ B|Fτ ) = P(Xτ +s ∈ B|σ(Xτ )) on {τ < ∞}. It is easy to see that all L´evy processes are Markovian. Indeed L´evy processes satisfy the stronger condition that the law of Xt+s − Xt is independent of Ft . The next theorem indicates that the continuation of X beyond an F-stopping time relative to its stopped position is completely independent of the history of the process up to that stopping time and is equal in law to X. Hence in particular, all L´evy processes exhibit the strong Markov property. Theorem 3.1. Suppose that τ is a stopping time. Define on {τ < ∞} the
= {X
t : t ≥ 0} where process X
t = Xτ +t − Xτ , t ≥ 0. X
is independent of Fτ and has the Then on the event {τ < ∞} the process X same law as X and hence in particular is a L´evy process.
3.1 The Strong Markov Property
69
Proof. As finite dimensional distributions determine the law of a stochastic process, it would suffice to prove that for any 0 ≤ v ≤ u ≤ s ≤ t < ∞, H ∈ Fτ and θ1 , θ2 ∈ R, E eiθ1 (Xτ +t −Xτ +s )+iθ2 (Xτ +u −Xτ +v ) ; H ∩ {τ < ∞} = e−Ψ (θ1 )(t−s)−Ψ (θ2 )(u−v) P (H ∩ {τ < ∞}) ,
where Ψ is the characteristic exponent of X. To this end, define a sequence of stopping times {τ (n) : n ≥ 1} by −n k2 if (k − 1) 2−n < τ ≤ k2−n for k = 1, 2, ... (n) τ = 0 if τ = 0.
(3.2)
Stationary independent increments together with the fact that H ∩{τ (n) = k2 } ∈ Fk2−n gives iθ (X −X )+iθ2 (Xτ (n) +u −Xτ (n) +v ) E e 1 τ (n) +t τ (n) +s ; H ∩ {τ (n) < ∞} iθ (X −X )+iθ2 (Xτ (n) +u −Xτ (n) +v ) E e 1 τ (n) +t τ (n) +s ; H ∩ {τ (n) = k2−n } = −n
k≥0
E 1(H∩{τ (n) =k2−n }) k≥0 ' ' E eiθ1 (Xk2−n +t −Xk2−n +s )+iθ2 (Xk2−n +u −Xk2−n +v ) ' Fk2−n = E eiθ1 Xt−s +iθ2 Xu−v P(H ∩ {τ (n) = k2−n }) =
k≥0
= e−Ψ (θ1 )(t−s)−Ψ (θ2 )(u−v) P(H ∩ {τ (n) < ∞}).
The paths of X are almost surely right continuous and τ (n) ↓ τ as n tends to infinity, hence Xτ (n) +s → Xτ +s almost surely for all s ≥ 0 as n tends to infinity. It follows by the dominated convergence theorem that P eiθ1 (Xτ +t −Xτ +s )+iθ2 (Xτ +u −Xτ +v ) ; H ∩ {τ < ∞} iθ (X −X )+iθ2 (Xτ (n) +u −Xτ (n) +v ) ; H ∩ {τ (n) < ∞} = lim E e 1 τ (n) +t τ (n) +s n↑∞
= lim e−Ψ (θ1 )(t−s)−Ψ (θ2 )(u−v) P(H ∩ {τ (n) < ∞}) n↑∞
= e−Ψ (θ1 )(t−s)−Ψ (θ2 )(u−v) P (H ∩ {τ < ∞})
is independent of Fτ on {τ < ∞} and has the same law as X. showing that X
Examples of F-stopping times which will repeatedly occur in the remaining text are those of the first entrance time and first hitting time of a given open or
70
3 More Distributional and Path-Related Properties
closed set B ⊆ R. They are defined, respectively, as T B = inf{t ≥ 0 : Xt ∈ B} and τ B = inf{t > 0 : Xt ∈ B}. We take the usual definition inf ∅ = ∞ here. Typically throughout this book we shall work with the choice of B equal to (x, ∞), [x, ∞), (−∞, x), (−∞, x] and {x} where x ∈ R. The two times T B and τ B are very closely related. They are equal when X0 ∈ B, however, they may possibly differ in value when X0 ∈ B. Consider for example the case that B = [0, ∞) and X is a compound Poisson process with strictly negative drift. When X0 = 0 we have P(T B = 0) = 1 where as P(τ B > 0) = 1.2 To some extent it is intuitively obvious why T B and τ B are stopping times. Nonetheless, we complete this section by justifying this claim. The justification comes in the form of a supporting lemma and a theorem establishing the claim. The lemma illustrates that there exists a sense of left continuity of L´evy processes when appropriately sampling the path with an increasing sequence of stopping times; so called quasi-left-continuity. The proofs of the forthcoming lemma and theorem are quite technical and it will do no harm if the reader chooses to bypass their proofs and continue reading on to the next section at this point in time. The arguments given are rooted in the works of Dellacherie and Meyer (1975–1993) and Blumenthal and Getoor (1968) who give a comprehensive and highly detailed account of the theory of Markov processes in general. Lemma 3.2 (Quasi-Left-Continuity). Suppose that T is a F-stopping time and that {Tn : n ≥ 1} is an increasing sequence of F-stopping times such that limn↑∞ Tn = T almost surely, then limn↑∞ XTn = XT on {T < ∞}. Hence if Tn < T almost surely for each n ≥ 1, then X is left continuous at T on {T < ∞}. Note that for any fixed t > 0, the probability that X jumps at time t is zero. Hence if {tn : n = 1, 2, ...} is a sequence of deterministic times satisfying tn → t as n ↑ ∞ then with probability one Xtn → Xt ; in other words, t is a point of continuity of X.3 The statement in the above lemma thus asserts that this property extends to the case of stopping times. Proof (of Lemma 3.2). First suppose that P(T < ∞) = 1. As the sequence {Tn : n ≥ 1} is almost surely increasing we can identify the limit of {XTn : n ≥ 0} by 2
As we shall see later, this is a phenomenon which is not exclusive to compound Poisson processes with strictly negative drift. The same behaviour is experienced by L´evy processes of bounded variation with strictly negative drift. 3 It is worth reminding oneself for the sake of clarity that Xtn → Xt as n ↑ ∞ means that for all ε > 0 there exists a N > 0 such that |Xtn − Xt | < ε for all n > N and this does not contradict the fact that there might be an infinite number of discontinuities in the path of X in an arbitrary small neighbourhood of t.
3.1 The Strong Markov Property
(
71
Z = 1A XT + 1Ac XT −
where A = n≥1 k≥n {Tk = T } = {Tk = T eventually}. Suppose that f and g are two continuous functions with compact supports. Appealing to bounded convergence and then to bounded convergence again together with the right continuity and left limits of paths we have lim lim E(f (XTn )g(XTn +t )) = lim E(f (Z)g(X(T +t)− )) t↓0
t↓0 n↑∞
= E(f (Z)g(XT )).
(3.3)
Now write for short Pt g(x) = E(g(x+Xt )) = Ex (g(Xt )) which is uniformly bounded in x and t and, by bounded convergence, continuous in x. Note that right continuity of X together with bounded convergence also implies that limt↓0 Pt g(x) = g(x) for each x ∈ R. These facts together with the Markov property applied at time Tn and bounded convergence imply that lim lim E(f (XTn )g(XTn +t )) = lim lim E(f (XTn )Pt g(XTn )) t↓0 n↑∞
t↓0 n↑∞
= lim E(f (Z)Pt g(Z)) t↓0
= E(f (Z)g(Z)).
(3.4)
Equating (3.3) and (3.4) we see that for all uniformly bounded continuous functions f and g, E(f (Z)g(XT )) = E(f (Z)g(Z)). From this equality we may deduce (using standard measure theory) that E(h(Z, XT )) = E(h(Z, Z)) for any bounded measurable function h. In particular, if we take h(x, y) = 1(x=y) then we deduce that Z = XT almost surely. When Tn < T almost surely for all n ≥ 1 it is clear that Z = XT − and the concluding sentence in the statement of the lemma follows for the case that P(T < ∞) = 1. To remove the requirement that P(T < ∞) = 1 recall that for each t > 0, T ∧ t is a finite stopping time. We have that Tn ∧ t ↑ T ∧ t as n ↑ ∞ and hence, from the previous part of the proof, limn↑∞ XTn ∧t = XT ∧t almost surely. In other words, limn↑∞ XTn = XT on {T ≤ t}. Since we may take t arbitrarily large the result follows. Theorem 3.3. Suppose that B is open or closed. Then, (i) T B is a stopping time and XT B ∈ B on {T B < ∞} and (ii) τ B is a stopping time and Xτ B ∈ B on {τ B < ∞} (note that B = B when B is closed).
72
3 More Distributional and Path-Related Properties
Proof. (i) First we deal with the case that B is open. Since any L´evy process X = {Xt : t ≥ 0} has right continuous paths and B is open we may describe the event {T B < t} in terms of the path of X at rational times. That is to say, {T B < t} = {Xs ∈ B}. (3.5) s∈Q∩[0,t)
Since each of the sets in the union are Ft -measurable and sigma algebras are closed under countable set operations, then {T B < t} is also Ft -measurable. Recalling that F is right continuous we have that {T B < t} is Ft -measurable if and only if {T B ≤ t} is Ft -measurable and hence T B fulfills the definition of an F-stopping time. Now note that on {T B < ∞} we have that either XT B ∈ B or that at the time T B , X is at the boundary of B and at the next instant moves into B; that is to say, X moves continuously into B by first approaching its boundary arbitrarily closely. In the latter case, right continuity of paths implies that XT B ∈ B. To illustrate this latter case, consider the example where B = (x, ∞) for some x > 0 and X is any compound Poisson process with strictly positive drift and negative jumps. It is clear that P(XT (x,∞) = x) > 0 as the process may drift up to the boundary point {x} and then continue into (x, ∞) before, for example, the first jump occurs. For the case of closed B, the argument given above does not work. The reason why lies with the possibility that X may enter B simply by touching its boundary which is now included in B. Further, this may occur in a way that cannot be described in terms of a countable sequence of events. We thus employ another technique for the proof of (i) when B is closed. Suppose then that {Bn : n ≥ 1} is a sequence of open sets given by Bn = {x ∈ R : |x − y| < 1/n for some y ∈ B}. Note that B ⊂ Bn for all n ≥ 1 and n≥1 B n = B. From the previous paragraph we have that T Bn are F-stopping times and clearly they are increasing. Denote their limit by T . Since for all t ≥ 0, & {T Bn ≤ t} ∈ Ft , {T ≤ t} = {sup T Bn ≤ t} = n≥1
n≥1
we see that T is an F-stopping time. Obviously T Bn ≤ T B for all n and hence T ≤ T B . On the other hand, according to quasi-left-continuity described in the previous lemma, limn↑∞ XT Bn = XT on the event {T < ∞} showing that XT ∈ B = B and hence that T ≥ T B on {T < ∞}. In conclusion we have that T = T B and XT B ∈ B on {T B < ∞}. (ii) Suppose now that B is open. Let TεB = inf{t ≥ ε : Xt ∈ B}. Note that {TεB < t} = ∅ ∈ Ft for all t < ε and for t ≥ ε,
3.2 Duality
{TεB < t} =
73
{Xs ∈ B},
s∈Q∩[ε,t)
which is Ft measurable and hence by right continuity of F, TεB is an F-stopping time. Now suppose that B is closed. Following the arguments in part (i) but with TεBn := inf{t ≥ ε : Xt ∈ Bn }, we conclude for closed B that TεB is again an F-stopping time. In both cases, when B is open or closed, we also see as in part (i) that XTεB ∈ B on {TεB < ∞}. Now suppose that B is open or closed. The sequence of stopping times {TεB : ε > 0} forms a decreasing sequence as ε ↓ 0 and hence has an almost sure limit which is equal to τ B by definition. Note also that {TεB < ∞} increases to {τ B < ∞} as ε ↓ 0. Since for all t ≥ 0 and decreasing sequences ε ↓ 0, & {τ B ≤ t}c = { inf TεBn > t} = {TεBn > t} ∈ Ft , n≥1
n≥1
we see that τ B is an F-stopping time. Right continuity of the paths of X tell us that limε↓0 XTεB = Xτ B on {τ B < ∞} where the limit is taken in Q ∩ [0, 1].
Hence X τ
B
∈ B whenever {τ B < ∞}.
3.2 Duality In this section we discuss a simple feature of all L´evy processes which follows as a direct consequence of stationary independent increments. That is, when the path of a L´evy process over a finite time horizon is time reversed (in an appropriate sense) the new path is equal in law to the process reflected about the origin. This property will prove to be of crucial importance in a number of fluctuation calculations later on. Lemma 3.4 (Duality Lemma). For each fixed t > 0, define the reversed process {X(t−s)− − Xt : 0 ≤ s ≤ t} and the dual process, {−Xs : 0 ≤ s ≤ t}. Then the two processes have the same law under P. Proof. Define the time reversed process Ys = X(t−s)− − Xt for 0 ≤ s ≤ t and note that under P we have Y0 = 0 almost surely as in the Poisson random measure describing the jumps P(N ({t} × R) = 0) = 1 and hence t is a jump time with probability zero. As can be seen from Fig. 3.1, the paths of Y are obtained from those of X by a reflection about the vertical axis with an
74
3 More Distributional and Path-Related Properties
Fig. 3.1. Duality of the processes X = {Xs : s ≤ t} and Y = {X(t−s)− −Xt : s ≤ t}. The path of Y is a reflection of the path of X with an adjustment of continuity at jump times.
adjustment of the continuity at the jump times so that its paths are almost surely right continuous with left limits. Further, the stationary independent increments of X imply directly the same as is true of Y. Further, for each 0 ≤ s ≤ t, the distribution of X(t−s)− − Xt is identical to that of −Xs and hence, since the finite time distributions of Y determine its law, the proof is complete. The Duality Lemma is also well known for (and in fact originates from) random walks, the discrete time analogue of L´evy processes, and is justified using an identical proof. See for example Feller (1971). One interesting feature that follows as a consequence of the Duality Lemma is the relationship between the running supremum, the running infimum, the process reflected in its supremum and the process reflected in its infimum. The last four objects are, respectively, X t = sup Xs , 0≤s≤t
X t = inf Xs 0≤s≤t
{X t − Xt : t ≥ 0} and {Xt − X t : t ≥ 0}. Lemma 3.5. For each fixed t > 0, the pairs (X t , X t −Xt ) and (Xt −X t , −X t ) have the same distribution under P.
s .
= inf 0≤s≤t X
s = Xt − X(t−s) for 0 ≤ s ≤ t and write X Proof. Define X t Using right continuity and left limits of paths we may deduce that
t − X
, −X
) (X t , X t − Xt ) = (X t t
almost surely. One may visualise this in Fig. 3.2. By rotating the picture about by 180◦ one sees the almost sure equality of the pairs (X t , X t − Xt ) and
3.3 Exponential Moments and Martingales
75
Fig. 3.2. Duality of the pairs (X t , X t − Xt ) and (Xt − X t , −X t ).
s : 0 ≤
t − X
, −X).
Now appealing to the Duality Lemma we have that {X (X t s ≤ t} is equal in law to {Xs : 0 ≤ s ≤ t} under P. The result now follows.
3.3 Exponential Moments and Martingales It is well known that the position of a Brownian motion at a fixed time has moments of all orders. It is natural therefore to cast an eye on similar issues for L´evy processes. In general the picture is not so straightforward. One needs only to consider compound Poisson processes to see how things can difffer. Suppose we write the latter in the form Xt =
Nt
ξi
i=1
where N = {Nt : t ≥ 0} is a Poisson process and {ξi : i ≥ 0} are independent and identically distributed. By choosing the jump distribution of each ξi in such a way that it has infinite first moment (for example any stable distribution on (0, ∞) with index α ∈ (0, 1)) it is clear that E (Xt ) = λtE (ξ1 ) = ∞ for all t > 0.
76
3 More Distributional and Path-Related Properties
As one might suspect, there is an intimate relationship between the moments of the L´evy measure and the moments of the distribution of the associated L´evy process at any fixed time. We have the following theorem. Theorem 3.6. Let β ∈ R, then E eβXt < ∞ for all t ≥ 0 if and only if
|x|≥1
eβx Π(dx) < ∞.
Proof. First suppose that E eβXt < ∞ for some t > 0. Recall X (1) , X (2) and X (3) given in the L´evy–Itˆo decomposition. Note in particular that X (2) is a compound Poisson process with arrival rate λ := Π(R\(−1, 1)) and jump distribution F (dx) := 1(|x|≥1) Π(dx)/Π(R\(−1, 1)) and X (1) + X (3) is a L´evy process with L´evy measure 1(|x|≤1) Π(dx). Since (2) (1) (3) E eβ(Xt +Xt ) , E eβXt = E eβXt it follows that
(2) < ∞, E eβXt
(3.6)
and hence as X (2) is a compound Poisson process, (λt)k (2) E(eβXt ) = e−λt eβx F ∗k (dx) k! R k≥0
= e−Π(R\(−1,1))t
tk
k≥0
k!
R
eβx (Π|R\(−1,1) )∗k (dx) < ∞, (3.7)
where F ∗n and (Π|R\(−1,1) )∗n are the n-fold convolution of F and Π|R\(−1,1) , the restriction of Π to R\(−1, 1), respectively. In particular the summand corresponding to k = 1 must be finite; that is eβx Π (dx) < ∞.
|x|≥1
Now suppose that R eβx 1(|x|≥1) Π (dx) < ∞ for some β ∈ R. Since (Π|R\(−1,1) )∗n (dx) is a finite measure, we have
R
βx
∗n
e (Π|R\(−1,1) )
(dx) =
|x|≥1
βx
n
e Π (dx)
,
and hence (3.7) and (3.6) hold for all t > 0. The proof is thus complete once we show that for all t > 0, (1) (3) E eβ(Xt +Xt ) < ∞. (3.8)
3.3 Exponential Moments and Martingales
77
However, since X (1) + X (3) has a L´evy measure with bounded support, it follows that its characteristic exponent, (1) (3) 1 − log E eiθ(Xt +Xt ) t 1 2 2 = iaθ + σ θ + (1 − eiθx + iθx)Π (dx) , θ ∈ R, 2 (−1,1)
(3.9)
can be extended to an entire function (analytic on the whole of C). To see this, note that (iθx)k+2 iθx Π (dx) . (1 − e + iθx)Π (dx) = (k + 2)! (−1,1) (−1,1) k≥0
The sum and the integral may be exchanged in the latter using Fubini’s Theorem and the estimate (|θ|)k+2 (|θ|x)k+2 Π (dx) ≤ x2 Π (dx) < ∞. (k + 2)! (k + 2)! (−1,1) (−1,1) k≥0
k≥0
Hence the right–hand side of (3.9) can be written as a power series for all θ ∈ C and is thus entire. We have then in particular that (3.8) holds. In general the conclusion of the previous theorem can be extended to a larger class of functions than just the exponential functions. Definition 3.7. A function g : R →[0, ∞) is called submultiplicative if there exists a constant c > 0 such that g(x + y) ≤ cg(x)g(y) for all x, y ∈ R. It follows easily from the definition that, for example, the product of two submultiplicative functions is submultiplicative. Again working directly with the definition it is also easy to show that if g(x) is submultiplicative, then so is {g(cx + γ)}α where c ∈ R, γ ∈ R and α > 0. An easy way to see this is first to prove the statement for g(cx), then g(x + γ) and finally for g(x)α , and then combine the conclusions. Theorem 3.8. Suppose that g is measurable, submultiplicative and bounded on compacts. Then g(x)Π(dx) < ∞ if and only if E (g(Xt )) < ∞ for all t > 0. |x|≥1
The proof is essentially the same once one has established that for each submultiplicative function, g, there exist constants ag > 0 and bg > 0 such that g (x) ≤ ag exp{bg |x|}. See Exercise 3.3 where examples of submultiplicative functions other than the exponential can be found.
78
3 More Distributional and Path-Related Properties
Theorem 3.6 gives us a criterion under which we can perform an exponential change of measure. Define the Laplace exponent ψ(β) =
1 log E(eβXt ) = −Ψ (−iβ), t
(3.10)
defined for all β for which it exits. We now know that the Laplace exponent is finite if and only if |x|≥1 eβx Π(dx) < ∞. Following Exercise 1.5 it is easy to deduce under the latter assumption that E(β) = {Et (β): t ≥ 0} is a Pmartingale with respect to F where Et (β) = eβXt −ψ(β)t , t ≥ 0.
(3.11)
Since it has mean one, it may be used to perform a change of measure via ' dPβ '' = Et (β). dP 'Ft
The change of measure above, known as the Esscher transform, is a natural generalisation of the Cameron–Martin–Girsanov change of measure. As the next theorem shows, it has the important property that the process X under Pβ is still a L´evy process. This fact will play a crucial role in the analysis of risk insurance models and spectrally negative L´evy processes later on in this text. Theorem 3.9. Suppose that X is L´evy process with characteristic triple (a, σ, Π) and that β ∈ R is such that eβx Π(dx) < ∞. |x|≥1
Under the change of measure Pβ the process X is still a L´evy process with characteristic triple (a∗ , σ ∗ , Π ∗ ) where ∗ 2 a = a − βσ + (1 − eβx )xΠ(dx), σ ∗ = σ and Π ∗ (dx) = eβx Π(dx) |x|<1
so that
2
ψβ (θ) = −θ a − βσ +
R
|x|<1
βx
(1 − e )xΠ(dx)
1 + σ2 θ2 2
(eθx − 1 − θx1(|x<1|) )eβx Π(dx).
Proof. Suppose, without loss of generality that β > 0. In the case that β < 0 simply consider the forthcoming argument for −X and for β = 0 the statement of the theorem is trivial. Begin by noting from H¨ older’s inequality that for any θ ∈ [0, β] and all t ≥ 0,
3.3 Exponential Moments and Martingales
79
E(eθXt ) ≤ E(eβXt )θ/β < ∞. Hence ψ(θ) < ∞ for all θ ∈ [0, β]. (In fact the inequality shows that ψ is convex in this interval). This in turn implies that E(eiθXt ) < ∞ for all θ such that −ℑθ ∈ [0, β]} and t ≥ 0. By analytic extension the characteristic exponent Ψ of X is thus finite on the same region of the complex plane. Fix a time horizon t > 0 and note that the density exp{βXt − ψ(β)t} is positive with probability one and hence P and Pβ are equivalent measures on Ft . For each t > 0, let At = {∀s ∈ (0, t], ∃ lim Xu and ∀s ∈ [0, t), ∃ lim Xu = Xs }. u↑s
u↓s
Then, since P(At ) = 1 for all t > 0 it follows that Pβ (At ) = 1 for all t > 0. That is to say, under Pβ , the process X still has paths which are almost surely continuous from the right with left limits. Next let 0 ≤ v ≤ u ≤ s ≤ t < ∞ and θ1 , θ2 ∈ R. Write Eβ eiθ1 (Xt −Xs )+iθ2 (Xu −Xv ) = E eβXv −ψ(β)v e(iθ2 +β)(Xu −Xv )−ψ(β)(u−v) × eβ(Xs −Xu )−ψ(β)(s−u) e(iθ1 +β)(Xt −Xs )−ψ(β)(t−s) .
Using the martingale property of the change of measure and stationary independent increments of X under P, by first conditioning on Fs , then Fu and finally Fv , we find from the previous equality that Eβ eiθ1 (Xt −Xs )+iθ2 (Xu −Xv ) = e(Ψ (−iβ)−Ψ (θ1 −iβ))(t−s) e(Ψ (−iβ)−ψ(θ2 −iβ))(u−v) .
Hence under Pβ , X has stationary independent increments with characteristic exponent given by Ψ (θ − iβ) − Ψ (−iβ), θ ∈ R. By writing out the latter exponent in terms of the triple (a, σ, Π) associated with X we have 1 iθ a − βσ 2 + (1 − eβx )xΠ(dx) + θ2 σ 2 , (3.12) 2 |x|<1 (3.13) + (1 − eiθx + iθx1|x|<1 )eβx Π(dx). R
We thus identify from the L´evy–Khintchine formula for X under Pβ , that the triple (a∗ , σ ∗ , Π ∗ ) are as given. The Laplace exponent is obtained by applying (3.10)–(3.13).
80
3 More Distributional and Path-Related Properties
Seemingly then, the effect of the Esscher transform is to exponentially tilt the L´evy measure, introduce an additional linear drift and leave the Gaussian contribution untouched. Note that in the case of a spectrally negative L´evy process the Laplace exponent satisfies |ψ(θ)| < ∞ for θ ≥ 0. This follows as a consequence of Theorem 3.6 together with the fact that Π(−∞, 0) = 0. Corollary 3.10. The Esscher transform may be applied for all β ≥ 0 when X is a spectrally negative L´evy process. Further, under Pβ , X remains within the class of spectrally negative L´evy process. The Laplace exponent ψβ of X under Pβ satisfies ψβ (θ) = ψ(θ + β) − ψ(β) for all θ ≥ −β. Proof. The Esscher change of measure has the effect of exponentially tilting the original L´evy measure and therefore does not have any influence on the support of the L´evy measure. Compute as before, for θ ≥ −β, e−ψβ (θ) = Eβ (eθX1 ) = E(e(θ+β)X1 −ψ(β) ) = E(e(θ+β)−ψ(β) ), which establishes the final statement of the corollary.
Corollary 3.11. Under the conditions of Theorem 3.9, if τ is an F-stopping time then on {τ < ∞}, ' dPβ '' = Eτ (β). dP ' Fτ
Proof. By definition if A ∈ Fτ , then A ∩ {τ ≤ t} ∈ Ft . Hence Pβ (A ∩ τ ≤ t) = E(Et (β)1(A,τ ≤t) ) = E(E(Et (β)1(A,τ ≤t) |Fτ )) = E(Eτ (β)1(A,τ ≤t) ),
where in the third equality we have used the Strong Markov Property as well as the martingale property for E(β). Now taking limits as t ↑ ∞, the result follows with the help of the Monotone Convergence Theorem. We conclude this section, remaining with spectrally negative L´evy processes, by giving another application of the exponential martingale E(α). Recall the stopping times τx+ = inf{t > 0 : Xt > x}, (3.14) for x ≥ 0; also called first passage times.
3.3 Exponential Moments and Martingales
81
Fig. 3.3. Two examples of ψ, the Laplace exponent of a spectrally negative L´evy process, and the relation to Φ.
Theorem 3.12. For any spectrally negative L´evy process, with q ≥ 0, +
E(e−qτx 1(τx+ <∞) ) = e−Φ(q)x , where Φ(q) is the largest root of the equation ψ(θ) = q. Before proceeding to the proof, let us make some remarks about the function Φ(q) = sup{θ ≥ 0 : ψ(θ) = q}, (3.15) also known as the right inverse of ψ. Exercise 3.5 shows that on [0, ∞), ψ is infinitely differentiable, strictly convex and that ψ(0) = 0 whilst ψ(∞) = ∞. As a particular consequence of these facts, it follows that E(X1 ) = ψ ′ (0+) ∈ [−∞, ∞). In the case that E(X1 ) ≥ 0, Φ(q) is the unique solution to ψ(θ) = q in [0, ∞). When E(X1 ) < 0 the latter statement is true only when q > 0 and when q = 0 there are two roots to the equation ψ(θ) = 0, one of them being θ = 0 and the other being Φ(0) > 0. See Fig. 3.3 for further clarification. Proof (of Theorem 3.12). Fix q > 0. Using spectral negativity to write x = Xτx+ on {τx+ < ∞}, note with the help of the Strong Markov Property that E(eΦ(q)Xt −qt |Fτx+ ) +
= 1(τx+ ≥t) eΦ(q)Xt −qt + 1(τx+
=e
Φ(q)(Xt −Xτ + )−q(t−τx+ ) x
|Fτx+ ),
82
3 More Distributional and Path-Related Properties
where in the final equality we have used the fact that E(Et (Φ(q))) = 1 for all t ≥ 0. Taking expectations again we have Φ(q)Xt∧τ + −q(t∧τx+ )
E(e
x
) = 1.
Noting that the expression in the latter expectation is bounded above by eΦ(q)x , an application of dominated convergence yields +
E(eΦ(q)x−qτx 1(τx+ <∞) ) = 1 which is equivalent to the statement of the theorem.
The following two corollaries are worth recording for later. Corollary 3.13. From the previous theorem we have that P(τx+ < ∞) = e−Φ(0)x which is one, if and only if Φ(0) = 0, if and only if ψ ′ (0+) ≥ 0, if and only if E(X1 ) ≥ 0. For the next corollary we define a killed subordinator to be a subordinator which is sent to an additional “cemetery” state at an independent and exponentially distributed time. Corollary 3.14. If E(X1 ) ≥ 0 then the process {τx+ : x ≥ 0} is a subordinator and otherwise it is equal in law to a subordinator killed at an independent exponential time with parameter Φ(0). Proof. First we claim that Φ(q) − Φ(0) is the Laplace exponent of a nonnegative infinitely divisible random variable. To see this, note that for all x ≥ 0, +
+
E(e−qτx |τx+ < ∞) = e−(Φ(q)−Φ(0))x = E(e−qτ1 |τ1+ < ∞)x , and hence in particular +
E(e−qτ1 |τ1+ < ∞) = E(e
+ −qτ1/n
+ |τ1/n < ∞)n
showing that P(τ1+ ∈ dz|τ1+ < ∞) for z ≥ 0 is the law of an infinitely divisible random variable. Next, using the Strong Markov Property, spatial homogeneity and again the special feature of spectral negativity that {Xτx+ = x} on the event {τx+ < ∞}, we have for x, y ≥ 0 and q ≥ 0, +
+
E(e−q(τx+y −τx ) 1(τ +
x+y
<∞) |Fτx+ )1(τx+ <∞)
+
= Ex (e−qτy 1(τy+ <∞) )1(τx+ <∞) = e−(Φ(q)−Φ(0))y e−Φ(0)y 1(τx+ <∞) .
3.3 Exercises
83
In the first equality we have used standard notation for Markov processes, + Ex (·) = E(·|X0 = x). We see then that the increment τx+y −τx+ is independent + of Fτx+ on {τx < ∞} and has the same law as the subordinator with Laplace exponent Φ(q) − Φ(0) but killed at an independent exponential time with parameter Φ(0). When E(X1 ) ≥ 0 we have that Φ(0) = 0 and hence the concluding statement of the previous paragraph indicates that {τx+ : x ≥ 0} is a subordinator (without killing). On the other hand, if E(X1 ) < 0, or equivalently Φ(0) > 0 then the second statement of the corollary follows. Note that embedded in the previous corollary is the same reasoning which lies behind the justification of the fact that an inverse Gaussian process is a L´evy process. See Sect. 1.2.5 and Exercise 1.6.
Exercises 3.1. Suppose that X is a L´evy process defined on (Ω, F, P) and that Ft is the sigma algebra obtained by completing σ(Xs : s ≤ t) by the null sets of P. The aim of this exercise is to show that F := {Ft : t ≥ 0} is automatically right continuous; that is to say that for all t ≥ 0, & Fs . Ft = s>t
(i) Fix t2 > t1 ≥ 0 and show that for any t ≥ 0, lim E(eiθ1 Xt1 +iθ2 Xt2 |Fu ) = E(eiθ1 Xt1 +iθ2 Xt2 |Ft ) u↓t
almost surely where θ1 , θ2 ∈ R. (ii) Deduce that for any sequence of times t1 , ..., tn ≥ 0, E(g(Xt1 , ..., Xtn )|Ft ) = E(g(Xt1 , ..., Xtn )|Ft+ ) almost surely for all functions g satisfying E(|g(Xt1 , ..., Xtn )|) < ∞. (iii) Conclude that for each A ∈ Ft+ , E(1A |Ft ) = 1A and hence that Ft = Ft+ . 3.2. Show that for any y ≥ 0, {(y ∨ X t ) − Xt : t ≥ 0} and {Xt − (X t ∧ (−y)) : t ≥ 0} are [0, ∞)-valued strong Markov process. 3.3 (Proof of Theorem 3.8 and examples). (i) Use the comments under Theorem 3.8 to prove it.
84
3 More Distributional and Path-Related Properties
(ii) Prove that the following functions are submultiplicative: x ∨ 1, xα ∨ 1 |x| ∨ 1, |x|α ∨ 1, exp(|x|β ), log(|x| ∨ e), log log(|x| ∨ ee ) where α > 0 and β ∈ (0, 1]. (iii) Suppose that X is a stable process of index α ∈ (0, 2). Show that E(|Xt |η ) < ∞ for all t ≥ 0 if and only if η ∈ (0, α). 3.4. A generalised tempered stable process is a L´evy process with no Gaussian component and L´evy measure given by Π(dx) = 1(x>0)
c+ 1+α+
x
e−γ
+
x
dx + 1(x<0)
− c− eγ x dx, |x|1+α−
where c± > 0, α± ∈ (−∞, 2) and γ ± > 0. Show that if X is a generalized stable process, then X may always be written in the form X = X + − X − where X + = {Xt+ : t ≥ 0} and X − = {Xt− : t ≥ 0} satisfy the following:
(i) If α± < 0 then X ± is a compound Poisson process with drift. (ii) If α± = 0 then X ± is a gamma process with drift. (iii) If α± = 1 then X ± is a one-sided Cauchy process. (iv) If α± ∈ (0, 1) ∪ (1, 2) then up to the addition of a linear drift X ± has the same law as a spectrally positive stable process with index α± but ± considered under the change of measure P−γ . 3.5. Suppose that ψ is the Laplace exponent of a spectrally negative L´evy process. By considering explicitly the formula 1 2 2 ψ(β) = −aβ + σ β + (eβx − 1 − βx1(x>−1) )Π(dx) 2 (−∞,0)
show that on [0, ∞), ψ is infinitely differentiable, strictly convex and that ψ(0) = 0 whilst ψ(∞) = ∞. 3.6. Suppose that X is a spectrally negative L´evy process with L´evy–Khintchine exponent Ψ . Here we give another proof of the existence of a finite Laplace exponent for all spectrally negative L´evy processes. (i) Use spectral negativity together with the lack of memory property to show that for x, y > 0, P(X eq > x + y) = P(X eq > x)P(X eq > y) where eq is an exponentially distributed random variable4 independent of X and X t = sups≤t Xs . 4
We are making an abuse of notation in the use of the measure P. Strictly speaking we should work with the measure P × P where P is the probability measure on the space in which the random variable eq is defined. This abuse of notation will be repeated for the sake of convenience at various points throughout this text.
3.3 Exercises
85
(ii) Deduce that X eq is exponentially distributed and hence the Laplace exponent ψ(β) = −Ψ (−iβ) exists and is finite for all β ≥ 0. (iii) By considering the Laplace transform of the first passage time τx+ as in Sect. 3.3, show that one may also deduce via a different route that X eq is exponentially distributed with parameter Φ(q). In particular show that X ∞ is either infinite with probability one or is exponentially distributed accordingly as E(X1 ) ≥ 0 or E(X1 ) < 0. [Hint: reconsider Exercise 3.5]. 3.7. For this exercise it will be useful to refer to Sect. 1.2.6. Suppose that X is a Stable L´evy process with index β = 1; that is to say Π(−∞, 0) = 0. (i) Show that if α ∈ (0, 1) then X is a driftless subordinator with Laplace exponent satisfying − log E(e−θX1 ) = cθα , θ ≥ 0 for some c > 0. (ii) Show that if α ∈ (1, 2), then X has a Laplace exponent satisfying − log E(e−θX1 ) = −Cθα , θ ≥ 0 for some C > 0. Confirm that X has no integer moments of order 2 and above as well as being a process of unbounded variation.
4 General Storage Models and Paths of Bounded Variation
In this chapter we return to the queuing and general storage models discussed in Sects. 1.3.2 and 2.7.2. Predominantly we shall concentrate on the asymptotic behaviour of the two quantities that correspond to the workload process and the idle time in the M/G/1 queue but now in the general setting described in Sect. 2.7.2. Along the way we will introduce some new tools which will be of help, both in this chapter and in later chapters. Specifically we shall spend some additional time looking at the change of variable and compensation formulae. We also spend some time discussing similarities between the mathematical description of the limiting distribution of workload process (when it is non-trivial) and the Pollaczek–Khintchine formula which requires a study of the small scale behaviour of L´evy processes of bounded variation. We start however by briefly recalling and expanding a little on the mathematical background of general storage models.
4.1 General Storage Models A general storage model may be considered as consisting of two processes; {At : t ≥ 0}, the volume of incoming work and {Bt : t ≥ 0}, the total amount of work that can potentially exit from the system as a result of processing work Nt ξi where continuously. In the case of the M/G/1 queue we have At = i=1 {Nt : t ≥ 0} is a Poisson process and {ξi : i = 1, 2, ...} are the independent service times of the ordered customers. Further, as the server processes at a constant unit rate, we have simply that Bt = t. For all t ≥ 0 let Dt = At − Bt . The process D = {Dt : t ≥ 0} is clearly related to the workload of the system, although it is itself not a suitable candidate to model the workload as in principle D may become negative and the workload is clearly a nonnegative quantity. The work stored in the system, W = {Wt : t ≥ 0}, is instead defined by Wt = Dt + Lt ,
88
4 General Storage Models and Paths of Bounded Variation
where L = {Lt : t ≥ 0} is increasing with paths that are right continuous (and left limits are of course automatic by monotonicity) and is added to the process D to ensure that Wt ≥ 0 for all t ≥ 0. The process L must only increase when W = 0 so in particular ∞ 1(Wt >0) dLt = 0. 0
It is easy to check that we may take Lt = −(inf s≤t Ds ∧ 0). Indeed with this choice of L we have that {Wt = 0} if and only if {Dt = inf s≤t Ds ∧ 0} if and only if t is in the support of the measure dL. It can also be proved that there is no other choice of L fulfilling these requirements (see for example Kella and Whitt 1996). We are concerned with the case that the process A is a pure jump subordinator and B is a linear trend. Specifically, Dt = x − Xt where w ≥ 0 is the workload already in the system at time t = 0 and X is a spectrally negative L´evy process of bounded variation. A little algebra with the given expressions for D and L shows that Wt = (w ∨ X t ) − Xt , t ≥ 0,
where X t = sups≤t Xs . We know from the discussion in Sect. 3.3 (see also Exercise 3.6) that the process X has Laplace exponent ψ(θ) = log E(eθX1 ) which is finite for all θ ≥ 0. Writing X in the form dt − St where d > 0 and S = {St : t ≥ 0} is a pure jump subordinator, it is convenient to write the Laplace exponent of X in the form ψ(θ) = dθ − (1 − e−θx )ν(dx), (0,∞) where ν is the L´evy measure of the subordinator S and necessarily (0,∞) (1 ∧ x)ν(dx) < ∞. We interpret ν(dx)dt + o(dt) as the probability a job or storage bulk of size x arrives independently in each dt.
4.2 Idle Times We start by introducing the parameter d − ψ ′ (0+) ρ := . d Note that regimes 0 < ρ < 1, ρ = 1 and ρ > 1 correspond precisely to the regimes ψ ′ (0+) > 0, ψ ′ (0+) = 0 and ψ ′ (0+) < 0, respectively. The first two of these cases thus imply that Φ(0) = 0 and the third case implies Φ(0) > 0 where Φ is the right inverse of ψ defined in (3.15). When d = 1 and ν = λF where F is a distribution function and λ > 0 is the arrival rate, the process W is the workload of an M/G/1 queue. In that case ρ = λE(ξ) where ξ is a random variable with distribution F and is called the traffic intensity. The main purpose of this section is to prove the following result which generalises Theorem 1.11.
4.2 Idle Times
89
Theorem 4.1. Suppose that ρ > 1 then the total time that the storage process spends idle ∞
I :=
0
1(Wt =0) dt,
has the following distribution
P (I ∈ dx) = (1 − e−Φ(0)w )δ0 (dx) + Φ(0)e−Φ(0)(w+xd) dx. Otherwise if 0 < ρ ≤ 1 then I is infinite with probability one. Proof (of Theorem 4.1). Essentially the proof mimics the steps of Exercise 1.9. As one sees for the case of the M/G/1 queue, a key ingredient to the t proof is that one may identify the process {d 0 1(Ws =0) ds : t ≥ 0} as the process {X t : t ≥ 0}. To see why this is true in the general storage model, recall from the L´evy–Itˆ o decomposition that X has a countable number of jumps over finite intervals of time and hence the same is true of W . Further since X has negative jumps, Ws = 0 only if there is no jump at time s. Hence, given that X is the difference of a linear drift with rate d and a subordinator S, it follows that for each t ≥ 0, t 1(X s =Xs ) dXs Xt = 0 t t 1(X s =Xs ) dSs 1(X s =Xs ) ds − =d 0 0 t 1(X s =Xs ) ds =d 0
almost surely where the final equality follows as a consequence of the fact that t t 1(X s =Xs ) dSs ≤ 1(∆Ss =0) dSs = 0. 0
0
It is important to note that the latter calculation only works for spectrally negative L´evy processes of bounded variation on account of the L´evy–Itˆo decomposition. Now following Exercise 3.6 (iii) we can use the equivalence of the events {X ∞ > x} and {τx+ < ∞}, where τx+ is the first hitting time of (x, ∞) defined in (3.14), to deduce that X ∞ is exponentially distributed with parameter Φ(0). When Φ(0) = 0 then the previous statement is understood to mean that P(X ∞ = ∞) = 1. When w = 0 we have precisely that ∞ ∞ X∞ = 1(Ws =0) ds. (4.1) 1(X s =Xs ) ds = d 0 0 Hence we see that I is exponentially distributed with parameter dΦ(0). Recalling which values of ρ imply that Φ(0) > 0 we see that the statement of the theorem follows for the case w = 0.
90
4 General Storage Models and Paths of Bounded Variation
In general however, when w > 0 the equality (4.1) is not valid. Instead we have that τw+ ∞ ∞ 1(Ws =0) ds 1(Ws =0) ds = 1(Ws =0) ds + + τw 0 0 ∞ = 1(τw+ <∞) 1(Ws =0) ds + τw ∗
= 1(X ∞ ≥w) I ,
(4.2)
where I ∗ is independent of Fτw+ on {τw+ < ∞} and equal in distribution to ∞ 1(Ws =0) ds when w = 0. Note that the first integral in the right-hand 0 side of the first equality disappears on account of the fact that Ws > 0 for all s < τw+ . The statement of the theorem now follows for 0 ≤ ρ ≤ 1 by once again recalling that in this regime Φ(0) = 0 and hence from (4.2) X ∞ = ∞ with probability one and hence I = I ∗ . The latter has previously been shown to be infinite with probability one. On the other hand, when ρ > 1, we see from (4.2) that there is an atom at zero corresponding to the event {X ∞ < w} with probability 1 − e−Φ(0)w . Otherwise, with independent probability e−Φ(0)w , the integral I has the same distribution as I ∗ . Again from previous calculations for the case w = 0 we have seen that this is exponential with parameter dΦ(0) and the proof is complete.
4.3 Change of Variable and Compensation Formulae Next we spend a little time introducing the change of variable formula and the compensation formula. Both formulae pertain to a form of stochastic calculus. The theory of stochastic calculus is an avenue which we choose not to pursue in full generality, choosing instead to make some brief remarks. Our exposition will suffice to study in more detail the storage processes discussed in Chap. 1 as well as a number of other applications in later Chapters. 4.3.1 The Change of Variable Formula We assume that X = {Xt : t ≥ 0} is a L´evy process of bounded variation. Referring back to Chap. 2, (2.21) and (2.22) we recall that we may always write its L´evy–Khintchine exponent as Ψ (θ) = −idθ + (1 − eiθx )Π(dx) R
and correspondingly identify X path-wise in the form of a generalised compound Poisson process xN (ds × dx), Xt = dt + [0,t]
R
4.3 Change of Variable and Compensation Formulae
91
where d ∈ R and, as usual, N is the Poisson random measure associated with the jumps of X. Our goal in this section is to prove the following change of variable formula. Theorem 4.2. Let C 1,1 ([0, ∞)×R) be the space of functions f : [0, ∞)×R → R which are continuously differentiable in each variable (in the case of the derivative in the first variable at the origin a right derivative is understood). If f (s, x) belongs to the class C 1,1 ([0, ∞) × R) then
t ∂f ∂f (s, Xs )ds + d (s, Xs )ds f (t, Xt ) = f (0, X0 ) + ∂s 0 0 ∂x + (f (s, Xs− + x) − f (s, Xs− ))N (ds × dx). t
[0,t]
R
It will become apparent from the proof of this theorem that the final integral with respect to N in the change of variable formula is well defined. It is worth mentioning that the change of variable formula exists in a much more general form. For example it is known (cf. Protter 2004 that if V = {Vt : t ≥ 0} is any mapping from [0, ∞) to R (random or deterministic) of bounded variation with paths that are right continuous and f (s, x) ∈ C 1,1 ([0, ∞) × R) is continuously differentiable, then {f (t, Vt ) : t ≥ 0} is a mapping from [0, ∞) to R of bounded variation which satisfies t t ∂f ∂f (s, Vs )ds + (s, Vs− )dVs f (t, Vt ) = f (0, V0 ) + 0 ∂s 0 ∂x ∂f (4.3) {f (s, Vs ) − f (s, Vs− ) − ∆Vs (s, Vs )}, + ∂x s≤t
where ∆Vs = Vs − Vs− . Note also that since V is of bounded variation then it has a minimal decomposition as the difference of two increasing functions mapping [0, ∞) to [0, ∞) and hence left continuity of V is automatically guaranteed. This means that V has a countable number of jumps (see Exercise 2.4). One therefore may understand the final term on the right-hand side of (4.3) as a convergent sum over the countable discontinuities of V . In the case that V is a L´evy process of bounded variation, it is a straightforward exercise to deduce that when one represents the discontinuities of V via a Poisson random measure then (4.3) and the conclusion of Theorem 4.2 agree. Proof (of Theorem 4.2). Define for all ε > 0, Xtε = dt + xN (ds × dx), t ≥ 0. [0,t]
{|x|≥ε}
As Π(R\(−ε, ε)) < ∞ it follows that N counts an almost surely finite number of jumps over [0, t] × {R\(−ε, ε)} and X ε = {Xtε : t ≥ 0} is a compound Poisson process with drift. Suppose the collection of jumps of X ε up to time
92
4 General Storage Models and Paths of Bounded Variation
t are described by the time-space points {(Ti , ξi ) : i = 1, ..., N } where N = N ([0, t] × {R\(−ε, ε)}). Let T0 = 0. Then a simple telescopic sum gives N
f (t, Xtε ) = f (0, X0ε ) +
i=1
(f (Ti , XTεi ) − f (Ti−1 , XTεi−1 ))
+(f (t, Xtε ) − f (TN , XTεN )).
Now noting that X ε is piece-wise linear we have, f (t, Xtε ) = f (0, X0ε ) N Ti ∂f ∂f ε ε ε ε (s, Xs ) + d (s, Xs )ds + (f (Ti , XTi − + ξi ) − f (Ti , XTi − )) + ∂x Ti−1 ∂s i=1 t ∂f ∂f (s, Xsε ) + d (s, Xsε )ds + ∂x TN ∂s t ∂f ∂f = f (0, X0ε ) + (s, Xsε ) + d (s, Xsε )ds ∂s ∂x 0 ε ε (f (s, Xs− + x) − f (x, Xs− ))1(|x|≥ε) N (ds × dx). (4.4) + [0,t]
R\{0}
(Note that the smoothness of f has been From Exercise 2.8 we know that any may be written as the difference of two (1) (2) spirit write Xt = Xt − Xt where (1) Xt = (d ∨ 0)t +
(0,∞)
xN (ds × dx),
t≥0
(−∞,0)
xN (ds × dx),
t ≥ 0.
xN (ds × dx),
t≥0
[0,t]
and (2)
Xt
= |d ∧ 0|t −
[0,t]
Now let (1,ε)
Xt and
(2,ε)
Xt
= |d ∧ 0|t −
= (d ∨ 0)t +
[0,t]
[0,t]
used here). L´evy process of bounded variation independent subordinators. In this
[ε,∞)
(−∞,−ε]
xN (ds × dx),
t≥0
and note by almost sure monotone convergence that for each fixed t ≥ 0, (1,ε) (2,ε) (i,ε) (i) Xt − Xt ↑ Xt almost surely for i = 1, 2 as ε ↓ 0. Since Xtε = Xt we see that for each fixed t > 0 we have limε↓0 Xtε = Xt almost surely. By replacing [0, t] by [0, t) in the delimiters of the definitions above it is also clear ε = Xt− almost surely. that for each fixed t > 0, limε↓0 Xt−
4.3 Change of Variable and Compensation Formulae
93
Now define the random region B = {0 ≤ x ≤ |Xsε | : s ≤ t and ε > 0} and note that B is almost surely bounded in R since it is contained in {0 ≤ x ≤ Xs(1) : s ≤ t} ∪ {0 ≥ x ≥ −Xs(2) : s ≤ t} and the latter two are almost surely bounded sets on account of right continuity of paths. Due to the assumed smoothness of f , both derivatives of f are uniformly bounded (by a random value) on [0, t] × B, where B is the closure of the set B. Using the limiting behaviour of X ε in ε and boundedness of the derivatives of f on [0, t] × B together with almost sure dominated convergence we see that t t ∂f ∂f ∂f ∂f ε ε (s, Xs ) + d (s, Xs )ds = (s, Xs ) + d (s, Xs )ds. lim ε↓0 0 ∂s ∂x ∂x 0 ∂s Again using uniform boundedness of ∂f /∂x but this time on [0, t] × {x + B : |x| ≤ 1} we note with the help of the Mean Value Theorem that for all ε > 0 and s ∈ [0, t], ' ' ε ε '(f (s, Xs− + x) − f (s, Xs− ))1(ε≤|x|<1) , ' ≤ C |x| 1(|x|<1) ,
where C > 0 is some random variable, independent of s, ε and x. The function |x| integrates against N on [0, t] × {(−1, 1)} thanks to the assumption that X has bounded variation. Now appealing to almost sure dominated convergence again we have that ε ε (f (s, Xs− + x) − f (s, Xs− ))1(|x|≥ε) N (ds × dx) lim ε↓0
[0,t]
(−1,1)
=
[0,t]
(−1,1)
f (s, Xs− + x) − f (s, Xs− )N (ds × dx).
A similar limit holds when the delimiters in the double integrals above are replaced by [0, t] × {R\(−1, 1)} as there are at most a finite number of atoms in the support of N in this domain. Now taking limits on both sides of (4.4) the statement of the theorem follows. It is clear from the above proof that one could not expect such a formula to be valid for a general L´evy process. In order to write down a change of variable formula for a general L´evy process, X, one must first progress to the construction of stochastic integrals with respect to the X; at the very least, integrals of the form t
g(s, Xs− )dXs
(4.5)
0
for continuous functions g. Roughly speaking the latter integral may be understood as the limit
94
4 General Storage Models and Paths of Bounded Variation
lim
||P||↓0
i≥1
g(ti−1 , Xti−1 )(Xt∧ti − Xt∧ti−1 ),
where P = {0 = t0 ≤ t1 ≤ t2 ≤ ...} is a partition of [0, ∞), ||P|| = supi≥1 (ti − ti−1 ) and the limit is taken in probability uniformly in t on [0, T ] where T > 0 is some finite time horizon. This is not however the only way to make sense of (4.5) although all definitions must be equivalent; see for example Exercise 4.5. In the case that X has bounded variation the integral (4.5) takes the recognisable form t t g(s, Xs− )N (ds × dx). (4.6) g(s, Xs )ds + g(s, Xs− )dXs = d 0
0
[0,t]
R
Establishing these facts is of course non-trivial and in keeping with the title of this book we shy away from them. The reader is otherwise directed to Applebaum (2004) for a focused account of the necessary calculations. Protter (2004) also gives the much broader picture for integration with respect to a general semi-martingale. (A L´evy process is an example of a broader family of stochastic processes called semi-martingales which form a natural class from which to construct a theory of stochastic integration). We finish this section however by simply stating Itˆ o’s formula for a general L´evy process1 which functions as a change of variable for the cases not covered by Theorem 4.2. Theorem 4.3. Let C 1,2 ([0, ∞) × R) be the space of functions f : [0, ∞) × R which are continuously differentiable in the first variable (where the right derivative is understood at the origin) and twice continuously differentiable in the second variable. Then for a general L´evy process X with Gaussian coefficient σ ≥ 0 and f ∈ C 1,2 ([0, ∞) × R) we have t t ∂f ∂f f (t, Xt ) = f (0, X0 ) + (s, Xs )ds + (s, Xs− )dXs 0 ∂s 0 ∂x t 1 2 ∂2f (s, Xs )ds σ + 2 ∂x2
0 ∂f + f (s, Xs− + x) − f (s, Xs− ) − x (s, Xs− ) N (ds × dx). ∂x [0,t] R 4.3.2 The Compensation Formula Although it was indicated that this chapter principally concerns processes of bounded variation, the compensation formula, which we will shortly establish, is applicable to all L´evy processes. Suppose then that X is a general L´evy process with L´evy measure Π. Recall our running assumption that X is defined on the filtered probability space (Ω, F, F, P) where F = {Ft : t ≥ 0} 1
As with the change of variable formula, a more general form of Itˆ o’s formula exists which includes the statement of Theorem 4.3. The natural setting as indicated above is the case that X is a semi-martingale.
4.3 Change of Variable and Compensation Formulae
95
is assumed to is completed by null sets (and hence is right continuous as X is a L´evy process). As usual, N will denote Poisson random measure with intensity ds × dΠ describing the jumps of X. The main result of this section may be considered as a generalisation of the results in Theorem 2.7. Theorem 4.4. Suppose φ : [0, ∞) × R × Ω → [0, ∞) is a random time-space function such that (i) as a trivariate function φ = φ(t, x)[ω] is measurable, (ii) for each t ≥ 0 φ(t, x)[ω] is Ft × B(R)-measurable and (iii) for each x ∈ R, with probability one, {φ(t, x)[ω] : t ≥ 0} is a left continuous process. Then for all t ≥ 0,
t E φ(s, x)dsΠ(dx) φ(s, x)N (ds × dx) = E [0,t]
0
R
(4.7)
R
with the understanding that the right-hand side is infinite if and only if the left-hand side is. Note that for each ε > 0, [0,t]
R\(−ε,ε)
φ(s, x)N (ds × dx)
is nothing but the sum over a finite number of terms of positive random objects and hence, under the first assumption on φ, is measurable in ω. By (almost sure) monotone convergence the integral [0,t] R φ(s, x)N (ds × dx) is well defined as lim φ(s, x)N (ds × dx) ε↓0
[0,t]
R\(−ε,ε)
and is measurable in ω (recall when the limit of a sequence of measurable functions exists it is also measurable). Hence the left-hand side of (4.7) is well defined even if infinite in value. On the other hand, under the first assumption on φ, Fubini’s Theorem implies that, as a random variable, t φ(s, x)dsΠ(dx) 0
R
is measurable in ω. Hence the expression on the right-hand side of (4.7) is also well defined even when infinite in value. Proof (of Theorem 4.4). Suppose initially that in addition to the assumptions of the theorem, φ is uniformly bounded by C(1∧x2 ) for some C > 0. Note that this ensures the finiteness of the expressions on the left-hand and right-hand side of (4.7). Write
96
4 General Storage Models and Paths of Bounded Variation
φn (t, x) = φ(0, x)1(t=0) +
φ(k/2n , x)1(t∈(k/2n ,(k+1)/2n ])
(4.8)
k≥0
noting that φn also satisfies the assumptions (i)–(iii) of the theorem. Hence, as remarked above, for each ε > 0, φn (s, x)N (ds × dx) [0,t]
R\(−ε,ε)
is well defined and measurable in ω. We have n E φ (s, x)N (ds × dx) [0,t]
⎛
= E⎝
⎛
= E⎝
⎛
= E⎝ =E
R\(−ε,ε)
( 2kn , k+1 2n ]
k≥0
E
k≥0
[0,t]
R\(−ε,ε)
( 2kn
∧t, k+1 2n ∧t]
⎞
φ(k/2n , x)N (ds × dx)⎠
' ⎞ ' ' φ(k/2 , x)N (ds × dx)' F kn ∧t ⎠ ' 2 R\(−ε,ε) ⎞
n
R\(−ε,ε)
φ(k/2n , x)dsΠ(dx)⎠
( 2kn ∧t, k+1 2n ∧t]
k≥0
φn (s, x)dsΠ(dx) ,
R\(−ε,ε)
(4.9)
where in the third equality we have used the fact that N has independent counts on disjoint domains, the measurability of φn (k/2n , x) together with an application of Theorem 2.7 (iii). Since it is assumed that φ is uniformly bounded by C(1 ∧ x2 ) we may apply dominated convergence on both sides of (4.9) as n ↑ ∞ together with the fact that limn↑∞ φn (t, x) = φ(t−, x) = φ(t, x) almost surely (by the assumed left continuity of φ) to conclude that t
E
[0,t]
R\(−ε,ε)
φ(s, x)N (ds × dx)
φ(s, x)dsΠ(dx) .
=E
0
R\(−ε,ε)
Now take limits as ε ↓ 0 and apply the Monotone Convergence theorem on each side of the above equality to deduce (4.7) for the case that φ is uniformly bounded by C(1 ∧ x2 ). To remove the latter condition, note that it has been established that (4.7) holds for φ ∧ C(1 ∧ x2 ) where φ is given in the statement of the theorem. By taking limits as C ↑ ∞ in the aforementioned equality, again with the help of the Monotone Convergence theorem, the required result follows. Reviewing the proof of this result, there is a rather obvious corollary which follows. We leave its proof to the reader as an exercise.
4.4 The Kella–Whitt Martingale
97
Corollary 4.5. Under the same conditions as Theorem 4.4 we have for all 0 ≤ u ≤ t < ∞, ' '
t ' ' ' φ(s, x)dsΠ(dx)'' Fu . E φ(s, x)N (ds × dx)' Fu = E ' u R (u,t] R The last corollary also implies the martingale result below.
Corollary 4.6. Under the same conditions as Theorem 4.4 with the additional assumption that E |φ(s, x)|dsΠ(dx) < ∞, [0,t]
we have that Mt :=
[0,t]
R
R
φ(s, x)N (ds × dx) −
[0,t]
R
φ(s, x)dsΠ(dx), t ≥ 0,
is a martingale. Proof. The additional integrability condition on φ and Theorem 4.4 implies that for each t ≥ 0, |φ(s, x)|dsΠ(dx) < ∞. E|Mt | ≤ 2E [0,t]
For 0 ≤ u ≤ t we see that
R
' ' ' φ(s, x)N (ds × dx)' Fu E(Mt |Fu ) = Mu + E ' (u,t] R '
t ' −E φ(s, x)dsΠ(dx)'' Fu
u
R
= Mu
where the last equality is a consequence of Corollary 4.5.
4.4 The Kella–Whitt Martingale In this section we introduce a martingale, the Kella–Whitt martingale, which will prove to be useful for the analysis concerning the existence of a stationary distribution of the process W . The martingale itself is of implicit interest as far as fluctuation theory of general spectrally negative L´evy processes are concerned since one may derive a number of important identities from it. These identities also appear later in this text as a consequence of other techniques centred around the Wiener–Hopf factorisation. See in particular Exercise 4.8. The Kella–Whitt martingale takes its name from Kella and Whitt (1992) and is presented in the theorem below.
98
4 General Storage Models and Paths of Bounded Variation
Theorem 4.7. Suppose that X is a spectrally negative L´evy process of bounded variation as described in the introduction. For each α ≥ 0, the process t e−α(X s −Xs ) ds + 1 − e−α(X t −Xt ) − αX t , t ≥ 0 ψ(α) 0
is a P-martingale with respect to F. Proof. The proof of this theorem will rely on the change of variable and compensation formulae. To be more precise, we will make use of the slightly more general version of the change of variable formula given in Exercise 4.2 which looks like t t ∂f ∂f f (X t , Xt ) = f (X 0 , X0 ) + d (X s , Xs )ds + (X s , Xs )dX s ∂x 0 0 ∂s + (f (X s , Xs− + x) − f (X s , Xs− ))N (ds × dx). [0,t]
([0, ∞) × R). From the latter we have that t t e−α(X s −Xs ) ds − α e−α(X s −Xs ) dX s = 1 + αd 0 0 −α(X s −Xs− −x) − e−α(X s −Xs− ) )N (ds × dx) (e +
for f (s, x) ∈ C e−α(X t −Xt )
R
1,1
[0,t]
= 1 + αd t + 0
(−∞,0) t −α(X s −Xs )
e
0
(0,∞)
ds − α
t
e−α(X s −Xs ) dX s
0
(e−α(X s −Xs− +x) − e−α(X s −Xs− ) )dsν(dx) (4.10)
+Mt
(recall that ν is the L´evy measure of −X, defined at the end of Sect. 4.1) where for each t ≥ 0, (e−α(X s −Xs− −x) − e−α(X s −Xs− ) )N (ds × dx) Mt = [0,t] (−∞,0) t
−
0
(0,∞)
(e−α(X s −Xs− +x) − e−α(X s −Xs− ) )dsν(dx).
Note that the second integral on the right-hand side of (4.10) can be replaced by X t since the process X increases if and only if the integrand is equal to one. Note also that the final integral on the right-hand side of (4.10) also combines with the first integral to give t t −α(X s −Xs ) −α(X s −Xs ) e ds + ds (e−αx − 1)ν(dx) e αd 0
= ψ(α)
0
t
e−α(X s −Xs ) ds. 0
(0,∞)
4.4 The Kella–Whitt Martingale
99
The theorem is thus proved once we show that M = {Mt : t ≥ 0} is a martingale. However, this is a consequence of Corollary 4.6. For the reader who is more familiar with stochastic calculus and Itˆ o’s formula for a general L´evy process, the conclusion of the previous theorem is still valid when we replace X by a general spectrally negative L´evy process. See Exercise 4.7. The reader is also encouraged to consult Kella and Whitt (1992) where general complex valued martingales of this type are derived. Similarly in this vein one may consult Kennedy (1976), Jacod and Shiryaev (1987) and Nugyen-Ngoc (2005). The theorem below, taken from Kyprianou and Palmowski (2005), is an example of how one may use the Kella–Whitt martingale to study the distribution of the running infimum X = {X t : t ≥ 0} where X t := inf s≤t Xs . Theorem 4.8. Suppose that X is a general spectrally negative L´evy process with Laplace exponent ψ and that eq is a random variable which is exponentially distributed with parameter q which is independent of X. Then for all β ≥ 0 and q > 0, E(e−β(X eq −Xeq ) ) =
q β − Φ(q) . Φ(q) ψ(β) − q
(4.11)
Proof. As indicated in the remarks following the proof of Theorem 4.7, the statement of the latter theorem is still valid when X is a general spectrally negative L´evy process. We will assume this fact without proof here (otherwise refer to Exercise 4.7). Since M is a martingale, it follows that E(Meq ) = 0. That is to say, for all α ≥ 0,
eq e−α(X s −Xs ) ds + 1 − E(e−α(X eq −Xeq ) ) − αE(X eq ) = 0. (4.12) ψ(α)E 0
Taking the first of the three expectations note that eq
∞
∞ −α(X s −Xs ) −α(X s −Xs ) −qu E e 1(s≤u) e du · qe ds = E ds 0 0 0
∞ 1 = E qe−qs e−α(X s −Xs ) ds q 0 1 = E e−α(X eq −Xeq ) . q To compute the third expectation of (4.12) we recall from Exercise 3.6 that X eq is exponentially distributed with parameter Φ(q). Hence the latter expectation is equal to 1/Φ(q). Now returning to (4.12) and using the previous two main observations we may re-write it as (4.11).
100
4 General Storage Models and Paths of Bounded Variation
Corollary 4.9. In the previous theorem, by taking limits as q ↓ 0 on both sides of the above equality, we obtain E(e−β(X ∞ −X∞ ) ) = (0 ∨ ψ ′ (0+))
β . ψ(β)
In particular this shows that P(X ∞ − X∞ = ∞) = 1 if and only if ψ ′ (0+) ≤ 0 and otherwise P(X ∞ − X∞ < ∞) = 1. Proof. Note that when Φ(0) = 0, equivalently ψ ′ (0+) ≥ 0, ψ ′ (0+) = lim θ↓0
ψ(θ) q = lim . q↓0 Φ(q) θ
On the other hand, when Φ(0) > 0, equivalently ψ ′ (0+) < 0, lim q↓0
q = 0. Φ(q)
Using these limits in (4.11) the statement of the Corollary follows.
4.5 Stationary Distribution of the Workload In this section we turn to the stationary distribution of the workload process W , making use of the conclusion in Corollary 4.9 which itself is drawn from the Kella–Whitt martingale. The setting is as in the introduction to this chapter. Theorem 4.10. Suppose that 0 < ρ < 1. Then for all w ≥ 0 the workload has a stationary distribution, lim P(Wt ∈ dx|W0 = w) = (1 − ρ)
t↑∞
where η(dx) =
∞
ρk η ∗k (dx),
(4.13)
k=0
1 ν(x, ∞)dx. dρ
Here we understand η ∗0 (dx) = δ0 (dx) so that the distribution of W∞ has an atom at zero. Otherwise if ρ ≥ 1 then there is no non-trivial stationary distribution. Proof. First suppose that ρ ≥ 1. In this case we know that ψ ′ (0+) ≤ 0 and then from Corollary 4.9 P(X ∞ − X∞ = ∞) = 1. Next note that Wt = (w ∨ X t ) − Xt ≥ X t − Xt thus showing that P(W∞ = ∞) = 1. Now suppose that 0 < ρ < 1. In this case ψ ′ (0+) > 0 and hence from Corollary 3.14 we know that P(τw+ < ∞) = 1. It follows that for all t ≥ τw+ , Wt = X t − Xt and so from Corollary 4.9 we see that for all β > 0,
4.5 Stationary Distribution of the Workload
lim E(e−βWt ) = ψ ′ (0+)
t↑∞
β . ψ(β)
101
(4.14)
The remainder of the proof thus requires us to show that the right-hand side of (4.13) has Laplace–Stieltjes transform equal to the right-hand side of (4.14). To this end, note using integration by parts in the definition of ψ that ∞ ψ(β) =d− e−βx ν(x, ∞)dx. (4.15) β 0 ∞ As ψ ′ (0+) > 0 we have that d−1 0 ν(x, ∞)dx < 1; indeed, for all β ≥ 0 we ∞ have that d−1 0 e−βx ν(x, ∞)dx < 1. We may thus develop the right-hand side of (4.14) as follows
k ψ ′ (0+) 1 ∞ −βx β ′ = ψ (0+) e ν(x, ∞)dx . ψ(β) d d 0 k≥0
Now define the measure η(dx) = (dρ)−1 ν(x, ∞)dx. We have ψ ′ (0+) k ∞ −βx ∗k β ′ ψ (0+) = e η (dx) ρ ψ(β) d 0
(4.16)
k≥0
with the understanding that η ∗0 (dx) = δ0 (dx). Noting that ψ ′ (0+)/d = 1 − ρ the result now follows by comparing (4.16) against (4.14). Note in particular that the stationary distribution, as one would expect, is independent of the initial value of the workload. Theorem 4.10 contains Theorem 1.12. To see this simply set d = 1, ν = λF where F is the distribution with mean µ. As noted earlier in Sect. 1.3.2 for the case of the M/G/1 queue, the expression for the stationary distribution given in statement Theorem 4.10 for the case 0 < ρ < 1 is remarkably similar to the expression for the PollaczekKhintchine formula given in Theorem 1.8. The similarity of these two can be explained simply using Duality Lemma 3.4. Duality implies that for each fixed t ≥ 0, X t − Xt is equal in distribution to −X t . As was noted in the proof of Theorem 4.10, when 0 < ρ < 1, the limit in distribution of W is independent of w and equal to the distributional limit of X − X and hence by the previous remarks, is also equal to the distribution of −X ∞ . Noting further that P(−X ∞ ≤ x) = Px (τ0− = ∞),
where τ0− = inf{t > 0 : Xt < 0}, we see that Theorem 4.10 also reads for all x > 0, ∞ ρk η ∗k (x) Px (τ0− = ∞) = (1 − ρ) k=0
where now η ∗0 (x) = 1. However, this is precisely the combined statements of Theorems 1.8 and 1.9, but now for a general spectrally negative L´evy process of bounded variation.
102
4 General Storage Models and Paths of Bounded Variation
4.6 Small-Time Behaviour and the Pollaczek–Khintchine Formula Either within the context of the stationary distribution of the workload process or the ruin problem, the reason for the appearance of a geometrictype sum in both cases is related to how spectrally negative L´evy processes of bounded variation behave at arbitrarily small times and consequently, how the entire path of the process X decomposes into objects called excursions. This section is dedicated to explaining this phenomenon. We start the discussion with a Lemma, essentially due to Shtatland (1965); see also Chap. IV of Gikhman and Skorokhod (1975). Lemma 4.11. Suppose that X is a spectrally negative L´evy process of bounded variation. Then Xt =d lim t↓0 t almost surely. Proof. Recall from the L´evy–Itˆo decomposition that jumps of L´evy processes are described by a Poisson random measure with intensity dt × ν(dx). From this it follows that the first jump of X of magnitude greater than δ appears after a length of time which is exponentially distributed with parameter ν(δ, ∞). Since we are interested in small-time behaviour, it therefore is of no consequence if we assume that ν is concentrated on (0, δ). That is to say, there are no negative jumps of magnitude greater than δ. Recall that as X is written in the form Xt = dt − St for t ≥ 0 where S = {St : t ≥ 0} is a pure jump subordinator with L´evy measure ν. The proof is then completed by showing that lim t↓0
St = 0. t
Note however that since S has non-decreasing paths, it follows that when t ∈ [2−(n−1) , 2−n ), St ≤ S2−n and hence it suffices to prove that lim
n↑∞
S2−n = 0. 2−(n−1)
To achieve the latter, set Mn = S2−n /2−n and compute on the one hand E(Mn+1 |M1 , ..., Mn ) = 2Mn − 2n+1 E(S2−n − S2−(n+1) |M1 , ..., Mn ). (4.17) On the other hand, time reversing the path {St : t ≤ 2−n } and using the stationarity and independence of increments we have that the law of S2−n /2 − S0 given {S2−n , S2−(n−1) , ..., S1/2 } is equal in law to the law of S2−n − S2−n /2 given {S2−n , S2−(n−1) , ..., S1/2 } and hence E(S2−n − S2−(n+1) |M1 , ..., Mn ) = E(S2−(n+1) |M1 , ..., Mn ).
4.6 Small-Time Behaviour and the Pollaczek–Khintchine Formula
103
Substituting back into (4.17) we see that E(Mn+1 |M1 , ..., Mn ) = Mn and hence the sequence M = {Mn : n ≥ 1} is a positive P-martingale with respect to the filtration generated by M . The Martingale Convergence Theorem implies that M∞ := limn↑∞ Mn exists and Fatou’s Lemma implies that xν(dx). E(M∞ ) ≤ E(M1 ) = (0,δ)
We have then that St 1 1 1 E lim sup xν(dx). ≤ E(lim sup Mn ) = E(M∞ ) ≤ t 2 2 2 (0,δ) t↓0 n↑∞
(4.18)
Since (0,1) xν(dx) < ∞ the right-hand side above can be made arbitrarily small by letting δ ↓ 0. This shows that the expectation on the left-hand side of (4.18) is equal to zero and hence so is the limsup in the expectation with probability one. The Lemma shows that for all sufficiently small times, Xt > 0 and hence P(τ0− > 0) = 1. That is to say, when starting from zero, it takes a strictly positive amount of time before X visits (−∞, 0). Compare this with, for example, the situation of a Brownian motion. It is intuitively clear that it will visit both sides of the origin immediately. To be rigorous about this, recall from Exercise 1.7 that the first passage process of a Brownian motion is a stable- 12 subordinator. Since the latter subordinator is not a compound Poisson process, and hence does not remain at the origin for an initial almost surely strictly positive period of time, first passage strictly above level zero of B occurs immediately. By symmetry, the same can be said about first passage strictly below the level zero. In order to complete our explanation of the geometric-type sum appearing in the Pollaczek–Khinchine formula let us proceed for the sake of convenience by showing that P(σx+ = ∞) takes the form given in the right-hand side of (4.13) where now we take Y = −X and for each x ≥ 0, σx+ = inf{t > 0 : Yt > x}. Lemma 4.11 shows that P(σ0+ > 0) = 1. This information allows us to make the following path decomposition. Define T0 = 0 and H0 = 0. Let T1 := σ0+ and XT1 if T1 < ∞ H1 = ∞ if T1 = ∞. Next we construct iteratively the variables T1 , T2 , ... and H1 , H2 , ... in such a way that inf{t > Tn−1 : Xt > Hn−1 } if Tn−1 < ∞ Tn := ∞ if Tn−1 = ∞
104
4 General Storage Models and Paths of Bounded Variation
and Hn :=
XTn if Tn < ∞ ∞ if Tn = ∞.
Note in particular that T1 = σ0+ is a stopping time and that for each n ≥ 1, Tn+1 − Tn is equal in distribution to T1 . The Strong Markov Property and stationary independent increments imply that in the event that {Tn−1 < ∞} the path (4.19) ǫn = {Xt : Tn−1 < t ≤ Tn } is independent of FTn−1 and has the same law as {Xt : 0 < t ≤ T1 }. In particular, the pair (Tn − Tn−1 , Hn − Hn−1 ) are independent of FTn−1 and have the same distribution as (σ0+ , Xσ+ ) under law P. 0 The sequence of independent and identically distributed sections of path {ǫn : n ≥ 1} are called the excursions of X from its maximum. The sequence of pairs {(T, H) := (Tn , Hn ) : n ≥ 0} are nothing more than the jump times and the consecutive heights of the new maxima of X so long as they are finite. The assumption that X drifts to infinity implies that the distribution of σ0+ (and hence Xσ+ ) under P is defective. To see this, recall that X ∞ − X∞ is 0
equal in distribution to −X ∞ which in turn is equal to Y ∞ . From (4.15) we see that as limβ↑∞ ψ(β)/β = d. Hence, as it is assumed that 0 < ρ < 1, or equivalently that ψ ′ (0+) > 0, we see from Corollary 4.9 that 1−ρ=
ψ ′ (0+) = lim E(e−βY ∞ ) = P(Y ∞ = 0) = E(σ0+ = ∞). β↑∞ d
It follows then that there exists an almost surely finite N for which (Tn , Hn ) are all finite for all n ≤ N and infinite for all n > N . We say that the excursion ǫn is infinite if Tn −Tn−1 = ∞ and otherwise finite. Since excursions are independent and identically distributed, the total number of excursions N + 1 is the first time to failure in Bernoulli trials where “failure” means the occurrence of an infinite excursion and, as noted above, failure has probability 1 − ρ. That is to say N + 1 is geometrically distributed with parameter 1 − ρ. As the process Y is assumed to drift to ∞ the structure of the path of Y must correspond to the juxtaposition of N finite excursions followed by a final infinite excursion. Figure 4.1 gives a symbolic impression of this decomposition leaving out details of the path within excursions. Using the decomposition of the path of Y into the juxtaposition of independent and identically distributed excursions from the maximum it is now clear that the event that there is no ruin corresponds to the event that there are N finite excursions which when pasted end to end have a right end point which is no higher than x followed by an infinite excursion. Here, as above, N +1 is geometrically distributed with parameter 1−ρ. It follows immediately that
4.6 Exercises
105
x
n
infinite excursion
Tn−
Tn
Fig. 4.1. A symbolic sketch of the decomposition of the path of Y when it fails to cross the level x.
P(σx+ = ∞) =
n≥0
(1 − ρ)ρn P(Hn ≤ x|ǫ1 , ..., ǫn are finite).
Recalling that the increments of Hn are independent and identically distributed with the same law as σ0+ under P it follows that the probabilities in the sum are each equal to µ∗n (x) where µ(dx) = P(H1 ≤ x|T1 < ∞) = P(−Xτ − ≤ x|τ0− < ∞) 0
thus explaining the form of the Pollaczek–Khintchine formula. Note that in our reasoning above, we have not proved that µ(dx) = (dρ)−1 ν(x, ∞)dx. However, by comparing the conclusions of the previous discussion with the conclusion of Theorem 4.10, we obtain the following corollary. Corollary 4.12. Suppose that X is a spectrally negative L´evy process of bounded variation such that ψ ′ (0+) > 0. Then P(τ0− < ∞) = ρ and x 1 − P(−Xτ − ≤ x|τ0 < ∞) = ν(y, ∞)dy. 0 dρ 0
Exercises 4.1. Suppose that X = {Xt : t ≥ 0} is a spectrally negative process of bounded variation. Suppose that we define for each t ≥ 0, L0t = #{0 < s ≤ t : Xt = 0}.
106
4 General Storage Models and Paths of Bounded Variation
(i) Show that the process {L0t : t ≥ 0} is almost surely integer valued with paths that are right continuous with left limits. (ii) Suppose now that f is a function which is equal to a C 1 (R) function on (−∞, 0) and equal to another C 1 (R) function on (0, ∞) but may have a discontinuity at 0. Show that for each t ≥ 0, t f ′ (Xs )ds f (Xt ) = f (X0 ) + d 0 (f (Xs− + x) − f (Xs− ))N (ds × dx) + +
(0,t] t
(−∞,0)
(f (Xs ) − f (Xs− ))dL0s .
0
4.2. Suppose that X = {Xt : t ≥ 0} is a spectrally negative L´evy process of bounded variation with drift d (see the discussion following Lemma 2.14). Show that for f (s, x) ∈ C 1,1 ([0, ∞) × R),
t ∂f f (X t , Xt ) = f (X 0 , X0 ) + d (X s , Xs )dX s 0 0 ∂s + f (X s , Xs− + x) − f (X s , Xs− )N (ds × dx). [0,t]
t
∂f (X s , Xs )ds + ∂x
(−∞,0)
4.3. Suppose that X is a L´evy process of bounded variation with L´evy measure Π and drift d ∈ R. We exclude the case of a compound Poisson process where the jump distribution has lattice support. Suppose further that f ∈ C 1 (R) and λ ≥ 0 are such that {e−λt f (Xt ) : t ≥ 0} is a martingale. Assume further that for each y ∈ D, |f (x + y) − f (y)|Π(dx) < ∞, R
where D = [0, ∞) if X is a subordinator and D = R otherwise. (i) Let
' ' ' ' ' ' Tn = inf t ≥ 0 : ' (f (Xt + x) − f (Xt ))Π(dx)' > n . R
Deduce that Tn is a stopping time with respect to F. (ii) Show that {Mt∧Tn : t ≥ 0} is a martingale where Mt = e−λs (f (Xs− + x) − f (Xs− ))N (ds × dx) [0,t] R − e−λs (f (Xs + x) − f (Xs ))dsΠ(dx), [0,t]
R
t ≥ 0.
4.6 Exercises
107
(iii) Deduce with the help of the change of variable formula that, under the assumption that the support of the distribution of Xs is R for all s > 0, ∂f d (y) + (f (y + x) − f (y))Π(dx) = λf (y) ∂y R
for all y ∈ R. (iv) Assume now that for given β ∈ R, |x|>1 eβx Π(dx) < ∞. Show that if f (x) = eβx then necessarily λ = ψ(β).
4.4. Suppose φ fulfils the conditions of Theorem 4.4 and that for each that t > 0, E( [0,t] R |φ(s, x)|dsΠ(dx)) < ∞. If M = {Mt : t ≥ 0} is the martingale given in Corollary 4.6 and further, it is assumed that for all t ≥ 0, E( [0,t] R φ(s, x)2 dsΠ(dx)) < ∞ show that E(Mt2 ) = E
φ(s, x)2 dsΠ(dx) .
[0,t]
R
4.5. In this exercise, we use ideas coming from the proof of the L´evy–Itˆo decomposition to prove Itˆ o’s formula in Theorem 4.3 but for the case that σ = 0. Henceforth we will assume that X is a L´evy process with no Gaussian component and f (s, x) ∈ C 1,2 ([0, ∞) × R) which is uniformly bounded along with its first derivative in s and first two derivatives in x. (i) Suppose that X has characteristic exponent Ψ (θ) = iθa + (1 − eiθx + iθx1(|x|<1) )Π(dx). R
(ε)
For each 1 > ε > 0 let X characteristic exponent (ε) Ψ (θ) = iθa +
(ε)
= {Xt
R\(−ε,ε)
: t ≥ 0} be the L´evy process with
(1 − eiθx + iθx1(|x|<1) )Π(dx).
Show that (ε)
f (t, Xt )
t ∂f (s, Xs(ε) )ds = f (0, X0 ) + 0 ∂s ∂f (ε) (ε) (ε) + (f (s, Xs− + x) − f (s, Xs− ) − x (s, Xs− ))N (ds × dx) ∂x [0,t] |x|>ε t ∂f (ε) (ε) (s, Xs− )dXs(2) + Mt , + (4.20) 0 ∂x where X (2) is a L´evy process with characteristic exponent aiθ + |x|≥1 (1 − (ε)
eiθx )Π(dx) and M (ε) = {Mt : t ≥ 0} is a right continuous, square integrable martingale with respect to the filtration {Ft : t ≥ 0} of X which you should specify.
108
4 General Storage Models and Paths of Bounded Variation
(ii) Fix T > 0. Show that {M (ε) : 0 < ε < 1} is a Cauchy family in the martingale space M2T (see Definition 2.11). (iii) Denote the limiting martingale in part (ii) by M . By taking limits as ε ↓ 0 along a suitable subsequence, show that the Itˆ o formula holds where we may define t t ∂f ∂f (s, Xs− )dXs = (s, Xs− )dX (2) + Mt . ∂x 0 ∂x 0 Explain why the left-hand side above is a suitable choice of notation. (iv) Show that if the restrictions of uniform boundedness of f and its derivatives using stopping times are removed then the same conclusion may be drawn as in (iii) except now there exists an increasing sequence of stopping times tending to infinity, say {Tn : n ≥ 1} , such that for each n ≥ 1 the process M is a martingale when stopped at time Tn . In other words, M is a local martingale and not necessarily a martingale. 4.6. Consider the workload process W of an M/G/1 queue as described in Sect. 1.3.2. Suppose that W 0 = w = 0 and the service distribution F has Laplace transform Fˆ (β) = (0,∞) e−βx F (dx).
(i) Show that the first busy period (the time from the moment of first service to the first moment thereafter that the queue is again empty), denoted B, fulfils E(e−βB ) = Fˆ (Φ(β)) where Φ(β) is the largest solution to the equation θ− (1 − e−θx )λF (dx) = β. (0,∞)
(ii) When ρ > 1, show that there are a geometrically distributed number of busy periods. Hence give another proof of the first part of Theorem 4.1 when w = 0 by using this fact. (iii) Suppose further that the service distribution F is that of an exponential random variable with parameter µ > λ. This is the case of an M/M/1 queue. Show that the workload process has limiting distribution given by
λ δ0 (dx) + 1(x>0) λe−(µ−λ)x dx . 1− µ
4.7. This exercise is only for the reader familiar with the general theory of stochastic calculus with respect to semi-martingales. Suppose that X is a general spectrally negative L´evy process. Recall the notation Et (α) = exp{αXt − ψ(α)t} for t ≥ 0. (i) If M is the Kella–Whitt martingale, show that
dMt = −e−X t +ψ(α)t dEt (α) and hence deduce that M is a local martingale.
4.6 Exercises
109
(ii) Show that E(X t ) < ∞ for all t > 0. (iii) Deduce that E(sups≤t |Ms |) < ∞ and hence that M is a martingale. 4.8. Suppose that X is a spectrally negative L´evy process of bounded variation with characteristic exponent Ψ . (i) Show that for each α, β ∈ R,
t
eiα(Xs −X s )+iβX s ds + 1 − eiα(Xt −X t )+iβX t 0 t eiα(Xs −X s )+iβX s dX s , t ≥ 0 −i(α − β)
Mt = −Ψ(α)
0
is a martingale. Note, for the reader familiar with general stochastic calculus for semi-martingales, one may equally prove that the latter is a martingale for a general spectrally negative L´evy process. (ii) Use the fact that E(Meq ) = 0, where eq is an independent exponentially distributed random variable with parameter q, to show that E(eiα(Xeq −X eq )+iβX eq ) =
q(Φ(q) − iα) , (Ψ(α) + q)(iβ − Φ(q))
(4.21)
where Φ is the right inverse of the Laplace exponent ψ(β) = −Ψ (−iβ). (iii) Deduce that X eq − Xeq and X eq are independent. 4.9. Suppose that X is any L´evy process of bounded variation with drift d > 0 (excluding subordinators). (i) Show that lim t↓0
Xt =d t
almost surely. (ii) Define τ0− = inf{t > 0 : Xt < 0}. By reasoning along similar lines for the case of a spectrally negative process, show that P(τ0− > 0) > 0 (iii) Suppose now that limt↑∞ Xt = ∞. Let η(dx) = P(−Xτ − ∈ dx|τ0− < ∞). 0 Conclude that the Pollaczek–Khinchine formula Px (τ0− = ∞) = (1 − ρ) is still valid under these circumstances.
∞
k=0
ρk η ∗k (x)
5 Subordinators at First Passage and Renewal Measures
In this chapter we look at subordinators; L´evy processes which have paths that are non-decreasing. In addition, we consider killed subordinators. That is subordinators which are sent to a “graveyard state” (in other words an additional point that is not on [0, ∞)) at an independent time that is exponentially distributed. Principally we are interested in first passage over a fixed level and some asymptotic features of the processes as this level tends to infinity. In particular, the (asymptotic) law of the overshoot and undershoot as well as the phenomena of crossing a level by hitting it. These three points of interest turn out to be very closely related to renewal measures. The results obtained in this chapter will be of significance later on when we consider first passage of a general L´evy process over a fixed level. As part of the presentation on asymptotic first passage, we will review some basic facts about regular variation. Regular variation will also be of use in later chapters.
5.1 Killed Subordinators and Renewal Measures Recall that a subordinator is a L´evy process with paths which are nondecreasing almost surely. Equivalently, a subordinator is a L´evy process of bounded variation, positive drift d > 0 and jump measure concentrated on (0, ∞). In this section we shall consider a slightly more general class of process, killed subordinators. Let Y be a subordinator and eη an independent exponentially distributed random variable for some η > 0. Then a killed subordinator is the process Yt if t < eη Xt = ∂ if t ≥ eη , where ∂ is a “graveyard state”. We shall also refer to X as “Y killed at rate η”. If we agree that eη = ∞ when η = 0 then the definition of a killed
112
5 Subordinators at First Passage and Renewal Measures
subordinator includes the class of regular subordinators.1 This will prove to be useful for making general statements. The Laplace exponent of a killed subordinator X is defined for all θ ≥ 0 by the formula Φ(η) = − log E(e−θX1 ) = − log E(e−θY1 1(1<eη ) ) = η−log E(e−θY1 ) = η+Ψ (iθ), where Ψ is the L´evy–Khintchine exponent of Y . From the L´evy–Khintchine formula given in the form (2.21) we easily deduce that (1 − e−θx )Π(dx), (5.1) Φ(θ) = η + dθ + (0,∞)
where d ≥ 0 and (0,∞) (1 ∧ x)Π(dx) < ∞; recall Exercise 2.11. With each killed subordinator we associate a family of potential measures. Define for each q ≥ 0 the q-potential measure by
∞ ∞ −qt (q) e−qt P(Xt ∈ dx)dt. e 1(Xt ∈dx) dt = U (dx) = E 0
0
For notational ease we shall simply write U (0) = U and call it the potential measure. Note that the q-potential measure of a killed subordinator with killing at rate η > 0 is equal to the (q + η)-potential measure of a subordinator. Note also that for each q > 0, (q + η)U (q) is a probability measure on [0, ∞) and also that for each q ≥ 0 U (q) (x) := U (q) [0, x] is right continuous. Roughly speaking, a q-potential measure is an expected discounted measure of how long the process X occupies different regions of space.2 These potential measures will play an important role in the study of how subordinators cross fixed levels. For this reason we will devote the remainder of this section to studying some of their analytical properties. One of the most important facts about q-potential measures is that they are closely related to renewal measures. Recall that the renewal measure associated with a distribution F concentrated on [0, ∞) is defined by F ∗k (dx), x ≥ 0, V (dx) = k≥0
where we understand F ∗0 (dx) := δ0 (dx). As with potential measures we work with the notation V (x) := V [0, x]. For future reference let us recall the two versions of the classical Renewal Theorem. Theorem 5.1 (Renewal Theorem). Suppose that V is the renewal function given above and assume that µ := (0,∞) xF (dx) < ∞. 1
A killed subordinator is only a L´evy process when η = 0 however, it is still a Markov process even when η > 0. 2 From the general theory of Markov processes, U (q) also comes under name of resolvent measure or Green’s measure.
5.1 Killed Subordinators and Renewal Measures
113
(i) If F does not have lattice support then for all y > 0, lim {V (x + y) − V (x)} =
x↑∞
y . µ
(ii) 3 If F does not have lattice support and h : R → R is directly Riemann integrable, then x 1 ∞ lim h(y)dy. h(x − y)V (dy) = x↑∞ 0 µ 0 (iii) Without restriction on the support of F , 1 V (x) = . x↑∞ x µ lim
The precise relationship between q-potential measures of subordinators and renewal measures is given in the following lemma. Lemma 5.2. Suppose that X is a subordinator (no killing). Let F = U (1) and let V be the renewal measure associated with the distribution F . Then V (dx) is equal to the measure δ0 (dx) + U (dx) on [0, ∞). Proof. First note that for all θ > 0, ∞ dt · e−t e−θx U (1) (dx) = 0
[0,∞)
=
∞
0
=
[0,∞)
e−θx P(Xt ∈ dx)
dt · e−(1+Φ(θ))t
1 , 1 + Φ(θ)
where Φ is the Laplace exponent of the underlying subordinator. Note that in the final equality we have used the fact that Φ(θ) > 0. Next compute the Laplace transform of V for all θ > 0 as follows, k −θx −θx (1) e V (dx) = e U (dx) [0,∞)
k≥0
=
k≥0
[0,∞)
1 1 + Φ(θ)
k
1 1 − (1 + Φ(θ))−1 1 . = 1+ Φ(θ)
=
3
(5.2)
This part of the theorem is also known on its own as the Key Renewal Theorem.
114
5 Subordinators at First Passage and Renewal Measures
Note that in the third equality we have used the fact that |1/(1+Φ(θ))| < 1. On the other hand, a similar computation to the one in the first paragraph of this proof shows that the Laplace transform of δ0 (dx) + U (dx) equals the right-hand side of (5.2). Since distinct measures have distinct Laplace transforms the proof is complete. The conclusion of the previous Lemma means that the Renewal Theorem can, and will, be employed at a later stage to understand the asymptotic behaviour of U . Specifically we have the following two asymptotics. Corollary 5.3. Suppose that X is a subordinator (no killing) such that µ := E(X1 ) < ∞. (i) If U does not have lattice support, then for all y > 0, lim {U (x + y) − U (x)} =
x↑∞
y . µ
(ii) Without restriction on the support of U , 1 U (x) = . x↑∞ x µ lim
Proof. The proof is a direct consequence of Theorem 5.1 once one notes that ∞ ∞ −t (1) te−t E(X1 )dt = E(X1 ) µ= e E(Xt )dt = xU (dx) = [0,∞)
0
0
and that U (1) has the same support as U .
In the previous corollary, the requirement that U does not have a lattice support is not a serious restriction as there are analogues to Corollary 5.3 (i); see for example Feller (1971). The following theorem, based on standard results in Blumenthal and Getoor (1968), shows that in principle one can only find examples of potential measures with lattice support when X is a killed compound Poisson subordinator. The statement of the theorem gives in fact a stronger conclusion than the latter. Theorem 5.4. Suppose that X is a killed subordinator with L´evy measure Π. (i) If Π(0, ∞) = ∞ then for any q ≥ 0, U (q) has no atoms. (ii) If Π(0, ∞) < ∞ and Π has a non-lattice support then for all q ≥ 0, U (q) does not have a lattice support. (iii) If Π(0, ∞) < ∞ and Π has a lattice support, then for all q ≥ 0, U (q) has the same lattice support in (0, ∞). Proof. (i) Recall the definition U (q) (dx) = E
0
∞
e−qt 1(Xt ∈dx) dt
5.1 Killed Subordinators and Renewal Measures
115
and note that, on account of monotonicity of the paths of X, an atom at x > 0 occurs only if, with positive probability, the path of X remains at level x over some period of time (a, b) where 0 ≤ a < b < ∞. However, since Π(0, ∞) = ∞, we know the latter behaviour is impossible; see Exercise 2.7. (ii) – (iii) Now suppose that X is equal in law to a compound Poisson subordinator with jump distribution F and arrival rate λ > 0 which is killed at rate η ≥ 0. (Note λF = Π). By conditioning on the number of jumps up to time t > 0 we have P(Xt ∈ dx) = e−ηt
k≥0
e−λt
(λt)k ∗k F (dx), k!
where as usual we understand F ∗0 = δ0 (dx). Using this representation of the transition measure we compute ∞ 1 F ∗k (dx) e−(λ+q+η)t (λt)k dt U (q) (dx) = k! 0 k≥0 ρ k ∗k ρ F (dx), (5.3) = λ k≥0
where ρ = λ/(λ + η + q). The second and third statements of the theorem now follow from the last equality. In the case that F does not have a lattice support in (0, ∞), then neither does F ∗k for any k ≥ 1 and hence neither does U (q) . On the other hand, if F has a lattice support in (0, ∞), then so does F ∗k for any k ≥ 1 (the sum of k independent and identically distributed lattice valued random variables is also lattice valued). Note that the above theorem shows that rescaling the L´evy measure of a subordinator, that is Π → cΠ for some c > 0, has no effect on the presence of atoms in the potential measure. In addition to the close association of the potential measure U with classical renewal measures, the connection of a subordinator with renewal processes4 can be seen in a pathwise sense when X is a compound Poisson subordinator with arrival rate λ > 0 and non-negative jumps with distribution F . In this case it is clear that the range of the process X, that is the projection of the graph of {Xt : t ≥ 0} onto the spatial axis, is nothing more 4
We recall briefly that a renewal process N = {Nx : x ≥ 0} counts the points in [0, x] for x ≥ 0 of a point process (that is a random scattering of points) on [0, ∞) in which points are laid down as follows. Let F be a distribution function on (0, ∞) and suppose that {ξi : i = 1, 2, ...} is a sequence of independent random variables with common distribution F . Points are positioned at {T1 , T2 , ...} where k ξ . In other words, the underlying point process is for each k ≥ 1, Tk = i=1 i nothing more than the range of a random walk with jump distribution F . We may now identify for each x ≥ 0, Nx = sup{i : Ti ≤ x}. Note that if F is an exponential distribution then N is nothing more than a Poisson process.
116
5 Subordinators at First Passage and Renewal Measures
x − Xτx+− TNx+1 − x x
x − TNx Xτx+ − x
Fig. 5.1. A realisation of a compound Poisson subordinator. The range of the process, projected onto the vertical axis, forms a renewal process thus relating overshoot and undershoot to excess and current lifetimes.
than a renewal process. Note that in this renewal process the spatial domain of X plays the role of time and the inter-arrival times are precisely distributed according to F . See Fig. 5.1. Denote this renewal process N = {Nx : t ≥ 0} and let {Ti : i ≥ 0} be the renewal epochs starting with T0 = 0. Then the excess lifetime of N at time x > 0 is defined by TNx +1 − x and the current lifetime by x − TNx . On the other hand recall the stopping time (first passage time) τx+ = inf{t > 0 : Xt > x}. Then the overshoot and undershoot at first passage of level x are given by Xτx+ − x and x − Xτx+ − , respectively. Excess and current lifetimes and overshoots and undershoots are thus related by Xτx+ − x = TNx +1 − x and x − Xτx+ − = x − TNx .
(5.4)
See Fig. 5.1. Classical renewal theory presents the following result for the excess and current lifetime; see for example Feller (1971) or Dynkin (1961). We give the proof for the sake of later reference. Lemma 5.5. Suppose that N is a renewal process with F as the distribution for the spacings. Then the following hold.
5.1 Killed Subordinators and Renewal Measures
117
(i) For u > 0 and y ∈ (0, x], P(TNx +1 − x ∈ du, x − TNx ∈ dy) = V (x − dy)F (du + y),
(5.5)
where V is the renewal measure constructed from F . (ii) Suppose that F has mean µ < ∞ and is non-lattice, then for u > 0 and y > 0, 1 ∞ F (z)dz, lim P(TNx +1 − x > u, x − TNx > y) = x↑∞ µ u+y where F (x) = 1 − F (x). Proof. (i) The key to the proof of the first part is to condition on the number of renewal epochs at time x. We have for k ≥ 0, P(TNx +1 − x > u, x − TNx > y|Nx = k) = F ∗k (dv)F (x − v + u) [0,x−y)
as the probability on the left-hand side requires that the kth renewal epoch occurs sometime before x−y. Further, this epoch occurs in dv with probability F ∗k (dv) and hence the probability that the excess exceeds u requires that the next inter-arrival time exceeds x−v+u with probability F (x−v+u). Summing over k and changing variable in the integral via z = x − v gives V (x − dz)F (z + u). P(TNx +1 − x > u, x − TNx > y) = (y,x]
In differential form this gives the distribution given in the statement of part (i). (ii) From part (i) we may write for u > 0 and y ∈ [0, x), P(TNx +1 − x > u, x − TNx > y) = V (dv)F (x − v + dθ) (u,∞)
=
[0,x−y)
F (dt)
(0,∞)
=
(0,∞)
F (dt)
V (dv)1(t>u+x−v) 1(v∈[0,x−y)) [0,x)
V (dv)1(v>u+x−t) 1(v∈[0,x−y)) , [0,x)
where we have applied the change of variables t = θ + x − v in the second equality. Now note that the indicators and integral delimiters require that v ≥ (u + x − t) ∨ 0 and u + x − t ≤ x − y.
118
5 Subordinators at First Passage and Renewal Measures
Hence for u > 0 and y ∈ [0, x), P(TNx +1 − x > u, x − TNx > y) F (dt){V (x − y) − V ((u + x − t) ∨ 0)}1(t≥u+y) = (0,∞) = F (dt){V (x − y) − V (u + x − t)}1(t
(5.6)
[u+x,∞)
To deal with the second term on the right-hand side of (5.6) we may use the Renewal Theorem 5.1 (iii) to show that for some ε > 0 and x sufficiently large 1+ε tF (dt) F (dt)V (x − y) ≤ µ (u+x,∞) (u+x,∞) which tends to zero as x tends to infinity as µ = (0,∞) tF (dt) < ∞. For the first term on the right-hand side of (5.6) suppose that X is a compound Poisson subordinator whose jump distribution is F and arrival rate is 1, then for this subordinator ∞ ∞ P(Xt ≤ x)dt = V (x), P(τx+ > t)dt = E(τx+ ) = 0
0
where the final equality follows from (5.3) with q = η = 0 and λ = 1. Now applying the strong Markov property we can establish that + V (x + y) = E(τx+y ) + )) = E(τx+ + EXτ + (τx+y x
≤ E(τx+ ) + E(τy+ ) = V (x) + V (y). Using then the bound V (x−y)−V (u+x−t) ≤ V (t−u−y), the right continuity of V and the Renewal Theorem 5.1 (iii) we know that the integrand in first term on the hand side of (5.6) is bounded by a constant times t. Hence as tF (dt) < ∞ dominated convergence applies together with Theorem 5.1 (0,∞) (i) to give lim F (dt){V (x − y) − V (u + x − t)}1(t
5.2 Overshoots and Undershoots
119
In light of (5.4) we see that Lemma 5.5 gives the exact and asymptotic distribution of the overshoot and undershoot at first passage of a compound Poisson subordinator with jump distribution F (with finite mean and nonlattice support in the case of the asymptotic behaviour). In this spirit, the aim of the remainder of this chapter is to study the exact and asymptotic joint distributions of the overshoot and undershoot of a killed subordinator at first passage. There are a number of differences in the range of a killed subordinator compared to the range of a compound Poisson subordinator which create additional difficulties to the situation described above. Firstly, in the case of a killed subordinator, the process may be killed before reaching a specified fixed level and hence one should expect an atom in the distribution of the overshoot at ∞. Secondly, the number of jumps over a finite time horizon may be infinite, which occurs if and only if Π(0, ∞) = ∞, and hence in this case the analysis in the proof of Lemma 5.5 (i) is no longer valid. Finally, in the case of a compound Poisson subordinator when F has no atoms, it is clear that the probability that there is first passage over a given level by hitting the level is zero. However, when moving to a killed subordinator for which either Π(0, ∞) = ∞ or there is a drift present, one should not exclude the possibility that first passage over a fixed level occurs by hitting the level with positive probability. The latter behaviour is called creeping over a fixed level and is equivalent to there being an atom at zero in the distribution of the overshoot at that level. As one might intuitively expect, creeping over a specified fixed level turns out to occur only in the presence of a drift in which case it is possible to creep over all fixed levels. These points will be dealt with in more detail in Sect. 5.3
5.2 Overshoots and Undershoots We begin with the following theorem which gives the generalisation of Lemma 5.5 (i); indeed containing it as a corollary. Weaker versions of this theorem can be found in Kesten (1969) and Horowitz (1972). The format we give is from Bertoin (1996a). Theorem 5.6. Suppose that X is a killed subordinator. Then for u > 0 and y ∈ [0, x], P(Xτx+ − x ∈ du, x − Xτx+ − ∈ dy) = U (x − dy)Π(y + du).
(5.7)
Proof. The proof principally makes use of the compensation formula. Suppose that f and g are two positive, bounded, continuous functions satisfying f (0) = 0. The latter ensures that the product f (Xτx+ − x)g(x − Xτx+ − ) is nonzero only if X jumps strictly above x when first crossing x. This means that we may write the expectation of the latter variable in terms of the Poisson random measure associated with the jumps of X whilst avoiding the issue of creeping.
120
5 Subordinators at First Passage and Renewal Measures
To this end, let us assume that X is equal in law to a subordinator Y killed at rate η ≥ 0. Then E(f (Xτx+ − x)g(x − Xτx+ − )) = E
[0,∞)
(0,∞)
e−ηt φ(t, θ)N (dt × dθ) ,
where φ(t, θ) = 1(Yt− ≤x) 1(Yt− +θ>x) f (Yt− + θ − x)g(x − Yt− ), and N is the Point random measure associated with the jumps of Y . Note that it is straightforward to see that φ satisfies the conditions of Theorem 4.4; in particular that it is left continuous in t. Then with the help of the aforementioned theorem f (u)P(Xτx+ − x ∈ du, x − Xτx+ − ∈ dy) g(y) (0,∞)
[0,x]
=E
∞
0
=E =
[0,x]
=
[0,x]
=
[0,x]
∞
0
dt · e
−ηt
1(Yt− ≤x) g(x − Yt− )
dt · e−ηt 1(Yt ≤x) g(x − Yt )
g(x − z) g(x − z) g(y)
(x−Yt− ,∞)
(x−Yt ,∞)
f (Yt− + θ − x)Π(dθ).
f (Yt + θ − x)Π(dθ)
∞
dt · e−ηt P(Yt ∈ dz)
(x−z,∞)
f (z + θ − x)Π(dθ)
(x−z,∞)
f (z + θ − x)Π(dθ)U (dz)
(0,∞)
f (u)Π(du + y)U (x − dy),
0
(5.8)
where the final equality follows by changing variables with y = x − z and then again with u = θ − y. (Note also that U is the potential measure of X and not Y ). As f and g are arbitrary within their prescribed classes, we read off from the left and right-hand sides of (5.8) the required distributional identity. Intutively speaking, the proof of Theorem 5.6 follows the logic of the proof of Lemma 5.5 (i). The compensation formula serves as a way of “decomposing” the event of first passage by a jump over level x according to the position of X prior to its first passage even when there are an unbounded number of jumps over finite time horizons. To make the connection with the expression given for renewal processes in Lemma 5.5 (i), recall from (5.3) that U (dx) = λ−1 V (dx) on (0, ∞) where U is the potential measure associated with a compound Poisson subordinator with jump distribution F and arrival rate λ > 0 and V is the renewal measure associated with the distribution F . For this compound Poisson subordinator, we also know that Π(dx) = λF (dx) so that U (x − dy)Π(du + y) = V (x − dy)
5.3 Creeping
121
F (u + dy). Setting f (·) = 1(·>u) and g(·) = 1(·>y) , an easy calculation now brings one from the right hand side of (5.8) to the right-hand side of (5.5). As (5.7) is the analogue of the statement in Lemma 5.5 (i) it is now natural to reconsider the proof of part (ii) of the same lemma in the more general context. The following result was presented in Bertoin et al. (1999). Theorem 5.7. Suppose that X is a subordinator (no killing) with finite mean µ := E(X1 ) and such that U does not have lattice support (cf. Theorem 5.4). Then for u > 0 and y ≥ 0, in the sense of weak convergence lim P(Xτx+ − x ∈ du, x − Xτx+ − ∈ dy) =
x↑∞
1 dyΠ(y + du). µ
In particular it follows that the asymptotic probability of creeping satisfies lim P(Xτx+ = x) =
x↑∞
d . µ
The proof of this result is a straightforward adaptation of the proof of Lemma 5.5 (ii) taking advantage of Corollary 5.3 and is left to the reader to verify in Exercise 5.1.
5.3 Creeping Now let us turn to the issue of creeping. Although τx+ is the first time that X strictly exceeds the level x > 0 it is possible that in fact P(Xτx+ = x) > 0; recall the statement and proof of Theorem 3.3. The following conclusion, found for example in Horowitz (1972), shows that crossing the level x > 0 by hitting it cannot occur by jumping onto it from a position strictly below x in the case where the jump measure is infinite. In other words, if our killed subordinator makes first passage above x with a jump then it must do so by jumping it clear, so {Xτx+ = x} = {Xτx+ − x = 0, x − Xτx+ − = 0}, which is of implicit relevance when computing the atom at zero in the overshoot distribution. Lemma 5.8. Let X be any killed subordinator with Π(0, ∞) = ∞. For all x > 0 we have (5.9) P(Xτx+ − x = 0, x − Xτx+ − > 0) = 0. Proof. Suppose for a given x > 0 that P(Xτx+ − x = 0, x − Xτx+ − > 0) > 0. Then this implies that there exists a y < x such that P(Xτy+ = x) > 0. However the latter cannot happen because of the combined conclusions of Theorem 5.6 and Theorem 5.4 (i). Hence by contradiction (5.9) holds.
122
5 Subordinators at First Passage and Renewal Measures
Although one may write with the help of Theorem 5.6 and Lemma 5.8 P(Xτx+ = x) = 1 − P(Xτx+ > x) = 1 − U (x − dy)Π(y, ∞) (0,x]
this does not bring one closer to understanding when the probability on the left-hand side above is strictly positive. In fact, although the answer to this question is intuitively obvious, it turns out to be difficult to prove. It was resolved by Kesten (1969); see also Bretagnolle (1972). The result is given below. Theorem 5.9. For any killed subordinator with jump measure Π satisfying Π(0, ∞) = ∞, and drift coefficient d we have the following. (i) If d = 0 then P(Xτx+ = x) = 0 for all x > 0. (ii) If d > 0 then U has a strictly positive and continuous density on (0, ∞), say u, satisfying P(Xτx+ = x) = du(x). The version of the proof we give here for the above result follows the reasoning in Andrew (2005) (see also Section III.2 of Bertoin (1996a)) and first requires two auxiliary Lemmas given below. In the proof of both we shall make use of the following two key estimates for the probabilities px := P(Xτx+ = x), x > 0. For all 0 < y < x, px ≤ py px−y + (1 − px−y ) and
px ≥ py px−y . The upper bound is a direct consequence of the fact that P(Xτx+ = x) = P(Xτ +
x−y
x−y
x−y
+P(Xτ +
(5.11)
= x − y, Xτx+ = x)
+P(Xτ + ≤ P(Xτ +
(5.10)
> x − y, Xτx+ = x)
= x − y)P(Xτx+ = x|X0 = x − y)
x−y
> x − y),
where in the last line the Strong Markov Property has been used. In a similar way the lower bound is a consequence of the fact that P(Xτx+ = x) ≥ P(Xτ +
x−y
= x − y)P(Xτx+ = x|X0 = x − y).
Lemma 5.10. (i) If for some x > 0 we have px > 0 then limε↓0 supη∈(0,ε) pη = 1. (ii) If for some x > 0 we have px > 3/4 then py ≥ 1/2 + px − 3/4 for all y ∈ (0, x].
5.3 Creeping
123
Proof. (i) From Lemma 5.8 we know that X cannot jump onto x. In other words P(Xτx+ = x > Xτx+ − ) = 0. This implies that {Xτx+ = x} ⊆
&
n≥1
{X visits (x − 1/n, x)}
almost surely. On the other hand, on the event n≥1 {X visits (x − 1/n, x)} we also have by quasi-left-continuity (cf. Lemma 3.2) that Xσ = x where + (the limit exists because of monotonicity). Since σ = limn↑∞ τx−1/n {σ ≤ t} =
&
n≥1
+ {τx−1/n ≤ t}
almost surely it follows that σ is a stopping time with respect to F. Applying the Strong Markov Property at time σ, since Xσ = x and X is not a compound Poisson subordinator, we have that Xt > x for all t > σ showing that in fact σ = τx+ . In conclusion & {Xτx+ = x} = {X visits (x − 1/n, x)} n≥1
almost surely. We may now write px = lim P(X visits (x − 1/n, x)).
(5.12)
n↑∞
Also we may upper estimate px ≤ P(X visits (x − 1/n, x))
sup
pz .
z∈(0,1/n)
Letting n ↑ ∞ in the above inequality and taking (5.12) into account we see that limε↓0 supη∈(0,ε) pη = 1. (ii) Suppose that 0 < y < x. We may assume without loss ofgenerality that py < px for otherwise it is clear that py ≥ px > 3/4 ≥ 1/2 + px − 3/4. From (5.10) it is a simple algebraic manipulation replacing y by x − y to show that 1 − px py ≤ . 1 − px−y
and again replacing y by x − y in the above inequality to deduce that 1 − px−y ≥
px − p y . 1 − py
124
5 Subordinators at First Passage and Renewal Measures
Combining the last two inequalities we therefore have py ≤
(1 − px )(1 − py ) px − p y
and hence the quadratic inequality p2y − py + 1 − px ≥ 0. This in turn implies that (5.13) py ∈ [0, 1/2 − px − 3/4] ∪ [1/2 + px − 3/4, 1].
The remainder of the proof is thus dedicated to showing that inclusion of py in the first of the two intervals cannot happen. Suppose then for contradiction that (5.13) holds for all y ≤ x and there exists a y ∈ (0, x) such that py ≤ 1/2 − px − 3/4. Now define g = sup{z ∈ [0, y); pz ≥ 1/2 +
px − 3/4}
which is well defined since at least p0 = 1. Note from this definition that it could be the case that g = y. Reconsidering the definition ofg and (5.13), we see that either there exists an ε > 0 such that pz ≤ 1/2 − px − 3/4 for all z ∈ (g − ε, g) or for all ε > 0, there exists a sequence of z ∈ (g − ε, g) such that pz ≥ 1/2 + p x − 3/4. In the former case it is clear by the definition of g that pg ≥ 1/2 + px − 3/4. In the latter case, we see when referring back to (5.12) that pg = lim P(X visits (z, g)) ≥ lim sup pg−η z↑g
ε↓0 η∈(0,ε)
and hence pg ≥ 1/2 + px − 3/4. For both cases this implies in particular that g < y. On the other hand, using (5.11) and the conclusion of part (i) we see that lim sup pg+η ≥ pg × lim sup pη = pg ≥ 1/2 + ε↓0 η∈(0,ε)
ε↓0 η∈(0,ε)
px − 3/4.
Since (5.13) is in force for all y ≤ x and g < y, this implies that there exists a g ′ > g such that pg′ ≥ 1/2 + px − 3/4 which contradicts the definition of g. The consequence of this contradiction is that there does not exist a y ∈ (0, x) + px − 3/4 and hence from (5.13) it necessarily follows for which py < 1/2 that py ≥ 1/2 + px − 3/4 for all y ∈ (0, x). Lemma 5.11. Suppose there exists an x > 0 such that px > 0, then (i) limε↓0 pε = 1 and (ii) x → px is strictly positive and continuous on [0, ∞).
5.3 Creeping
125
Proof. (i) The first part is a direct consequence of parts (i) and (ii) of Lemma 5.10. (ii) Positivity follows from a repeated use of the lower estimate in (5.11) to obtain px ≥ (px/n )n and the conclusion of part (i). To show continuity, note with the help of (5.10), lim sup px+ε ≤ lim sup{pε px + 1 − pε } = px ε↓0
ε↓0
and from (5.11) and part (i), lim inf px+ε ≥ lim inf px pε = px . ε↓0
ε↓0
Further, arguing in a similar manner, lim sup px−ε ≤ lim sup ε↓0
ε↓0
and lim inf px−ε ≥ lim inf ε↓0
ε↓0
px = px pε
px + p ε − 1 = px . pε
Thus continuity is confirmed.
Finally we return to the proof of Theorem 5.9. Proof (of Theorem 5.9). Consider the function
a 1(X + =x) dx = M (a) := E 0
τx
a
px dx
0
for all a ≥ 0. For convenience, suppose further that X is equal in law to a subordinator Y killed at rate η. Let N be the Poisson random measure associated with the jumps of X (or equivalently Y ). Then we may write with the help of the L´evy–Itˆo decomposition for subordinators, M (a) = E Y(τa+ ∧eη )− −
[0,τa+ ∧eη )
(0,∞)
xN (ds × dx)
= dE(τa+ ∧ eη ).
(i) If d = 0 then px = 0 for Lebesgue almost every x. Lemma 5.11 now implies that px = 0 for all x > 0. (ii) If d > 0 then three exists an x > 0 such that px > 0. Hence from Lemma 5.11, x → px is strictly positive and continuous. Further, we see that ∞ ∞ + P(Xt ≤ a)dt = dU (a). P(τa ∧ eη > t)dt = d M (a) = d 0
0
The latter implies that U has a density which may be taken as equal to d−1 px for all x ≥ 0.
126
5 Subordinators at First Passage and Renewal Measures
We close this section by noting that the reason why the case of a killed compound Poisson subordinator (Π(0, ∞) < ∞) is excluded from Theorem 5.9 is because of possible atoms in Π. Take for example the case that Π consists of a single atom at x0 > 0 then the same is true of the jump distribution. This + means that P(Xτnx = nx0 ) > 0 for all n ≥ 1. None the less P(Xτx+ = x) = 0 0 for all other x.
5.4 Regular Variation and Tauberian Theorems The inclusion of the forthcoming discussion on regular variation and Tauberian theorems is a prerequisite to Sect. 5.5 which gives the Dynkin–Lamperti asymptotics for the joint law of the overshoot and undershoot. However, the need for facts concerning regular variation will also appear in later sections and chapters. Suppose that U is a measure supported on [0, ∞) and with Laplace– transform e−θx U (dx) Λ(θ) = [0,∞)
for θ ≥ 0 which may be infinite. Note that if there exists a θ0 such that Λ(θ0 ) < ∞ then Λ(θ) < ∞ for all θ ≥ θ0 . The point of this chapter is to present some classic results which equivalently relate certain types of tail behaviour of the measure U to a similar type of behaviour of Λ. Our presentation will only offer the bare essentials based on the so called Karamata theory of regularly varying functions. Aside from their intrinsic analytic curiosity, regularly varying functions have proved to be of great practical value within probability theory, not least in the current context. The highly readable account given in Feller (1971) is an important bridging text embedding into probability theory the classic work of Karamata and his collaborators which dates back to the period between 1930 and the 1960s. For a complete account, the reader is referred to Bingham et al. (1987) or Embrechts et al. (1997). The presentation here is principally based on these books. Definition 5.12. A function f : [0, ∞) → (0, ∞) is said to be regularly varying at zero with index ρ ∈ R if for all λ > 0, lim x↓0
f (λx) = λρ . f (x)
If the above limit holds as x tends to infinity then f is said to be regularly varying at infinity with index ρ. The case that ρ = 0 is referred to as slow variation. Note that any regularly varying function f may always be written in the form f (x) = xρ L(x)
5.4 Regular Variation and Tauberian Theorems
127
where L is a slowly varying function. Any function which has a strictly positive and finite limit at infinity is slowly varying at infinity so the class of slowly (and hence regularly) varying functions is clearly non-empty due to this trivial example. There are however many non-trival examples of slowly varying functions. Examples include L(x) = log x, L(x) = logk x (the kth iterate of log x) and L(x) = exp{(log x)/ log log x}. All of these examples have the property that they are functions which tend to infinity at infinity. The function 1 1 L(x) := exp{(log x) 3 cos[(log x) 3 ]} is an example of a regularly varying function at infinity which oscillates. That is to say lim inf x↑∞ L(x) = 0 and lim supx↑∞ L(x) = ∞. The main concern of this section are the following remarkable results. Theorem 5.13. Suppose that L is slowly varying at infinity, ρ ∈ [0, ∞) and U is a measure supported on [0, ∞). Then the following two statements are equivalent. (i) Λ(θ) ∼ θ−ρ L(1/θ), as θ → 0, (ii)U (x) ∼ xρ L(x)/Γ (1 + ρ) as x → ∞. In the above theorem we are using the notation f ∼ g for functions f and g to mean that lim f (x)/g(x) = 1. Theorem 5.14. Suppose that L is slowly varying at infinity, ρ ∈ (0, ∞) and U is a measure on [0, ∞) which has an ultimately monotone density, u. Then the following two statements are equivalent. (i) Λ(θ) ∼ θ−ρ L(1/θ), as θ → 0, (ii) u(x) ∼ xρ−1 L(x)/Γ (ρ) as x → ∞. Recalling that Γ (1 + ρ) = ρΓ (ρ), Theorem 5.14 is a natural statement next to Theorem 5.13. It says that, up to a slowly varying function, the asymptotic behaviour of the derivative of U (x) behaves like the derivative of the polynomial that U (x) asymptotically mimics; providing of course the density u exists and is ultimately monotone. The methods used to prove these results also produce the following corollary with virtually no change at all. Corollary 5.15. The statement of Theorems 5.13 and 5.14 are still valid when instead the limits in their parts (i) and (ii) are simultaneously changed to θ → ∞ and x → 0. We now give the proof of Theorem 5.13 which, in addition to the assumed regular variation, uses little more than the Continuity Theorem for Laplace transforms of positive random variables. Proof (of Theorem 5.13). It will be helpful for this proof to record the well known fact that for any ∞ > ρ ≥ 0 and λ > 0,
128
5 Subordinators at First Passage and Renewal Measures
∞
xρ e−λx dx =
0
Γ (1 + ρ) . λ1+ρ
In addition we will also use the fact that for all λ > 0 and θ > 0, e−λx U (dx/θ) = Λ(λθ).
(5.14)
(5.15)
[0,∞)
First we prove that (i) implies (ii). Fix λ0 > 0. From (5.15) we have for θ > 0 that e−λ0 x U (dx/θ)/Λ(λ0 θ) is a probability distribution. Again from (5.15) we can compute its Laplace transform as Λ((λ + λ0 )θ)/Λ(λ0 θ). The regular variation assumed in (i) together with (5.14) implies that ∞ λρ0 λρ0 U (dx/θ) xρ−1 e−(λ+λ0 )x dx, = = e−(λ+λ0 )x lim θ↓0 [0,∞) Λ(λ0 θ) (λ0 + λ)ρ Γ (ρ) 0 where the right-hand side is the Laplace transform of a gamma distribution. It follows from the Continuity Theorem for Laplace transforms of probability distributions that e−λ0 x U (dx/θ)/Λ(λ0 θ) converges weakly to e−λ0 x λρ0 xρ−1 / Γ (ρ)dx as θ tends to zero. Using the regular variation of Λ again, this implies that for all x > 0, U (y/θ) ρ ρ λρ y ρ lim λ0 θ = 0 . θ↓0 L(1/θ) ρΓ (ρ) Now setting y = 1, rewriting x = 1/θ and recalling that Γ (1 + ρ) = ρΓ (ρ), statement (ii) follows. Now to prove that (ii) implies (i). The assumption in (ii) expressed in terms of weak convergence implies that for each y ≥ 0, lim
x↑∞
U (x dy) = ρy ρ−1 dy, U (x)
in particular for any t > 0 and λ > 0, t t U (x dy) =ρ e−λy lim y (ρ−1) e−λy dy. x↑∞ 0 U (x) 0
(5.16)
In view of (5.15), the Laplace transform of the measure U (x dy)/U (x) is given by Λ(λ/x)/U (x) for λ > 0. Now suppose that for some 0 < λ0 < 1 and x0 > 0, the sequence {Λ(λ0 /x)/U (x) : x > x0 } is uniformly bounded by some C > 0. With this further assumption in place, we may pick a sufficiently large t > 0 such that
t
∞
e
−y U (x dy)
U (x)
<e
−(1−λ0 )t
t
∞
e−λ0 y
U (x dy) < Ce−(1−λ0 )t . U (x)
Together with (5.16), the above estimate is sufficient to deduce that ∞ ∞ U (x dy) Λ(1/x) = lim =ρ y (ρ−1) e−y dy = Γ (1 + ρ). e−y lim x↑∞ 0 x↑∞ U (x) U (x) 0 Choosing λ = 1 and writing θ = 1/x, the statement in (i) follows.
5.4 Regular Variation and Tauberian Theorems
129
It remains then to show that for some 0 < λ0 < 1 and x0 , the sequence {Λ(λ0 /x)/U (x) : x > x0 } is uniformly bounded by some C > 0. This is done by partitioning the domain of integration over the lattice {2k x : k ≥ 0} for some x > 0. The assumed regular variation of U implies that for all x sufficiently large U (2x) < 2ρ+1 U (x). This can be iterated to deduce for x sufficiently large, U (2n x) < 2n(1+ρ) U (x) for each n ≥ 1. With this inequality in hand we may quite coarsely estimate for all sufficiently large x, Λ(λ0 /x) −λ0 2n−1 U (2n x) n(1+ρ) −λ0 2n−1 ≤ < e 2 e <∞ U (x) U (x) n≥1
n≥1
and the proof is complete.
Next we turn to the proof of Theorem 5.14 which implicitly uses the statement of Theorem 5.13. Proof (of Theorem 5.14). First we prove that (ii) implies (i). It suffices to prove that (ii) implies Theorem 5.13 (ii). However this is a simple issue of weak convergence and regular variation, since for any y > 0, ρU (x dy) ρu(xy)x = dy → ρy ρ−1 dy xu(x) xu(x) as x tends to infinity in the sense of weak convergence. This implies that ρU (xy) ∼ yρ . xu(x) Now choosing y = 1 and taking account of the fact that xu(x)/ρ ∼ xρ L(x)/Γ (1 + ρ) (here we use that Γ (1 + ρ) = ρΓ (ρ)), the result follows. Next we prove that (i) implies (ii). From Theorem 5.13 we see that U (x) ∼ xρ L(x)/Γ (1 + ρ) for some slowly varying function L. Let us assume that u is eventually monotone non-decreasing. For any 0 < a < b < ∞ we have U (bx) − U (ax) =
bx
u(y)dy
ax
and hence for x large enough, U (bx) − U (ax) (b − a)xu(bx) (b − a)xu(ax) ≤ ρ ≤ ρ . + ρ) x L(x)/Γ (1 + ρ) x L(x)/Γ (1 + ρ)
xρ L(x)/Γ (1
Using the regular variation of U we also have that lim
x↑∞
U (bx) − U (ax) = (bρ − aρ ). xρ L(x)/Γ (1 + ρ)
(5.17)
130
5 Subordinators at First Passage and Renewal Measures
Hence from the left inequality of (5.17) we have lim sup x↑∞
u(ax) (bρ − aρ ) ≤ . xρ−1 L(x)/Γ (1 + ρ) (b − a)
Now taking a = 1 and letting b ↓ 1 gives lim sup x↑∞
u(x) xρ−1 L(x)
≤
ρ . Γ (1 + ρ)
A similar treatment for the right inequality with b = 1 and letting a ↑ 1 shows that ρ u(x) ≥ . lim inf ρ−1 x↑∞ x L(x) Γ (1 + ρ) Recalling that Γ (1 + ρ) = ρΓ (ρ), the statement of the theorem follows. The proof when u is eventually non-increasing is essentially the same with minor adjustments.
5.5 Dynkin–Lamperti Asymptotics Let us return to the issue of the asymptotic behaviour of overshoots and undershoots of subordinators. The following theorem, due to Dynkin (1961) and Lamperti (1962), shows that obtaining an asymptotic bivariate limit of the overshoot and undershoot via rescaling by the level of the barrier is equivalent to an assumption of regular variation on the Laplace exponent of the subordinator. Theorem 5.16. Suppose that X is any subordinator with Laplace exponent Φ which is regularly varying at zero (resp. infinity) with some index α ∈ (0, 1). Then, in the sense of weak convergence,
Xτx+ − x x − Xτx+ − ∈ du, ∈ dy P x x α sin πα → (1 − y)α−1 (y + u)−α−1 dy du (5.18) π for u > 0 and y ∈ [0, 1) as x tends to infinity (resp. zero). Note that the statement of the theorem is not empty as one sees that any stable subordinator fulfills the assumptions. Recall from Exercise 3.7 that a stable subordinator necessarily has Laplace exponent on [0, ∞) given by Φ(θ) = cθα for some c > 0 and α ∈ (0, 1). It is possible to prove more than the above statement. For example, one may prove conversely that the pair
Xτx+ − x x − Xτx+ − , x x
5.5 Dynkin–Lamperti Asymptotics
131
F(q)
q
Fig. 5.2. Examples of the shape of the Laplace exponent Φ(θ). The solid concave curve corresponds to the case of a compound Poisson process with infinite mean (Φ′ (0+) = ∞ and Φ(∞) < ∞). The dashed concave curve corresponds to the case of a finite mean subordinator with strictly positive linear drift (Φ′ (0+) < ∞ and limθ↑∞ Φ(θ)/θ = d).
has a non-degenerate limit in distribution as x ↑ ∞ only if Φ is regularly varying with index α ∈ (0, 1). See Exercise 5.7. It is also possible to calculate the marginal laws of (5.18) as follows,
P and P
Xτx+ − x x
x − Xτx+ − x
∈ du
→
sin πα −α u (1 + u)−1 du π
→
sin πα −α y (1 − y)α−1 dy π
∈ dy
in the sense of weak convergence as x ↑ ∞ or x ↓ 0. The latter case is known as the generalised arcsine law; the arcsine law itself being a special case when α = 1/2. In that case, the density (π y(1 − y))−1 is related (via a linear transform) to the derivative of the arcsine function. Before moving to the proof of Theorem 5.16 let us make some remarks about regular variation of the Laplace exponent Φ of a subordinator. It is easy to deduce with the help of dominated convergence that Φ is infinitely differentiable and strictly concave. In addition Φ′ (0+) = E(X1 ) ∈ (0, ∞], Φ(0) = 0 and Φ(∞) = − log P(X1 = 0) (which is only finite in the case that X is a compound Poisson subordinator). Finally recall again from Exercise 2.11 that limθ↑∞ Φ(θ)/θ = d. See Fig. 5.2 for a visualization of these facts.
132
5 Subordinators at First Passage and Renewal Measures
Suppose now that Φ is regularly varying at the origin with index α ∈ R. As Φ(0) = 0 this implies that necessarily α ≥ 0. If E(X1 ) < ∞ then clearly Φ(θ)/θ ∼ E(X1 ) as θ ↓ 0 forcing α = 1. On the other hand, if E(X1 ) = ∞ then Φ(θ)/θ explodes as θ ↓ 0 forcing α < 1. In conclusion, regular variation at the origin of Φ with index α ∈ R means necessarily that α ∈ [0, 1]. Now suppose that Φ is regularly varying at infinity with index α ∈ R. Since Φ(∞) > 0 (actually infinite in the case that X is not a compound Poisson subordinator) again implies that α ≥ 0. On the other hand, the fact that Φ(θ)/θ tends to the constant d at infinity also dictates that α ≤ 1. Hence regular variation at infinity of Φ with index α ∈ R again necessarily implies that α ∈ [0, 1]. We now turn to the proof of Theorem 5.16, beginning with the following preparatory Lemma. Recall U is the potential measure of the given subordinator. Lemma 5.17. Suppose that the Laplace exponent of a subordinator, Φ, is regularly varying at zero (resp. infinity) with index α ∈ [0, 1]. Then for all λ > 0
(i) U (λx)Φ(1/x) → λα /Γ (1 + α) as x ↑ ∞ (resp. x ↓ 0) and (ii) when α is further restricted to [0, 1), Π(λx, ∞)/Φ(1/x) → λ−α /Γ (1 − α) as x ↑ ∞ (resp. x ↓ 0). Proof. (i) Recall that
1 . Φ(q) [0,∞) The assumption on Φ means that Φ(θ) ∼ θα L(1/θ) as θ tends to zero where L is slowly varying at infinity. That is to say 1/Φ(1/x) ∼ xα /L(x) as x tends to infinity. Noting that 1/L is still slowly varying at infinity, theorem 5.13 thus implies that U (x) ∼ xα /L(x)Γ (1 + α) as x ↑ ∞. Regular variation now implies the statement in part (i). The same argument works when Φ is regularly varying at infinity rather than zero. (ii) Now recall that ∞ Φ(θ) e−θx Π(x, ∞)dx =d+ θ 0 showing that Φ(θ)/θ is the Laplace transform of the measure dδ0 (dx) + Π(x, ∞)dx. The assumed regular variation on Φ implies that Φ(θ)/θ ∼ θ−(1−α) L(1/θ), for some slowly varying L at infinity. Theorem 5.14 now implies that Π(x, ∞) ∼ x−α L(x)/Γ (1 − α). Regular variation now implies the statement in part (ii). As usual, the same argument works when instead it is assumed that Φ is regularly varying at infinity. Note also in this case the assumption that α ∈ [0, 1) implies that d = 0 as otherwise if d > 0 then necessarily α = 1. e−qx U (dx) =
Finally we are ready for the proof of the Dynkin–Lamperti Theorem. Proof (of Theorem 5.16). We give the proof for the case that x ↑ ∞. The proof for x ↓ 0 requires minor modification.
5.5 Exercises
133
Starting from the conclusion of Theorem 5.6 we have for θ ∈ (0, 1] and φ > 0,
Xτx+ − x x − Xτx+ − P ∈ dφ, ∈ dθ = U (x(1 − dθ))Π(x(θ + dφ)) x x and hence for 0 < a < b < 1 and c > 0,
Xτx+ − x x − Xτx+ − P > c, ∈ (a, b) x x = Π(x(θ + c), ∞)U (x(1dθ)) (a,b)
=
(1−b,1−a)
Π(x(1 − η + c), ∞) U (x dη)Φ(1/x), Φ(1/x)
(5.19)
where in the last equality we have changed variables. From Lemma 5.17 (i) we see on the one hand that U (x dη)Φ(1/x) converges weakly to η α−1 dη/Γ (α) (we have used that Γ (1 + α) = αΓ (α)). On the other hand we have seen from part (ii) of the same lemma that lim x↓0
Π(x(1 − η + c), ∞) (1 − η + c)−α = . Φ(1/x) Γ (1 − α)
Since Π(x(1 − η + φ), ∞) is monotone in η, it follows that the convergence above is uniform on (1 − b, 1 − a); recall Exercise 2.4. It follows that the right-hand side of (5.19) converges to (1 − η + c)−α η α−1 dη Γ (1 − α) Γ (α) (1−b,1−a) 1 = (θ + c)−α (1 − θ)α−1 dθ Γ (α)Γ (1 − α) (a,b) as x ↑ ∞ which is tantamount to
x − Xτx+ − Xτ + −x ∈ dy, x ∈ du lim P x↑∞ x x α −α−1 = (y + u) (1 − y)α−1 dy du Γ (α)Γ (1 − α) in the sense of weak convergence. Finally, a special property of gamma functions gives 1/(Γ (α)Γ (1 − α)) = (sin πα)/π and hence the proof is complete.
Exercises 5.1. Prove Theorem 5.7.
134
5 Subordinators at First Passage and Renewal Measures
5.2. Suppose that Y is a spectrally positive L´evy process of bounded variation drifting to −∞ with Laplace exponent written in the usual form log E(e−θY1 ) = ψ(θ) = dθ − (1 − e−θx )ν(dx), (0,∞)
where necessarily d > 0, σx+
(0,∞)
(1 ∧ x)ν(dx) < ∞ and ψ ′ (0+) > 0. Define
= inf{t > 0 : Yt > x} and Y t = sups≤t Ys .
(i) Suppose that X = {Xt : t ≥ 0} is a compound Poisson subordinator with jump distribution (d−ψ ′ (0+))−1 ν(x, ∞)dx. By following similar reasoning to the explanation of the Pollaczeck–Khintchin formula in Chap. 4 show that P(Yσx+ −x ∈ du, x−Y σx+ − ∈ dy|σx+ < ∞) = P(Xτx+ −x ∈ du, x−Xτx+ − ∈ dy). (ii) Hence deduce that if of weak convergence
∞ 0
xν(x, ∞)dx < ∞ then for u, y > 0, in the sense
lim P(Yσx+ − x ∈ du, x − Y σx+ − ∈ dy|σx+ < ∞)
x↑∞
= ∞ 0
1 ν(u + y, ∞)du dy xν(x, ∞)dx
(iii) Give an interpretation of the result in (ii) in the context of modelling insurance claims. 5.3. Suppose that X is a finite mean subordinator and that its associated potential measure U does not have lattice support. Suppose that Z is a random variable whose distribution is equal to that of the limiting distribution of Xτx+ − Xτx+ − as x ↑ ∞. Suppose further that (V, W ) is a bivariate random variable whose distribution is equal to the limiting distribution of (Xτx+ −x, x− Xτx+ − ) as x ↑ ∞ and U is independent of V, W, Z and uniformly distributed on [0, 1]. Show that (V, W ) is equal in distribution to ((1 − U )Z, U Z). 5.4. Let X and Y be two (possibly correlated) subordinators killed independently at the rate η ≥ 0. Denote their bivariate jump measure by Π(·, ·). Define their bivariate renewal function ∞ U(dx, dy) = dt · P(Xt ∈ dx, Yt ∈ dy), 0
and suppose that as usual τx+ = inf{t > 0 : Xt > x}.
5.5 Exercises
135
Use a generalised version of the compensation formula to establish the following quadruple law P (∆Xτx+ ∈ dt, Xτx+ − ∈ ds, x − Yτx+ − ∈ dy, Yτx+ − x ∈ du) = U(ds, x − dy)Π(dt, du + y)
for u > 0, y ∈ [0, x] and s, t ≥ 0. This formula will be of use later on while considering the first passage of a general L´evy process over a fixed level. 5.5. Let X be any subordinator with Laplace exponent Φ and recall that τx+ = inf{t > 0 : Xt > x}. Let eα be an exponentially distributed random variable which is independent of X. (i) By applying the Strong Markov Property at time τx+ in the expectation E(e−βXeα 1(Xeα >x) ) show that for all α, β, x ≥ 0 we have
−ατx+ −βXτ + x e−βz U (α) (dz) (5.20) = (α + Φ(β)) E e (x,∞)
for all x > 0. (ii) Show further with the help of the identity in (i) that when q > β,
∞ 1 α + Φ (β) −ατx+ −β(Xτ + −x) x e−qx E e dx = 1− . q−β α + Φ (q) 0 (iii) Deduce with the help of Theorem 5.9 that +
E(e−ατx 1(X
+ =x) τx
) = du(α) (x)
where, if d = 0 the term u(α) (x) may be taken as equal to zero and otherwise the potential measure U (α) has a density and u(α) is a continuous and strictly positive version thereof. (iv) Show that for this version of the density, u(α) (0+) = 1/d where d is the drift of X. 5.6. Suppose that X is a stable subordinator with parameter α ∈ (0, 1) thus having Laplace exponent Φ(θ) = cθα for θ ≥ 0 and some c > 0 which in this exercise we will take equal to unity. (i) Show from Exercise 1.4 that the precise expression for the jump measure is x−(1+α) Π(dx) = dx. −Γ (−α)
(ii) By considering the Laplace transform of the potential measure U , show that xα−1 dx. U (dx) = Γ (α)
136
5 Subordinators at First Passage and Renewal Measures
(iii) Hence deduce that P(Xτx+ − x ∈ du, x − Xτx+ − ∈ dy) =
α sin απ (x − y)α−1 (y + u)−(α+1) du dy π
for u > 0 and y ∈ [0, x]. Note further that the distribution of the pair
x − Xτx+ − Xτx+ − x , (5.21) x x is independent of x. (iv) Show that stable subordinators do not creep. 5.7. Suppose that X is any subordinator. (i) Use the joint law of the overshoot and undershoot of a subordinator to deduce that for β, γ ≥ 0, ∞ −βXτ + − −γ(Xτ + −x) x x dx · e−qx E(e 1(X + >x) ) τx 0
1 Φ(q) − Φ(γ) d = . − q−γ Φ(q + β) Φ(q + β) (ii) Taking account of creeping, use part (i) to deduce that ∞ −β(Xτ + − /t)−γ(Xτ + −tx)/t Φ(q/t) − Φ(γ/t) 1 tx tx . )= dx · e−qx E(e (q − γ) Φ((q + β)/t) 0 (iii) Show that if Φ is regularly varying at zero (resp. infinity) with index α equal to 0 or 1, then the limiting distribution of the pair in (5.21) is trivial as x tends to infinity (resp. zero). (iv) It is possible to show that if a function f : [0, ∞) → (0, ∞) satisfies lim
f (λt) = g(λ) f (t)
for all λ > 0 as t tends to zero (resp. infinity) then in fact f must be regularly varying. Roughly speaking, the reason for this is that for λ, µ > 0, f (λµt) f (λt) g(λµ) = lim = g(µ)g(λ) f (λt) f (t) showing that g is a multiplicative function. With a little measure theory, one can show that necessarily, it must follow that g(λ) = λρ for some ρ ∈ R. See Theorem 1.4.1 of Bingham et al. (1987) for the full details. Use the above remarks to deduce that if (5.21) has a limiting distribution as x tends to infinity (resp. zero), then necessarily Φ is regularly varying at zero (resp. infinity) with index α ∈ [0, 1]. Hence conclude that (5.21) has a non-trivial limiting distribution if and only if α ∈ (0, 1).
5.5 Exercises
137
5.8. An important class of distributions, denoted L(α) where α is a parameter in [0, ∞), are defined as follows. Suppose that F is a probability distribution function. Write F (x) = 1 − F (x). Then F belongs to L(α) if the support of F is in [0, ∞) and non-lattice, F (x) > 0 for all x ≥ 0 and for all y > 0, F (x + y)
lim
F (x)
x↑∞
= e−αy .
Note that the requirement that F is a probability measure can be weakened to a finite measure as one may always normalise by total mass to fulfill the conditions given earlier. We are interested in establishing an asymptotic conditional distribution for the overshoot of a killed subordinator. To this end we assume that X is a killed subordinator with killing rate η > 0, Laplace exponent Φ, jump measure Π, drift d ≥ 0 and potential measure U which is assumed to belong to class L(α) for some α ≥ 0 such that Φ(−α) < ∞. (i) Show that P(τx+ < ∞) = ηU (x, ∞) where τx+ = inf{t > 0 : Xt > x}. (ii) Show that for all β ≥ 0, E(e
−β(Xτ + −x) x
|τx+
Φ(β) < ∞) = ηU (x, ∞)
e−β(y−x) U (dy).
(x,∞)
(iii) Applying integration by parts, deduce that lim E(e
−β(Xτ + −x) x
x↑∞
|τx+ < ∞) =
Φ(β) η
α α+β
.
(iv) Now take the distribution G defined by its tail e−αx G(x, ∞) = η
Φ(−α) +
(x,∞)
(e
αy
−e
αx
)Π(dy) .
Show that G has an atom at zero and
α Φ(β) dα −βy , e G(dy) = − η α + β η (0,∞) where d is the drift coefficient of X. (v) Deduce that lim P(Xτx+ − x > u|τx+ < ∞) = G(u) x↑∞
138
5 Subordinators at First Passage and Renewal Measures
and lim P(Xτx+ = x|τx+ < ∞) =
x↑∞
dα . η
5.9. Suppose that X is any L´evy process of bounded variation with zero drift which is not a compound Poisson process. By writing it as the difference of two independent subordinators prove that for any x ∈ R, P(inf{t > 0 : Xt = x} < ∞) = 0.
6 The Wiener–Hopf Factorisation
This chapter gives an account of the theory of excursions of a L´evy process from its maximum and the Wiener–Hopf factorisation that follows as a consequence from it. In Sect. 4.6 the analytical form of the Pollaczek–Khintchine formula was explained in terms of the decomposition of the path of the underlying L´evy process into independent and identically distributed sections of path called excursions from the supremum. The decomposition made heavy use of the fact that for the particular class of L´evy processes considered, namely spectrally positive processes of bounded variation, the times of new maxima form a discrete set. For a general L´evy process, it is still possible to decompose its path into “excursions from the running maximum”. However conceptually this decomposition is a priori somewhat more tricky as, in principle, a general L´evy process may exhibit an infinite number of excursions from its maximum over any finite period of time. Nonetheless, when considered in the right mathematical framework, excursions from the maximum can be given a sensible definition and can be shown to form the support of a Poisson random measure. The theory of excursions presents one of the more mathematically challenging aspects of the theory of L´evy processes. This means that in order to keep to the level outlined in the preface of this text, there will be a number of proofs in the forthcoming sections which are excluded or only discussed at an intuitive level. Amongst a very broad spectrum of probabilistic literature, the Wiener– Hopf factorisation may be thought of as a common reference to a multitude of statements concerning the distributional decomposition of the excursions of any L´evy process when sampled at an independent and exponentially distributed time. (We devote a little time later in this text to explain the origin of the name “Wiener–Hopf factorisation”.) In the light of the excursion theory given in this chapter we explain in detail the Wiener–Hopf factorisation. The collection of conclusions which fall under the umbrella of the Wiener–Hopf factorisation turn out to provide a robust tool from which one may analyse a
140
6 The Wiener–Hopf Factorisation
number of problems concerning the fluctuations of L´evy processes; in particular problems which have relevance to the applications we shall consider in later chapters. The chapter concludes with some special classes of L´evy processes for which the Wiener–Hopf factorisation may be exemplified in more detail.
6.1 Local Time at the Maximum Unlike the L´evy processes presented in Sect. 4.6, a general L´evy process may have an infinite number of new maxima over any given finite period of time. As our ultimate goal is to show how to decompose events concerning the path of a L´evy process according to the behaviour of the path in individual excursions, we need a way of indexing them. To this end we introduce the notion of local time at the maximum. To avoid trivialities we shall assume throughout this section that neither X nor −X is a subordinator. Recall also the definition X t = sups≤t Xs . In the sequel we shall repeatedly refer to the process X − X = {X t − Xt : t ≥ 0}, which we also recall from Exercise 3.2, which can be shown to be Strong Markov. Definition 6.1 (Local time at the maximum). A continuous, nondecreasing, [0, ∞)-valued, F-adapted process L = {Lt : t ≥ 0} is called a local time at the maximum (or just local time for short) if the following hold. (i) The support of the Stieltjes measure dLt is the closure of the (random) set of times {t ≥ 0 : X t = Xt } and is finite for each t ≥ 0. (ii) For every F-stopping time T such that X T = XT on {T < ∞} almost surely, the shifted trivariate process {(XT +t − XT , X T +t − XT +t , LT +t − LT ) : t ≥ 0} is independent of FT on {T < ∞} and has the same law as X, X − X, L under P. (The process which is identically zero is excluded). Let us make some remarks about the above definition. Firstly if L is a local time then so is kL for any constant k > 0. Hence local times can at best be defined uniquely up to a multiplicative constant. On occasion we shall need to talk about both local time and the time scale on which the L´evy process itself is defined. In such cases we shall refer to the latter as real time. Finally, by applying this definition of local time to −X it is clear that one may talk ) of a local time at the minimum. The latter shall always be referred to as L. Local times as defined above do not always exist on account of the requirement of continuity. Nonetheless, in such cases, it turns out that one may construct right continuous processes which satisfy conditions (i) and (ii) of
6.1 Local Time at the Maximum
141
Definition 6.1 and which serve their purpose equally well in the forthcoming analysis of the Wiener–Hopf factorisation. We provide more details shortly. We give next, however, some examples for which a continuous local time can be identified explicitly. Example 6.2 (Spectrally negative processes). Recall that the formal definition of a spectrally negative L´evy process is simply one for which the L´evy measure satisfies Π(0, ∞) = 0 and whose paths are not monotone. As there are no positive jumps the process X must therefore be continuous. It is easy to check that L = X fulfils Definition 6.1. Example 6.3 (Compound Poisson processes with drift d ≥ 0). Just by considering the piece-wise linearity of the paths of these processes, one has obviously that over any finite time horizon, the time spent at the maximum has strictly positive Lebesgue measure with probability one. Hence the quantity t Lt := (6.1) 1(X s =Xs ) ds, t ≥ 0 0
is almost surely positive and may be taken as a candidate for local time. Indeed it increases on {t : X t = Xt }, is continuous, non-decreasing and is an F-adapted process. Taking T as in part (ii) of Definition 6.1 we also see that on {T < ∞}, T +t 1(X s =Xs ) ds (6.2) LT +t − LT = T
which is independent of FT because {X T +t − XT +t : t ≥ 0} is and has the same law as L by the Strong Markov Property applied to the process X − X and the fact that X T − XT = 0. The distributional requirement in part (ii) for the trivariate process (X, X − X, L) follows by similar reasoning. If we only allow negative jumps and d > 0, then according to the previous example X also fulfils the definition of local time. However, as we have seen in the proof of Theorem 4.1, t 1(X s =Xs ) ds Xt = d 0
for all t ≥ 0. Next we would like to identify the class of L´evy processes for which continuous local time cannot be constructed and for which a right continuous alternative is introduced instead. In a nutshell, the aforementioned class are those L´evy processes whose moments of new maxima form a discrete set. The qualifying criterion for this turns out to be related to the behaviour of the L´evy process at arbitrarily small times; a sense of this has already been given in the discussion of Sect. 4.6. We spend a little time developing the relevant notions, namely path regularity, in order to complete the discussion on local time.
142
6 The Wiener–Hopf Factorisation
Definition 6.4. For a L´evy process X, the point x ∈ R is said to be regular (resp. irregular) for an open or closed set B if Px τ B = 0 = 1 (resp. 0), where the stopping time τ B = inf{t > 0 : Xt ∈ B}. Intuitively speaking, x is regular for B if, when starting from x, the L´evy process hits B immediately. Note that as τ B is a stopping time, it follows that 1(τ B =0) = Px (τ B = 0|F0 ). On the other hand, since F0 contains only null sets, Kolmogorov’s definition of conditional expectation implies Px (τ B = 0|F0 ) = Px (τ B = 0) and hence Px (τ B = 0) is either zero or one. In fact one may replace {τ B = 0} by any event A ∈ F0 and reach the same conclusion about P(A). This is nothing but Blumenthal’s zero–one law. We know from the L´evy–Itˆ o decomposition that the range of a L´evy process over any finite time horizon is almost surely bounded and thanks to right continuity, limt↓0 max{−X t , X t } = 0. Hence for any given open or closed B, the points x ∈ R for which Px (τ B = 0) = 1 are necessarily those belonging to B ∪ ∂B. However, x ∈ ∂B is not a sufficient condition for Px (τ B = 0) = 1. To see why, consider the case that B = (0, ∞) and X is any compound Poisson process. Finally note that the notion of regularity can be established for any Markov process with analogous definition to the one given earlier. However, for the special case of a L´evy process, stationary independent increments allow us reduce the discussion of regularity of x for open and closed sets to simply the regularity of 0 for open and closed sets. Indeed, for any L´evy process, x is regular for B if and only if 0 is regular for B − x. As we shall see shortly, it is regularity of 0 for [0, ∞) which dictates whether one may find a continuous local time. The following result, due in parts to Rogozin (1968), Shtatland (1965) and Bertoin (1997), gives precise conditions for the slightly different issue of regularity of 0 for (0, ∞). Theorem 6.5. For any L´evy process, X, other than a compound Poisson process, the point 0 is regular for (0, ∞) if and only if
0
1
1 P (Xt > 0) dt = ∞ t
(6.3)
and the latter holds if and only if one of the following three conditions hold, (i) X is a process of unbounded variation, (ii) X is a process of bounded variation and d > 0 ,
6.1 Local Time at the Maximum
143
(iii) X is a process of bounded variation, d = 0 and xΠ (dx) x = ∞. (0,1) 0 Π (−∞, −y) dy
Here d is the drift coefficient in the representation (2.21) of a L´evy process of bounded variation. Recall that if N is the Poisson random measure associated with the jumps of X, then the time of arrival of a jump of size ε > 0 or greater, say, T (ε), is exponentially distributed since P(T (ε) > t) = P(N ([0, t] × {R\(−ε, ε)}) = 0) = exp{−tΠ(R\(−ε, ε))}.
This tells us that, if Π(R) = ∞, then jumps of size greater than ε become less and less probable as t ↓ 0. Hence that the jumps that have any influence over the initial behaviour of the path of X, if at all, will necessarily be arbitrarily small. With this in mind, one may intuitively see the conditions (i)–(iii) in Theorem 6.5 in the following way. In case (i) when σ > 0 regularity follows as a consequence of the presence of Brownian motion whose behaviour on the small time scale always dominates the path of the L´evy process. If on the other hand σ = 0, the high intensity of small jumps causes behaviour on the small time scale close to that of Brownian motion even though the paths are not continuous. (We use the words “high intensity” here in the sense that (−1,1) |x|Π(dx) = ∞). Case (ii) says that when the Poisson point process of jumps fulfils the condition |x|Π(dx) < ∞, over small time scales, the sum of the jumps grows sub(−1,1) linearly in time almost surely. Therefore if a drift is present, this dominates the initial motion of the path. In case (iii) when there is no dominant drift, the integral test may be thought of as a statement about what the “relative weight” of the small positive jumps compared to the small negative jumps needs to be in order for regularity to occur. x In the case of bounded variation, the integral 0 Π (−∞, −y) dy is finite for all x > 0. This can be deduced by noting that for any L´evy process of bounded variation (−1,0) |x|Π(dx) < ∞ and then integrating by parts. Note also that Theorem 6.5 implies that processes of unbounded variation are such that 0 is regular for both (0, ∞) and (−∞, 0) and that processes of bounded variation with d > 0 are irregular for (−∞, 0]. For processes of bounded variation with d = 0 it is possible to find examples where 0 is regular for both (0, ∞) and (−∞, 0). See Exercise 6.1. We offer no proof of Theorem 6.5 here. However it is worth recalling that from Lemma 4.11 and the follow up Exercise 4.9 (i) we know that for any L´evy process, X, of bounded variation, lim t↓0
Xt =d t
almost surely where d is the drift coefficient. This shows that if d > 0 (resp. d < 0) then for all t > 0 sufficiently small, Xt must be strictly positive
144
6 The Wiener–Hopf Factorisation
(resp. negative). That is to say, 0 is regular for (0, ∞) and irregular for (−∞, 0] if d > 0 (resp. regular for (−∞, 0) and irregular for [0, ∞) if d < 0). For the case of a spectrally negative L´evy process of unbounded variation, Exercise 6.2 deduces regularity properties in agreement with Theorem 6.5. In addition, Exercise 6.8 shows how to establish the criterion (6.3). There is a slight difference between regularity of 0 for (0, ∞) and regularity of 0 for [0, ∞). Consider for example the case of a compound Poisson Process. The latter is regular for [0, ∞) but not for (0, ∞) due to the initial exponentially distributed period of time during which the process remains at the origin. On the other hand, we also have the following conclusion. Corollary 6.6. The only L´evy process for which 0 is regular for [0, ∞) but not for (0, ∞) is a compound Poisson process. Proof. If a process is regular for [0, ∞) but not for (0, ∞) then, according to the cases given in Theorem 6.5 it must be a process of bounded variation with zero drift. If the underlying L´evy process is not a compound Poisson process then this would require that the process jumps into (−∞, 0) and back on to 0 infinitely often for arbitrarily small times. This is impossible when one takes into account Exercise 5.9 which shows that a L´evy process of bounded variation with no drift which is not a compound Poisson process cannot hit a pre-specified point. By definition, when 0 is irregular for [0, ∞) the L´evy process takes a strictly positive period of time to return to reach a new maximum above the origin. Hence, applying the Strong Markov Property at the time of first entry into [0, ∞) we see that in a finite interval of time there are almost surely a finite number of new maxima, in other words, {0 < s ≤ t : X s = Xs } is a discrete set. (Recall that this type of behaviour has been observed for spectrally positive L´evy process of bounded variation in Chap. 4). In this case we may then define the counting process n = {nt : t ≥ 0} by nt = #{0 < s ≤ t : X s = Xs }.
(6.4)
We are now ready to make the distinction between those processes which admit continuous local times in Definition 6.1 and those that do not. Theorem 6.7. Let X be any L´evy process. (i) There exists a continuous version of L which is unique up to a multiplicative constant if and only if 0 is regular for [0, ∞).
6.1 Local Time at the Maximum
145
(ii) If 0 is irregular for [0, ∞) then we can take as our definition of local time Lt =
nt
(i)
eλ ,
(6.5)
i=0
(i)
satisfying (i) and (ii) of Definition 6.1, where {eλ : i ≥ 0} are independent and exponentially distributed random variables with parameter λ > 0 (chosen arbitrarily) and {nt : t ≥ 0} is the counting process defined in (6.4). We offer no proof for case (i) which is a particular example of a classic result from potential theory of stochastic processes, a general account of which can be found in Blumenthal and Getoor (1968). The proof of part (ii) is quite accessible and we leave it as an Exercise. Note that one slight problem occurring in the definition of L in (6.5) is that it is not adapted to the filtration of X. However this is easily resolved by simply broadening out the filtration (i) to include σ(eλ : i ≥ 0) before completing it with null sets. Also the choice of exponential distribution used in (6.5) is of no effective consequence. One could in principle always work with the definition L′t =
nt
(i)
e1 .
i=0
Scaling properties of exponential distributions would then allow us to con(i) (i) (i) (i) struct the eλ s and e1 s on the same probability space so that λeλ = e1 for each i = 0, 1, 2... and this would imply that L′ = λL where L is local time constructed using exponential distributions with parameter λ. So in fact within the specified class of local times in part (ii) of the above theorem, the only effective difference is a multiplicative constant. The reason why we do not simply define Lt = nt has to do with the fact that we shall require some special properties of the inverse L−1 . This will be discussed in Sect. 6.2. In accordance with the conclusion of Theorem 6.7, in the case that 0 is regular for [0, ∞) we shall henceforth work with a continuous version of L and in the case that 0 is irregular for [0, ∞) we shall work with the definition (6.5) for L. In Example 6.3 we saw that we may use a multiple of the Lebesgue measure of the real time spent at the maximum to give a version of local time which is continuous. The fact that the latter is non-zero is a clear consequence of piecewise linearity of the process. Although compound Poisson processes (with drift) are the only L´evy processes which are piecewise linear, it is nonetheless natural to investigate to what extent one may work with the Lebesgue measure of the time spent at the maximum for local time in the case that 0 is regular for [0, ∞). Rubinovitch (1971) supplies us with the following charactarisation of such processes.
146
6 The Wiener–Hopf Factorisation
Theorem 6.8. Suppose that X is a L´evy process for which 0 is regular for [0, ∞). Let L be some continuous version of local time. The constant a ≥ 0 satisfying the relation t
0
1(X s =Xs ) ds = aLt
is strictly positive if and only if X is a L´evy process of bounded variation and 0 is irregular for (−∞, 0). ∞ Proof. Note that 0 1(X t =Xt ) dt > 0 with positive probability if and only if
∞ E 1(X t −Xt =0) dt > 0. 0
By Fubini’s Theorem and the Duality Lemma the latter occurs if and only ∞ ∞ if 0 P(X t = 0)dt = E( 0 1(X t =0) dt) > 0 (recall that X t := inf s≤t Xs ). Due to the fact that X has paths that are right continuous and monotone decreasing, the positivity of the last integral happens if and only if it takes an almost ∞surely strictly positive time for X to visit (−∞, 0). In short we have that 0 1(X t =Xt ) dt > 0 with positive probabiltiy if and only if 0 is irregular for (−∞, 0). By Theorem 6.5 the latter can only happen when X has bounded variation. Following the same reasoning as used in Example 6.3 it is straightforward to deduce that t 1(X s =Xs ) ds, t ≥ 0 0
may be used as a local time. Theorem 6.7 (i) now gives us the existence of a constant a > 0 so that for a given local time L, t 1(X s =Xs ) ds. aLt = 0
When 0 is regular for (−∞, 0) the reasoning above also shows that 1 ds = 0 almost surely for all t ≥ 0 and hence it is clear that 0 (X s =Xs ) the constant a = 0. t
We can now summarise the discussion on local times as follows. There are three types of L´evy processes which are associated with three types of local times. 1. Processes of bounded variation for which 0 is irregular for [0, ∞). The set of maxima forms a discrete set and we take a right continuous version of local time in the form nt (i) e1 , Lt = i=0
(i)
where nt is the count of the number of maxima up to time t and {e1 : i = 0, 1, ...} are independent and exponentially distributed random variables with parameter 1.
6.2 The Ladder Process
147
2. Processes of bounded variation for which 0 is irregular for (−∞, 0). There exists a continuous version of local time given by, t 1(X s =Xs ) ds Lt = a 0
for some arbitrary a > 0. In the case that X is spectrally negative, we have that L is equal to a multiplicative constant times X. 3. Processes of unbounded variation, in which case 0 is implicitly regular for [0, ∞). We take a continuous version of local time exists but cannot be identified explicitly as a functional of the path of X in general. However, if X is a spectrally negative L´evy process, then this local time may be taken as X.
6.2 The Ladder Process Define the inverse local time process L−1 = {L−1 t : t ≥ 0} where inf{s > 0 : Ls > t} if t < L∞ L−1 t := ∞ otherwise. Next define the process H = {Ht : t ≥ 0} where XL−1 if t < L∞ t Ht := ∞ otherwise. The range of inverse local time, L−1 , corresponds to the set of real times at which new maxima occur, called the ascending ladder times. The range of process H corresponds to the set of new maxima called the ascending ladder heights. The bivariate process (L−1 , H) := {(L−1 t , Ht ) : t ≥ 0}, called the ascending ladder process, is the main object of study of this section. Note that it is implicit from their definition that L−1 and H are processes with paths that are right continuous with left limits. The word “ascending” distinguishes the process (L−1 , H) from the anal) constructed from −X, which is called the descending ) −1 , H), ogous object (L ladder process (note that local time at the maximum of −X is the local time at ) When the context the minimum of X which was previously referred to as L). is obvious we shall drop the use of the words ascending or descending. The ladder processes we have defined here are the continuous time analogue of the processes with the same name for random walks1 . In the case of random walks, one defines Ln to be the number of times a maxima is reached after n steps, Tn = inf{k ≥ 1 : Lk = n} as the number of steps required to achieve n new maxima and Hn as the n-th new maxima. n 1 Recall that {Sn : n = 0, 1, 2, ...} is a random walk if S0 = 0 and Sn = where {ξi : i = 1, 2, ...} are independent and identically distributed.
i=1
ξi
148
6 The Wiener–Hopf Factorisation
An additional subtlety for random walks is that the count Ln may be taken to include visits to previous maxima (consider for example a simple random walk which may visit an existing maximum several times before generating a strictly greater maximum). In that case the associated ascending ladder process is called weak. When {Ln : n ≥ 0} only counts the number of new maxima which exceed all previous maxima, the associated ascending ladder process is called strict. The same subtlety appears in the definition of L for L´evy processes when 0 is irregular for [0, ∞) and our definition of the process {nt : t ≥ 0} is analogous to a count of weak ascending ladder heights. However, this is of no consequence in the forthcoming discussion as we shall see that, it turns out that in this setting with probability one no two maxima can be equal anyway. When 0 is regular for [0, ∞) but X is not a compound Poisson process we shall again see in due course that ladder heights at different ladder times are distinct. Finally when X is a compound Poisson process, although one cannot count the times spent at the maximum, the distinction between weak and strict maxima will become an issue at some point in later discussion. Indeed the choice of local time t 1(X s =Xs ) ds, t ≥ 0 Lt = a 0
is analogous to the count of weak ascending ladder heights in a random walk. Consider for example the continuous time version of a simple random walk; that is a compound Poisson process with jumps in {−1, 1}. Our interest in this section will be to characterise the ladder process. We start with the following lemma which will be used at several places later on. Lemma 6.9. For each t ≥ 0, both L−1 and L−1 t t− are F-stopping times. Proof. Recall from Sect. 3.1 that thanks to the assumed right continuity of F it suffices to prove that for each s > 0, {L−1 < s} ∈ Fs and a similar notion t −1 < s} = {L > t} which belongs to Fs as the for L−1 . For all s, t ≥ 0, {L s− t t− process L is F-adapted. To prove that L−1 is a stopping time note that t− {L−1 t− < s} =
&
n≥1
{L−1 t−1/n < s} ∈ Fs .
In the next theorem we shall link the process (L−1 , H) to a bivariate subordinator. Let us remind ourselves what the latter object is. With Exercise 2.10 in mind, recall that a bivariate subordinator is a two-dimensional (0, ∞)2 -valued stochastic processes X = {Xt : t ≥ 0} with paths that are
6.2 The Ladder Process
149
right continuous with left limits as well as having stationary independent increments2 and further, each component is non-decreasing. It is important to note that in general it is not correct to think of a bivariate subordinator simply as a vector process composed of two independent subordinators. Correlation between the subordinators in each of the co-ordinates may be represented as follows. Write X in the form xN (ds × dx), t ≥ 0, Xt = dt + [0,t]
(0,∞)2
where d ∈ [0, ∞)2 and N is the Poisson random measure describing the jumps defined on [0, ∞) × (0, ∞)2 with intensity measure given by dt × Λ(dx, dy) for a bivariate measure Λ on (0, ∞)2 satisfying (1 ∧ x2 + y 2 )Λ(dx, dy) < ∞. (0,∞)2
Independence of the two individual co-ordinate processes of X corresponds to the case that Λ is a product measure; say Λ(dx, dy) = Λ1 (dx)Λ2 (dy). For a general bivariate subordinator, positivity allows us to talk about their Laplace exponent φ (α, β) given by
α = exp{−φ (α, β) t}. E exp − · Xt β Referring back to Chap. 2, it is a straightforward exercise to deduce that that α x α (1 − e−(β )·(y) )Λ(dx, dy). φ (α, β) = d · + β (0,∞)2 Theorem 6.10. Let X be a L´evy process and eq an independent and exponentially distributed random variable with parameter q ≥ 0. Then P lim sup Xt < ∞
= 0 or 1
t↑∞
and the ladder process (L−1 , H) satisfies the following properties. (i) If P lim supt↑∞ Xt = ∞ = 1 then (L−1 , H) has the law of a bivariate subordinator. d (ii) If P lim supt↑∞ Xt < ∞ = 1 then for some q > 0 L∞ = eq , the exponen−1 tial distribution with parameter q, and {(Lt , Ht ) : t < L∞ } has the same −1 , H) is a bivariate law as (L−1 , H) := {(L−1 t , Ht ) : t < eq } where (L subordinator independent of eq . 2
Recall that right continuous with left limits and stationary independent increments for a multi-dimensional process means that the same properties hold component-wise. However, it does not necessarily mean that the individual component processes are independent.
150
6 The Wiener–Hopf Factorisation
Proof. Since {lim sup Xt < ∞} = {lim sup Xt < ∞} t↑∞
Q∋t↑∞
and the latter event is in the tail sigma algebra t∈Q∩[0,∞) σ (Xs : s ≥ t) , then Kolmogorov’s zero–one law for tail events tells us that P lim supt↑∞ Xt < ∞ = 0 or 1. To deal with (i) and (ii) in the case that 0 is irregular for [0, ∞), the analysis proceeds in the sprit of the discussion around the Pollaczek–Khintchine formula in Chap. 4. We give a brief outline of the arguments again. If we agree that a geometric distribution with parameter 1 is infinite with probability one then, the total number of excursions from the maximum n∞ defined in (6.4) is geometrically distributed with parameter 1 − ρ = P(τ0+ = ∞) where τ0+ = inf{t > 0 : Xt > 0}. Now define the sequence of times T0 = 0, Tn+1 = inf{t > Tn : Xt > XTn } = inf{t > Tn : ∆Lt > 0} = inf{t > Tn : ∆nt = 1}
for n = 0, 1, ..., n∞ where ∆Lt = Lt − Lt− , ∆nt = nt − nt− and inf ∅ = ∞. It is easy to verify that the latter times form a sequence of stopping times with Tn < ∞ for all n ≥ 0 and otherwise Tn∞ < ∞ and Tn∞ +1 = ∞ when n∞ < ∞. Further, by the Strong Markov Property for L´evy processes, if n∞ < ∞ then the successive excursions of X from its maximum, ǫn := {Xt : t ∈ (Tn−1 , Tn ]} for n = 1, ..., n∞ are equal in law to an independent sample of n∞ − 1 copies of the first excursion from the maximum conditioned to be finite followed by a final independent copy conditioned to be infinite in length. If n∞ = ∞ then the sequence {ǫn : n = 1, 2, ...} is equal in law to an independent sample of the first excursion from the maximum. By considering Fig. 6.1 we see that L−1 (the reflection of L about the diagonal) is a step function and its successive jumps (the flat sections of L) correspond precisely to the sequence {Tn+1 − Tn : n = 0, ..., n∞ }. From the previous paragraph, it follows that L−1 has independent and identically distributed jumps and is sent independently to infinity (which we may consider as a “graveyard” state) on the n∞ -th jump accordingly with the arrival of the first infinite excursion. As the jumps of L are independent and exponentially distributed it also follows that the periods between jumps of L−1 are independent and exponentially distributed. According to Exercise 6.3 the process L−1 is now equal in law to a compound Poisson subordinator killed independently after an exponentially distributed time with parameter λ(1 − ρ). (Again we work with the notation that an exponential distribution with parameter 0 is infinite with probability one). It follows by construction that H is also a compound Poisson subordinator killed at the same rate.
6.2 The Ladder Process
151
L
e1(1)
e1(0) τ0+
X
Fig. 6.1. A realisation of local time and inverse local time for a L´evy process for which 0 is irregular for [0, ∞). The upper graph plots the paths of L and the lower graph plots the path of X symbolically in terms of the excursions from the maximum.
Next we prove (i) and (ii), for the case that 0 is regular for [0, ∞) so that the version of local time we work with is assumed to have continuous paths. for Fix t > 0. In Definition 6.1 let us work with the stopping time T = L−1 t t > 0. Note that LL−1 = t on the event that t < L∞ . Define the processes t
= {X
t := X −1 − X −1 : s ≥ 0} X L +s L t
t
= {L
s := L −1 − t : s ≥ 0}. and L L +s t
From Lemma 6.9 we know that L−1 is a stopping time and hence according t
is to Definition 6.1, on the event L−1 < ∞, that is t < L∞ , the process L t
at its maximum. Note also from Theorem 3.1 and again the local time of X
152
6 The Wiener–Hopf Factorisation
and L
are independent of F −1 . It is clear that Definition 6.1 that X L t
Further
−1 −1
−1 L s = Lt+s − Lt .
s := X
−1 = X −1 − X −1 = Ht+s − Hs . H L L
L s
t+s
t
(6.6) (6.7)
In conclusion we have established that on t < L∞ ,
−1 {(L−1 t+s − Lt , Ht+s − Ht ) : s ≥ 0}
is independent of FL−1 and equal in law to (L−1 , H). With this in hand, note t that for any α, β ≥ 0, −1 E e−αLt+s −βHt+s 1(t+s
−1
s 1 s −β H −1 F = E e−αLt −βHt 1(t
(s
where κ(α, β) = −log E(e−αL1 −βH1 1(1
0 and L∞ = ∞ otherwise. Now writing for each α, β, κ(α, β) = κ(0, 0) + φ(α, β), Bayes formula applied to (6.8) shows that for all t ≥ 0, ' −1 ' e−φ(α,β) = E e−αL1 −βH1 ' 1 < L∞ ' %1/t $ −1 ' = E e−αLt −βHt ' t < L∞
(6.9)
(6.10)
illustrating that φ(α, β) is the Laplace exponent of a bivariate, componentwise positive, infinitely divisible distribution η(dx, dy) = P(L−1 1 ∈ dx, H1 ∈ dy|1 < L∞ ). (Consider (6.10) for t = 1/n where n is a positive integer). In the spirit of the L´evy–Itˆo decomposition, there exists a bivariate subordinator, say (L−1 , H)
6.2 The Ladder Process
153
whose Laplace exponent is φ(α, β). We now see from (6.8) and (6.9) that (L−1 , H) is equal in law to (L−1 , H) killed independently (with “graveyard” state ∞) after an exponentially distributed time with parameter q = κ(0, 0). In particular X ∞ = ∞ almost surely if and only if q = 0 and otherwise X ∞ = Heq < ∞ almost surely. Corollary 6.11. In the previous Theorem, the subordinator associated with L−1 has drift a where a is the constant appearing in Theorem 6.8. Proof. Note that ∆L−1 := L−1 − L−1 t t t− is greater than ε > 0 follows as a consequence of the path of X moving away from its maximum for a period of real time exceeding ε. That is to say, individual jumps of L−1 correspond to individual excursions of X from X. Let us denote by NL−1 the Poisson random measure associated with the jumps of L−1 . Then the time it takes to accumulate t < L∞ units of local time is the sum of the periods of time that X has spent away from its maximum plus the real time that X has spent at its maximum (if at all). The latter qualification is only of significance when X is of bounded variation with 0 irregular for (−∞, 0) in which case the constant a in Theorem 6.8 is strictly positive and then the local time is taken as the Lebesgue measure of the time spent at the maximum. We have on {t < L∞ }, L−1 t =
0
L−1 t
1(X s =Xs ) ds +
[0,t]
(0,∞)
xNL−1 (ds × dx).
From Theorem 6.8 we know that the integral is equal to aLL−1 = at and t hence a is the drift of the subordinator L−1 . Finally note in the case of compound Poisson process for which, with positive probability, the same maxima may be visited over two intervals of time > 0. separated by at least one excursion, we have that ∆Ht = 0 when ∆L−1 t In other words, the jump measure of H may have an atom at zero. This would be the case for the earlier given example of a compound Poisson process with jumps in {−1, 1}. Strictly speaking this violates our definition of a subordinator. However, this does not present a serious problem since H is necessarily a compound Poisson subordinator and hence its paths are well defined with the presence of this atom. Further, this does not affect the forthcoming analysis unless otherwise mentioned. Example 6.12 (Spectrally negative processes). Suppose that X is a spectrally negative L´evy process with Laplace exponent ψ having right inverse Φ; recall the latter part of Sect. 3.3 for a reminder of what this means. As noted earlier, we may work with local time given by L = X. It follows that L−1 x is nothing more than the first passage time above x > 0. (Note that in general it is not true that L−1 x is the first passage above x). As X is spectrally negative we have in particular that Hx = XL−1 = x on {x < L∞ }. Recalling x
154
6 The Wiener–Hopf Factorisation
Corollary 3.14 we already know that L−1 is a subordinator killed at rate Φ(0). Hence we may easily identify for α, β ≥ 0, κ(α, β) = Φ(0) + φ(α, β) where φ(α, β) = [Φ(α) − Φ(0)] + β is the Laplace exponent of a bivariate subordinator. Note in particular that L∞ < ∞ if and only if Φ(0) > 0 if and only if ψ ′ (0+) = E(X1 ) ∈ [−∞, 0) and, on account of the fact that L−1 is the first passage process, the latter occurs if and only if P(lim supt↑∞ Xt < ∞) = 1. In the special case that X is a Brownian motion withdrift ρ, we know explicitly that ψ(θ) = ρθ + 12 θ2 and hence Φ(α) = −ρ + ρ2 + 2α. Inverse local time can then be identified precisely as an inverse Gaussian process (killed at rate 2|ρ| if ρ < 0). We close this section by making the important remark that the brief introduction to excursion theory offered here has not paid fair dues to their general setting. Excursion theory formally begins with Itˆ o (1970) with further foundational contributions coming from Maisonneuve (1975) and can be applied to a much more general class of Markov processes than just L´evy processes. Recall that X − X is a Markov process and hence one may consider L as the local time at 0 of the latter process. In general it is possible to identify excursions of well defined Markov processes from individual points in their state space with the help of local time. The reader interested in a comprehensive account should refer to the detailed but nonetheless approachable account given in Chap. IV of Bertoin (1996) or Blumenthal (1992).
6.3 Excursions Recall that in Sect. 4.6 we gave an explanation of the Pollaczek–Khintchine formula by decomposing the path of the L´evy processes considered there in terms of excursions from the maximum. Clearly this decomposition relied heavily on the fact that the number of new maxima over any finite time horizon is finite. That is to say, that 0 is irregular for [0, ∞) and the local time at the maximum is a step function as in case 1 listed at the end of Sect. 6.1. Now that we have established the concept of local time at the maximum for any L´evy process we can give the general decomposition of the path of a L´evy process in terms of its excursions from the maximum. Definition 6.13. For each moment of local time t > 0 we define −1 −1 −1 {XL−1 +s − XL−1 : 0 < s ≤ L−1 t − Lt− } if Lt− < Lt t− t− ǫt = −1 ∂ if L−1 t− = Lt where we take L−1 0− = 0 and ∂ is some “dummy” state. Note that when −1 < L the object ǫt is a process and hence is double indexed with L−1 t t−
6.3 Excursions
155
ǫt (s) = XL−1 +s − XL−1 for 0 < s ≤ L−1 − L−1 t t− . When ǫt = ∂ we refer t− t− to it as the excursion (from the maximum) associated with local time t. Note also that excursion paths are right continuous with left limits and, with the exception of its terminal value (if L−1 t < ∞), is valued in (−∞, 0). Definition 6.14. Let E be the space of excursions of X from its running supremum. That is the space of mappings which are right continuous with left limits satisfying ǫ : (0, ζ) → (−∞, 0) for some ζ ∈ (0, ∞] ǫ : {ζ} → [0, ∞) if ζ < ∞ where ζ = ζ(ǫ) is the excursion length. Write also h = h(ǫ) for the terminal value of the excursion so that h(ǫ) = ǫ(ζ). Finally let ǫ = − inf s∈(0,ζ) ǫ(s) for the excursion height. We will shortly state the fundamental result of excursion theory which relates the process {(t, ǫt ) : t < L∞ and ǫt = ∂} to a Poisson point process on [0, ∞) × E. The latter process has not yet been discussed in this text however and so we devote a little time to its definition first. Recall that in Chap. 2 the existence of a Poisson random measure on an arbitrary sigma finite measure space (S, S, η) was proved in Theorem 2.4. If we reconsider the proof of Theorem 2.4 then in fact what was proved was the existence of a random set of points in S, each of which is assigned a unit mass thus defining the Poisson random measure N . Instead of referring to the Poisson random measure on (S, S, η) we can instead refer to its support. The latter is called a Poisson point process on (S, S, η) (or sometimes the Poisson point process on S with intensity η). In the case that S = [0, ∞) × E we may think of the associated Poisson point process as a process of E-valued points appearing in time. Theorem 6.15. There exists a σ-algebra Σ and σ-finite measure n such that (E, Σ, n) is a measure space and Σ is rich enough to contain sets of the form {ǫ ∈ E : ζ (ǫ) ∈ A, ǫ ∈ B, h(ǫ) ∈ C} where, for a given ǫ ∈ E, ζ (ǫ), ǫ and h(ǫ) were all given in Definition 6.14. Further, A, B and C are Borel sets of [0, ∞]. (i) If P(lim supt↑∞ Xt = ∞) = 1 then {(t, ǫt ) : t ≥ 0 and ǫt = ∂} is a Poisson point process on ([0, ∞) × E, B[0, ∞) × Σ, dt × dn). (ii) If P(lim supt↑∞ Xt < ∞) = 1 then {(t, ǫt ) : t < L∞ and ǫt = ∂} is a Poisson point process on ([0, ∞) × E, B[0, ∞) × Σ, dt × dn) stopped at the first arrival of an excursion which has infinite length.
156
6 The Wiener–Hopf Factorisation
We offer no proof for this result as it goes beyond the scope of this book. We refer instead to Bertoin (1996) who gives a rigorous treatment. However, the intuition behind this theorem lies with the observation that for each t > 0, by Lemma 6.9, L−1 t− is a stopping time and hence by Theorem 3.1 the progression −1 of XL−1 − XL−1 in the time interval (L−1 . As t− , Lt ] is independent of FL−1 t− t−+s t− alluded to earlier, this means that the paths of X may be decomposed into the juxtaposition of independent excursions from the maximum. The case that the drift coefficient a of L−1 is strictly positive is the case of a bounded variation L´evy process with 0 irregular for (−∞, 0) and hence local time which may be taken as proportional to the Lebesgue measure of the time that X = X. In this case excursions from the maximum are interlaced by moments of real time where X can be described as drifting at its maximum. That is to say, moments of real time which contribute to a strict increase in the Lebesgue measure of the real time the process spends at its maximum. If there is a last maximum, then the process of excursions is stopped at the first arrival in E∞ := {ǫ ∈ E : ζ (ǫ) = ∞}. Theorem 6.15 generalises the statement of Theorem 6.10. To see why, suppose that we write Λ(dx, dy) = n(ζ (ǫ) ∈ dx, h(ǫ) ∈ dy).
(6.11)
On {t < L∞ } the jumps of the ladder process (L−1 , H) form a Poisson process on [0, ∞) × (0, ∞)2 with intensity measure dt × Λ(dx, dy). We can write L−1 t as the sum of the Lebesgue measure of the time X spends drifting at the maximum (if at all) plus the jumps L−1 makes due to excursions from the maximum. Hence, if N is the counting measure associated with the Poisson point process of excursions, then on {L∞ > t}, L−1 t
=
L−1 t
1(ǫs =∂) ds +
0
=
[0,t]
L−1 t
1(X s =Xs ) ds +
0
= at +
[0,t]
(0,∞)
E
[0,t]
ζ (ǫ) N (ds × dǫ)
E
ζ (ǫ) N (ds × dǫ)
xNL−1 (ds × dx).
(6.12)
We can also write the ladder height process H in terms of a drift, say b ≥ 0, and its jumps which are given by the terminal values of excursions. Hence, on {t < L∞ }, Ht = bt +
[0,t]
E
h(ǫ)N (ds × dǫ).
(6.13)
Also we can see that P(L∞ > t) is the probability that in the process of excursions the first arrival in E∞ is after time t. Written in terms of the Poisson
6.4 The Wiener–Hopf Factorisation
157
point process of excursions we see that P(L∞ > t) = P(N ([0, t] × E∞ ) = 0) = e−n(E∞ )t . This reinforces the earlier conclusion that L∞ is exponentially distributed and we equate the parameters κ(0, 0) = n(E∞ ).
(6.14)
6.4 The Wiener–Hopf Factorisation A fundamental aspect of the theory of L´evy processes is a set of conclusions which in modern times are loosely referred to as the Wiener–Hopf factorisation. Historically the identities around which the Wiener–Hopf factorisation is centred are the culmination of a number of works initiated from within the theory of random walks. These include Spitzer, (1956, 1957, 1964), Feller (1971), Borovkov (1976), Pecherskii and Rogozin (1969), Gusak and Korolyuk (1969), Greenwood and Pitman (1980), Fristedt (1974) and many others; although the analytical roots of the so-called Wiener–Hopf method go much further back than these probabilistic references (see Sect. 6.6). The importance of the Wiener–Hopf factorisation is that it gives us information concerning the characteristics of the ascending and descending ladder processes. As indicated earlier, we shall use this knowledge in later chapters to consider a number of applications as well as to extract some generic results concerning course and fine path properties of L´evy process. In this section we treat the Wiener–Hopf factorisation following closely the presentation of Greenwood and Pitman (1980) which relies heavily on the decomposition of the path of a L´evy process in terms of excursions from the maximum. Examples of the Wiener–Hopf factorisation will be treated in Sect. 6.5. We begin by recalling that for α, β ≥ 0 the Laplace exponents κ(α, β) and κ )(α, β) of the ascending ladder process (L−1 , H) and the descending ladder ) are defined, respectively, by, ) −1 , H) process (L −1 )−1 ) −) κ(α,β) 1 −β H1 1 E e−αL1 −βH1 1(1
κ(α, β) = q + φ (α, β)
(6.15)
where φ is the Laplace exponent of a bivariate subordinator and L∞ is exponentially distributed with parameter q = n(E∞ ) ≥ 0. The exponent φ can be written in the form φ (α, β) = αa + βb + (1 − e−αx −βy )Λ (dx , dy) , (6.16) (0 ,∞)2
158
6 The Wiener–Hopf Factorisation
where the constant a was identified in Corollary 6.8, b is some non-negative constant representing the drift of H and Λ(dx, dy) is given in terms of the excursion measure n in (6.11). It is also important to remark that both κ(α, β) and κ )(α, β) can be analytically extended in β to C+ = {z ∈ C : ℜz ≥ 0}. The next theorem gives the collection of statements which are known as the Wiener–Hopf factorisation. We need to introduce some additional notation first. As in earlier chapters, we shall understand ep to be an independent random variable which is exponentially distributed with mean 1/p. Further, we define Gt = sup{s < t : X s = Xs } and
Gt = sup{s < t : X s = Xs }.
An important fact concerning the definition of Gt which is responsible for the first sentence in the statement of the Wiener–Hopf factorisation (Theorem 6.16 below) is that, if X is not a compound Poisson process, then its maxima are obtained at unique times. To see this first suppose that 0 is regular for [0, ∞). Since we have excluded Poisson processes, then by Corollary 6.6 this implies that 0 is regular for (0, ∞). In this case, for any stopping time T such that X T = XT it follows by the Strong Markov Property and regularity that X T +u > X T for all u > 0; in particular, we may consider the stopping which run through all the times at which X visits its maximum. times L−1 t If the aforementioned regularity fails, then since X is assumed not to be a compound Poisson process, then 0 must be regular for (−∞, 0). In that case, the conclusions of the previous case apply to −X. However, −X has the same law as X time reversed. Hence the path of X over any finite time horizon when time reversed has new maxima which are obtained at unique times. This implies that X itself cannot touch the same maxima at two different times when sampled over any finite time horizon. As mentioned earlier however, if X is a compound Poisson process with an appropriate jump distribution, it is possible that X visits the same maxima at distinct ladder times. Theorem 6.16 (The Wiener–Hopf factorisation). Suppose that X is any L´evy process other than a compound Poisson process. As usual, denote by ep an independent and exponentially distributed random variable. (i) The pairs (Gep , X ep ) and (ep − Gep , X ep − Xep )
are independent and infinitely divisible, yielding the factorisation p = Ψp+ (ϑ, θ) · Ψp− (ϑ, θ) (6.17) p − iϑ + Ψ (θ)
where θ, ϑ ∈ R,
iϑG +iθX e p . Ψp+ (ϑ, θ) = E eiϑGep +iθX ep and Ψp− (ϑ, θ) = E e ep
The pair Ψp+ (ϑ, θ) and Ψp− (ϑ, θ) are called the Wiener–Hopf factors.
6.4 The Wiener–Hopf Factorisation
159
(ii) The Wiener–Hopf factors may themselves be identified in terms of the analytically extended Laplace exponents κ(α, β) and κ )(α, β) via the Laplace transforms, E e−αGep −βX ep =
κ(p, 0) κ )(p, 0) −αGep +βX ep and E e = κ(p + α, β) κ )(p + α, β) (6.18)
for α, β ∈ C+ . (iii) The Laplace exponents κ(α, β) and κ )(α, β) may also be identified in terms of the law of X in the following way, ∞ −t 1 e − e−αt−βx P(Xt ∈ dx)dt (6.19) κ(α, β) = k exp t 0 (0,∞) and κ )(α, β) = ) k exp
0
∞
(−∞,0)
e
−t
−e
−αt+βx
1 P(Xt ∈ dx)dt t
(6.20)
where α, β ∈ R and k and ) k are strictly positive constants. (iv) By setting ϑ = 0 and taking limits as p tends to zero in (6.17) one obtains for some constant k ′ > 0 (which may be taken equal to unity by a suitable normalisation of local time), k ′ Ψ (θ) = κ(0, −iθ)) κ(0, iθ).
(6.21)
Let us now make some notes concerning the statement of the Wiener–Hopf factorisation. Firstly, there are a number of unidentified constants in the expressions concerning the Wiener–Hopf factorisation. To some extent, these constants are meaningless since, as a little reflection reveals, they are dependent on the normalisation chosen in the definition of local time (cf. Definition 6.1). In this context local time is nothing other than an artificial clock to measure intrinsic time spent at the maximum. Naturally a different choice of local time will induce a different inverse local time and hence ladder height process. Nonetheless the range of the bivariate ladder process will be invariant to this choice as this will always correspond to the range of the real times and positions of the new maxima of the underlying L´evy process. Secondly, the exclusion of the compound Poisson processes from the statement of the theorem is not to say that a Wiener–Hopf factorisation for this class of L´evy processes does not exist. The case of the compound Poisson process is essentially the case of the random walk and has some subtle differences which we shall come back to later on. The proof of Theorem 6.16 we shall give makes use of a simple fact about infinitely divisible distributions as well as the fundamental properties of the Poisson point processes describing the excursions of X. We give these facts
160
6 The Wiener–Hopf Factorisation
in the following two preparatory Lemmas. For the first, it may be useful to recall Exercise 2.10 Lemma 6.17. Suppose that X = {Xt : t ≥ 0} is any d-dimensional L´evy process with characteristic exponent Ψ (θ) = −log E(eiθ·Xt ) for θ ∈ Rd . Then the pair (ep , Xep ) has a bivariate infinitely divisible distribution with L´evy– Khintchine exponent given by ∞ 1 (1 − eiϑt+iθ·x ) e−pt P (Xt ∈ dx) dt E eiϑep +iθXep = exp − t 0 Rd p . = p − iϑ + Ψ (θ) Proof. Noting from the L´evy–Khintchine formula (cf. Exercise 2.10) that ℜΨ (θ) = θ · Aθ/2 + Rd (1 − cos θ · x)Π(dx) where A is a d × d matrix which has non-negative eigenvalues, Π is the L´evy measure on Rd and θ ∈ Rd , it follows that ℜΨ (θ) ≥ 0. Hence we have ∞ p E eiϑep +iθXep = . pe−pt+iϑt−Ψ (θ)t dt = p − iϑ + Ψ (θ) 0 On the other hand using the Frullani integral in Lemma 1.7 we see that ∞ iϑt+iθ·x 1 −pt exp − (1 − e ) e P (Xt ∈ dx) dt t 0 ∞R −(Ψ (θ)−iϑ)t 1 −pt = exp − (1 − e ) e dt t 0 p = . p − iϑ + Ψ (θ)
The result now follows.
The next result concerns the Poisson point process of excursions {(t, ǫt ) : t ≥ 0 and ǫt = ∂}. However, the conclusion depends only on the fact that points of the latter process belong to a product measure space ([0, ∞) × E, B([0, ∞)) × Σ, dt × dn) and not that E is the space of excursions. Lemma 6.18. Suppose that {(t, ǫt ) : t ≥ 0} is a Poisson point process on ([0, ∞) × E, B[0, ∞) × Σ, dt × dn). Choose A ∈ Σ such that n(A) < ∞ and define σ A = inf{t > 0 : ǫt ∈ A}. (i) The random time σ A is exponentially distributed with parameter n(A). (ii) The process {(t, ǫt ) : t < σ A } is equal in law to a Poisson point process on [0, ∞) × E\A with intensity dt × dn′ where n′ (dǫ) = n(dǫ ∩ E\A) which is stopped at an independent exponential time with parameter n(A). (iii) The process {(t, ǫt ) : t < σ A } is independent of ǫσA .
6.4 The Wiener–Hopf Factorisation
161
Proof. Let S1 = [0, ∞) × A and S2 = [0, ∞) × (E\A). Suppose that N is the Poisson random measure associated with the given Poisson point process. All three conclusions follow from Corollary 2.5 applied to the restriction of N to the disjoint sets S1 and S2 , say N (1) and N (2) , respectively. Specifically, for (i) note that P(σ A > t) = P(N (1) ([0, t]×A) = 0) = e−n(A)t as N (1) has intensity dt × n(dǫ ∩ A). For (ii) and (iii) it suffices to note that N (2) has intensity dt × n(dǫ ∩ E\A), that {(t, ǫt ) ∈ [0, ∞) × E : t < σ A } = {(t, ǫt ) ∈ [0, ∞) × (E\A) : t < σ A } and that the first arrival in A is a point belonging to the process N (1) which is independent of N (2) . Note in fact that, since {σ A ≤ t} = {N ([0, t] × A) ≥ 1}, it is easily seen that σ A is a stopping time with respect to the filtration G = {Gt : t ≥ 0} where Gt = σ(N (U × V ) : U ∈ B[0, t] and V ∈ Σ). In the case that E is taken as the space of excursions, one may take G = F. Now we are ready to give the proof of the Wiener–Hopf factorisation. Proof (of Theorem 6.16 (i)). The crux of the first part of the Wiener–Hopf factorisation lies with the following important observation. Consider the Poisson point process of marked excursions on ([0, ∞) × E × [0, ∞), B[0, ∞) × Σ × B[0, ∞), dt × dn × dη) where η(dx) = pe−px dx for x ≥ 0. That is to say, a Poisson point process (t) (t) whose points are described by {(t, ǫt , ep ) : t ≥ 0 and ǫt = ∂} where ep is an independent copy of an exponentially distributed random variable if t is such (t) that ǫt = ∂ and otherwise ep := ∂. The Poisson point process of excursions is then just a projection of the latter on to [0, ∞) × E. Sampling the L´evy process X up to an independent exponentially distributed random time ep corresponds to sampling the Poisson process of excursions up to time Lep ; that is {(t, ǫt ) : t < Lep and t = ∂}. In turn, we claim that the latter is equal in law to the projection on to [0, ∞) × E of {(t, ǫt , ep(t) ) : t < σ1 ∧ σ2 and ǫt = ∂} where σ1 := inf{t > 0 :
0
and
L−1 t
(6.22)
1(X s =Xs ) ds > ep }
σ2 := inf{t > 0 : ζ(ǫt ) > ep(t) } where we recall that ζ(ǫt ) is the duration of the excursion indexed by local time t. Note that in the case that the constant a in Theorem 6.8 is zero,
162
6 The Wiener–Hopf Factorisation
· in other words 0 1(X s =Xs ) ds = 0, we have simply that σ1 = ∞. A formal proof of this claim would require the use of some additional mathematical tools. However, for the sake of brevity, we shall lean instead on an intuitive explanation as follows. We recall that the path of the L´evy process up to time ep is the independent juxtaposition of excursions and further, in the case that the constant a in Theorem 6.8 is strictly positive, excursions are interlaced with moments of real time when X = X and which accumulate positive Lebesgue measure. By the lack of memory property the event {t < Lep }, that is the event that there are at least t units of local time for a given stretch of ep units of real time, is equivalent to the event that the total amount of real time accumulated at the maximum by local time t has survived independent exponential killing at rate p as well as each of the excursion lengths up to local time t have survived independent exponential killing at rate p. This idea is easier to visualise when one considers the case that X is a compound Poisson process with strictly positive or strictly negative drift; see Figs. 6.2 and 6.3. The times σ1 and σ2 are independent and further σ2 is of the type of stopping time considered in Lemma 6.18 with A = {ζ(ǫ) > ep } when applied to the Poisson point process (6.22). From each of the three statements given in Lemma 6.18 we deduce three facts concerning the Poisson point process (6.22). (1) Since
L−1 t 0
1(X s =Xs ) ds = at we have P(σ1 > t) = P
L−1 t
0
1(X s =Xs ) ds < ep
= e−apt .
As mentioned earlier, if the constant a = 0 then we have that σ1 = ∞. Further, with the help of Lemma 6.18 (i) we also have that P(σ2 > t) = exp −t
∞
0
= exp −t
∞
pe−px dx · n(ζ(ǫ) > x) pe
−px
0
= exp −n(E∞ )t − t
dx · [n(∞ > ζ(ǫ) > x) + n(ζ(ǫ) = ∞)]
(0,∞)
(1 − e
−px
)n(ζ(ǫ) ∈ dx)
6.4 The Wiener–Hopf Factorisation
163
Fig. 6.2. A symbolic sketch of the decomposition of the path of a compound Poisson process with strictly positive drift over an independent and exponentially distributed period of time. The situation for bounded variation L´evy processes for which 0 is irregular for (−∞, 0) is analogous to the case in this sketch in the sense that the Lebesgue measure of the time spent at the maximum over any finite time horizon is strictly positive.
where we recall that E∞ = {ǫ ∈ E : ζ(ǫ) = ∞}. As σ1 and σ2 are independent and exponentially distributed it follows3 that P(σ1 ∧σ2 > t) = exp −t n(E∞ ) + ap +
(0,∞)
(1 − e−px )n(ζ(ǫ) ∈ dx)
.
However, recall from (6.11) and (6.14) that κ(0, 0) = n(E∞ ) and Λ(dx, [0, ∞)) = n(ζ(ǫ) ∈ dx) and hence the exponent above is equal to κ(p, 0) where κ is given by (6.15) and (6.16). (2) From Lemma 6.18 (ii) and the observation (1) above, we see that the Poisson point process (6.22) is equal in law to a Poisson point process on
3
Recall that the minimum of two independent exponential random variables is again exponentially distributed with the sum of their rates
164
6 The Wiener–Hopf Factorisation
z( t) < ep(t)
− Xep − Xep
−
Xep
ep t
L−1 t
Fig. 6.3. A symbolic sketch of the decomposition of the path of a compound Poisson process with strictly negative drift over an independent and exponentially distributed period of time. The situation for a L´evy process of unbounded variation or a L´evy process for which 0 is irregular for [0, ∞) is analogous to the case in this sketch in the sense that the Lebesgue measure of the time spent at the maximum is zero.
[0, ∞) × E × [0, ∞) with intensity dt × n(dǫ; ζ(ǫ) < x) × η(dx)
(6.23)
which is stopped at an independent time which is exponentially distributed with parameter κ(p, 0). (3) Lemma 6.18 (iii) tells us that on the event σ2 < σ1 , the process (6.22) is independent of ǫσ2 = ǫσ1 ∧σ2 . On the other hand, when σ1 < σ2 since at the local time σ1 we have ∂ = ǫσ1 = ǫσ1 ∧σ2 We conclude that ǫσ1 ∧σ2 is independent of (6.22). Now note with the help of (6.12) and (6.13) that −1 ζ(ǫt )N (dt × dǫ) = a(σ ∧ σ ) + Gep = L(σ 1 2 1 ∧σ2 )− [0,σ1 ∧σ2 )
E
and X ep = H(σ1 ∧σ2 )− = b(σ1 ∧ σ2 ) +
[0,σ1 ∧σ2 )
E
h(ǫt )N (dt × dǫ).
From point (3) above, the previous two random variables are independent of the excursion ǫσ1 ∧σ2 . This last excursion occupies the final ep − Gep units of real time in the interval [0, ep ] and reaches a depth of Xep − X ep relative to its spatial point of issue (see Figs. 6.2 and 6.3). Note that the last two random variables are both zero if and only if ǫσ1 ∧σ2 = ∂ if and only if σ1 < σ2 . In conclusion (Gep , X ep ) is independent of (ep − Gep , X ep − Xep ).
6.4 The Wiener–Hopf Factorisation
165
From point (2), the process {(L−1 t , Ht ) : t < σ1 ∧ σ2 } behaves like a subordinator with characteristic measure ∞ pe−pt dt · n(ζ(ǫ) ∈ dx, h(ǫ) ∈ dy, x < t) = e−px Λ(dx, dy) 0
and drift (a, b) which is stopped at an independent exponentially distributed time with parameter κ(p, 0). Suppose that we denote this subordinator (L−1 , H) = {(L−1 t , Ht ) : t ≥ 0}. Then d
(L−1 eχ , Heχ ) = (Gep , X ep ) where eχ is an independent exponential random variable with parameter χ = κ(p, 0). From Lemma 6.17 we also see that (Gep , X ep ) is infinitely divisible. Now note that by appealing to the Duality Lemma and the fact that maxima are attained at unique times (recall the disc