RUIN PROBABILITIES Second Edition
7431 tp.indd 1
8/5/10 9:33 AM
ADVANCED SERIES ON STATISTICAL SCIENCE & APPLIED PROBABILITY Editor: Ole E. Barndorff-Nielsen Published Vol. 1
Random Walks of Infinitely Many Particles by P. Révész
Vol. 2
Ruin Probabilities by S. Asmussen
Vol. 3
Essentials of Stochastic Finance: Facts, Models, Theory by Albert N. Shiryaev
Vol. 4
Principles of Statistical Inference from a Neo-Fisherian Perspective by L. Pace and A. Salvan
Vol. 5
Local Stereology by Eva B. Vedel Jensen
Vol. 6
Elementary Stochastic Calculus — With Finance in View by T. Mikosch
Vol. 7
Stochastic Methods in Hydrology: Rain, Landforms and Floods eds. O. E. Barndorff-Nielsen et al.
Vol. 8
Statistical Experiments and Decisions: Asymptotic Theory by A. N. Shiryaev and V. G. Spokoiny
Vol. 9
Non-Gaussian Merton–Black–Scholes Theory by S. I. Boyarchenko and S. Z. Levendorskiĭ
Vol. 10 Limit Theorems for Associated Random Fields and Related Systems by A. Bulinski and A. Shashkin Vol. 11 Stochastic Modeling of Electricity and Related Markets . by F. E. Benth, J. Òaltyte Benth and S. Koekebakker Vol. 12 An Elementary Introduction to Stochastic Interest Rate Modeling by N. Privault Vol. 13 Change of Time and Change of Measure by O. E. Barndorff-Nielsen and A. Shiryaev Vol. 14 Ruin Probabilities (2nd Edition) by S. Asmussen and H. Albrecher
EH - Ruin Probabilities.pmd
2
7/26/2010, 4:56 PM
Advanced Series on Statistical Science &
Vol. 14
Applied Probability
RUIN PROBABILITIES Second Edition
Søren Asmussen Aarhus University, Denmark
Hansjörg Albrecher University of Lausanne, Switzerland
World Scientific NEW JERSEY
7431 tp.indd 2
•
LONDON
•
SINGAPORE
•
BEIJING
•
SHANGHAI
•
HONG KONG
•
TA I P E I
•
CHENNAI
8/5/10 9:33 AM
Published by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 USA office: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE
Library of Congress Cataloging-in-Publication Data Asmussen, Søren. Ruin probabilities / by Søren Asmussen & Hansjörg Albrecher p. cm. -- (Advanced series on statistical science and applied probability ; v. 14) Includes bibliographical references and index. ISBN-13: 978-981-4282-52-9 (hardcover : alk. paper) ISBN-10: 981-4282-52-9 (hardcover : alk. paper) 1. Insurance--Mathematics. 2. Risk. I. Albrecher, Hansjörg. II. Title. HG8781.A83 2010 368'.01--dc22 2010023280
British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library.
Copyright © 2010 by World Scientific Publishing Co. Pte. Ltd. All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the Publisher.
For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher.
Printed in Singapore.
EH - Ruin Probabilities.pmd
1
7/26/2010, 4:56 PM
Contents Preface
ix
Notation and conventions I
II
III
IV
xiii
Introduction 1 The risk process . . . . . . 2 Claim size distributions . . 3 The arrival process . . . . 4 A summary of main results
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
1 1 6 11 13
. . . . . motion . . . . . . . . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
21 21 23 29 30
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
39 39 45 48 54 62
compound Poisson model Introduction . . . . . . . . . . . . . . . . . . . . . . The Pollaczeck-Khinchine formula . . . . . . . . . . Special cases of the Pollaczeck-Khinchine formula . Change of measure via exponential families . . . . . Lundberg conjugation . . . . . . . . . . . . . . . . . Further topics related to the adjustment coefficient
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
71 72 75 77 82 84 91
. . . . . . . . . . . . . . . . . . . . . . . . and methods
. . . .
Martingales and simple ruin calculations 1 Wald martingales . . . . . . . . . . . . . . 2 Gambler’s ruin. Two-sided ruin. Brownian 3 Further simple martingale calculations . . 4 More advanced martingales . . . . . . . .
. . . .
. . . .
Further general tools and results 1 Likelihood ratios and change of measure . . . 2 Duality with other applied probability models 3 Random walks in discrete or continuous time . 4 Markov additive processes . . . . . . . . . . . 5 The ladder height distribution . . . . . . . . . The 1 2 3 4 5 6
v
. . . .
. . . . .
. . . .
. . . . .
vi
V
VI
VII
CONTENTS 7 8 9 10
Various approximations for the ruin probability . . . . Comparing the risks of different claim size distributions Sensitivity estimates . . . . . . . . . . . . . . . . . . . Estimation of the adjustment coefficient . . . . . . . .
The 1 2 3 4 5 6 7
probability of ruin within finite time Exponential claims . . . . . . . . . . . . . The ruin probability with no initial reserve Laplace transforms . . . . . . . . . . . . . When does ruin occur? . . . . . . . . . . . Diffusion approximations . . . . . . . . . . Corrected diffusion approximations . . . . How does ruin occur? . . . . . . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . .
. . . . . . .
. . . .
. . . . . . .
. . . .
. 95 . 100 . 103 . 110
. . . . . . .
115 116 121 126 128 136 139 146
. . . . . . .
Renewal arrivals 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Exponential claims. The compound Poisson model with negative claims . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Change of measure via exponential families . . . . . . . . . . . 4 The duality with queueing theory . . . . . . . . . . . . . . . .
151 151
Risk theory in a Markovian environment 1 Model and examples . . . . . . . . . . . . . . . 2 The ladder height distribution . . . . . . . . . . 3 Change of measure via exponential families . . . 4 Comparisons with the compound Poisson model 5 The Markovian arrival process . . . . . . . . . . 6 Risk theory in a periodic environment . . . . . . 7 Dual queueing models . . . . . . . . . . . . . . .
154 157 161
. . . . . . .
. . . . . . .
. . . . . . .
165 165 172 180 188 194 196 205
VIII Level-dependent risk processes 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . 2 The model with constant interest . . . . . . . . . . . . . . 3 The local adjustment coefficient. Logarithmic asymptotics 4 The model with tax . . . . . . . . . . . . . . . . . . . . . . 5 Discrete-time ruin problems with stochastic investment . . 6 Continuous-time ruin problems with stochastic investment
. . . . . .
. . . . . .
209 209 222 227 239 242 248
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
CONTENTS IX
X
XI
XII
vii
Matrix-analytic methods 1 Definition and basic properties of phase-type 2 Renewal theory . . . . . . . . . . . . . . . . 3 The compound Poisson model . . . . . . . . 4 The renewal model . . . . . . . . . . . . . . 5 Markov-modulated input . . . . . . . . . . . 6 Matrix-exponential distributions . . . . . . . 7 Reserve-dependent premiums . . . . . . . . 8 Erlangization for the finite horizon case . . . Ruin probabilities in the presence 1 Subexponential distributions . . . 2 The compound Poisson model . . 3 The renewal model . . . . . . . . 4 Finite-horizon ruin probabilities . 5 Reserve-dependent premiums . . 6 Tail estimation . . . . . . . . . .
distributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . .
. . . . . . . .
253 253 260 264 266 271 277 281 287
of heavy tails . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
293 293 302 305 309 318 320
Ruin probabilities for L´ evy processes 1 Preliminaries . . . . . . . . . . . . . . . . . . . . . 2 One-sided ruin theory . . . . . . . . . . . . . . . . 3 The scale function and two-sided ruin problems . 4 Further topics . . . . . . . . . . . . . . . . . . . . 5 The scale function for two-sided phase-type jumps
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
329 329 336 340 345 353
Gerber-Shiu functions 1 Introduction . . . . . . 2 The compound Poisson 3 The renewal model . . 4 L´evy risk models . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
357 357 360 374 384
XIII Further models with dependence 1 Large deviations . . . . . . . . . . . . . . . . . . 2 Heavy-tailed risk models with dependent input 3 Linear models . . . . . . . . . . . . . . . . . . . 4 Risk processes with shot-noise Cox intensities . 5 Causal dependency models . . . . . . . . . . . . 6 Dependent Sparre Andersen models . . . . . . . 7 Gaussian models. Fractional Brownian motion . 8 Ordering of ruin probabilities . . . . . . . . . . 9 Multi-dimensional risk processes . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
397 398 410 417 419 424 427 428 433 435
. . . . model . . . . . . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
viii
CONTENTS
XIV Stochastic control 445 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 445 2 Stochastic dynamic programming . . . . . . . . . . . . . . . . 447 3 The Hamilton-Jacobi-Bellman equation . . . . . . . . . . . . . 448 XV
Simulation methodology 1 Generalities . . . . . . . . . . . . . . . . . . . . . . . . 2 Simulation via the Pollaczeck-Khinchine formula . . . . 3 Static importance sampling via Lundberg conjugation . 4 Static importance sampling for the finite horizon case . 5 Dynamic importance sampling . . . . . . . . . . . . . . 6 Regenerative simulation . . . . . . . . . . . . . . . . . 7 Sensitivity analysis . . . . . . . . . . . . . . . . . . . .
XVI Miscellaneous topics 1 More on discrete-time risk models . . . . 2 The distribution of the aggregate claims 3 Principles for premium calculation . . . . 4 Reinsurance . . . . . . . . . . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
461 461 465 470 474 475 482 484
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
487 487 493 510 513
Appendix A1 Renewal theory . . . . . . . . . . . . . . . A2 Wiener-Hopf factorization . . . . . . . . . A3 Matrix-exponentials . . . . . . . . . . . . . A4 Some linear algebra . . . . . . . . . . . . . A5 Complements on phase-type distributions . A6 Tauberian theorems . . . . . . . . . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
517 517 522 526 530 536 548
Bibliography
549
Index
597
Preface This book is a second edition of the book of the same title by the first author which was published in 2000. The subject of ruin probabilities and related topics has since then undergone a considerable development, not to say boom. This much expanded and revised second edition aims at covering a substantial part of these developments as well as the classical topics. Risk theory in general and ruin probabilities in particular are traditionally considered as part of insurance mathematics, and has been an active area of research from the days of Lundberg all the way up to today. One reason for writing this book is a feeling that the area has in recent years achieved a considerable mathematical maturity, which has in particular removed one of the standard criticisms of the area, namely that it can only say something about very simple models and questions. Although in insurance practice, usually simpler (and coarser) risk measures like Value-at-Risk are used, it is widely believed that the thinking advocated by ruin theory is still important for modern risk management. For instance, in times of market-consistent valuation principles, the role of the time diversification effect of insurance portfolios, which is one of the core elements of ruin theory, should not be forgotten. In addition, ruin theory has fruitful methodological links and applications to other fields of applied probability, like queueing theory and mathematical finance (pricing of barrier options, credit products etc.). Apart from these remarks, we have deliberately stayed away from discussing the practical relevance of the theory; if the formulations occasionally give a different impression, it is not by intention. Thus, the book is basically mathematical in its flavor. The present second edition is more than 50% longer than the first and has more than double the number of references. The longer parts of the new material, reflecting subareas that have been particularly active in the last decade, are collected in Chapters XI–XIV, which treat L´evy processes, Gerber-Shiu functions, dependence and stochastic control, respectively. Shorter additions include ix
x
PREFACE
more about martingales and generators (II.4), various versions in Chapter VIII of models with level dependence, e.g. tax or stochastic investments, Erlangization (IX.8), statistical techniques for distinguishing between light and heavy tails (X.6), more material on discrete-time risk models (XVI.1) and recent advances in simulation techniques scattered in Chapter XV. In addition, there are amendments and updates at a large number of places. A book like this can be organized in many ways. One is by model, another by method. The present book is somewhere between these two possibilities. Chapters IV–VIII introduce some of the main models and give a first derivation of some of their properties. Chapters IX–XV then go into more depth with some of the special approaches for analyzing specific models and add a number of results on the models in Chapters IV–VIII. Chapters II and III are essentially methodological in flavor. Here is a suggestion on how to get started with the book. For a brief orientation, read first Chapter I, continue with II.1–3 to see some of the simplest ruin calculations, the first part of III.5 (to understand the Pollaczeck-Khinchine formula in IV.2 more properly), and then, to get acquainted with the classical theory of the Cram´er-Lundberg model, IV.1–5, V.4a, VIII.1, IX.1–3 and X.1– 2. For a second reading, incorporate II.4, III.1–3, IV.8–9, V.1–2, V.5, VII.1–3, VIII.2, X.3–4, XII.1–2, XIII.1-2 and XV.1–3. The rest is up to your specific interests. Enjoy! The symbols used for the quantities appearing in the book differ among the disciplines. We chose to use those that are common in the queueing community, partly also to be in line with the first edition. We apologize for the confusion this may cause for readers who are used to other symbols. In a book project like this it is impossible to avoid conflicts of notation in the sense that the same symbol may be used for different quantities. We hope that it will always be clear from the context what the notation refers to. In addition, we have collected a number of conventions, abbreviations and symbols after this Preface. We have tried to be fairly exhaustive in citing references close to the text, but it is obvious that such a system involves a number of inconsistencies and omissions, for which we apologize to the reader and to the authors of the many papers that ought to have been on the list. We intend to keep a list of misprints and remarks posted on the web page http://www.hec.unil.ch/halbrecher/rp2.html and we are grateful to get relevant material sent by email to
[email protected]
PREFACE
xi
Finally, we would like to thank Corina Constantinescu, Hans Gerber, Peter Glynn, Dominik Kortschak, Ronnie Loeffen, Stefan Thonhauser and Hailiang Yang for discussions and proofreading parts of the manuscript, and Dominik Kortschak for help with some figures and general LaTeX issues. Most of all, we would like to thank our wives May Lise and Renate for their support and patience during the writing of this book. Aarhus and Lausanne, May 2010 Søren Asmussen
Hansj¨org Albrecher
This page intentionally left blank
Notation and conventions Numbering and reference system The chapter number is specified only when it is not the current one. Thus Proposition 4.2, formula (5.3) or Section 3 of Chapter VI are referred to as Proposition VI.4.2, formula VI.(5.3) and Section VI.3 (or just VI.3), respectively, in all other chapters whereas in VI we just write Proposition 4.2, formula (5.3) or Section 3. References like Proposition A.4, (A.29) refer to the Appendix. Throughout the book, [APQ] refers to the first author’s earlier book Applied Probability and Queues, reference [69]. Abbreviations a.s. almost surely c.d.f. cumulative distribution function P(X ≤ x) b where B[s] b is the m.g.f. c.g.f. cumulant generating function, i.e. log B[s] IDE integro-differential equation i.i.d. independent identically distributed i.o. infinitely often l.h.s. left-hand side (of equation) b below. m.g.f. moment generating function, see under B[s] ODE ordinary differential equation r.h.s. right-hand side (of equation) r.v. random variable s.c.v. squared coefficient of variation, EX 2 /(EX)2 . xiii
xiv
NOTATION AND CONVENTIONS w.r.t. with respect to w.p. with probability
Mathematical notation P probability. E expectation. ∼ Used in asymptotic relations to indicate√that the ratio between two expressions is 1 in the limit. E.g. n! ∼ 2π nn+1/2 e−n , n → ∞. ≈ A different type of asymptotics: less precise, say a heuristic approximation, or a more precise one like eh ≈ 1 + h + h2 /2, h → 0. log
∼ Used in asymptotic relations to indicate that the ratio between logarithms of two expressions is 1.
≺st stochastic order. ≺cx convex order. ≺icx increasing convex order (i.e. stop-loss order). ≺sm supermodular order. <(s) the real part of a complex number s. — The same symbol B is used for a probability R x measure B(dx) = P(X ∈ dx) and its c.d.f. B(x) = P(X ≤ x) = −∞ B(dy). R∞ b B[r] the m.g.f. −∞ erx B(dx) of the distribution B. If, as for typical claim b is always defined size distributions, B is concentrated on [0, ∞), B[r] if <(r) ≤ 0 and sometimes in a larger strip (for example, if B(x) ∼ b ce−δx , then for <(r) < δ). The Laplace-Stieltjes transform is B[−s]. B(x) the tail 1 − B(x) = P(X > x) of B. λ(x) the failure rate of the distribution B, i.e. λ(x) = b(x)/B(x). kGk the total mass (variation) of a (signed) measure G. In particular, for a probability distribution kGk = 1, and for a defective probability distribution kGk < 1. R µB the mean EX = xB(dx) of B. R (n) µB the nth moment EX n = xn B(dx) of B. I(A) the indicator function of the event A. E[X; A] means E[XI(A)]. 2 marks the end of a proof, an example or a remark.
NOTATION AND CONVENTIONS
xv
Xt− the left limit lims↑t Xs , i.e. the value just before t. C n the space of functions that are n times continuously differentiable. D[0, ∞) the space of R-valued functions which are right-continuous and have left limits. Unless otherwise stated, all stochastic processes considered in this book are assumed to have sample paths in this space. Usually, the processes we consider are piecewise continuous, i.e. only have finitely many jumps in each finite interval. Then the assumption of D-paths just means that we use the convention that the value at each jump epoch is the right limit rather than the left limit. In the French-inspired literature, often the term ‘cadlag’ (continues a droite avec limites a gauche) is used for the D-property. N (µ, σ 2 ) the normal distribution with mean µ and variance σ 2 . Matrices and vectors are denoted by bold letters. Usually, matrices have uppercase Roman or Greek letters like T , Λ, row vectors have lowercase Greek letters like α, π, and column vectors have lowercase Roman letters like t, a. In particular: I is the identity matrix. e is the column vector with all entries equal to 1. ei is the ith unit column vector, i.e. the ith entry is 1 and all other 0. (the dimension is usually clear from the context and left unspecified in the notation). For a given set x1 , . . . , xp of numbers, (xi )diag denotes the diagonal matrix with the xi on the diagonal (xi )row denotes the row vector with the xi as components (xi )col denotes the column vector with the xi as components. T is the transposition operator acting on vectors or matrices. E.g, the ith unit row vector is eT i. Special notation for risk processes At the total claims up to time t. β the arrival intensity (when the arrival process is Poisson). Notation like βi and β(t) in Chapter VII has a similar, though slightly more complicated, intensity interpretation. B the claim size distribution. Notation like Bi and B (t) in Chapter VII has a similar, though slightly more complicated, interpretation.
xvi
NOTATION AND CONVENTIONS B0 the stationary excess (integrated tail) distribution of B. Bt Brownian motion. δ the rate parameter of B for the exponential case B(x) = e−δx . Alternatively, at some places the discount rate for time-dependent considerations. η the safety loading, cf. I.1. γ The adjustment coefficient (for negative drift, the positive solution of κ(γ) = 0). γδ The adjustment coefficient in a time-dependent context (for negative drift, the smallest positive solution of κ(α) = δ). κ(α) the c.g.f. of the increment distribution in the context of discretetime random walks; for continuous-time processes with stationary and independent increments, κ(α) is the L´evy exponent as defined in III.(3.5). For Markov additive processes, the corresponding extension is discussed in II.4 and VI.3b. In Section XVI.1, an adaptation for processes with dependent increments is used. m(u) the Gerber-Shiu function for initial capital u. ν The L´evy measure. At some places also the rate parameter of an exponential distribution. φ Depending on the context it is sometimes used as a symbol for a m.g.f. and sometimes as the survival probability φ(u) = 1 − ψ(u). ψ(u) the ruin probability for initial capital u. ψ(u, T ) the ruin probability up to time T for initial capital u. R∞ b ψ[−s] the Laplace transform 0 e−su ψ(u) du of the ruin probability. Rt the risk reserve process at time t. ρ the net amount βµB of claims per unit time, or quantities with a similar time average interpretation, cf. I.1. ρδ The absolute value of the largest non-positive solution of the timedependent Lundberg equation (for negative drift, κ(−ρδ ) = δ). St the claim surplus process (i.e. aggregate loss process) u − Rt at time t. τ (u) the time of ruin for initial capital u. u usually the initial capital (in the chapter on control, u denotes the control strategy). Wt sometimes an alternative notation for Bt , i.e. Brownian motion.
NOTATION AND CONVENTIONS
xvii
ξ(u) the deficit at ruin of the process Rt starting in u (or, equivalently, the overshoot over u of St ). PL , EL the probability measure and its corresponding expectation corresponding to the exponential change of measure given by Lundberg conjugation, cf. e.g. IV.5, VII.5.
This page intentionally left blank
Chapter I
Introduction 1
The risk process
In this chapter, we give a very brief summary of some of the models, results and topics to be studied in the rest of the book, and some terminology is introduced. A risk reserve process {Rt }t≥0 , as defined in broad terms, is a model for the time evolution of the reserves of an insurance company. We denote throughout the initial reserve by u = R0 . The probability ψ(u) of ultimate ruin is the probability that the reserve ever drops below zero, ¯ ³ ´ ³ ´ ¯ ψ(u) = P inf Rt < 0 = P inf Rt < 0 ¯ R0 = u . t≥0
t≥0
The probability of ruin before time T is ³ ´ ψ(u, T ) = P inf Rt < 0 . 0≤t≤T
We also refer to ψ(u) and ψ(u, T ) as ruin probabilities with infinite horizon and finite horizon, respectively. They are the main topics of study of the present book. For mathematical purposes, it is frequently more convenient to work with the claim surplus process (also called aggregate loss process) {St }t≥0 defined by St = u − Rt . Letting τ (u) = inf {t ≥ 0 : Rt < 0} = inf {t ≥ 0 : St > u} , M =
sup St ,
MT =
0≤t<∞
1
sup St ,
0≤t≤T
(1.1) (1.2)
2
CHAPTER I. INTRODUCTION
be the time to ruin and the maxima with infinite and finite horizon, respectively, the ruin probabilities can then alternatively be written as ψ(u) = P(τ (u) < ∞) = P(M > u), ψ(u, T ) = P(τ (u) ≤ T ) = P(MT > u).
(1.3) (1.4)
So far we have not imposed any assumptions on the risk reserve process. However, the following set-up will cover a main part of the book: • There are only finitely many claims in finite time intervals. That is, the number Nt of arrivals in [0, t] is finite. We denote the interarrival times of claims by T2 , T3 , ... and T1 is the time of the first claim. Thus, the time of arrival of the nth claim is σn = T1 + · · · + Tn , and Nt = min {n ≥ 0 : σn+1 > t} = max {n ≥ 0 : σn ≤ t}. • The size of the nth claim is denoted by Un . • Premiums flow in at rate p, say, per unit time. Putting things together, we see that Rt = u + pt −
Nt X
Uk ,
St =
k=1
Nt X
Uk − pt.
(1.5)
k=1
The sample paths of {Rt } and {St } and the connection between the two processes are illustrated in Fig. I.1.
Figure I.1
1. THE RISK PROCESS
3
Note that it is a matter of taste (or mathematical convenience) whether one allows {Rt } and/or {St } to continue its evolution after the time τ (u) of ruin. Thus, for example, one could well replace Rt by Rt∧τ (u) or Rt∧τ (u) ∨ 0. For the purpose of studying ruin probabilities this distinction is, of course, immaterial. Some main examples of models not incorporated in the above set-up are: • Models which are non-homogeneous in space, for example with a premium depending on the reserve (i.e. on Fig. I.1 the slope of {Rt } should depend also on the level). We study this case in Chapter VIII. • Brownian motion or more general diffusions. Traditionally, Brownian motion has mainly been used as an approximation to the risk process rather than as a model of intrinsic merit and we look at this in Chapter V. However, since any modeling involves some approximative assumptions, it has (partly inspired from the modeling in mathematical finance) become more and more common to use Brownian motion as an intrinsically reasonable model. • General L´evy processes (defined as continuous time processes with stationary independent increments) where the jump component has infinite L´evy measure, allowing a countable infinity of jumps on Fig. I.1. We treat L´evy processes in Chapter XI. The models we consider will often have the property that there exists a constant ρ such that Nt 1X a.s. Uk → ρ, t → ∞. (1.6) t k=1
The interpretation of ρ is as the average amount of claim per unit time. A further basic quantity is the safety loading (or the security loading) η defined as the relative amount by which the premium rate p exceeds ρ, η=
p−ρ . ρ
It is sometimes stated in the theoretical literature that the typical values of the safety loading η are relatively small, say 10% − 20%; we shall, however, not discuss whether this actually corresponds to practice. It would appear obvious, however, that the insurance company should try to ensure η > 0, and in fact: Proposition 1.1 Assume that (1.6) holds. If η < 0, then M = ∞ a.s. and hence ψ(u) = 1 for all u. If η > 0, then M < ∞ a.s. and hence ψ(u) < 1 for all sufficiently large u.
4
CHAPTER I. INTRODUCTION
Proof. It follows from (1.6) that St = t
PNt k=1
Uk − pt a.s. → ρ − p, t
t → ∞.
a.s.
If η < 0, then this limit is > 0 which implies St → ∞ and hence M = ∞ a.s. If a.s. η > 0, then similarly lim St /t < 0, St → −∞, M < ∞ a.s. 2 In concrete models, we obtain typically a somewhat stronger conclusion, namely that M = ∞ a.s., ψ(u) = 1 for all u holds also when η = 0, and that ψ(u) < 1 for all u > 0 when η > 0. However, this needs to be verified in each separate case. The simplest concrete example (to be studied in Chapter IV) is the Cram´erLundberg or compound Poisson model, where {Nt } is a Poisson process with rate β (say) and U1 , U2 , . . . are i.i.d. and independent of {Nt }. Here it is easy to see that ρ = βEU (on the average, β claims arrive per unit time and the mean of a single claim is EU ) and that also N
t 1X lim E Uk = ρ. t→∞ t
(1.7)
k=1
Again, (1.7) is a property which we will typically encounter. However, not all models considered in the literature have this feature: with random Example 1.2 (Cox processes) Here {Nt } is a Poisson process © ª rate β(t) (say) at time t. If U1 , U2 , . . . are i.i.d. and independent of (β(t), Nt ) , it is not too difficult to show that ρ as defined by (1.6) is given by 1 t→∞ t
Z
t
ρ = EU · lim
β(s) ds 0
(provided the © limit ª exists). Thus ρ may well be random for such processes, namely, if β(t) is non-ergodic. The simplest example is β(t) ≡ V where V is a r.v. This case is referred to as the mixed Poisson process, with the most notable special case being V having a Gamma distribution, corresponding to the P´ olya process. 2 We shall only encounter a few instances of a Cox process, in connection with risk processes in a Markovian or periodic environment (Chapter VII), and here (1.6), (1.7) hold with ρ constant.
1. THE RISK PROCESS
5
et = Rt/p . Then the connection Proposition 1.3 Assume p 6= 1 and define R e between the ruin probabilities for the given risk process {Rt } and those ψ(u), © ª e e ψ(u, T ) for Rt is given by e ψ(u) = ψ(u),
e T p). ψ(u, T ) = ψ(u,
© ª et has premium rate 1, the role of the result is The proof is trivial. Since R © ª et to justify taking p = 1, which is feasible since in most cases the process R has a similar structure as {Rt } (for example, the claim arrivals are Poisson or renewal at the same time). Note that when p = 1, the assumption η > 0 is equivalent to ρ < 1; in a number of models, we shall be able to identify ρ with the traffic intensity of an associated queue, and in fact ρ < 1 is the fundamental assumption of queueing theory ensuring steady-state behavior (existence of a limiting stationary distribution). Notes and references The study of ruin probabilities, often referred to as collective risk theory or just risk theory, was largely initiated in Sweden in the first half of the century. Some of the main general ideas were laid down by Lundberg [614], while the first mathematically substantial results were given in Lundberg [615] and Cram´er [265]; another important early Swedish work is T¨ acklind [826]. The Swedish school was pioneering not only in risk theory, but also in probability and applied probability as a whole; in particular, many results and methods in random walk theory originate from there and the area was ahead of related ones like queueing theory. Some early surveys are given in Cram´er [265], Segerdahl [792] and Philipson [699]. Some main later textbooks are (in alphabetical order) B¨ uhlmann [208], Dickson [309], Daykin, Pentik¨ ainen & Pesonen [279], De Vylder [300], Gerber [398], Grandell [429], Rolski, Schmidli, Schmidt & Teugels [746] and Seal [784, 788]. Besides in standard journals in probability and applied probability, the research literature is often published in journals like Astin Bulletin, Insurance: Mathematics and Economics, the North American Actuarial Journal, the Scandinavian Actuarial Journal and Mitteilungen der Schweizerischen Aktuarvereinigung. Note that the latter has recently been merged with Bl¨ atter der Deutschen Gesellschaft f¨ ur Versicherungs- und Finanzmathematik and a number of further Actuarial Bulletins of European countries into The European Actuarial Journal. The term risk theory is often interpreted in a broader sense than as just to comprise the study of ruin probabilities. An idea of the additional topics and problems one may incorporate under risk theory can be obtained from the survey paper [665] by Norberg; see also Chapter XVI. In the even more general area of non-life insurance mathematics, some main texts (typically incorporating some ruin theory but emphasizing the topic to a varying degree) are Bowers et al. [195], B¨ uhlmann [208], Daykin et al. [279], Embrechts et al. [349], Heilmann [458], Hipp & Michel [468], Kaas et al. [515], Klugman, Panjer & Willmot [536], Mikosch [638], Schmidt [782], Straub [818], Sundt
6
CHAPTER I. INTRODUCTION
[820] and Taylor [840]. Note that life insurance (e.g. Gerber [402]) has a rather different flavor, and we do not get near to the topic anywhere in this book. Cox processes are treated extensively in Grandell [429]. For mixed Poisson processes and P´ olya processes, see e.g. the recent survey by Grandell [431] and references therein.
2
Claim size distributions
This section contains a brief survey of some of the most popular classes of distributions B which have been used to model the claims U1 , U2 , . . . We roughly classify these into two groups, light-tailed distributions (sometimes the term ‘Cram´er-type conditions’ is used), and heavy-tailed distributions. Here lighttailed means that the tail B(x) = 1 − B(x) satisfies B(x) = O(e−sx ) for some b is finite for some s > 0. In contrast, B is s > 0. Equivalently, the m.g.f. B[s] b heavy-tailed if B[s] = ∞ for all s > 0, but different more restrictive definitions are often used: subexponential, regularly varying (see below) or even regularly varying with infinite variance. On the more heuristical side, one could mention also the folklore in actuarial practice to consider B heavy-tailed if ‘20% of the claims account for more than 80% of the total claims’, i.e. if Z ∞ 1 x B(dx) ≥ 0.8, µB b0.2 where B(b0.2 ) = 0.2 and µB is the mean of B.
2a
Light-tailed distributions
Example 2.1 (the exponential distribution) Here the density is b(x) = δe−δx .
(2.1)
The parameter δ is referred to as the rate or the intensity, and can also be interpreted as the (constant) failure rate b(x)/B(x). As in a number of other applied probability areas, the exponential distribution is by far the simplest to deal with in risk theory as well. In particular, for the compound Poisson model with exponential claim sizes the ruin probability ψ(u) can be found in closed form. The crucial feature is the lack of memory: if U is exponential with rate δ, then the conditional distribution of U − x given U > x is again exponential with rate δ (this is essentially equivalent to the failure rate being constant). For example in the compound Poisson model, a simple stopping time argument shows that this implies that the conditional distribution
2. CLAIM SIZE DISTRIBUTIONS
7
of the overshoot Sτ (u) − u at the time of ruin given τ (u) is again exponential with rate δ, a fact which turns out to contain considerable information. 2 Example 2.2 (the gamma distribution) The gamma distribution with parameters p, δ has density δ p p−1 −δx x e Γ(p)
b(x) = and m.g.f.
µ b = B[s]
δ δ−s
(2.2)
¶p ,
s < δ.
The mean EU is p/δ and the variance Var U is p/δ 2 . In particular, the squared coefficient of variation (s.c.v.) Var U 1 = (EU )2 p is < 1 for p > 1, > 1 for p < 1 and = 1 for p = 1 (the exponential case). The exact form of the tail B(x) is given by the incomplete Gamma function Γ(x; p), Z ∞ Γ(δx; p) B(x) = where Γ(x; p) = tp−1 e−t dt. Γ(p) x Asymptotically, one has B(x) ∼
δ p−1 p−1 −δx x e . Γ(p)
In the sense of the theory of infinitely divisible distributions, the Gamma density (2.2) can be considered as the pth power of the exponential density (2.1) (or the 1/pth root if p < 1). In particular, if p is integer and U has the D gamma distribution p, δ, then U = X1 + · · · + Xp where X1 , X2 , . . . are i.i.d. and exponential with rate δ. This special case is referred to as the Erlang distribution with p stages, or just the Erlang(p) distribution. An appealing feature is its simple connection to the Poisson process: B(x) = P(U1 + · · · + Up > x) is the probability of at most p − 1 Poisson events in [0, x] so that B(x) =
p−1 X i=0
e−δx
(δx)i . i!
In the present text, we develop computationally tractable results mainly for the Erlang case (i.e. p ∈ N). Ruin probabilities for the general case have been 2 studied, among others, by Grandell & Segerdahl [433] and Thorin [847].
8
CHAPTER I. INTRODUCTION
Example 2.3 (the hyperexponential distribution) This is defined as a finite mixture of exponential distributions, b(x) =
p X
αi δi e−δi x
(2.3)
i=1
Pp where 1 αi = 1, 0 ≤ αi ≤ 1, i = 1, . . . , p. An important property of the hyperexponential distribution is that its s.c.v. is > 1. If αi ∈ R, then one speaks of the distribution as a combination of exponentials and this class is dense in the set of all distributions on the positive halfline. 2 Example 2.4 (phase-type distributions) A phase-type distribution is the distribution of the absorption time in a Markov process with finitely many states, of which one is absorbing and the rest transient. Important special cases are the exponential, the Erlang and the hyperexponential distributions. This class of distributions plays a major role in this book as one within computationally tractable exact forms of the ruin probability ψ(u) can be obtained. The parameters of a phase-type distribution are the set E of transient states, the restriction T of the intensity matrix of the Markov process to E and the row vector α = (αi )i∈E of initial probabilities. The density and c.d.f. are b(x) = αeT x t, resp. B(x) = αeT x e,
x ≥ 0,
where t = T e and e = (1 . . . 1)T is the column vector with 1 at all entries. The couple (α, T ) or sometimes the triple (E, α, T ) is called the representation. We give a more comprehensive treatment in IX.1 and defer further details to Chapter IX. 2 Example 2.5 (distributions with rational transforms) A distribution b = B has a rational m.g.f. (or, equivalently, a rational Laplace transform) if B[r] p(r)/q(r) with p(r) and q(r) being polynomials of finite degree. An equivalent characterization is that the density b(x) is the solution of a homogeneous ordinary differential equation with constant coefficients b(q) (x) + dq−1 b(q−1) (x) + · · · + d0 = 0;
dj ∈ R, d0 6= 0, R∞ where one of the initial conditions is determined by 0 b(x) dx = 1. Consequently the density b(x) has one of the forms b(x) = b(x) =
q X j=0 q1 X j=0
cj xj eηj x , cj xj eηj x +
(2.4) q2 X j=0
dj xj cos(aj x)eδj x +
q3 X j=0
ej xj sin(bj x)e²j x , (2.5)
2. CLAIM SIZE DISTRIBUTIONS
9
where the parameters in (2.4) are possibly complex-valued but the parameters in (2.5) are real-valued. This class of distributions is popular in the literature on both risk theory and queues, but often the attention is restricted to the class of phase-type distributions, which is slightly smaller but more amenable to probabilistic reasoning. We give some theory for matrix-exponential distributions in IX.6. 2 Example 2.6 (distributions with bounded support) This example (i.e. there exists a x0 < ∞ such that B(x) = 0 for x ≥ x0 , B(x) > 0 for x < x0 ) is of course a trivial instance of a light-tailed distribution. However, it is notable from a practical point of view because of reinsurance: if excess-of-loss reinsurance has been arranged with retention level x0 , then the claim size which is relevant from the point of view of the insurance company itself is U ∧ x0 rather than U (the excess (U − x0 )+ is covered by the reinsurer). See XVI.6. 2
2b
Heavy-tailed distributions
Example 2.7 (the Weibull distribution) This distribution originates from reliability theory. Here failure rates δ(x) = b(x)/B(x) play an important role, the exponential distribution representing the simplest example since here δ(x) is constant. However, in practice one may observe that δ(x) is either decreasing or increasing and may try to model smooth (increasing or decreasing) deviations from constancy by δ(x) = dxr−1 (0 < r < ∞). Writing c = d/r, we obtain the Weibull distribution r
B(x) = e−cx ,
r
b(x) = crxr−1 e−cx ,
(2.6)
which is heavy-tailed when 0 < r < 1. All moments are finite. Another interpretation is that it is the distribution of X 1/r , where X is exponential with parameter c. 2 Example 2.8 (the lognormal distribution) The lognormal distribution with parameters σ 2 , µ is defined as the distribution of eV where V ∼ N (µ, σ 2 ), or equivalently as the distribution of eσW +µ where W ∼ N (0, 1). It follows that the density is d ³ log x − µ ´ 1 ³ log x − µ ´ b(x) = Φ = ϕ dx σ σx σ n ³ 1 1 log x − µ ´2 o √ exp − = . (2.7) 2 σ xσ 2π Asymptotically, the tail is B(x) ∼
n 1 ³ log x − µ ´2 o σ √ exp − , 2 σ log x 2π
(2.8)
10
CHAPTER I. INTRODUCTION
which is heavier than the one of the Weibull distribution. The lognormal dis2 tribution has moments of all orders. In particular, the mean is eµ+σ /2 and the 2 2 second moment is e2µ+2σ . Example 2.9 (the Pareto distribution) Here the essence is that the tail B(x) decreases like a power of x. There are various variants of the definition around, the simplest one being B(x) = x−α ,
x ≥ 1,
(2.9)
which can be interpreted as the distribution of eX for an exponential r.v. X with parameter α. Another variant is often referred to as US-Pareto and defined by aα αaα B(x) = , b(x) = , x ≥ 0, (2.10) α (a + x) (a + x)α+1 for some a > 0. The pth moment is finite if and only if p < α − 1. The Laplace-Stieltjes transform of the Pareto distribution defined in (2.9) can be expressed through the incomplete Gamma function by Z ∞ α b B[−s] = e−sx α+1 dx = α sα Γ(−α, s). x 1 b Similarly, the Laplace-Stieltjes transform of the US Pareto distribution is B[−s] = α as α (as) e Γ(−α, as). These relatively simple expressions have not always been noted. Abate, Choudhury & Whitt [1] introduced a somewhat related class of random variables called Pareto mixture of exponentials, which are products of Pareto and exponential r.v.’s and lead to quite explicit Laplace-Stieltjes transforms. 2 Example 2.10 (the loggamma distribution) The loggamma distribution with parameters p, δ is defined as the distribution of eV where V has the gamma density (2.2). The density is b(x) =
δ p (log x)p−1 . xδ+1 Γ(p)
(2.11)
The pth moment is finite if p < δ and infinite if p > δ. For p = 1, the loggamma 2 distribution is a Pareto distribution. Example 2.11 (distributions with regularly varying tails) The tail B(x) of a distribution B is said to be regularly varying with index α if B(x) ∼
L(x) , xα
x → ∞,
(2.12)
3. THE ARRIVAL PROCESS
11
where L(x) is slowly varying, i.e. satisfies L(xt)/L(x) → 1 as x → ∞ (any L having a limit in (0, ∞) is slowly varying; another standard example is (log x)η ). Thus, examples of distributions with regularly varying tails are the Pareto distribution (2.10) (here L(x) → 1), the loggamma distribution (with index δ) and a Pareto mixture of exponentials. 2 Example 2.12 (the subexponential class of distributions) We say that a distribution B is subexponential if B ∗2 (x) = 2. x→∞ B(x) lim
(2.13)
It can be proved (see X.1) that any distribution with a regularly varying tail is subexponential. Also, for example the lognormal distribution is subexponential (but not regularly varying), though the proof of this is non-trivial, and so is the Weibull distribution with 0 < r < 1. Thus, the subexponential class of distributions provide a convenient framework for studying large classes of heavy2 tailed distributions. We return to a closer study in X.1. When studying ruin probabilities, it will be seen that we obtain completely different results depending on whether the claim size distribution is exponentially bounded or heavy-tailed. From a practical point of view, this phenomenon represents one of the true controversies of the area. Namely, the knowledge of the claim size distribution will typically be based upon statistical data, and based upon such information it seems questionable to extrapolate to tail behavior. However, one may argue that this difficulty is not restricted to ruin probability theory alone. Similar discussion applies to the distribution of the accumulated claims (XVI.2) or even to completely different applied probability areas like extreme value theory: if we are using a Gaussian process to predict extreme value behavior, we may know that such a process (with a covariance function estimated from data) is a reasonable description of the behavior of the system under study in typical conditions, but can never be sure whether this is also so for atypical levels for which far less detailed statistical information is available. We give some discussion on standard methods to distinguish between light and heavy tails in Chapter X.
3
The arrival process
For the purpose of modeling a risk process, the claim size distribution represents of course only one aspect (though a major one). At least as important is the
12
CHAPTER I. INTRODUCTION
specification of the structure of the point process {Nt } of claim arrivals and its possible dependence with the claims. By far the most prominent case is the compound Poisson (Cram´er-Lundberg) model where {Nt } is Poisson and independent of the claim sizes U1 , U2 , . . . The reason is in part mathematical since this model is the easiest to analyze, but the model also admits a natural interpretation: a large portfolio of insurance holders, which each have a (time-homogeneous) small rate of experiencing a claim, gives rise to an arrival process which is very close to a Poisson process, in just the same way as the Poisson process arises in telephone traffic (a large number of subscribers each calling with a small rate), radioactive decay (a huge number of atoms each splitting with a tiny rate) and many other applications. The compound Poisson model is studied in detail in Chapters IV, V (and, with the extension to premiums depending on the reserve, in Chapter VIII). To the authors’ knowledge, not so many detailed studies of the goodness-of-fit of the Poisson model in insurance are available. Some of them have concentrated on the marginal distribution of NT (say T = one year), found the Poisson distribution to be inadequate and suggested various other univariate distributions as alternatives, e.g. the negative binomial distribution. The difficulty in such an approach lies in that it may be difficult or even impossible to imbed such a distribution into the continuous set-up of {Nt } evolving over time, and also that the ruin problem may be hard to analyze. Nevertheless, getting away from the simple Poisson process seems a crucial step in making the model more realistic, in particular to allow for certain inhomogeneities. Historically, the first extension to be studied in detail was {Nt } to be renewal (the interarrival times T1 , T2 , . . . are i.i.d. but with a general not necessarily exponential distribution). This model, to be studied in Chapter VI, has some mathematically appealing random walk features, which facilitate the analysis. However, it is more questionable whether it provides a model with a similar intuitive content as the Poisson model. One could possibly argue that renewal models are a compromise between choosing a tractable model and taking into account statistical information that may indicate that exponential interarrival time distributions do not calibrate given data well enough. Of course, one is then still left to believe in the independence assumption and – with the introduced memory between claims – one has to be aware that the resulting model is for most applications to be seen as an interpolation rather than a causal model. A more appealing way to allow for inhomogeneity is by means of an intensity β(t) fluctuating over time. An obvious example is β(t) depending on the time of the year (the season), so that β(t) is a periodic function of t; we study this case in VII.6. Another one is Cox processes, where {β(t)}t≥0 is an arbitrary stochastic process. In order to prove reasonably substantial and interesting results, Cox processes are, however, too general and one needs to specialize to
4. A SUMMARY OF MAIN RESULTS AND METHODS
13
more concrete assumptions. The one we focus on (Chapter VII) is a Markovian environment: the environmental conditions are described by a finite Markov process {Jt }t≥0 , such that β(t) = βi when Jt = i. I.e. with a common term {Nt } is a Markov-modulated Poisson process; its basic feature is to allow more variation (bursty arrivals) than inherent in the simple Poisson process. This model can be intuitively understood in some simple cases like {Jt } describing weather conditions in car insurance, epidemics in life insurance etc. In others, it may be used in a purely descriptive way when it is empirically observed that the claim arrivals are more bursty than allowed for by the simple Poisson process. Mathematically, the periodic and the Markov-modulated models also have attractive features. The point of view we take here is Markov-dependent random walks in continuous time (Markov additive processes), see III.4. This applies also to the case where the claim size distribution depends on the time of the year or the environment (VII.6), and which seems well motivated from a practical point of view as well.
4
A summary of main results and methods
4a
Duality with other applied probability models
Risk theory may be viewed as one of many applied probability areas, others being branching processes, genetics models, queueing theory, dam/storage processes, reliability, interacting particle systems, stochastic differential equations, time series and Gaussian processes, extreme value theory, stochastic geometry, point processes and so on. Some of these have a certain resemblance in flavor and methodology, others are quite different. The ones which appear most related to risk theory are queueing theory and dam/storage processes. In fact, it is a recurrent theme of this book to stress this connection which was often neglected in the early specialized literature on risk theory. Mathematically, the classical result is that the ruin probabilities for the compound Poisson model are related to the workload (virtual waiting time) process {Vt }t≥0 of an initially empty M/G/1 queue by means of ψ(u, T ) = P(VT > u),
ψ(u) = P(V > u),
(4.1)
where V is the limit in distribution of Vt as t → ∞. The M/G/1 workload process {Vt } may also be seen as one of the simplest storage models, with Poisson arrivals and constant release rule p(x) ≡ 1. A general release rule p(x) means that {Vt } decreases according to the differential equation V˙ = −p(V ) in between jumps, and here (4.1) holds as well provided the risk process has a premium rule depending on the reserve, R˙ = p(R) in between jumps. Similarly, ruin
14
CHAPTER I. INTRODUCTION
probabilities for risk processes with an input process which is renewal, Markovmodulated or periodic can be related to queues with similar characteristics. Thus, it is desirable to have a set of formulas like (4.1) permitting to translate freely between risk theory and the queueing/storage setting. In Chapter VIII we will also see a direct and natural link between the maximum workload of an M/G/1 queue and the ruin probability in a compound Poisson risk model in terms of excursions. In general, methods or modeling ideas developed in one area often have relevance for the other one as well. A stochastic process {Vt } is said to be in the steady state if it is strictly stationary (in the Markov case, this amounts to V0 having the stationary distribution of {Vt }), and the limit t → ∞ is the steady-state limit. The study of the steady state is by far the most dominant topic of queueing and storage theory, and a lot of information on steady-state r.v.’s like V is available. It should be noted, however, that quite often the emphasis is Ron computing expected values ∞ like EV . In the setting of (4.1), this gives only 0 ψ(u)du which is of limited intrinsic interest. Thus, the two areas, though overlapping, have to some extent a different flavor. A prototype of the duality results in this book is Theorem III.2.1, which gives a sample path version of (4.1) in the setting of a general premium rule p(x): the events {VT > u} and {τ (u) ≤ T } coincide when the risk process and the storage process are coupled in a suitable way (via time-reversion). The infinite horizon (steady state) case is covered by letting T → ∞. The fact that Theorem III.2.1 is a sample path relation should be stressed: in this way the approach also applies to models having supplementary r.v.’s like the environmental process {Jt } in a Markov-modulated setting.
4b
Exact solutions
Of course, the ideal is to be able to come up with closed form solutions for the ruin probabilities ψ(u), ψ(u, T ). The cases where this is possible are basically the following for the infinite horizon ruin probability ψ(u): • The compound Poisson model with constant premium rate p = 1 and exponential claim size distribution B, B(x) = e−δx . Here ψ(u) = ρe−γu where β is the arrival intensity, ρ = β/δ and γ = δ − β. • The compound Poisson model with constant premium rate p = 1 and B being phase-type with just a few phases. Here ψ(u) is given in terms of a matrix-exponential function (Corollary IX.3.1), which can be expanded into a sum of exponential terms by diagonalization (see, e.g., Example IX.3.2). The qualifier ‘with just a few phases’ refers to the fact that the diagonalization has to be carried out numerically in higher dimensions.
4. A SUMMARY OF MAIN RESULTS AND METHODS
15
• The compound Poisson model with a claim size distribution degenerate at one point, see Corollary IV.3.7. • The compound Poisson model with some rather special heavy-tailed claim size distributions, see Boxma & Cohen [193] and Abate & Whitt [3]. • The compound Poisson model with premium rate p(x) depending on the reserve and exponential claim size distribution B. Here ψ(u) is explicit provided that, as is typically the case, the functions Z ∞ Z x 1 βω(x)−δx 1 dy, e dx ω(x) = p(y) p(x) 0 0 can be written in closed form, see Corollary VIII.1.9. • The compound Poisson model with a piecewise constant premium rule p(x) and B being phase-type with just a few phases, see IX.7. • Renewal models with exponential claim sizes, see Theorem VI.2.2. • Renewal model variants of the above cases for which the interclaim time is phase-type with just a few phases. • Any L´evy model where the risk reserve process (not the claim surplus process!) is downward skipfree (Theorem XI.2.3). This includes Brownian motion. • Any L´evy model for which the scale function is explicitly available, see XI.3 (for an early example cf. Furrer [381]). A further notable fact (see again XVI.1) is the explicit form of the ruin probability when {Rt } is a diffusion with infinitesimal drift and variance µ(x), σ 2 (x): © Rx ª R∞ exp − 0 2µ(y)/σ 2 (y) dy dx S(u) u © ª R R ψ(u) = ∞ (4.2) = 1− x 2 (y) dy dx S(∞) exp − 2µ(y)/σ 0 0 where
Z
u
S(u) = 0
½ Z exp −
x
¾ 2
2µ(y)/σ (y) dy
dx
0
is the natural scale. The finite horizon ruin probability ψ(u, T ) is explicit for Brownian motion (III.1) and the compound Poisson model with exponential claim size distribution (V.1). Later in the book a number of further rather specific cases will be discussed for which explicit expressions exist.
16
4c
CHAPTER I. INTRODUCTION
Numerical methods
Next to a closed-form solution, the second best alternative is a numerical procedure which allows to calculate the exact values of the ruin probabilities. Here are some of the main approaches: Laplace transform inversion Often, it is easier to find the Laplace transforms Z ∞ Z ∞Z ∞ −su b b e e−su−ωT ψ(u, T ) du dT ψ[−s] = ψ(u) du , ψ[−s, −ω] = 0
0
0
in closed form rather than the ruin probabilities ψ(u), ψ(u, T ) themselves. In that case ψ(u), ψ(u, T ) can be calculated numerically by some method for transform inversion, say the fast Fourier transform (FFT) as implemented in Gr¨ ubel [438] for infinite horizon ruin probabilities for the renewal model. We do not discuss Laplace transform inversion much; other relevant references are Abate & Whitt [2], Embrechts, Gr¨ ubel & Pitts [346] and Gr¨ ubel & Hermesmeier [439]; see also Albrecher, Avram & Kortschak [14] and the Bibliographical Notes in [746, p. 191]. Matrix-analytic methods This approach is relevant when the claim size distribution is of phase-type (or matrix-exponential), and in quite a few cases (Chapter IX), ψ(u) is then given in terms of a matrix-exponential function eU u (here U is some suitable matrix) which can be computed by diagonalization, as the solution of linear differential equations or by some P∞ series expansion (not necessarily the straightforward 0 U n u/n! one!). In the compound Poisson model with p = 1, U is explicit in terms of the model parameters, whereas for the renewal arrival model and the Markovian environment model U has to be calculated numerically, either as the iterative solution of a fixed point problem or by finding the diagonal form in terms of the complex roots to certain transcendental equations. Differential- and integral equations The idea here is to express ψ(u) or ψ(u, T ) as the solution to a differential- or integral equation, and carry out the solution by some standard numerical method. One example where this is feasible is the renewal equation for ψ(u) (Corollary IV.3.3) in the compound Poisson model which is an integral equation of Volterra type. The method is, however, restricted to models that have a certain degree of Markovian structure in which case conditioning (or applying the more formal tool of generators, see II.4a) leads to equations that often involve both differential and integral terms. We will discuss cases where this approach can even lead to explicit solutions (see e.g. IX.7 and XII.3c). In
4. A SUMMARY OF MAIN RESULTS AND METHODS
17
many more cases, numerical solution methods are applicable, although the initial or boundary conditions can be a challenge. If an integral equation is available, it is often possible to define a contractive integral operator and to identify the ruin probability as its fixed point, in which case the ruin probability can be approximated by iterated application of the integral operator to some starting function. The resulting high-dimensional integral can then be calculated by standard Monte Carlo and Quasi-Monte Carlo techniques (see e.g. Albrecher et al. [31, 24]). In comparison to the alternative of direct simulation of the risk process (as discussed in Section 4g), this technique often has significant computational advantages over the latter.
4d
Approximations
The Cram´ er-Lundberg approximation This is one of the most celebrated results of risk theory (and probability theory as a whole). For the compound Poisson model with p = 1 and claim size distribution B with mob it states that ment generating function (m.g.f.) B[s], ψ(u) ∼ Ce−γu ,
u → ∞,
(4.3)
b 0 [γ] − 1) and γ > 0 is the solution of the Lundberg where C = (1 − ρ)/(β B equation ¡ ¢ b − 1 − γ = 0, β B[γ] (4.4) which can equivalently be written as γ b B[γ] = 1+ . β
(4.5)
It is rather standard to call γ the adjustment coefficient but a variety of other terms are also frequently encountered (and often the notation R instead of γ is used in the literature). The Cram´er-Lundberg approximation is renowned not only for its mathematical beauty but also for being very precise, often for all u ≥ 0 and not just for large u. It has generalizations to other L´evy models, to the models with renewal arrivals, a Markovian environment or periodically varying parameters. However, in such cases the evaluation of C is more cumbersome. In fact, when the claim size distribution is of phase-type, the exact solution is as easy to compute as the Cram´er-Lundberg approximation in some of these models. The shape of the l.h.s. of equation (4.4) and its extensions to other models lie at the heart of ruin theory. Its level sets (not only the one at 0) reveal a
18
CHAPTER I. INTRODUCTION lot of (in particular asymptotic) properties of ruin-related quantities and will play an important role in this book.
Diffusion approximations Here the idea is simply to approximate the risk process by a Brownian motion (or a more general diffusion) by fitting the first and second moments, and to use the fact that first passage probabilities are more readily calculated for diffusions than for the risk process itself. Diffusion approximations are easy to calculate, but typically not very precise in their first naive implementation. However, incorporating correction terms may change the picture dramatically. In particular, corrected diffusion approximations (see V.6) are by far the best one can do in terms of finite horizon ruin probabilities ψ(u, T ). Large claims approximations In order for the Cram´er-Lundberg approximation to be valid, the claim size distribution should have an exponentially decreasing tail B(x). In the case of heavy-tailed distributions, other approaches are thus required. Approximations for ψ(u) as well as for ψ(u, T ) for large u are available in most of the models we discuss. For example, for the compound Poisson model under certain assumptions on B Z ∞ ρ B(x) dx, u → ∞. (4.6) ψ(u) ∼ µB (1 − ρ) u In fact, in some cases the results are even more complete than for light tails. See Chapter X. This list of approximations does by no means exhaust the topic; some further possibilities are surveyed in IV.7 and V.2.
4e
Bounds and inequalities
The outstanding result in the area is Lundberg’s inequality ψ(u) ≤ e−γu .
(4.7)
Compared to the Cram´er-Lundberg approximation (4.3), it has the advantage of not involving approximations and also, as a general rule, of being somewhat easier to generalize beyond the compound Poisson setting. We return to various extensions and sharpenings of Lundberg’s inequality (finite horizon versions, lower bounds etc.) at various places and in various settings. When comparing different risk models, it is a general principle that adding random variation to a model increases the risk. For example, one expects a model with a deterministic claim size distribution B, say degenerate at m, to
4. A SUMMARY OF MAIN RESULTS AND METHODS
19
have smaller ruin probabilities than when B is non-degenerate with the same mean m. This is proved for the compound Poisson model in IV.8 (see also further ordering results for dependent risks in Section XIII.8). Empirical evidence shows that the general principle holds in a broad variety of settings, though precise mathematical results are not always available.
4f
Statistical methods
Any of the approaches and results above assume that the parameters of the model are completely known. In practice, they have however to be estimated from data, obtained say by observing the risk process in [0, T ]. This procedure in itself is fairly straightforward; e.g., in the compound Poisson model, it splits up into the estimation of the Poisson intensity (the estimator is βb = NT /T ) and of the parameter(s) of the claim size distribution, which is a standard statistical problem since the claim sizes U1 , . . . , UNT are i.i.d. given NT . However, the difficulty comes in when drawing inference about the ruin probabilities. How do we produce a confidence interval? And, more importantly, can we trust the confidence intervals for the large values of u which are of interest? In the present authors’ opinion, this is extrapolation from data due to the extreme sensitivity of the ruin probabilities to the tail of the claim size distribution in particular (in contrast, fitting a parametric model to U1 , . . . , UNT may be viewed as an interpolation or smoothing of the histogram). For example, one may question whether it is possible to distinguish between claim size distributions which are heavy-tailed and those that have an exponentially decaying tail. This issue will be further discussed in Section X.6.
4g
Simulation
The development of modern computers has made simulation a popular experimental tool in all branches of applied probability and statistics, and of course the method is relevant in risk theory as well. Simulation may be used just to get some vague insight in the process under study: simulate one or several sample paths, and look at them to see whether they exhibit the expected behavior or some surprises come up. However, the more typical situation is to perform a Monte Carlo experiment to estimate probabilities (or expectations or distributions) which are not analytically available. For example, this is a straightforward way to estimate finite horizon ruin probabilities. The infinite horizon case presents a difficulty, because it appears to require an infinitely long simulation. Truncation to a finite horizon (or above a certain surplus level) has been used, but is not very satisfying. Still, good methods exist in a number of models and are based upon representing the ruin probability ψ(u)
20
CHAPTER I. INTRODUCTION
as the expected value of a r.v. (or a functional of the expectation of a set of r.v’s) which can be generated by simulation. The problem is entirely analogous to estimating steady-state characteristics by simulation in queueing/storage theory, and in fact methods from that area can often be used in risk theory as well. We look at a variety of such methods in Chapter XV, and also discuss how to develop methods which are efficient in terms of producing a small variance for a fixed simulation budget. A main problem is that ruin is typically a rare event (i.e. having small probability) and that therefore it is expensive or even infeasible in terms of computer time to obtain reasonably precise estimates of the ruin probability through naive simulation. Variance reduction techniques to improve the situation are discussed in Chapter XV.
Chapter II
Martingales and simple ruin calculations 1
Wald martingales
A random walk in discrete time is defined as Rn = R0 + Y1 + · · · + Yn where the Yi are i.i.d., with common distribution F (say). Here F is a general probability distribution on R (the special case of F being concentrated on {−1, 1} is often referred to as simple random walk or Bernoulli random walk). Most often in the probability literature, R0 = 0, but since we are here thinking of the random walk as a model for the risk reserve, we often allow R0 = u > 0. Denote by Fb[α] = EeαY1 the m.g.f. (moment generating function) of F and let κ(α) = log Fb[α] be the c.g.f. (cumulant generating function). Theorem 1.1 Let Rn = R0 + Y1 + · · · + Yn be a random walk. Then for any α such that Fb[α] < ∞, the sequence eα(Y1 +···+Yn ) = eα(Y1 +···+Yn )−nκ(α) n b F [α]
(1.1)
is a martingale. Proof. Denote by Mn the expression (1.1). Then ¯ £ ¤ E Mn+1 ¯ Y1 , . . . , Yn = =
¤ eα(Y1 +···+Yn ) £ αYn+1 b ¯¯ E e /F [α] Y1 , . . . , Yn Fb[α]n Mn EeαYn+1 /Fb[α] = Mn . 21
2
22 CHAPTER II. MARTINGALES AND SIMPLE RUIN CALCULATIONS The martingale in Theorem 1.1 is denoted the Wald martingale. The main application is optional stopping, i.e. exploiting the identity Eeα(Y1 +···+Yτ )−τ κ(α) = 1
(1.2)
where τ < ∞ is a finite stopping time. A sufficient condition for (1.2) is that E sup eα(Y1 +···+Yn )−nκ(α) < ∞ . n≤τ
For a necessary and sufficient condition, see III.1.4. The Wald martingale generalizes to a L´evy process {Xt }, defined as a continuous time process with stationary and independent increments. The traditional formal definition is that {Xt } is R-valued with the increments Xt1 − Xt0 , Xt2 − Xt1 , . . . , Xtn − Xtn−1 being independent whenever t0 < t1 < . . . < tn and with Xti − Xti−1 having distribution depending only on ti − ti−1 . An equivalent characterization is {Xt } being Markov with state space R and ¯ ¤ £ E f (Xt+s − Xt ) ¯ Ft = E0 f (Xs ) , (1.3) where Ex refers to the case X0 = x. Note that the structure of such a process admits a complete description: {Xt } can be written as the independent sum of a pure drift {µt}, a Brownian component {Bt } (scaled by a variance constant σ) and a pure jump process {Mt }, Xt = X0 + µt + σBt + Mt .
(1.4)
More precisely, the pure jump process is given by its L´evy measure ν(dx), a positive measure on R with the properties Z ² Z x2 ν(dx) < ∞, ν(dx) < ∞ (1.5) −²
{x:|x|>²}
for some (and then all) ² > 0.R Roughly, the interpretation is that the rate of ² a jump of size x is ν(dx) (if −² |x|ν(dx) = ∞, this description needs some amendments). The simplest case is β = kνk < ∞, which corresponds to the compound Poisson case: here jumps of {Mt } occur at rate β and have distribution B = ν/β (in particular, the claim surplus process for the compound Poisson risk model, with premium rate p, corresponds to a L´evy process with µ = −p, σ 2 = 0 and ν = βB). A general jump process can be thought of as limit of compound Poisson processes with drift by considering a sequence ν (n)
2. GAMBLER’S RUIN. TWO-SIDED RUIN. BROWNIAN MOTION
23
of bounded measures with ν (n) ↑ ν. These issues are discussed in more detail in XI.1. For the moment, it suffices to have Brownian motion (possibly with a non-zero drift µ and a general variance constant σ 2 ) in mind as a second main example besides the compound Poisson model. We have: Theorem 1.2 Let {Xt } be a L´evy process and α ∈ R. Then EeαXt is either finite for all t > 0 or infinite for all t > 0. In the first case, EeαXt = etκ(α) for some κ(α) ∈ R, and the process eαXt −tκ(α)
(1.6)
is a martingale. Proof. The first part is easily seen to hold with κ(α) = log Eeα(X1 −X0 ) . For the second, denote by Mt the expression (1.6) and let {Ft } be the natural filtration of {Xt }. Then ¯ ¤ £ E[Mt+s | Ft ] = Mt E eα(Xt+s −Xt )−sκ(α) ¯ Ft = Mt Eeα(Xt+s −Xt )−sκ(α) = Mt . 2 A sufficient condition for optional stopping, i.e. EMτ = 1, is E supt≤τ Mt < ∞. For a necessary and sufficient condition, see again III.1.4. For Brownian motion with drift µ and variance constant σ 2 , X1 is N (µ, σ 2 ). 2 2 Therefore EeαX1 = eαµ+α σ /2 , so that κ(α) = αµ + α2 σ 2 /2 .
(1.7)
For the Cram´er-Lundberg process Rt with premium rate p, Poisson parameter β and claim size distribution B, it is shown in IV.1 that ¡ ¢ b (1.8) κ(α) = β B[−α] − 1 + αp . For the claim surplus process St = u − Rt , ¡ ¢ b − 1 − αp . κ(α) = β B[α]
2
(1.9)
Gambler’s ruin. Two-sided ruin. Brownian motion
The first solution of a ruin problem appears to be that of de Moivre (1711) for the gambler’s ruin problem, which is a two-sided ruin problem. That is,
24 CHAPTER II. MARTINGALES AND SIMPLE RUIN CALCULATIONS starting from u ∈ [0, a] we define the two-barrier ruin probability ψa (u) as the probability of being ruined before the reserve reaches level a. I.e. ¡ ¢ ¡ ¢ ψa (u) = P τ (u, a) = τ (u) = 1 − P τ (u, a) = τ+ (a) , where1 τ (u) = inf {t ≥ 0 : Rt ≤ 0} ,
τ+ (a) = inf {t ≥ 0 : Rt ≥ a} ,
τ (u, a) = τ (u) ∧ τ+ (a) = inf {t ≥ 0 : Rt ≤ 0 or Rt ≥ a} . Note that P(τ (u, a) < ∞) = 1, because the interval [0, a] is finite. Besides its intrinsic interest, ψa (u) can also be a useful vehicle for computing ψ(u) by letting a → ∞. De Moivre considered a Bernoulli random walk, defined as R0 = u with u ∈ {0, 1, . . . , a}, Rn = u+Y1 +· · ·+Yn where Y1 , Y2 , . . . are i.i.d. and {−1, 1}-valued with P(Yk = 1) = θ. His result was: Proposition 2.1 For a Bernoulli random walk with θ 6= 1/2, ³ 1 − θ ´a
³ 1 − θ ´u − θ θ , ³ 1 − θ ´a −1 θ
ψa (u) =
If θ = 1/2, then ψa (u) =
a = u, u + 1, . . . .
(2.1)
a−u . a
We give two proofs, one elementary but difficult to generalize to other models, and the other more advanced but applicable also in some other settings. Proof 1. Conditioning upon Y1 yields immediately the recursion ψa (1) ψa (2)
= 1 − θ + θψa (2), = (1 − θ)ψa (1) + θψa (3), .. . ψa (a − 2) = (1 − θ)ψa (a − 3) + θψa (a − 1), ψa (a − 1) = (1 − θ)ψa (a − 2), 1 Note that the definition of τ (u) differs from the rest of the book where we use τ (u) = inf {t ≥ 0 : Rt < 0} (sharp inequality); in most cases, either this makes no difference (P(Rτ (u) = 0) = 0) or it is trivial to translate from one set-up to the other, as e.g. in the Bernoulli random walk example below.
2. GAMBLER’S RUIN. TWO-SIDED RUIN. BROWNIAN MOTION
25
and insertion shows that (2.1) is the solution satisfying the obvious boundary conditions ψa (0) = 1, ψa (a) = 0.2 2 The second proof uses martingales. We remark here as a matter of terminology that whereas our general definition of the Lundberg coefficient γ in Chapter I is as the non-zero solution of log eγS1 = 0 where St = R0 − Rt is the claim surplus, we work here directly with the reserve process Rt , so that for our Bernoulli random walk the Lundberg coefficient is the non-zero solution of log e−γ(R1 −R0 ) = 0, i.e. Fb[−γ] = 1 where Fb[s] = θes +(1−θ)e−s . In view of the discrete nature of a Bernoulli random walk, we write z = e−γ . The Lundberg equation is then 1 1 = Fb[−γ] = θz + (1 − θ) z with solution z = (1 − θ)/θ. Similar remarks apply when computing the Lundberg coefficient for Brownian motion below. © ª © ª Proof 2. Wald’s exponential martingale with α = −γ is just e−γRt = z Rn . By optional stopping, zu
= = =
Ez R0 = Ez Rτ (u,a) ¡ ¢ ¡ ¢ z 0 P Rτ (u,a) = 0 + z a P Rτ (u,a) = a ¡ ¢ z 0 ψa (u) + z a 1 − ψa (u) ,
(2.2)
and solving for ψa (u) yields ψa (u) = (z a − z u )/(z a − 1). If θ = 1/2, (2.2) is trivial (z = 1). However, {Rn } is then itself a martingale and we get in a similar manner u = ER0 = ERτu,a = 0 · ψa (u) + a(1 − ψa (u)),
ψa (u) =
a−u . a
2 We note that if θ ≤ 1/2, then a Bernoulli random walk hits 0 w.p. 1 so ψ(u) = 1 for u ≥ 0. In contrast: Corollary 2.2 For a Bernoulli random walk with θ > 1/2, µ ¶u 1−θ ψ(u) = . θ
(2.3)
If θ ≤ 1/2, then ψ(u) = 1. 2 Alternatively, a constructive solution of the difference equation ψ (x) = (1 − θ)ψ (x − a a 1) + θψa (x + 1) is to substitute rx , leading to the two choices r = 1 and r = (1 − θ)/θ and the result then follows from their linear combination determined by the boundary conditions.
26 CHAPTER II. MARTINGALES AND SIMPLE RUIN CALCULATIONS Proof. Let a → ∞ in (2.1).
2
Now let us turn to Brownian motion. Proposition 2.3 Let {Rt } be Brownian motion starting from u ≥ 0 and with drift µ and variance constant σ 2 . Then for µ 6= 0, 2
2
e−2µa/σ − e−2µu/σ ψa (u) = . e−2µa/σ2 − 1 If µ = 0, then ψa (u) =
(2.4)
a−u . a
Proof. By (1.7), the Lundberg equation κ(−γ) = 0 is γ 2 σ 2 /2 − γµ = 0 with solutionª γ = 2µ/σ 2 . Applying optional stopping to the exponential martingale © e−γRt yields e−γu = Ee−γR0 = Ee−γRτ (u,a) = e0 ψa (u) + e−γa (1 − ψa (u)), and solving for ψa (u) yields ψa (u) = (e−γa − e−γu )/(e−γa − 1) for µ 6= 0. If µ = 0, {Rt } is itself a martingale and just the same calculation as in the proof of Proposition 2.1 yields ψa (u) = (a − u)/a. 2 Corollary 2.4 For Brownian motion starting in u ≥ 0 with drift µ > 0 and variance constant σ 2 , 2 ψ(u) = e−2µu/σ . (2.5) If µ ≤ 0, then ψ(u) = 1. Proof. Let a → ∞ in (2.4).
2
The reason that the calculations work out so smoothly for Bernoulli random walks and Brownian motion is the skip-free nature of the paths, implying Rτ (u,a) = a on {τ (u, a) = τ+ (a)} and similarly for the boundary 0. For most standard risk processes, the paths are upwards skip-free but not downwards, and thus one encounters the problem of controlling the undershoot under level 0. Here is one more case where this is feasible: Example 2.5 Consider a compound Poisson model with exponential claims (with rate, say, δ). That is, Rt = u + t −
Nt X i=1
Ui
2. GAMBLER’S RUIN. TWO-SIDED RUIN. BROWNIAN MOTION
27
where N is a Poisson(β) process and P(Ui > x) = e−δx . Now consider Rτ (u) , assume Rτ (u)− = x > 0, and let Z = −Rτ (u) + x be the size of the claim leading to ruin. The available information on Z is that its distribution is that of a claim size U given U > x, and thus by the memoryless property of the exponential distribution, the conditional distribution of Z is again just exponential with rate δ. Hence e−γu
= Ee−γR0 ¯ £ ¤ = E e−γRτ (u,a) ¯ Rτ (u,a) ≤ 0 P(Rτ (u,a) ≤ 0) + e−γa P(Rτ (u,a) = a) δ = P(Rτ (u,a) ≤ 0) + e−γa P(Rτ (u,a) = a) δ−γ ¡ ¢ δ = ψa (u) + e−γa 1 − ψa (u) . δ−γ
It follows from (1.8) that γ = δ − β, from which we obtain ψa (u) =
e−γu − e−γa . δ/β − e−γa
(2.6)
Again, letting a → ∞ yields the classical expression ρ e−γu for ψ(u) where ρ = β/δ (cf. I.4b), valid if ρ < 1 (otherwise, ψ(u) = 1). 2 However, passing to even more general cases the method quickly becomes unfeasible (see, however, IX.5a). It may then be easier to first compute the one-barrier ruin probability ψ(u): Proposition 2.6 If the paths of {Rt } are upward skip-free and ψ(a) < 1, ψa (u) =
ψ(u) − ψ(a) , 1 − ψ(a)
0 ≤ u ≤ a.
(2.7)
Proof. By the upward skip-free property, ¡ ¢ ψ(u) = ψa (u) + 1 − ψa (u) ψ(a). If ψ(a) < 1, this immediately yields (2.7).
2
We will meet this argument again in VIII.1a for computing ruin probabilities for a two-step premium function. Let us now return to Bernoulli random walk and Brownian motion and consider finite horizon ruin probabilities. For the symmetric (drift 0) case these are easily computable by means of the reflection principle:
28 CHAPTER II. MARTINGALES AND SIMPLE RUIN CALCULATIONS Proposition 2.7 For Brownian motion starting in u ≥ 0 with drift 0 and variance constant σ 2 , ³ −u ´ ψ(u, T ) = P(τ (u) ≤ T ) = 2Φ √ . σ T
(2.8)
Proof. In terms of the claim surplus process {St } = {u − Rt }, we have ψ(u, T ) = P(MT ≥ u) where MT = max0≤t≤T St . Here {St } is Brownian motion with drift 0 (starting from 0), in particular symmetric so that from time τ (u) (when the level is u) it is equally likely to go to levels < u and levels > u in time T − τ (u). Hence P(MT ≥ u, ST < u) = P(MT ≥ u, ST > u), and one gets P(MT ≥ u)
= = = =
P(ST ≥ u) + P(ST < u, MT ≥ u) P(ST ≥ u) + P(ST > u, MT ≥ u) P(ST ≥ u) + P(ST > u) 2P(ST > u) .
(2.9)
2 Small modifications also apply to Bernoulli random walks: Proposition 2.8 For the Bernoulli random walk with θ = 1/2, ψ(u, T ) = P(ST = u) + 2 P(ST > u),
(2.10)
whenever u, T are integer-valued and non-negative. Here
P(ST = v) =
³ 2−T
´ T , v = −T, −T + 2, . . . , T − 2, T, (v + T )/2 0,
otherwise.
Proof. The argument leading to (2.9) goes through unchanged, and (2.10) is the same as (2.9). The expression for P(ST = v) is just a standard formula for the binomial distribution. 2 Notes and references All material of the present section is standard. A classical reference for further aspects of Bernoulli random walks is Feller [361]. For generalizations of Proposition 2.6 to Markov-modulated models, see Asmussen & Perry [95]. Further early references on two-barrier ruin problems include Dickson & Gray [312, 313].
3. FURTHER SIMPLE MARTINGALE CALCULATIONS
3
29
Further simple martingale calculations
We consider the claim surplus process {St } of a general risk process. As usual, the time to ruin τ (u) is inf {t ≥ 0 : St > u}, and the ruin probabilities are ψ(u) = P(τ (u) < ∞),
ψ(u, T ) = P(τ (u) ≤ T ).
Our first result is a representation formula for ψ(u) obtained by using the martingale optional stopping theorem. Let ξ(u) = Sτ (u) − u denote the overshoot. © ª Proposition 3.1 Assume that (a) for some γ > 0, eγSt t≥0 is a martingale, a.s.
(b) St → −∞ on {τ (u) = ∞}. Then ψ(u) =
e−γu ¯ £ ¤, E eγξ(u) ¯ τ (u) < ∞
u ≥ 0.
Proof. We shall use optional stopping at time τ (u) ∧ T . 1
= =
3
(3.1)
We get
EeγS0 = EeγSτ (u)∧T ¤ £ ¤ £ E eγSτ (u) ; τ (u) ≤ T + E eγST ; τ (u) > T .
(3.2)
As T → ∞, the second term converges to 0 by (b) and dominated convergence (eγST ≤ eγu on {τ (u) > T }), and in the limit (3.2) takes the form ¤ £ 1 = E eγSτ (u) ; τ (u) < ∞ + 0 ¯ £ ¤ £ ¤ = eγu E eγξ(u) ; τ (u) < ∞ = eγu E eγξ(u) ¯ τ (u) < ∞ ψ(u). 2 Example 3.2 Consider the compound Poisson model with Poisson arrival rate β, claim size distribution B and ρ = βµB < 1. Thus St =
Nt X
Ui − t,
i=1
where {Nt } is a Poisson process with rate β and the Ui are i.i.d. with common distribution B (and independent of {Nt }). Condition (a) of Proposition 3.1 is satisfied, if a positive solution γ > 0 to the Lundberg equation (1.9) (i.e. an adjustment coefficient) exists. Property (b) follows from ρ < 1 and the law of large numbers (see Proposition IV.1.2(c)). 2 3 We cannot use the stopping time τ (u) directly because P(τ (u) = ∞) > 0 and also because the conditions of the optional stopping theorem present a problem; however, using τ (u) ∧ T invokes no problems because τ (u) ∧ T is bounded by T .
30 CHAPTER II. MARTINGALES AND SIMPLE RUIN CALCULATIONS Example 3.3 Assume that {Rt } is Brownian motion with variance constant σ 2 and drift µ > 0. Then {St } is Brownian motion with variance constant σ 2 and drift −µ < 0. Since the positive solution to the Lundberg equation (1.7) is γ = 2µ/σ 2 , the conditions of Proposition 3.1 are satisfied. 2 Corollary 3.4 (Lundberg’s inequality) Under the conditions of Proposition 3.1, ψ(u) ≤ e−γu for all u ≥ 0. Proof. Just note that ξ(u) ≥ 0 a.s.
2
We also retrieve again the exact expression of Section I.4b for exponential claims: Corollary 3.5 For the compound Poisson model with B exponential, B(x) = e−δx , and ρ = β/δ < 1, the ruin probability is ψ(u) = ρe−γu where γ = δ − β. Proof. As before, from (1.9) it is immediately seen that γ = δ − β. Now at the time τ (u) of ruin, {St } upcrosses level u by making a jump. By the memoryless property of the exponential distribution, the conditional distribution of the overshoot ξ(u) is again just exponential with rate δ. Thus Z ∞ Z ∞ ¯ £ ¤ δ 1 E eγξ(u) ¯ τ (u) < ∞ = eγx δe−δx dx = δe−βx dx = = . β ρ 0 0 2 If {Rt } is Brownian motion with variance constant σ 2 and drift µ > 0, 2 then ξ(u) = 0 by continuity of Brownian motion and ψ(u) = e−2µu/σ , which reconfirms Corollary 2.4. Notes and references The first use of martingales in risk theory is due to Gerber [397], and is further exploited in his book [398]. More recent references are Dassios & Embrechts [273], Grandell [429, 430], Embrechts, Grandell & Schmidli [345], Delbaen & Haezendonck [287] and Schmidli [770, 780].
4
More advanced martingales
4a
Generators. The Dynkin martingale
Assume that a stochastic process {Rt } is a Markov process and write Pu and Eu for the case R0 = u. In loose terms, the generator A is then an operator in an appropriate function space such that ¯ d ¯ Eu f (Rt )¯ = Af (u) dt t=0
4. MORE ADVANCED MARTINGALES
31
or equivalently lim h↓0
Eu f (Rh ) − f (u) = Af (u) h
(4.1)
for a sufficiently rich class of functions f . Historically, there have, however, been several different ways to make this loose definition precise, and in particular, one will find many definitions of the domain D(A ) on which A is defined. For example, some older definitions require (4.1) to hold uniformly or locally uniformly in u. The most standard current definition is in terms of martingales: f ∈ D(A) with Af = g (g can be shown to be unique up to some null set complications (cf. Davis [278, p. 32]) if and only if Z t
f (Rt ) −
g(Rs ) ds
(4.2)
0
is a local martingale4 , commonly referred to as the Dynkin martingale. The motivation relating to (4.1) is loosely the following. Denote by Mt the expression (4.2), assume it is a martingale (and not just a local martingale) and that the function s → Eu Af (Rs ) is sufficiently well-behaved at s = 0, say continuous and bounded. Then Z h Eu f (Rh ) − f (u) = Eu [Mh − M0 ] + Eu Af (Rs ) ds 0
=
0 + hAf (u) + o(h)
so that (4.1) holds. Example 4.1 Assume that {Rt } is Brownian motion with drift µ and variance constant σ 2 . Let further f ∈ C 3 have compact support. Then if V is a standard normal r.v., we have5 √ ¡ ¢ Eu f (Rh ) = Ef u + µh + hσV √ √ £ £ ¤2 ¤ = E f (u) + f 0 (u)[µh + hσV ] + f 00 (u) µh + hσV /2 + O(h2 ) = f (u) + f 0 (u)µh + f 00 (u)hσ 2 EV 2 /2 + O(h3/2 ) . Thus (4.1) holds with Af = µf 0 + (σ 2 /2) f 00 . 4 Strictly speaking, a local martingale w.r.t. P for all x. For ease of exposition, we omit x such specification here and in the following. 5 This calculation is of course a heuristic derivation of Itˆ o’s formula. In its full generality Itˆ o’s formula permits to weaken the assumption on f to f ∈ C 2 .
32 CHAPTER II. MARTINGALES AND SIMPLE RUIN CALCULATIONS It is less clear how much one can relax the assumptions on f to still get a local martingale and we will not go into this issue here. Nevertheless, it is clear that for a suitable class of twice differentiable functions f , one should have f ∈ D(A) and that Af = µf 0 + (σ 2 /2) f 00 . The operator sending a twice differentiable function f to µf 0 + (σ 2 /2) f 00 is often called the differential operator of the Brownian motion. Similarly, a diffusion process with local drift µ(u) and local variance σ 2 (u) has differential operator µ(u)f 0 (u) + (σ 2 (u)/2) f 00 (u). 2 Example 4.2 Consider the Cram´er-Lundberg model with parameters β, B and let U be a generic claim. Then, conditioning on whether or not a claim occurs in (0, h), we have under suitable conditions on f ¡ ¢ Eu f (Rh ) = (1 − βh)f (u + h) + βh Ef u − U + O(h) + o(h) Z ∞ = f (u) − βf (u)h + hf 0 (u) + βh f (u − x) B(dx) + o(h) . 0
Thus, it is clear that for a suitable class of differentiable functions f , one should have f ∈ D(A) and that Z ∞ 0 Af (u) = −βf (u) + f (u) + β f (u − x) B(dx) . 0
2 A function f such that f (Rt ) is a martingale is called harmonic. Obviously, in view of (4.1) a harmonic function will have the property f ∈ D(A) and Af ≡ 0. Example 4.3 As a simple example of the relevance of harmonic functions for ruin theory, consider the Brownian setting of Example 4.1 and take f (u) = ψ(u) (the ruin probability), with the convention ψ(u) = 1 for u ≤ 0. For u > 0, P(τ (u) ≤ h) = o(h) 6 and so by boundedness of ψ(u) and the Markov property of Rt , £ ¤ £ ¤ ψ(u) = Eu ψ(Rh ); τ (u) > h + Eu I(τ (u) ≤ h) = Eu ψ(Rh ) + o(h). The same holds for u < 0, and so (omitting the details for u = 0) we conclude that ψ(u) is harmonic. Combining this with the remarks of Example 4.1, we conclude that µψ 0 (u) + ψ 00 (u)σ 2 /2 = 0. 6 This
for instance follows from III.(1.8).
4. MORE ADVANCED MARTINGALES
33
The general solution of this differential equation is C+ eλ+ u + C− eλ− u , where λ± are the solutions of the quadratic equation 0 = λµ + λ2 /2, i.e. λ+ = 0 and λ− = −2µ/σ 2 . If µ > 0, we have ψ(u) → 0 as u → ∞, and so C+ = 0. Together with the boundary condition ψ(0) = 1 (due to the oscillation) we arrive at 2 ψ(u) = e−2µu/σ , as found in Corollary 2.4 by different means. The method employed may be seen as a continuous time analogue of Proof 1 of Theorem 2.1. 2 Notes and references Ethier & Kurtz [359] is a good reference for the modern approach to generators. Further references are Davis [278] and Rolski et al. [746].
4b
Diffusions and two-sided ruin
One of the major areas where generators play a main role is diffusion processes. Thus let {Rt } be a diffusion on [0, ∞) with drift µ(x) and variance σ 2 (x) at x. We assume that µ(x) and σ 2 (x) are continuous with σ 2 (x) > 0 for x > 0. Thus, close to x, {Rt } behaves as Brownian motion with drift µ = µ(x) and variance σ 2 = σ 2 (x). We can define a ‘local’ adjustment coefficient γ(x) = −2µ(x)/σ 2 (x) for the locally approximating Brownian motion. Let Z x Z ∞ Ry s(y) = e 0 γ(x) dx , S(x) = (4.3) s(y) dy, S(∞) = s(y) dy. 0
0
The following result gives a complete solution of the ruin problem for the diffusion subject to the assumption that S(x), as defined in (4.3) with 0 as lower limit of integration, is finite for all x > 0. If this assumption fails, the behavior at the boundary 0 is more complicated and it may happen, e.g, that ψ(u), as defined above as the probability of actually hitting 0, is zero for all u > 0 a.s. but that nevertheless Rt → 0 (the problem leads into the complicated area of boundary classification of diffusions, see e.g. Breiman [199] or Karlin & Taylor [522, p. 226]). Theorem 4.4 Consider a diffusion process {Rt } on [0, ∞), such that the drift µ(x) and the variance σ 2 (x) are continuous functions of x and that σ 2 (x) > 0 for x > 0. Assume further that S(x) as defined in (4.3) is finite for all x > 0. If S(∞) < ∞, (4.4) then 0 < ψ(u) < 1 for all u > 0 and ψ(u) = 1 −
S(u) . S(∞)
Conversely, if (4.4) fails, then ψ(u) = 1 for all u > 0.
34 CHAPTER II. MARTINGALES AND SIMPLE RUIN CALCULATIONS Lemma 4.5 Let 0 < b ≤ u ≤ a and let ψa,b (u) be the probability that {Rt } hits b before a starting from u. Then ψa,b (u) =
S(a) − S(u) . S(a) − S(b)
(4.5)
Proof. Recall that under mild conditions on q, Eu q(Rh ) = q(u) + Aq(u)h + o(h), where σ 2 (u) 00 Aq(u) = q (u) + µ(u)q 0 (u) . 2 If b < u < a, the probability of ruin or hitting the upper barrier a before h is of order o(h), so that ψa,b (u) = Eu ψa,b (Rh ) + o(h) = ψa,b (u) + Aψa,b (u)h + o(h), i.e Aψa,b (u) = 0. Using s0 (x)/s(x) = −2µ(x)/σ 2 (x), elementary calculus shows that we can rewrite A as 1 d h q 0 (u) i Aq(u) = σ 2 (u)s(u) . (4.6) 2 du s(u) 0 Hence Aψa,b (u) = 0 implies that ψa,b (u)/s(u) is constant, i.e. ψa,b (u) = α + βS(u). The obvious boundary conditions ψa,b (b) = 1, ψa,b (a) = 0 then yield the result. 2
Proof of Theorem 4.4. Letting b ↓ 0 in (4.5) yields ψa (u) = 1 − S(u)/S(a). Letting a ↑ ∞ and considering the cases S(∞) = ∞, S(∞) < ∞ separately completes the proof. 2 Notes and references A good introduction to diffusions is in Karlin & Taylor [522]; see in particular pp. 191–195 for material related to Theorem 4.4. In view of (4.5), the function S(x) is referred to as the natural scale in the general theory of diffusions (in case of integrability problems at 0, one works instead with a lower limit ² > 0 of integration in (4.3)). Another basic quantity is the speed measure M , defined by the density 1/(σ 2 (u)s(u)) showing up in (4.6). For related arguments concerning the local adjustment coefficient, see VIII.3.
4c
The Kella-Whitt martingale
Example 4.6 As a motivating example, consider the surplus process {St } of a Cram´er-Lundberg model with a claim size distribution B that is a mixture of two exponential distributions. To be definite, let the density be b(x) =
1 −3x 1 −7x 3e + 7e 2 2
4. MORE ADVANCED MARTINGALES
35
and let the Poisson parameter be β = 3. Then ³1 3 ´ 1 7 κ(α) = 3 + − 1 − α. 23−α 27−α
(4.7)
Thus a solution of the Lundberg equation κ(α) = 0 must satisfy 9 21 (7 − α) + (3 − α) − 3(3 − α)(7 − α) − α(3 − α)(7 − α) . 2 2
0 =
This is a cubic equation, and roots are easily seen to be 0, γ = 1 , γ ∗ = 6; that the Lundberg coefficient γ must be 1 and not 6 follows since EeαS1 is only finite if α < 3. Consider the problem of two-sided exit of {St } from [−a, b] with a, b > 0. Let p0 be the probability of exit at the lower barrier and p3 , p7 the probabilities of exit at the upper barrier as result of a jump which is exponential with rate 3 and 7, respectively. For brevity, write τ = τ (u, a). Now Sτ equals 0 for lower exit and b + V3 for upper exit as result of an exponential(3) jump (where V3 is again exponential(3) due to the lack-of-memory property of the exponential distribution). Defining V7 similarly, we get by optional stopping of {eγSt } 1 = eγS0 = EeγSτ = p0 e−γa + p3 eγb i.e.
3 7 + p7 eγb , 3−γ 7−γ
6 = 6 p0 e−a + 9 p3 eb + 7 p7 eb .
(4.8)
Also obviously 1 = p0 +p3 +p7 . To get the missing third equation, it is tempting to formally proceed with γ ∗ as with γ, which would give 1 = eγ
∗
S0
= Eeγ
∗
Sτ
= p0 e−γ
∗
a
+ p3 eγ
∗
b
∗ 3 7 + p 7 eγ b , ∗ 3−γ 7 − γ∗
(4.9)
i.e. 1 = p0 e−6a + e6b (−p3 + 7p7 ) . ∗
(4.10)
∗
The problem is, however, that Eeγ St = ∞ so {eγ St } is not a martingale (or for that sake a local martingale), so we are missing a rigorous justification for (4.9). 2 We will see in Example 4.9 that the solution is nevertheless correct. For this and other purposes, we will exploit a martingale introduced by Kella & Whitt [527]. Let {Rt } be a L´evy process with L´evy exponent κ(α). The Wald martingale is then Mt = eαRt −tκ(α) . The Kella-Whitt martingale is a stochastic integral w.r.t. {Mt } and has a somewhat different range of applications; in particular, it allows for a more direct study of aspects of reflected L´evy processes.
36 CHAPTER II. MARTINGALES AND SIMPLE RUIN CALCULATIONS Theorem 4.7 Let {Rt } be a L´evy process with L´evy exponent κ(α), let Z
t
Yt = 0
dYsc +
X
∆Ys
0≤s≤t
be an adapted process of locally bounded variation with continuous part {Ytc }, D-paths and jumps ∆Ys = Ys − Ys− , and define Zt = x + Rt + Yt . For each t, let Kt be the r.v. Z t eαZs dMs Kt = 0 Z t Z t X eαZs (1 − e−α∆Ys ). = κ(α) eαZs ds + eαx − eαZt + α eαZs dYsc + 0
0
0≤s≤t
Then {Kt } is a local martingale whenever κ(α) is well-defined. αYt +tκ(α) Proof. Let B . Then, by the general theory of stochastic integraR tt = e ∗ tion, Kt = 0 Bs− dMs is a local martingale. Using the formula for integration by parts (see e.g. Protter [718, p.60] for a version sufficiently general to deal with the present case) yields
Z
t
Ms− dBs + Kt∗ +
Mt Bt − M0 B0 = 0
X
∆Ms ∆Bs .
0≤s≤t
Inserting X
Z 0
Z −Kt∗ =
t
∆Ms dBs =
0≤s≤t
it follows that
Z
t
∆Ms ∆Bs =
(Ms − Ms− ) dBs , 0
t
Ms dBs + M0 B0 − Mt Bt .
(4.11)
0
¡ ¢ Using Ms Bs = eαZs and dBs = Bs α dYsc + κ(α)ds + 1 − e−α∆Ys shows that the r.h.s. of (4.11) reduces to Kt . 2 For practical purposes, the main application is optional stopping which is often verified via the following standard result from martingale theory: Theorem 4.8 If for a given t we have E sups≤t |Ks | < ∞, then {Kt } is a proper martingale. Further, let τ be a stopping time such that E supt≤τ |Kt | < ∞. Then EKτ = EK0 = 0.
4. MORE ADVANCED MARTINGALES
37
Example 4.9 Consider again the mixed exponential setting of Example 4.6. Take Yt ≡ 0. Thus we have simply Z t Kt = κ(α) eαSs ds + 1 − eαSt 0
whenever α < 3. Noting that −a ≤ Ss < b, we get ¯ ¯ |Ks | ≤ ¯κ(α)¯se|α| max(a,b) + 1 + e|α|(b+V3 ) + e|α|(b+V7 ) . Since Eτ < ∞, this shows the conditions of Theorem 4.8 for |α| < 3 and gives as in (4.9) that 0 = κ(α)φ(α) + 1 − p0 e−αa − p3 eαb
3 7 − p7 e−αb , 3−α 7−α
(4.12)
Rt where φ(α) = E 0 eαRs ds. The same bound as used above easily gives that φ(α) is defined for all α ∈ R, not only for |α| < 3, and is an analytic function of α. Since everything else in (4.12) is analytic in the region Ω = R\{3, 7} (think of κ(s) as the r.h.s. of (4.7), i.e. the analytic continuation of log EesS1 ), we conclude that (4.12) holds in the whole of Ω. Taking α = γ ∗ = 6 we get the desired rigorous proof of (4.9). 2 The picture that emerges is that all roots of the analytic continuation of log Ees(R1 −R0 ) may enter in ruin formulas, and we will see several examples of this, in particular when phase-type distributions are involved (see e.g. XI.5 for a much more elaborate version of Example 4.9). The problem with the Wald martingale is of course that one only gets (4.9) for 0 and γ, and this is not enough to do an analytic continuation. Other values of α require conditional expectations of eατ given the type of exit, and we are not aware of how to approach these via the Wald martingale. However, Example 4.9 shows how to solve the problem via the Kella-Whitt martingale. Notes and references Optional stopping of the Kella-Whitt martingale is further discussed in Asmussen & Kella [85], and Markov-modulated versions of the martingale are in Asmussen & Kella [84]. A variety of different applications are surveyed in [APQ, Ch. IX.3].
This page intentionally left blank
Chapter III
Further general tools and results 1
Likelihood ratios and change of measure
We consider stochastic processes {Xt } with a Polish state space E and paths in the Skorohod space DE = DE [0, ∞), which we equip with the natural filtration {Ft }t≥0 and the Borel σ-field F. Two such processes may be repe on (DE , F), and in analogy with the resented by probability measures P, P theory of measures on finite-dimensional spaces one could study conditions for e the Radon-Nikodym derivative dP/dP to exist. However, as shown by the following example this set-up is too restrictive: typically1 , the parameters of the e are then two processes can be reconstructed from a single infinite path, and P, P singular (concentrated on two disjoint measurable sets). e correspond to the claim surplus process of two comExample 1.1 Let P, P pound Poisson risk processes with Poisson rates β, βe and claim size distributions e The number Nt(²) of jumps > ² before time t is a (measurable) r.v. on B, B. (²) (DE , F), hence so is Nt = lim²↓0 Nt . Thus the sets n S=
o Nt =β , t→∞ t lim
Se =
n
o Nt = βe t→∞ t lim
e then S and Se are disjoint, and by the law of are both in F. But if β 6= β, 1 Though not always: it is not difficult to construct a counterexample say in terms of transient Markov processes.
39
40
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
e S) e = 1. A somewhat similar large numbers for the Poisson process, P(S) = P( e argument gives singularity when B 6= B. 2 The interesting concept is therefore to look for absolute continuity only on finite time intervals (possibly random, cf. Theorem 1.3 below). I.e. we look for a process {Lt } (the likelihood ratio process) such that e P(A) = E[Lt ; A], A ∈ Ft ,
(1.1)
e to (DE , Ft ) is absolutely continuous w.r.t. the restriction (i.e. the restriction of P of P to (DE , Ft )). The following result gives the connection to martingales. Proposition 1.2 Let {Ft }t≥0 be the natural filtration on DE , F the Borel σfield and P a given probability measure on (DE , F). ¡ ¢ (i) If {Lt }t≥0 is a non-negative martingale w.r.t. {Ft } , P such that ELt = 1, e on F such that (1.1) holds. then there exists a unique probability measure P e (ii) Conversely, if for some probability measure P and some {Ft }-adapted ¡ process¢ {Lt }t≥0 (1.1) holds, then {Lt } is a non-negative martingale w.r.t. {Ft } , P such that ELt = 1. e by P et (A) = E[Lt ; A], A ∈ Ft . Proof. Under the assumptions of (i), define P e Then Lt ≥ 0 and ELt = 1 ensure that Pt is a probability measure on (DE , Ft ). Let s < t, A ∈ Fs . Then ¯ ¤ £ et (A) = E[Lt ; A] = E E Lt I(A) ¯ Fs = E I(A)E[Lt |Fs ] P es (A), = E I(A)Ls = P © ª et using the martingale property in the fourth step. Hence the family P is t≥0 e consistent and hence extendable to a probability measure P on (DE , F) such e et (A), A ∈ Ft . This proves (i). that P(A) =P Conversely, under the assumptions of (ii) we have for A ∈ Fs and s < t that A ∈ Ft as well and hence E[Ls ; A] = E[Lt ; A]. The truth of this for all A ∈ Fs implies that E[Lt |Fs ] = Ls and the martingale property. Finally, ELt = 1 follows by taking A = DE in (1.1) and non-negativity by letting A = {Lt < 0}. e 2 Then P(A) = E[Lt ; Lt < 0] can only be non-negative if P(A) = 0. The following likelihood ratio identity (typically with τ being the time τ (u) to ruin) is a fundamental tool throughout the book:
1. LIKELIHOOD RATIOS AND CHANGE OF MEASURE
41
e be as in Proposition 1.2(i). If τ is a stopping time Theorem 1.3 Let {Lt }, P and G ∈ Fτ , G ⊆ {τ < ∞}, then h i e 1 ;G . P(G) = E (1.2) Lτ Further, if Z is a r.v. which is Fτ -measurable and 0 on the set {τ = ∞}, then e EZ = E[Z/L τ ].
(1.3)
Proof. Assume first G ⊆ {τ ≤ T } for some fixed deterministic T < ∞. By the martingale property, we have E[LT |Fτ ] = Lτ on {τ ≤ T }. Hence h i h i h i e 1 ; G = E LT ; G = E 1 I(G)E[LT |Fτ ] E Lτ Lτ Lτ h 1 i = E I(G)Lτ = P(G) . (1.4) Lτ In the general case, applying (1.4) to G ∩ {τ ≤ T } we get h i e 1 ; G ∩ {τ ≤ T } . P(G ∩ {τ ≤ T }) = E Lτ Since everything is non-negative, both sides are increasing in T , and letting T → ∞, (1.2) follows by monotone convergence. For (1.3), just use standard measure-theoretic arguments to extend from indicators to r.v.’s. 2 A main example of change of measure is to take {Lt } as the Wald martingale eθXt −tκ(θ) in the case where {Xt } is a random walk or a L´evy process. We e and talk about exponential change of measure then write Pθ rather than P, or exponential tilting. We will see in Section 3 that {Xt } remains a random walk/L´evy process under Pθ , only with changed parameters. A first elegant application of the change-of-measure technique is the following observation: Corollary 1.4 The necessary and sufficient condition for optional stopping of the Wald martingale, i.e. 1 = EeθXτ −τ κ(θ) for a given stopping time with τ < ∞, is that Pθ (τ < ∞) = 1. Proof. Let Z = Lτ = eθXτ −τ κ(θ) = eθXτ −τ κ(θ) I(τ < ∞) . e < ∞). Then the assertion means EZ = 1, whereas (1.3) gives EZ = P(τ
2
42
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
From Theorem 1.3 we obtain a likelihood ratio representation of the ruin probability ψ(u) parallel to the martingale representation II.(3.1) in Proposition II.3.1: Corollary 1.5 Under condition (a) of Proposition II.3.1, ψ(u) = e−γu Eγ [e−γξ(u) ; τ (u) < ∞].
(1.5)
Proof. Letting G = {τ (u) < ∞}, we have P(G) = ψ(u). Now just rewrite the r.h.s. of (1.2) by noting that 1 = e−γSτ (u) = e−γu e−γξ(u) . Lτ (u)
2
The advantage of (1.5) compared to II.(3.1) is that it seems in general easier to deal with the (unconditional) expectation Eγ [e−γξ(u) ; τ (u) < ∞] occurring there than with the (conditional) expectation E[eγξ(u) |τ (u) < ∞] in II.(3.1). The crucial step is to obtain information on the process evolving according to e and this problem will now be studied, first in the Markov case and next P, (Sections 3, 4) for processes with some random-walk-like structure. As another simple application of the change-of-measure technique, we shall establish a formula for the finite-time ruin probability of Brownian motion: Corollary 1.6 Let {Rt } be Brownian motion with drift µ and variance constant 1. Then the density and c.d.f. of τ (u) are n (u − T µ)2 o u Pµ (τ (u) ∈ dT ) = √ T −3/2 exp − , (1.6) 2T 2π ³ u ³ u √ ´ √ ´ Pµ (τ (u) ≤ T ) = 1 − Φ √ − µ T + e2µu Φ − √ − µ T . (1.7) T T For a general variance constant σ 2 , one furthermore obtains P(τ (u) ≤ T ) = Φ
³ −u + µT ´ ³ −u − µ√T ´ 2 √ √ + e2µu/σ Φ . σ T σ T
(1.8)
Proof. Consider first the case σ 2 = 1. For µ = 0, (1.7) is the same as II.(2.8), and (1.6) follows then by straightforward differentiation. For µ 6= 0, the ratio 2 dPµ /dP0 of densities of St is eµSt −tµ /2 , since κ(θ) = −θµ + θ2 σ 2 /2. Hence £ ¤ 2 Pµ (τ (u) ∈ dT ) = E0 eµSτ (u) −τ (u)µ /2 ; τ (u) ∈ dT ¡ ¢ 2 = eµu−T µ /2 P0 τ (u) ∈ dT n 1 u2 o 2 u = eµu−T µ /2 √ T −3/2 exp − · , 2 T 2π
1. LIKELIHOOD RATIOS AND CHANGE OF MEASURE
43
which is the same as (1.6). (1.7) then follows by checking that the derivative of the r.h.s. is (1.6) and that the value at 0 is 0. For a general σ 2 , a completely analogous calculation can be done, but the analogue of (1.6) is more tedious to write down, so we omit the details. 2 The same argument as used for Corollary 1.6 also applies to Bernoulli random walk with θ 6= 1/2, but we again omit the details. Consider next a (time-homogeneous) Markov process {Xt } with state space E, say, in continuous time (the discrete time case is parallel but slightly simpler). In the context of ruin probabilities, one would typically have Xt = Rt , Xt = St , Xt = (Jt , Rt ) or Xt = (Jt , St ), where {Rt } is the risk reserve process, {St } = {u − Rt } the claim surplus process and {Jt } a process of supplementary variables possibly needed to make the process Markovian. A change of measure is performed by finding a process {Lt } which is a martingale w.r.t. each Px , is non-negative and has Ex Lt = 1 for all x, t. The problem is thus to investigate which characteristics of {Xt } and {Lt } ensure a given set of properties of the changed probability measure. First we ask when the Markov property is preserved. To this end, we need the concept of a multiplicative functional. For the definition, we assume for simplicity that {Xt } has D-paths, is Markov w.r.t. the natural filtration {Ft } on DE and define {Lt } to be a multiplicative functional if {Lt } is adapted to {Ft }, non-negative and Lt+s = Lt · (Ls ◦ θt ) (1.9) Px -a.s. for all x, s, t, where θt is the shift operator. The precise meaning of this is the following: being Ft -measurable, Lt has the form ¡ ¢ Lt = ϕt {Xu }0≤u≤t for some mapping ϕt : DE [0, t] → [0, ∞), and then ¡ ¢ Ls ◦ θt = ϕs {Xt+u }0≤u≤s . Theorem 1.7 Let {Xt } be Markov w.r.t. the natural filtration {Ft } on DE , e be let {Lt } be a non-negative martingale with Ex Lt = 1 for all x, t and let P © ªx ex (A) = Ex [Lt ; A]. Then the family P ex the probability measure given by P x∈E defines a time-homogeneous Markov process if and only if {Lt } is a multiplicative functional. Proof. Since both sides of (1.9) are Ft+s measurable, (1.9) is equivalent to £ ¤ Ex [Lt+s Vt+s ] = Ex Lt · (Ls ◦ θt )Vt+s (1.10)
44
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
for any Ft+s -measurable r.v. Vt+s , which in turn is the same as £ ¤ £ ¤ Ex Lt+s Zt · (Ys ◦ θt ) = Ex Lt · (Ls ◦ θt )Zt · (Ys ◦ θt )
(1.11)
for any Ft -measurable Zt and any Fs -measurable Ys . Indeed, since Zt · (Ys ◦ θt ) is Ft+s -measurable, (1.10) implies (1.11). The converse follows since Qn the class of r.v.’s of the form Zt · (Ys ◦ θt ) comprises all r.v.’s of the form 1 fi (Xt(i) ) with all t(i) ≤ t + s. Similarly, the Markov property can be written e x [Ys ◦ θt |Ft ] = E e X Ys , t < s, E t for any Fs -measurable r.v. Ys , which is the same as £ ¤ £ ¤ e x Zt (Ys ◦ θt ) = E e x Zt E e X Ys E t ex , this in turn means for any Ft -measurable r.v. Zt . By definition of P £ ¤ £ ¤ Ex Lt+s Zt (Ys ◦ θt ) = Ex Lt Zt EXt [Ls Ys ] , ¯ ¤ £ or, since EXt [Ls Ys ] = E (Ys ◦ θt )(Ls ◦ θt ) ¯ Ft , £ ¤ £ ¤ Ex Lt+s Zt (Ys ◦ θt ) = Ex Lt Zt (Ys ◦ θt )(Ls ◦ θt ) , which is the same as (1.11).
(1.12) 2
© ª ex Remark 1.8 For P to define a time-homogeneous Markov process, it x∈E suffices to assume that {Lt } is a multiplicative functional with Ex Lt = 1 for all x, t. Indeed, then E[Lt+s |Ft ]
= Lt E[Ls ◦ θt |Ft ] = Lt EXt Ls = Lt ,
(using the Markov property in the second step) so that the martingale property is automatic. 2 Notes and references The results of the present section are essentially known in a very general Markov process formulation, see Dynkin [338] and Kunita [562]. A more elementary version along the lines of Theorem 1.7 can be found in K¨ uchler & Sørensen [561], with a proof somewhat different from the present one. A further relevant reference is Barndorff-Nielsen & Shiryaev [139].
2. DUALITY WITH OTHER APPLIED PROBABILITY MODELS
2
45
Duality with other applied probability models
In this section, we shall establish a general connection between ruin probabilities and certain stochastic processes which occur for example as models for queueing and storage. The formulation has applications to virtually all the risk models studied in this book. The result is a sample path relation, and thus for the moment no parametric assumptions (on say the structure of the arrival process) are needed. We work on a finite time interval [0, T ] in the following set-up (which can be much generalized): The risk process {Rt }0≤t≤T has arrivals at epochs σ1 , . . . , σN , 0 ≤ σ1 ≤ . . . ≤ σN ≤ T . The corresponding claim sizes are U1 , . . . , UN . In between jumps, the premium rate is p(r) > 0 when the reserve is r (i.e., R˙ = p(R)). Thus Z Rt = R0 +
t
p(Rs ) ds − At
where At =
0
X
Uk .
(2.1)
k: σk ≤t
The initial condition is arbitrary, R0 = u (say), and the time to ruin is τ (u) = inf {t ≥ 0 : Rt < 0}. The storage process {Vt }0≤t≤T is essentially defined by time-reversion, reflection at zero and initial condition V0 = 0. More precisely, the arrival ∗ where σk∗ = T −σN −k+1 , and just after time σk∗ {Vt } epochs are σ1∗ , . . . , σN makes an upwards jump of size Uk∗ = UN −k+1 . In between jumps, {Vt } decreases at rate p(r) when Vt = r (i.e., V˙ = −p(V )). That is, instead of (2.1) we have Z Vt =
A∗t
−
t
p(Vs ) ds 0
X
where A∗t = k:
Uk∗ = AT − AT −t ,
∗
and we use the convention p(0) = 0 to make zero a reflecting barrier (when hitting 0, {Vt } remains at 0 until the next arrival). Note that these definitions make {Rt } right-continuous (as standard) and {Vt } left-continuous. The sample path relation between these two processes is illustrated in Fig. III.1.
46
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
Figure III.1 Define τ (u) = inf {t ≥ 0 : Rt < 0} (τ (u) = ∞ if Rt ≥ 0 for all t ≤ T ) and let ³ ´ ¡ ¢ ψ(u, T ) = P inf Rt < 0 = P τ (u) ≤ T 0≤t≤T
be the finite-time ruin probability. Theorem 2.1 The events {τ (u) ≤ T } and {VT > u} coincide. In particular, ψ(u, T ) = P(VT > u).
(2.2)
(u) (u) (u) Proof. Let rt denote the solution of R˙ = p(R) subject to r0 = u. Then rt (v) > rt for all t when u > v. Suppose first VT > u (this situation corresponds to the solid path of {Rt } in Fig. III.1 with R0 = u = u1 ). Then ∗ = rσ(V1T ) − U1 > rσ(u) − U1 = Rσ1 . Vσ N 1 ∗ > 0, we can repeat the argument and get Vσ ∗ If VσN > Rσ2 and so on. Hence N −1 ∗ if n satisfies VσN = 0 (such an n exists, if nothing else n = N ), we have −n+1 Rσn < 0 so that indeed τ (u) ≤ T . Suppose next VT ≤ u (this situation corresponds to the dotted path of {Rt } in Fig. III.1 with R0 = u = u2 ). Then similarly ∗ Vσ N = rσ(V1T ) − U1 ≤ rσ(u) − U1 = Rσ1 , 1
∗ Vσ N ≤ Rσ2 , −1
and so on. Hence Rσn ≥ 0 for all n ≤ N , and since ruin can only occur at the 2 times of claims, we have τ (u) > T .
2. DUALITY WITH OTHER APPLIED PROBABILITY MODELS
47
A basic example is when {Rt } is the risk reserve process corresponding to claims arriving at Poisson rate β and being i.i.d. with distribution B, and a general premium rule p(r) when the reserve is r. Then the time reversibility of the Poisson process ensures that {At } and {A∗t } have the same distribution (for finite-dimensional distributions, the distinction between right- and left continuity is immaterial because the probability of a Poisson arrival at any fixed time t is zero). Thus we may think of {Vt } as having compound Poisson input and being defined for all t < ∞. Historically, this represents a model for storage, say of water in a dam though other interpretations like the amount of goods stored are also possible. The arrival epochs correspond to rainfalls, and in between rainfalls water is released at rate p(r) when Vt (the content) is r. We get: Corollary 2.2 Consider the compound Poisson risk model with a general premium rule p(r). Then the storage process {Vt } has a proper limit in distribution as t → ∞, say V , if and only if ψ(u) < 1 for all u, and then ψ(u) = P(V > u). Proof. Let T → ∞ in (2.2).
(2.3) 2
Consider now a compound Poisson risk model with constant premium rate 1 and claim arrival rate β. Then a direct relationship can be obtained between the survival probability in the risk model and the maximum workload Vmax (u) of a busy period in an M/G/1 queue with arrival rate β. Theorem 2.3 Under the safety loading condition η > 0, we have for every u≥0 1 d P(Vmax > u) = log φ(u), (2.4) β du where φ(u) = 1 − ψ(u) is the survival probability. Proof. The risk process Rt starting in u can only survive if after each claim that occurs at some running maximum s > u, the level s will be reached again before ruin occurs. This is equivalent to the statement that the maximum workload Vmax of a busy period in an M/G/1 queue (with traffic intensity ρ < 1) does not exceed s. As we are only concerned about eventual survival, we can cut out every such ‘surviving’ excursion away from the running maximum of the risk process and only consider those claims at the running maximum which lead to a downward excursion causing ruin before recovering to level s. The instantaneous probability of having a claim of the latter type is β dt P(Vmax > s) = β ds P(Vmax > s),
48
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
since at the running maximum we have ds = dt. Consequently, the survival probability φ(u) can simply be interpreted as the probability to have zero events during [u, ∞) of an inhomogeneous Poisson process with rate β(s) = β P(Vmax > s) (which constitutes a thinning of the original Poisson process). This finally implies Z ∞ ³ Z ∞ ´ ³ ´ φ(u) = exp − β(s) ds = exp −β P(Vmax > s) ds . (2.5) u
u
2 The relation (2.4) also follows from a combination of (2.3) and the identity P(Vmax > u) =
1 d log P(V < u) β du
for an M/G/1 queue (see for instance Cohen [249, p. 618]), but the above proof establishes a direct and self-contained link between Vmax and φ(u) that will also be useful later on (cf. VIII.4). Notes and references Two main references on storage processes are Harrison & Resnick [451] and Brockwell, Resnick & Tweedie [203]. Theorem 2.1 and its proof is from Asmussen & Schock Petersen [104], Corollary 2.2 from Harrison & Resnick [452]. The results can be viewed as special cases of Siegmund duality, see Siegmund [808]. Some further more general references are Asmussen [63] and Asmussen & Sigman [105]. Theorem 2.3 is due to Albrecher, Borst, Boxma & Resing [16]. Historically, the connection between risk theory and other applied probability areas appears first to have been noted by Prabhu [711] in a queueing context. It is a standard tool today, but one may feel that the interaction between the different areas was surprisingly limited in the first decades after the appearance of [711].
3
Random walks in discrete or continuous time
Consider a random walk Xn = X0 + Y1 + · · · + Yn in discrete time where the Yi are i.i.d., with common distribution F . For discrete time random walks, there is an analogue of Theorem 2.1 in terms of Lindley processes. For a given i.i.d. R-valued sequence Z1 , Z2 , . . ., the Lindley process W0 , W1 , W2 , . . . generated by Z1 , Z2 , . . . is defined by assigning W0 some arbitrary value ≥ 0 and letting Wn+1 = (Wn + Zn+1 )+ .
(3.1)
Thus {Wn }n=0,1,... evolves as a random walk with increments Z1 , Z2 , . . . as long as the random walk only takes non-negative values, and is reset to 0 once the
3. RANDOM WALKS IN DISCRETE OR CONTINUOUS TIME
49
random walk hits (−∞, 0). I.e., {Wn }n=0,1,... can be viewed as the reflected version of the random walk with increments Z1 , Z2 , . . . In particular, if W0 = 0 then (3.2) WN = Z1 + · · · + ZN − min (Z1 + · · · + Zn ) n=0,1,...,N
(for a rigorous proof, just verify that the r.h.s. of (3.2) satisfies the same recursion as in (3.1)). Theorem 3.1 Let τ (u) = inf {n : u + Y1 + · · · + Yn < 0}. Let further N be fixed and let W0 , W1 , . . . , WN be the Lindley process generated by Z1 = −YN , Z2 = −YN −1 , . . ., ZN = −Y1 according to W0 = 0. Then the events {τ (u) ≤ N } and {WN > u} coincide. Proof. By (3.2), WN
=
−YN − · · · − Y1 −
=
−
min
n=0,1,...,N
min
n=0,1,...,N
(−YN − · · · − YN −n+1 )
(Y1 + · · · + YN −n ) = −
min
n=0,1,...,N
(Y1 + · · · + Yn ).
From this the result immediately follows.
2
assertions are equivalent: Corollary 3.2 ¡ The following ¢ (a) ψ(u) = P ¡τ (u) < ∞ ¢ < 1 for all u ≥ 0; (b) ψ(u) = P τ (u) < ∞ → 0 as u → ∞; (c) The Lindley process {WN } generated by Z1 = −Y1 , Z2 = −Y2 , . . . has a proper limit W in distribution as n → ∞; (d) m = inf n=0,1,... (Y1 + · · · + Yn ) > −∞ a.s.; (e) Y1 + · · · + Yn 6→ −∞ a.s. D In that case, W = −m and P(W > u) = P(−m > u) = ψ(u). Proof. Since (YN , . . . , Y1 ) has the same distribution as (Y1 , . . . , YN ), the Lindley processes in Corollary 3.2 and Theorem 3.1 have the same distribution for n = 0, 1, . . . , N . Thus the assertion of Theorem 3.1 is equivalent to D WN = M N =
sup n=0,1,...,N
(Z1 + · · · + Zn )
D so that WN → M = supn=0,1,... (Z1 + · · · + Zn ) = −m and P(W > u) = P(M > u) = ψ(u). By Kolmogorov’s 0-1 law, either M = ∞ a.s. or M < ∞ a.s. Combining these facts gives easily the equivalence of (a)–(d). Clearly, (d) ⇒ (e). The converse follows from general random walk theory since it is standard that lim sup(Y1 + · · · + Yn ) = ∞ when Y1 + · · · + Yn 6→ −∞. 2
50
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
By the law of large numbers, a sufficient condition for (e) is that EY is welldefined and ≥ 0. In general, the condition ∞ X 1 P(Y1 + · · · + Yn < 0) < ∞ n n=1
is known to be necessary and sufficient ([APQ, p. 231]) but appears to be rather intractable. Remark 3.3 The i.i.d. assumption on the Z1 , . . . , ZN (or, equivalently, on the Y1 , . . . , YN ) in Theorem 3.1 is actually not necessary — the result is a sample path relation as is Theorem 2.1. Similarly, there is a more general version of Corollary 3.2. One then assumes Yn to be a stationary sequence, w.l.o.g. doubly infinite (n = 0, ±1, ±2, . . .) and defines Zn = −Y−n . 2 Next consider change of measure via likelihood ratios. For a random walk, a Markovian change of measure as in Theorem 1.7 does not necessarily lead to a random walk: if, e.g., F has a strictly positive density ex corresponds to a Markov chain such that the density of X1 given X0 = x and P ex to Fn are equivalent (have is also strictly positive, then the restrictions of Px , P the same null sets) so that the likelihood ratio Ln exists. The following result gives the necessary and sufficient condition for {Ln } to define a new random walk: Proposition 3.4 Let {Ln } be a multiplicative functional of a random walk with Ex Ln = 1 for all n and x. Then the change of measure in Theorem 1.7 corresponds to a new random walk if and only if Ln = h(Y1 ) · · · h(Yn )
(3.3)
Px -a.s. for some function h with Eh(Y ) = 1. In that case, the changed increment distribution is Fe(x) = E[h(Y ); Y ≤ x]. Proof. If (3.3) holds, then ex E
n Y
fi (Yi )
= Ex
i=1
n Y
fi (Yi )h(Yi )
i=1
=
n Y i=1
Efi (Yi )h(Yi ) =
n Z Y i=1
fi (y)Fe (dy)
3. RANDOM WALKS IN DISCRETE OR CONTINUOUS TIME
51
from which the random walk property is immediate with the asserted form of e x f (Y1 ) = E e 0 f (Y1 ). Since Fe. Conversely, the random walk property implies E L1 has the form g(X0 , Y1 ), this means E[g(x, Y )f (Y )] = E[g(0, Y )f (Y )] for all f and x, implying g(x, Y ) = h(Y ) a.s. where h(y) = g(0, y). In particular, (3.3) holds for n = 1. For n = 2, we get L2 = L1 (L1 ◦ θ1 ) = h(Y1 )g(X1 , Y2 ) = h(Y1 )h(Y2 ), and so on for n = 3, 4, . . ..
2
A particular important example is exponential change of measure (h(y) = eαy−κ(α) where κ(α) = log Fb[α] is the c.g.f. of F ). The corresponding likelihood ratio is © ª Ln = exp α(Y1 + · · · + Yn ) − nκ(α) . (3.4) Thus {Ln } is the Wald martingale, cf. II.1. We get: Corollary 3.5 Consider a random walk and an α such that κ(α) = log Fb[α] = log EeαY is finite, and define Ln by (3.4). Then the change of measure in Theorem 1.7 corresponds to a new random walk with changed increment distribution Z x Fe(x) = e−κ(α) eαy F (dy) . −∞
Discrete time random walks have classical applications in queueing theory via the Lindley process representation of the waiting time, see Chapter VI. In risk theory, they arise as models for the reserve or claim surplus at a discrete sequence of instants, say the beginning of each month or year, or imbedded into continuous time processes, say by recording the reserve or claim surplus just before or just after claims (see Chapter VI for some fundamental examples). However, the tradition in the area is to use continuous time models. Now consider reflected versions of L´evy processes (cf. II.1). First assume in the setting of Section that {Rt } is the risk reserve process for the compound Poisson risk model with constant premium rate p(r) ≡ 1. Then the storage process {Vt } has constant release rate 1, i.e. has upwards jumps governed by B at the epochs of a Poisson process with rate β and decreases linearly at rate 1 in between jumps. A different interpretation is as the workload or virtual waiting time process in an M/G/1 queue, defined as a system with a single server working at a unit rate, having Poisson arrivals with rate β and
52
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
distribution B of the service times of the arriving customers. Here ‘workload’ refers to the fact that we can interpret Vt as the amount of time the server will have to work until the system is empty provided no new customers arrive; virtual waiting time refers to Vt being the amount of time a customer would have to wait before starting service if he arrived at time t (this interpretation requires FIFO = First In First Out queueing discipline: the customers are served in the order of arrival). Corollary 3.6 In the compound Poisson risk model with constant premium rate p(r) ≡ 1, ψ(u, T ) = P(VT > u), where VT is the virtual waiting time at time T in an initially empty M/G/1 queue with the same arrival rate β and the service times having the same distribution B as the claims in the risk process. D Furthermore, VT → V for some r.v. V ∈ [0, ∞], and ψ(u) = P(V > u). [The condition for V < ∞ a.s. is easily seen to be βµB < 1, cf. Chapter IV.] Processes with a more complicated path structure like Brownian motion or jump processes with unbounded L´evy measure are not covered by Section 2, and the reflected version is then defined by means of the abstract reflection operator as in (3.2), WT = XT − min Xt 0≤t≤T
(assuming W0 = X0 = 0 for simplicity). Proposition 3.7 If {Xt } is a L´evy process of the form Xt = X0 +µt+σBt +Mt as in II.(1.4), then Eeα(Xt −X0 ) = E0 eαXt = etκ(α) , (3.5) where
Z κ(α) = αµ + α2 σ 2 /2 +
∞
(eαx − 1)ν(dx)
−∞
provided the L´evy measure of the jump part {Mt } satisfies
R² −²
(3.6) |x| ν(dx) < ∞.
Proof. This is basically an easy application of formulas II.(1.7), II.(1.8). To repeat: by standard formulas for the normal distribution, Eeα(µt+σBt ) = et{αµ+α
2
σ 2 /2}
.
By explicit calculation, we show in the compound Poisson case (kνk < ∞) in Proposition IV.1.1 that ½Z ∞ ¾ EeαMt = exp (eαx − 1)ν(dx) . −∞
3. RANDOM WALKS IN DISCRETE OR CONTINUOUS TIME
53
In the general case, use the representation as limit of compound Poisson processes. 2 Note that (3.6) is the L´evy-Khinchine representation of the c.g.f. of an infinitely divisible distribution (see, e.g., Chung [246]). This is of course no coincidence since the distribution of X1 − X0 is necessarily infinitely divisible when {Xt } has stationary independent increments. R² Theorem 3.8 Assume that {Xt } is a L´evy process with −² |x| ν(dx) < ∞, and that {Lt } is a non-negative multiplicative functional of the form Lt = g(t, Xt − X0 ) with Ex Lt = 1 for all x, t. Then the Markov process given by Theorem 1.7 is again a L´evy process. In particular, if Lt = eθ(Xt −X0 )−tκ(θ) , then the changed parameters in the representation (1.4) are µ e = µ + θσ 2 , σ e2 = σ 2 , νe(dx) = eθx ν(dx). Proof. For the first statement, we use the characterization (1.3) and get ¯ ¤ ¯ ¤ £ £ e f (Xt+s − Xt ) ¯ Ft = E f (Xt+s − Xt )Ls ◦ θt ¯ Ft E ¯ ¤ £ = E f (Xt+s − Xt )g(s, Xt+s − Xt ) ¯ Ft = E0 f (Xs )g(s, Xs ) = E0 f (Xs )Ls e 0 f (Xs ). = E e 0 eαX1 . Then For the second, let eκe(α) = E £ ¤ £ ¤ eκe(α) = E0 L1 eαX1 = e−κ(θ) E0 e(α+θ)X1 = eκ(α+θ)−κ(θ) , κ e(α) = κ(α + θ) − κ(θ) Z ∞ ¡ ¢ ¡ (α+θ)x ¢ = αµ + (α + θ)2 − θ2 σ 2 /2 + e − eθx ν(dx) −∞ Z ∞ 2 2 2 = α(µ + θσ ) + α σ /2 + (eαx − 1)eθx ν(dx). −∞
2 ©
Remark 3.9 If X0 = 0, then the martingale e time analogue of the Wald martingale (3.4).
ª θX(t)−tκ(θ)
is the continuous 2
Example 3.10 Let Xt be the claim surplus process of a compound Poisson risk process with Poisson rate β and claim size distribution B, corresponding to µ = −1, σ = 0, ν(dx) = βB(dx). Then we can write e νe(dx) = βeθx B(dx) = βeB(dx),
eθx b e where βe = β B[θ], B(dx) = B(dx). b B[θ]
54
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
Thus (since µ e = µ = −1, σ e = σ = 0) the changed process is the claim surplus process of another compound Poisson risk process with Poisson rate βe and claim e size distribution B. 2 Example 3.11 For an example of a likelihood ratio not covered by Theorem 3.8, let the given Markov process (specified by the Px ) be the claim surplus process of a compound Poisson risk process with Poisson rate β and claim size ex refer to the claim surplus process of another distribution B, and let the P compound Poisson risk process with Poisson rate βe = β and claim size distribue 6= B. Recalling that σ1 , σ2 , . . . are the arrival times and U1 , U2 , . . . the tion B corresponding claim sizes, it is then easily seen that Lt =
Y dB e (Ui ) dB
i: σi ≤t
e e whenever the Radon-Nikodym derivative dB/dB exists (e.g. dB/dB = eb/b when e have densities b, eb with b(x) > 0 for all x such that eb(x) > 0). B, B 2
4
Markov additive processes
A Markov additive process, abbreviated as MAP in this section2 , is defined as © ª a bivariate Markov process {Xt } = (Jt , St ) , where {Jt } is a Markov process with state space E (say) and the increments of {St } are governed by {Jt } in the sense that ¯ ¤ £ £ ¤ E f (St+s − St )g(Jt+s ) ¯ Ft = EJt ,0 f (Ss )g(Js ) .
(4.1)
For shorthand, we write Pi , Ei instead of Pi,0 , Ei,0 in the following. As for processes with stationary independent increments, the structure of MAP’s is completely understood when E is finite: In discrete time, a MAP is specified by the measure-valued matrix (kernel) F (dx) whose ijth element is the defective probability distribution Fij (dx) = Pi (J1 = j, Y1 ∈ dx) where Yn = Sn − Sn−1 . An alternative description is in terms of the transition matrix P = (pij )i,j∈E (here pij = Pi (J1 = j)) and the probability measures ¯ ¡ ¢ Fij (dx) Hij (dx) = P Y1 ∈ dx ¯ J0 = i, J1 = j = . pij 2 and only there; one reason is that in parts of the applied probability literature, MAP stands for the Markovian arrival process discussed below.
4. MARKOV ADDITIVE PROCESSES
55
In simulation language, this means that the MAP can be simulated by first simulating the Markov chain {Jn } and next the Y1 , Y2 , . . . by generating Yn according to Hij when Jn−1 = i, Jn = j. If all Fij are concentrated on (0, ∞), a MAP is the same as a semi-Markov or Markov renewal process, with the Yn being interpreted as interarrival times. In continuous time (assuming D-paths), {Jt } is specified by its intensity matrix Λ = (λij )i,j∈E . On an interval [t, t + s) where Jt ≡ i, {St } evolves like a L´evy process and the parameters µi , σi2 , νi (dx) in II.(1.4) depending on i. In addition, a jump of {Jt } from i to j 6= i has probability qij of giving rise to a jump of {St } at the same time, the distribution of which has some distribution Bij . [That a process with this description is a MAP is obvious; the converse requires a proof, which we omit and refer to Neveu [663] or C ¸ inlar [247].] If E is infinite a MAP may be much more complicated. As an example, let {Jt } be standard Brownian motion on the line. Then a Markov additive process can be defined by letting St = lim ²↓0
1 2²t
Z
t
¡ ¢ I |Js | ≤ ² ds
0
be the local time at 0 up to time t. b t [α] with ijth element of the m.g.f., consider the matrix F £ As a generalization ¤ Ei eαSt ; Jt = j . b n [α] = F b [α]n Proposition 4.1 For a MAP in discrete time and with E finite, F where ¡ ¢ ¡ ¢ ¡ ¢ b [α] = F b 1 [α] = Ei [eαS1 ; J1 = j] b ij [α] F = Fbij [α] i,j∈E = pij H . i,j∈E i,j∈E Proof. Conditioning upon (Jn , Sn ) yields X Ei [eαSn+1 ; Jn+1 = j] = Ei [eαSn ; Jn = k] Ek [eαY1 ; J1 = j], k∈E
b n+1 [α] = F b n [α]F b [α]. which in matrix formulation is the same as F
2
Proposition 4.2 Let E be finite and consider a continuous time Markov additive process with parameters Λ, µi , σi2 , νi (dx) (i ∈ E), qij , Bij (i, j ∈ E) and
56
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
£ ¤ b t [α] with ijth element Ei eαSt ; Jt = j is given by S0 = 0. Then the matrix F etK[α] , where ¡ ¢ ¡ ¢ bij [α] − 1) , K[α] = Λ + κ(i) (α) diag + λij qij (B Z κ(i) (α) = αµi + α2 σi2 /2 +
∞
(eαx − 1)νi (dx).
−∞
© (i) ª Proof. Let St be a L´evy process with parameters µi , σi2 , νi (dx). Then, up to o(h) terms, £ ¤ Ei eαSt+h ; Jt+h = j £ ¤ (j) = (1 + λjj h)Ei eαSt ; Jt = j Ej eSh X £ ¤© ª bkj [α] + λkj hEi eαSt ; Jt = k 1 − qkj + qkj B k6=j
£ ¤¡ ¢ Ei eαSt ; Jt = j 1 + hκ(j) (α) X £ ¤© ª bkj [α] − 1) +h Ei eαSt ; Jt = k λkj + λkj qkj (B
=
k∈E
(recall that qjj = 0). In matrix formulation, this means that ¡ ¡ ¢¢ ¡ ¡ ¢ b t+h [α] = F b t [α] I + h κ(i) (α) bij [α] − 1 , F + hΛ + h λij qij B diag b 0 [α] F t
=
b t [α]K , F
b 0 [α] = I implies F b t [α] = etK[α] according to the which in conjunction with F standard solution formula for systems of linear differential equations. 2 In the following, assume that the Markov chain/process {Jt } is ergodic. By Perron-Frobenius theory (see A.4c), we infer that in the discrete time case the b [α] has a real eigenvalue κ(α) with maximal absolute value and that matrix F in the continuous time case K[α] has a real eigenvalue κ(α) with maximal real part. The corresponding left and right eigenvectors ν (α) , h(α) may be chosen with strictly positive components. Since ν (α) , h(α) are only given up to a constants, we are free to impose two normalizations, and we shall take ν (α) h(α) = 1, πh(α) = 1, where π = ν (0) is the stationary distribution. Then h(0) = e. The function κ(α) plays in many respects the same role as the cumulant g.f. of a random walk, as will be seen from the following results. In particular,
4. MARKOV ADDITIVE PROCESSES
57
its derivatives are ‘asymptotic cumulants’, cf. Corollary 4.7, and appropriate generalizations of the Wald martingale (and the associated change of measure) can be defined in terms of κ(α) (and h(α) ), cf. Proposition 4.4. £ ¤ (α) (α) Corollary 4.3 Ei eαSt ; Jt = j ∼ hi νj etκ(α) . Proof. By Perron-Frobenius theory (see A.4c).
2
We also get an analogue of the Wald martingale for random walks: (α)
(α)
Proposition 4.4 Ei eαSt hJt = hi etκ(α) . Furthermore, ©
(α) ª
eαSt −tκ(α) hJt
t≥0
is a martingale. Proof. For the first assertion, just note that (α)
Ei eαSt hJt
(α)
(α) tK[α] (α) tκ(α) (α) b = eT = eT h = eT h = etκ(α) hi i F t [α]h ie ie
.
It then follows that £ ¤ (α) ¯ E eαSt+v −(t+v)κ(α) hJt+v ¯ Ft £ ¤ (α) ¯ = eαSt −tκ(α) E eα(St+v −St )−vκ(α) hJt+v ¯ Ft £ (α) ¤ (α) = eαSt −tκ(α) EJt eαSv −vκ(α) hJv = eαSt −tκ(α) hJt . Let k(α) denote the derivative of h(α) w.r.t. α, and write k = k(0) .
2
Λt Corollary 4.5 Ei St = tκ0 (0) + ki − Ei kJt = tκ0 (0) + ki − eT i e k.
Proof. By differentiation in Proposition 4.4, £ ¡ (α) (α) (α) ¤ (α) ¢ Ei St eαSt hJt + eαSt kJt = etκ(α) ki + tκ0 (α)hi . (0)
Let α = 0 and recall that h(0) = e so that hi
(0)
= hJt = 1.
(4.2) 2
The argument is slightly heuristic (e.g., the existence of exponential moments is assumed) but can be made rigorous by passing to characteristic functions. In the same way, one obtains a generalization of Wald’s identity ESτ = Eτ · ES1 for a random walk:
58
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
Corollary 4.6 For any stopping time τ with finite mean, Ei Sτ = κ0 (0)Eτ + ki − Ei kJτ . Corollary 4.7 No matter the initial distribution ν of J0 , lim
t→∞
Eν St t
=
κ0 (0),
lim
t→∞
Varν St = κ00 (0). t
Proof. The first assertion is immediate by dividing by t in Corollary 4.5. For the second, we differentiate (4.2) to get h i (α) (α) (α)0 Ei St2 eαSt hJt + 2St eαSt kJt + eαSt kJt ³ ´ © (α)0 (α) (α) (α) (α) ª = etκ(α) ki + tκ0 (α)ki + t κ00 (α)hi + tκ0 (α)2 hi + κ0 (α)ki . Multiplying by νi , summing and letting α = 0 yields ¤ £ Eν St2 + 2St kJt = t2 κ0 (0)2 + 2tκ0 (0)νk + tκ00 (0) + O(1) . Squaring in Corollary 4.5 yields [Eν St ]
2
= t2 κ0 (0)2 + 2tκ0 (0)νk − 2tκ0 (0)Eν kJt + O(1) .
Since it is easily seen by an asymptotic independence argument that Eν [St kJt ] = tκ0 (0)Eν kJt + O(1), subtraction yields Varν St = tκ00 (0) + O(1). 2 Remark 4.8 Also for E being infinite (possibly uncountable), EeαSt typically grows asymptotically exponential with a rate κ(α) independent of the initial condition (i.e., the distribution of J0 ). More precisely, there is typically a function h = h(α) on E and a κ(α) such that Ex eαSt −tκ(α) → h(x) , t → ∞ , for all x ∈ E. From (4.1) one then (at least heuristically) obtains h(x) = = =
lim Ex eαSv −vκ(α) £ ¤ lim Ex eαSt −tκ(α) EJt eαSv−t −(v−t)κ(α)
v→∞
v→∞ Ex eαSt −tκ(α) h(Jt ).
It then follows as in the proof of Proposition 4.4 that o n h(J ) t eαSt −tκ(α) h(J0 ) t≥0
(4.3)
4. MARKOV ADDITIVE PROCESSES
59
is a martingale. In view of this discussion, we take the martingale property as our basic condition below (though this is automatic in the finite case). An example beyond the finite case occurs for periodic risk processes in VII.6, where {Jt } is deterministic period motion on E = [0, 1) (i.e., Jt = (s + t) mod 1 Ps -a.s. for s ∈ E). 2 Remark 4.9 The condition that (4.3) is a ªmartingale can be expressed via the © generator A (cf. II.4a) of {Xt } = (Jt , St ) as follows. Given a function h on E, let hα (i, s) = eαs h(i). We then want to determine h and κ(α) such that Ei eαSt h(Jt ) = etκ(α) h(i). For t small, this leads to ¡ ¢ h(i) + tAhα (i, 0) = h(i) 1 + tκ(α) , i.e. Ahα (i, 0) = κ(α)h(i). We shall not exploit this approach systematically; see, however, VI.3b and Remark VII.6.5. 2 © ª Proposition 4.10 Let (Jt , St ) be a MAP and let θ be such that {Lt }t≥0 =
n h(J ) o t eθSt −tκ(θ) h(J0 ) t≥0
is a Px -martingale for each x ∈ E. Then {Lt } is a multiplicative functional, © ª ex and the family P given by Theorem 1.7 defines a new MAP. x∈E Proof. That {Lt } is a multiplicative functional follows from Ls ◦ θt =
h(Jt+s ) θ(St+s −St )−sκ(θ) e . h(Jt )
The proof that we have a MAP is contained in the proof of Theorem 4.11 below in the finite case. In the infinite case, one can directly verify that (4.1) holds ex . We omit the details. for the P 2 Theorem 4.11 Consider the irreducible case with E finite. Then the MAP in Proposition 4.10 is given by b [θ]∆ (θ) , e = e−κ(θ) ∆−1(θ) F P h h
e ij (dx) = H
eθx H (dx) b ij [θ] ij H
60
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
in the discrete time case, and by e = ∆−1(θ) K[θ]∆ (θ) − κ(θ)I, µ Λ ei = µi + θσi2 , σ ei2 = σi2 , h h νei (dx) = eθx νi (dx), qeij =
θx bij [θ] qij B eij (dx) = e B (dx) ¡ ¢, B bij [θ] − 1 bij [θ] ij 1 + qij B B (θ)
in the continuous time case. Here ∆h(θ) is the diagonal matrix with the hi on the diagonal. In particular, if νi (dx) is compound Poisson, νi (dx) = βi Bi (dx) with βi < ∞ and Bi a probability measure, then also νei (dx) is compound Poisson with θx bi [θ], B ei (dx) = e Bi (dx). βei = βi B bi [θ] B e means Remark 4.12 The expression for Λ h ¡ ¢i bij [θ] − 1 , i 6= j. λ 1 + q B ij ij (θ) (θ)
eij = λ
hj hi
(4.4)
e is an intensity matrix: the offIn particular, this gives a direct verification that Λ bij [θ] > 0. diagonal elements are non-negative because λij ≥ 0, 0 ≤ qij ≤ 1 and B That the rows sum to 1 follows from e Λe = =
∆−1 K[θ]h(θ) − κ(θ)e = κ(θ)∆−1 h(θ) − κ(θ)e h(θ) h(θ) κ(θ)e − κ(θ)e = 0 .
That 0 ≤ qeij ≤ 1 follows from the inequality qb ≤ 1, 1 + q(b − 1)
2
0 ≤ q ≤ 1, 0 < b < ∞ .
b e t [α] is Proof of Theorem 4.11. First note that the ijth element of F (θ)
e i [eαSt ; Jt = j] = Ei [Lt eαSt ; Jt = j] = E
hj
(θ)
hi
e−tκ(θ) Ei [e(α+θ)St ; Jt = j].
In matrix notation, this means that b b t [α + θ]∆ (θ) . e t [α] = e−tκ(θ) ∆−1(θ) F F h h
(4.5)
4. MARKOV ADDITIVE PROCESSES
61
e follows Consider first the discrete time case. Here the stated formula for P immediately by letting t = 1, α = 0 in (4.5). Further Feij (dx)
ei (Y1 ∈ dx, J1 = j) = Ei [Lt ; Y1 ∈ dx, J1 = j] = P (θ)
hj
=
(θ)
hi
(θ)
e
θx−κ(θ)
Pi (Y1 ∈ dx, J1 = j) =
hj
(θ)
hi
eθx−κ(θ) Fij (dx).
This shows that Feij is absolutely continuous w.r.t. Fij with a density propore ij and Hij ; since H e ij , Hij are tional to eθx . Hence the same is true for H b ij [θ]. probability measures, it follows that indeed the normalizing constant is H Similarly, in continuous time (4.5) yields f
etK[α] = ∆−1 et(K[α+θ]−κ(θ)I) ∆h(θ) . h(θ) By a general formula (A.13) for matrix-exponentials, this implies f K[α] = ∆−1 (K[α + θ] − κ(θ)I)∆h(θ) = ∆−1 K[α + θ]∆h(θ) − κ(θ)I. h(θ) h(θ) e Letting α = 0 yields the stated expression for Λ. Now we can write ¡ ¢ f e + ∆−1(θ) K[α + θ] − K[θ] ∆ (θ) K[α] = Λ h h ³h ¡ ¢ ¡ ¢´ j e + κ(i) (α + θ) − κ(i) (θ) bij [α + θ] − B bij [θ] . Λ + λ q B ij ij diag (θ) hi (θ)
=
That κ(i) (α + θ) − κ(i) (θ) corresponds to the stated parameters µei , σ ei2 , νei (dx) of a L´evy process follows from Theorem 3.8. Finally note that by (4.4), (θ)
hj
(θ) hi
λij qij
¡
bij [α + θ] − B bij [θ] B
¢
(θ)
=
hj
(θ) hi
¢ ¡b e ij [α] − 1 bij [θ] B λij qij B
¡b ¢ eij qeij B e ij [α] − 1 . = λ 2
Notes and references The earliest paper on treatment of MAP’s in the present spirit we know of is Nagaev [654]. Much of the pioneering was done in the sixties in papers like Keilson & Wishart [524, 525, 526] and Miller [642, 643, 644] in discrete time; the literature on the continuous time case tends more to deal with special cases. Though the literature on MAP’s is extensive, there is, however, hardly a single comprehensive treatment; an extensive bibliography on aspects of the theory can be found in Asmussen [58].
62
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
Conditions for analogues of Corollary 4.3 for an infinite E are given by Ney & Nummelin [657]. For the Wald identity in Corollary 4.6, see also Fuh & Lai [380] and Moustakides [651]. The closest reference on exponential families of random walks on a Markov chain we know of within the more statistical oriented literature is H¨ oglund [477], which, however, is slightly less general than the present setting.
5
The ladder height distribution
We consider the claim surplus process {St } of a risk process with jumps Ui , interclaim times Ti > 0 and premium rate 1 (but note that no independence or Poisson assumptions are made). As usual, τ (u) = inf {t > 0 : St > u} is the time to ruin. In the particular case u = 0, write τ+ = τ (0) and define the associated ladder height Sτ+ and ladder height distribution by G+ (x) = P(Sτ+ ≤ x) = P(Sτ+ ≤ x, τ+ < ∞). Note that G+ is concentrated on (0, ∞), i.e. has no mass on (−∞, 0], and is typically defective, kG+ k = G+ (∞) = P(τ+ < ∞) = ψ(0) < 1 when η > 0 (there is positive probability that {St } will never come above level 0). M 6 Sτ+ (2) Sτ+ = Sτ+ (1) -
Figure III.2 The term ladder height is motivated from the shape of the process {Mt } of relative maxima, see Fig. III.2. The first ladder step is precisely Sτ+ , and the maximum M is the total height of the ladder, i.e. the sum of all the ladder steps (if η > 0, there are only finitely many). In Fig. III.2, the second ladder point is Sτ+ (2) where τ+ (2) is the time of the next relative maximum after τ+ (1) = τ+ ,
5. THE LADDER HEIGHT DISTRIBUTION
63
the second ladder height (step) is Sτ+ (2) − Sτ+ (1) and so on. In simple cases like the compound Poisson model, the ladder heights are i.i.d., a fact which turns out to be extremely useful. In other cases like the Markovian environment model, they have a semi-Markov structure (but in complete generality, the dependence structure seems too complicated to be useful). In any case, at present we concentrate on the first ladder height. The main result of this section is Theorem 5.5 below, which gives an explicit expression for G+ in a very general setting, where basically only stationarity is assumed. To illustrate the ideas, we shall first consider the compound Poisson model in the notation of Example II.3.2. Recall that B(x) = 1 − B(x) denotes the tail of B. Theorem 5.1 For the compound Poisson model with ρ = βµB < 1, G+ is given by the defective density g+ (x) = βB(x) = ρb0 (x) on (0, ∞). Here b0 (x) = B(x)/µB . For the proof of Theorem 5.1, define the pre-τ+ -occupation measure R+ by Z ∞ Z τ+ R+ (A) = E I(St ∈ A, τ+ > t) dt = E I(St ∈ A) dt. 0
0
The interpretation of R+ (A) is as the expected time {St } spends in the set A before τ+ . Thus, R+ is concentrated on (−∞, 0], i.e., has no mass on (0, ∞). Also, by approximation with step functions, it follows that for g ≥ 0 measurable, Z
Z
0
τ+
g(y)R+ (dy) = E −∞
g(St ) dt.
(5.1)
0
Lemma 5.2 R+ is the restriction of the Lebesgue measure to (−∞, 0]. Proof. Let T be fixed and define St∗ = ST − ST −t , 0 ≤ t ≤ T . That is, {St∗ }0≤t≤T is constructed from {St }0≤t≤T by time-reversion and hence, since the distribution of the Poisson process is invariant under time reversion, has the same distribution as {St }0≤t≤T , see Fig. III.3. Thus, P(ST = = = =
∈ A, τ+ > T ) P(ST ∈ A, St ≤ 0, 0 ≤ t ≤ T ) P(ST∗ ∈ A, ST∗ ≤ ST∗ −t , 0 ≤ t ≤ T ) P(ST∗ ∈ A, ST∗ ≤ St∗ , 0 ≤ t ≤ T ) P(ST ∈ A, ST ≤ St , 0 ≤ t ≤ T ).
(5.2)
64
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
Figure III.3(a): τ+ > t
Figure III.3(b): τ+ ≤ t
Integrating w.r.t. dT , it follows that R+ (A) is the expected time when ST is in A and at a minimum at the same time. But since St → −∞ a.s., this is just the Lebesgue measure of A, cf. Fig. III.4 where the bold lines correspond to minimal values. 2
Lemma 5.3 G+ is the restriction of βR+ ∗B to (0, ∞). That is, for A ⊆ (0, ∞), Z
0
G+ (A) = β
B(A − y)R+ (dy) . −∞
5. THE LADDER HEIGHT DISTRIBUTION
65
6 -
A
Figure III.4 © Proof.ª A jump of {St } at time t and of size U contributes to the event Sτ+ ∈ A precisely when τ+ ≥ t, U + St− ∈ A. The probability of this given {Su }u
∞
= 0
Z
£ ¤ β dt E B(A − St− ); τ+ ≥ t
∞
= β
£ ¤ E B(A − St ); τ+ > t dt
0
Z
Z
τ+
= βE
0
g(St ) dt = β 0
g(y)R+ (dy) −∞
where g(y) = B(A − y) (here we used the fact that the probability of a jump at t is zero in the second step, and (5.1) in the last). 2 Proof of Theorem 5.1. With r+ (y) = I(y < 0) denoting the density of R+ , Lemma 5.3 yields Z ∞ Z ∞ g+ (x) = β r+ (x − z) B(dz) = β I(x < z) B(dz) = βB(x). 0
0
2 Generalizing the set-up, we consider the claim surplus process {St∗ }t≥0 of a risk reserve process in a very general set-up, assuming basically stationarity in time and space, © ∗ ª D St+s − Ss∗ t≥0 = {St∗ }t≥0 (5.3) for all s ≥ 0. The sample path structure is assumed to be as for the compound Poisson case: {St∗ } is generated from interclaim times Tk∗ and claim sizes Uk∗
66
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
according to premium 1 per unit time, i.e. ∗
St∗
=
Nt X
Uk∗ − t
where Nt∗ = max {k = 0, 1, . . . : T1∗ + · · · + Tk∗ ≤ t} .
k=1 ∗ The first ladder epoch τ+ is defined as inf {t > 0 : St∗ > 0} and the corresponding ladder height distribution is ¡ ¢ ¡ ¢ ∗ <∞ . G∗+ (A) = P Sτ∗+∗ ∈ A = P Sτ∗+∗ ∈ A, τ+
The traditional representation of the input sequence {(Tk∗ , Uk∗ )}k=1,2,... is as a marked point process M ∗ , i.e. as a point process on [0, ∞) × (0, ∞). The points in the plane (marked by × on Fig. III.5) are (σk∗ , Uk∗ ) (k = 1, 2, . . .) where σk∗ = T1∗ + · · · + Tk∗ , the first component representing time (the arrival time σk∗ ) and the second the mark (the claim size Uk∗ ). The marked point process M ∗ ◦ θs shifted by s is defined the obvious way, cf. Fig. III.5 (the points in the plane are (σk∗ − s, Uk∗ ) for those k for which σk∗ − s ≥ 0). We call M ∗ stationary if M ∗ ◦ θs has the same distribution as M ∗ for all s ≥ 0; obviously, this is equivalent to the risk process {St∗ } being stationary in the sense of (5.3). In the stationary case, we define the arrival rate as β = E# {k : σk∗ ∈ [0, h]} /h (by stationarity, this does not depend on h).
×
×
M∗
× × U∗ 2 U1∗ σ1∗
0
σ2∗
U3∗
×
× × ×
×
M ∗ ◦ θs
×
×
× ×
×
× 0
-
s
× U3∗
×
×
-
Figure III.5
Given a stationary marked point process M ∗ , we define its Palm version M as a marked point process having the conditional distribution of M ∗ given an
5. THE LADDER HEIGHT DISTRIBUTION
67
arrival at time 0, i.e. σ1∗ = 0. We represent M by the sequence (Tk , Uk )k=1,2,... where T1 = 0, and let T = T2 denote the first proper interarrival time. The two fundamental formulas connecting M ∗ and M are Eϕ(M) = Eϕ(M ∗ ) =
1 E βh
X
ϕ(M∗ ◦ θσk∗ ),
(5.4)
∗ ∈[0,h] k: σk
1 E ET
Z
T
ϕ(M ◦ θt ) dt, 0
where T is the first arrival time > 0 of M and h > 0 an arbitrary constant (in the literature, most often one takes h = 1). As above, the r.h.s. of (5.4) does not depend on h; letting h ↓ 0, βh becomes the approximate probability P(σ1∗ ≤ h) of an arrival in [0, h] and the sum approximately ϕ(M ∗ )I(σ1 ≤ h). This more or less gives a proof that indeed (5.4) represents the conditional distribution of M ∗ given σ1∗ = 0. Note also that (again by stationarity) the Palm distribution also represents the conditional distribution of M∗ ◦ θt given an arrival at time t. See, e.g., Sigman [812] or [APQ, VII.6] for these and further aspects of Palm theory. Example 5.4 Consider a finite Markov additive process (cf. Section 4) which has pure jump structure corresponding to µi = σi2 = 0, νi (dx) = βi Bi (dx). Assume {Jt } irreducible so that a stationary distribution π = (πi )i∈E exists. Interpreting jump times as arrival times and jump sizes as marks, we get a marked point process generated by Poisson arrivals at rate βi and mark distribution Bi when Jt = i, and by some additional arrivals which occur w.p. qij when {Jt } jumps from i to j and have mark distribution Bij . A stationary marked point process M∗ is obtained by assigning J0 distribution π. If Jt− = i, an arrival for M∗ occurs before time t + dt w.p. n o X dt βi + λij qij . j6=i
Thus the arrival rate for M∗ is o X n X β = πi βi + λij qij . i∈E
j6=i
Given that an arrival occurs at time t, the probability αij of Jt− = i, Jt = j is πi βi /β for i = j and πi λij qij /β for i 6= j. It follows that we can describe the Palm version M as follows. First choose (J0− , J0 ) w.p. αij for (i, j) and let the initial mark U1 have distribution Bi when i = j and Bij otherwise. After that, let the arrivals and their marks be generated by {Jt } starting from J0 = j.
68
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
Note in particular that the Palm distribution of the mark size (i.e., the distribution of U1 ) is the mixture o o X Xn X X πi n B = αij Bij = βi Bi + λij qij Bij . αii Bi + β i∈E
i∈E
j6=i
j6=i
2 Theorem 5.5 Consider a general stationary claim surplus process {St∗ }t≥0 , let U0 be a r.v. having the Palm distribution of the claim size and F (x) = P(U0 ≤ x) its distribution. Assume that St∗ → −∞ a.s. and that ρ = βEU0 < 1. Then the ∗ ladder height distribution G∗+ is given by the (defective) density g+ (x) = βF (x). Before giving the proof, we note: Corollary 5.6 Under the assumptions of Theorem 5.5, the ruin probability ψ ∗ (0) with initial reserve u = 0 is ρ = βEU0 . This follows by noting that Z ∗
ψ (0) =
kG∗+ k
= 0
∞
Z ∗ g+ (x) dx
By (5.4), ψ ∗ (0) = E
∞
F (x) dx = βEU0 .
= β 0
X
Uk∗ ;
∗ ∈[0,1] k: σk
here the r.h.s. has a very simple interpretation as the average amount of claims received per unit time. The result is notable by giving an explicit expression for ruin in great generality and by only depending on the parameters of the model through the arrival rate β and the average (in the Palm sense) claim size EU0 . The last property is referred to as insensitivity in the applied probability literature. Proof of Theorem 5.5. A standard argument for stationary processes ([199, p. 105]) shows that one can assume w.l.o.g. that M ∗ and M have doubly infinite time (i.e., are point processes on (−∞, ∞) × (0, ∞)). We then represent M by the mark (claim size) U0 of the arrival at time 0, the arrival times 0 < σ1 < σ2 < . . . in (0, ∞) and the arrival times 0 > σ−1 > σ−2 > . . . in (−∞, 0); the mark at time σk is denoted by Uk . Let p(t) be the conditional probability that Sτ∗+ ∈ A, τ+ = t given the event At that an arrival at t occurs. Then clearly Z ∞ G∗+ (A) = P(Sτ∗+ ∈ A) = p(t)β dt . 0
5. THE LADDER HEIGHT DISTRIBUTION
69
© ª Consider a process S˘t t≥0 , which makes an upwards jump at time −σ−k (k = 1, 2, . . .), moves down linearly at a unit rate in between jumps and starts from S˘0 = U0 . © ª © ª Now conditionally upon At , Su∗ 0≤u≤t is distributed as a process Seu∗ 0≤u≤t where a claim arrives at time t and has size U0 , and the kth preceding claim arrives timeª t − σ−k and has size U−k . The sample path relation between © ∗ ª at © ∗ e (left limit) when 0 ≤ u ≤ t and is Su and S˘u amounts to S˘u = Set∗ − Set−u− illustrated on Fig. III.6. It follows that for A ⊆ (0, ∞) ¯ ¢ ¡ = P St∗ ∈ A, Su∗ ≤ 0, 0 < u < t ¯ At ¡ ¢ ∗ = P St∗ ∈ A, Su− ≤ 0, 0 < u < t | At ¡ ¢ ∗ = P Set∗ ∈ A, Seu− ≤ 0, 0 < u < t ¡ ¢ = P S˘t ∈ A, S˘t ≤ S˘t−u , 0 < u < t ¡ ¢ = P S˘t ∈ A, S˘t ≤ S˘u , 0 < u < t ¡ ¢ ˘t , = P S˘t ∈ A; M
p(t)
© ª © ª ˘ t = S˘t ≤ S˘u , 0 < u < t is the event that S˘u has a relative minimum where M at t. In Fig. III.6, time instants corresponding © ª to such minimal values have been marked with bold lines in the path of S˘t , and we let L(dy) be the random R∞ ˘ t ) dt. measure L(A) = 0 I(S˘t ∈ A; M Since S˘0 = U0 , the support of L has right endpoint U0 , and since by assumption St∗ → −∞ a.s., t → ∞, the left endpoint of the support is −∞. A sample path inspection just as in the proof of Lemma 5.2 therefore immediately shows that L(dy) is Lebesgue measure on (−∞, U0 ], cf.©Fig. ª III.6 where the boxes on the time axis correspond to time intervals where S˘t is at a minimum belong© ª ing to A and split A into pieces corresponding to segments where S˘u is at a relative minimum. Thus, Z G∗+ (A)
∞
= β
P(S˘t ∈ A; Mt ) dt = βEL(A)
0
Z ∞ Z = βE I(U0 > y)I(y ∈ A) dy = β P(U0 > y) dy A Z −∞ = β F (y) dy. A
2
70
CHAPTER III. FURTHER GENERAL TOOLS AND RESULTS
6
6 n o Seu∗
U−1
0≤u≤t
U0
A
U0 I
6 t
t n o S˘u
u≥0
U−1
Figure III.6 Notes and references Theorem 5.5 is due to Schmidt & co-workers [102, 372, 648] (a special case of the result appears in Proposition VII.2.1). A further relevant reference related to Corollary 5.6 is Bj¨ ork & Grandell [170]. Two alternative somewhat simpler approaches to prove Theorem 5.1 will be given in Chapter IV (after Theorem IV.2.1 and in Remark IV.3.6).
Chapter IV
The compound Poisson model We consider throughout this chapter a risk reserve process {Rt }t≥0 in the terminology and notation of Chapter I, and assume that • {Nt }t≥0 is a Poisson process with rate β. • the claim sizes U1 , U2 , . . . are i.i.d. with common distribution B, say, and independent of {Nt }. • the premium rate is p = 1. Thus, {Rt } and the associated claims surplus process {St } are given by Rt = u + t −
Nt X
Ui ,
St = u − Rt =
i=1
Nt X
Ui − t.
i=1
An important omission of the discussion in this chapter is the numerical evaluation of the ruin probability. Some possibilities are numerical Laplace transform inversion via Corollary 3.4 below, exact matrix-exponential solutions under the assumption that B is phase-type (see further IX.3), Panjer’s recursion (Corollary XVI.2.6) and simulation methods (Chapter XV). For finite horizon ruin probabilities, see Chapter V. It is worth mentioning that much of the analysis of this chapter can be carried over in a direct way to more general L´evy processes, see Chapter XI. 71
72
1
CHAPTER IV. THE COMPOUND POISSON MODEL
Introduction
For later reference, we shall start by giving the basic formulas for moments, cumulants, m.g.f.’s etc. of the claim surplus St = u − Rt . Write (n)
(1)
µB = EU n , µB = µB = EU, ρ = βµB = 1/(1 + η) . Proposition 1.1 (a) ESt = t(βµB − 1) = t(ρ − 1); (2) (b) Var St = tβµB ; ¡ ¢ b − 1 − r; (c) EerSt = etκ(r) where κ(r) = β B[r] (k) (d) The kth cumulant of St is tβµB for k ≥ 2. Proof. It was noted in Chapter I that ρ − 1 is the expected claim surplus per unit time, and this immediately yields (a). A more formal proof goes as follows: ESt
=
E
Nt X
Uk − t = E E
Nt hX
k=1
=
¯ i ¯ Uk ¯ Nt − t
k=1
E[Nt µB ] − t = βtµB − t = t(ρ − 1).
The same method yields also the variance as Var St
=
Var
Nt X
Nt Nt ¯ i ¯ i hX hX ¯ ¯ Uk = Var E Uk ¯ Nt + E Var Uk ¯ Nt
k=1
=
k=1
Var [Nt µB ] + E[Nt Var U ] =
k=1
tβµ2B
(2)
+ tβVar U = tβµB .
For (c), we get EerSt
= =
e−rt e−rt
∞ X k=0 ∞ X k=0
Eer(U1 +···+Uk ) P(Nt = k) k
b k · e−βt (βt) B[r] k!
© ª b = exp −rt − βt + B[r]βt = etκ(r) .
Finally, for (d) just note that the kth cumulant of St is tκ(k) (0), where κ(k) (0) b (k) [0] = µ(k) . is the kth derivative of κ at 0, and that B 2 B The linear way the index t enters in the formulas in Proposition 1.1 is the same as if {St } was a random walk indexed by t = 0, 1, 2, . . . The connections to random walks are in fact fundamental, and there are at least two ways to exploit this:
1. INTRODUCTION
73
Recalling that σk is the time of the kth claim, we have Sσk −Sσk−1 = Uk −Tk , where Tk is the time between the kth and the (k − 1)th claim. Obviously, the Uk − Tk are i.i.d. so that {Sσk } is a random walk with mean EU − ET = EU −
1 βEU − 1 = = −ηµB β β
where η is the safety loading. In this way, we get a discrete time random walk imbedded in the claim surplus process {St }, which is often used in the literature for obtaining information about {St } and the ruin probabilities. For example, obviously ψ(u) = P(maxk Sσk > u). We return to this approach in Chapter VI. The point of view in the present chapter is, however, rather to view {St } directly as a random walk in continuous time, meaning that the increments are stationary and independent, cf. III.3, so we have a L´evy process. Here is one immediate application: Proposition 1.2 (drift and oscillation) a.s. (a) No matter the value of η, St /t → ρ − 1 as t → ∞; a.s. (b) If η < 0, then St → ∞; a.s. (c) If η > 0, then St → −∞; (d) If η = 0, then lim inf t→∞ St = −∞, lim supt→∞ St = ∞. For the proof, we need the following lemma: Lemma 1.3 If nh ≤ t ≤ (n + 1)h, then Snh − h ≤ St ≤ S(n+1)h + h. Proof. We first note that for u, v ≥ 0, Su+v ≥ Su − v. Indeed, Su+v − Su attains its minimal value when there are no arrivals in (u, u + v], and the value is then precisely v. In particular, if t = nh + v with 0 ≤ v ≤ h, then St ≥ Snh − v ≥ Snh − h. The inequality on the right in (1.3) is proved similarly.
2
Proof of Proposition 1.2. For any fixed h, {Snh }n=0,1,... is a discrete time random a.s.
walk, and hence by the strong law of large numbers, Snh /n → ESh = h(ρ − 1).
74
CHAPTER IV. THE COMPOUND POISSON MODEL
Thus using Lemma 1.3, we get lim inf t→∞
St t
inf
St t
=
lim inf
≥
1 Snh − h 1 lim inf = ESh = ρ − 1. h n→∞ n h
n→∞ nh≤t≤(n+1)h
A similar argument for lim sup proves (a), and (b), (c) are immediate consequences of (a). Part (d) follows by a (slightly more intricate) general random walk result ([APQ, pp. 224–225]) stating that lim inf n→∞ Snh = −∞, lim supn→∞ Snh = ∞ (Lemma 1.3 is not needed for (d)). 2 Corollary 1.4 The ruin probability ψ(u) is 1 for all u when η ≤ 0, and < 1 for all u when η > 0. Proof. The case of η ≤ 0 is immediate since then M = ∞ by Proposition 1.2. If η > 0, it suffices to prove ψ(0) = P(M > 0) < 1. However, if P(M > 0) = 1, then {St } upcrosses level 0 a.s. at least once. Considering the next downcrossing (which occurs w.p. 1 since St → −∞) and repeating the argument, it is seen that upcrossing occurs at least twice, hence by induction i.o. This contradicts St → −∞. 2 There is also a central limit version of Proposition 1.2: ¡ ¢ √ Proposition 1.5 The limiting distribution of St − t(ρ − 1) / t as t → ∞ is (2) normal with mean zero and variance βµB . Proof. Since {St }t≥0 is a L´evy process (a random walk in continuous time), {Snh }n=0,1,... is a discrete-time random walk for any h > 0, and hence it follows (2)
from standard central limit theory and the expression Var(St ) = tβµB (Proposition 1.1(b)) that the assertion holds as t → ∞ through values of the form t = 0, h, 2h . . .. The general case now follows either by another easy application of Lemma 1.3, or by a general result on discrete skeletons ([APQ, p. 415]). 2 Remark 1.6 Often it is of interest to consider size-fluctuations, where the size of the portfolio at time t is M (t). Assuming that each risk generates claims at Poisson intensity β and pays premium 1 per unit time, this case can be reduced to the compound Poisson R s model by an easy operational time transformation T −1 (t) where T (s) = β 0 M (t)dt (this was already pointed out by Lundberg [614], see also [11] for an overview). 2 Notes and references All material of the present section is standard.
2. THE POLLACZECK-KHINCHINE FORMULA
2
75
The Pollaczeck-Khinchine formula
The time to ruin τ (u) was already defined in Chapter I as inf {t > 0 : St > u}, and we shall here exploit the decomposition of the maximum M as sum of ladder heights, cf. Fig. III.2. We assume throughout η > 0 or, equivalently, ρ < 1. It is crucial to note that for the compound Poisson model, the ladder heights are i.i.d. This follows simply by noting that the process repeats itself after reaching a relative maximum. The decomposition of M as a sum of ladder heights now yields: ∞ ¡ ¢X Theorem 2.1 The distribution of M is 1 − kG+ k G∗n + , where G+ is given n=0
by the defective density g+ (x) = βB(x) = ρb0 (x) on (0, ∞). Here b0 (x) = B(x)/µB . The formula for g+ was already obtained in Theorem III.5.1, but before showing the rest of Theorem 2.1, we give an alternative argument which is short and intuitive, but also slightly heuristical: Proof of g+ (x) = βB(x): Assume B has a density b. Note that if there is a claim arrival before dt, then Sτ+ ∈ (u, u + du] occurs precisely when the claim has size u. Hence the contribution to g+ (u) from this event is b(u)β dt. If there are no claim arrivals before dt, consider the process {Set }t≥0 where Set = St+dt − Sdt = St+dt + dt. For Sτ+ ∈ (u, u + du] to occur, Se must either have its first ladder point equal to u + dt or v ∈ (0, dt], and in the latter case the process starting from v must have its first ladder point equal to u + v, i.e. the probability is R dt g+ (v)g+ (u + v) dv. Collecting all first order terms, it follows that, 0 g+ (u)
0 g+ (u)
¡ ¢ = b(u)β dt + (1 − β dt) g+ (u + dt) + g+ (0)g+ (u) dt + o(dt) ¡ ¢ 0 = b(u)β dt + (1 − β dt) g+ (u) + g+ (u) dt + g+ (0)g+ (u) dt + o(dt) ¡ ¢ 0 = g+ (u) + dt −βg+ (u) + g+ (u) + βg+ (0)g+ (u) + βb(u) + o(dt) , ¡ ¢ = β − g+ (0) g+ (u) − βb(u) . (2.1)
Integrating from 0 to x gives ¡ ¢ g+ (x) = g+ (0) + β − g+ (0) P(Sτ+ ≤ x, τ+ < ∞) − βB(u) . Letting x → ∞ and assuming (heuristical but reasonable!) that then g+ (x) → 0, we get ¡ ¢ ¡ ¢ 0 = g+ (0) + β − g+ (0) P(τ+ < ∞) − β = − β − g+ (0) P(τ+ = ∞) .
76
CHAPTER IV. THE COMPOUND POISSON MODEL
Since P(τ+ = ∞) > 0 because of the assumption of a positive loading, we 0 therefore have g+ (0) = β. Thus (2.1) simply means g+ (u) = −βb(u), and the solution satisfying g+ (0) = β is g+ (u) = βB(u). 2 Proof of Theorem 2.1. The probability that M is attained in precisely n ladder steps and does not exceed x is G∗n + (x)(1 − kG+ k) (the parenthesis gives the probability that there are no further ladder steps after the nth). Summing over n, the formula for the distribution of M follows. 2 Alternatively, we may view the ladder heights as a terminating renewal process and M becomes then the lifetime. Combined with ψ(u) = P(M > u), Theorem 2.1 provides a representation formula for ψ(u), which we henceforth refer to as the Pollaczeck-Khinchine formula. Note that the integrated tail distribution B0 with density b0 is familiar from renewal theory as the limiting stationary distribution of the overshoot (forward recurrence time), see [APQ, V.3–4] or A.1e. Thus, we can rewrite the Pollaczeck-Khinchine formula as ψ(u) = P(M > u) = (1 − ρ)
∞ X
∗n
ρn B 0 (u) ,
(2.2)
n=1
representing the distribution of M as a geometric compound. As a vehicle for computing ψ(u), (2.2) is not entirely satisfying because of the infinite sum of convolution powers, but we shall be able to extract substantial information from the formula, nevertheless. The following result generalizes the fact that the conditional distribution of the deficit Sτ (0) just after ruin given that ruin occurs (i.e., that τ (0) < ∞) is B0 : taking y = 0 shows that the conditional distribution of the risk reserve immediately before ruin (i.e. −Sτ (0)− ) is again B0 , and we further get information about the joint conditional distribution of this quantity and the deficit. Note that this distribution is the same as the limiting joint distribution of the age and excess life in a renewal process governed by B, cf. Theorem A1.5. Theorem 2.2 The joint distribution of (−Sτ (0)− , Sτ (0) ) is given by the following four equivalent statements: Z ∞ ¡ ¢ (a) P −Sτ (0)− > x, Sτ (0) > y; τ (0) < ∞ = β B(z) dz; x+y
(b) the joint distribution of (−Sτ (0)− , Sτ (0) ) given τ (0) < ∞ is the same as the distribution of (V W, (1 − V )W ) where V, W are independent, V is uniform on (0, 1) and W has distribution FW given by dFW /dB(x) = x/µB ; (c) the marginal distribution of −Sτ (0)− is B0 , and the conditional distribution (y)
of Sτ (0) given −Sτ (0)− = y is the overshoot distribution B0
(y)
given by B0 (z) =
2. SPECIAL CASES OF POLLACZECK-KHINCHINE
77
B0 (y + z)/B0 (y); (d) the marginal distribution of Sτ (0)− is B0 , and the conditional distribution of (z) −Sτ (0)− given Sτ (0)− = z is B0 . The proof is given in V.2 and it gives an alternative derivation of the distribution of the deficit Sτ (0) . Notes and references The Pollaczeck-Khinchine formula is standard in queueing theory, see for example [APQ], Feller [362] or Wolff [894]. The proof of Theorem III.5.1 is traditionally carried out for the imbedded discrete time random walk, where it requires slightly more calculation. As shown in Theorem III.5.5, the form of G+ is surprisingly insensitive to the form of {St } and holds in a certain general marked point process set-up. However, in this setting there is no decomposition of M as a sum of i.i.d. ladder heights so that the results do not appear too useful for estimating ψ(u) for u > 0. Theorem 2.2(a) is from Dufresne & Gerber [333]. Again, there is a general marked point process version, cf. Asmussen & Schmidt [103]. For the study of the joint distribution of the surplus Sτ (u)− just before ruin and the deficit Sτ (u) at ruin, see Schmidli [773] and references therein. In Chapter XII these results will be generalized in various directions. In risk theory literature, the Pollaczeck-Khinchine formula is often referred to as Beekman’s convolution formula, cf. Beekman [152, 153].
3
Special cases of the Pollaczeck-Khinchine formula
The model and notation is the same as in the preceding sections. We assume η > 0 throughout.
3a
The ruin probability when the initial reserve is zero
The case u = 0 is remarkable by giving a formula for ψ(u) which depends on the claim size distribution only through its mean: Corollary 3.1 ψ(0) = ρ = βµB =
1 . 1+η
Proof Recall that τ+ = τ (0) and note that Z
∞
ψ(0) = P(τ+ < ∞) = kG+ k = β
B(x) dx = βµB . 0
2
78
CHAPTER IV. THE COMPOUND POISSON MODEL
Notes and references The fact that ψ(u) only depends on B through µB is often referred to as an insensitivity property. As shown in III.6, the formula for ψ(0) holds in a more general setting; a slightly modified version also holds for certain two-sided jumps, cf. Section XII.4. A further relevant reference is Bj¨ ork & Grandell [170].
3b
Exponential claims
Corollary 3.2 If B is exponential with rate δ, then ψ(u) = ρ e−(δ−β)u . Proof The distribution B0 of the ascending ladder height (given that it is defined) is the distribution of the overshoot of {St } at time τ+ over level 0. But claims are exponential, hence without memory, and so this overshoot has the same distribution as the claims themselves. I.e., B0 is exponential with rate δ and the result can now be proved from the Pollaczeck-Khinchine formula by elementary calculations. Thus, B0∗n is the Erlang distribution with n phases and the density of M at x > 0 is (1 − ρ)
∞ X n=1
ρn
δ n xn−1 −δx e = (1 − ρ)ρδe−δ(1−ρ)x = ρ(δ − β)e−(δ−β)x . (n − 1)!
Integrating from u to ∞, the result follows. Alternatively, use Laplace transforms. The result can, however, also be seen probabilistically without summing infinite series. Let λ(x) be the failure rate of M at x > 0. For a failure at x, the current ladder step must terminate which occurs at rate δ and there must be no further ones which occurs w.p. 1 − ρ. Thus λ(x) = δ(1 − ρ) = δ − β so that the conditional distribution of M given M > 0 is exponential with rate δ − β and ¯ ¡ ¢ ψ(u) = P(M > u) = P(M > 0) P M > u ¯ M > 0 = ρe−(δ−β)u . 2 In IX.3, we show that expressions for ψ(u) which are explicit (up to matrix exponentials) come out in a similar way also when B is phase-type. E.g. (Example IX.3.2), if β = 3 and B is a mixture of two exponential distributions with rates 3 and 7, and weights 1/2 for each, then ψ(u) =
24 −u 1 e + e−6u . 35 35
(3.1)
For heavy-tailed B, we use the Pollaczeck-Khinchine formula in Chapter X to show that ρ ψ(u) ∼ B 0 (u), u → ∞. 1−ρ
3. SPECIAL CASES OF POLLACZECK-KHINCHINE
79
Notes and references Corollary 3.2 is one of the main classical early results in the area. A variety of proofs are available. We mention in particular the following: (a) check that ψ(u) = ρ e−(δ−β)u is the solution of the renewal equation (3.2) below; (b) use stopped martingales, cf. II.3.
3c
Some classical analytical results
Recall the notation G+ (u) =
R∞ u
G+ (dx).
Corollary 3.3 The ruin probability ψ(u) satisfies the defective renewal equation Z ∞ Z u ψ(u − y)βB(y) dy. (3.2) ψ(u) = G+ (u) + G+ ∗ ψ(u) = β B(y) dy + u
0
Equivalently, the survival probability φ(u) = 1 − ψ(u) satisfies the defective renewal equation Z u φ(u) = 1 − ρ + G+ ∗ φ(u) = 1 − ρ + φ(u − y)βB(y) dy. (3.3) 0
Proof Write ψ(u) as P(M > u) = P(Sτ+ > u, τ+ < ∞) + P(M > u, Sτ+ ≤ u, τ+ < ∞). Then the first term on the r.h.s. is G+ (u), and conditioning upon Sτ+ = y yields P(M > u, Sτ+ ≤ u, τ+ < ∞) Z u Z = P(M > u − y)G+ (dy) = 0
u
ψ(u − y)G+ (dy) .
0
For the last identity in (3.2), just insert the explicit form of G+ . The case of (3.3) is similar (equivalently, (3.3) can be derived by elementary algebra from (3.2)). 2 Corollary 3.4 The Laplace transform of the ruin probability is Z
∞
e−su ψ(u)du =
0
b β − β B[−s] − ρs . b s(β − s − β B[−s])
(3.4)
c0 of B0 as Proof. We first find the m.g.f. B Z c0 [r] = B 0
∞
eru
B(u) du = µB
Z
∞ 0
b −1 eru − 1 B[r] B(du) = . rµB rµB
(3.5)
80
CHAPTER IV. THE COMPOUND POISSON MODEL
Hence Ee
rM
=
(1 − ρ)
∞ X
c0 [r]n = ρn B
n=0
Z
∞
Z e−su ψ(u)du =
0
∞
(1 − ρ)r 1−ρ = , (3.6) b b 1 − ρB0 [r] r + β − β B[r]
e−su P(M > u)du =
0
=
´ 1³ (1 − ρ)s 1+ , b s β − s − β B[−s]
1 (1 − Ee−sM ) s
which is the same as (3.4).
2
Corollary 3.5 The first two moments of M are Z
∞
EM = 0
(2)
ρµB ψ(u) du = , 2(1 − ρ)µB
(3)
EM
2
(2)2
β 2 µB ρµB = + . (3.7) 3(1 − ρ)µB 2(1 − ρ)2
Proof. This can be shown, for example, by analytical manipulations (L’Hˆopital’s rule) from (3.6). We omit the details (see, e.g., [APQ, p. 237]). 2 Remark 3.6 As mentioned in the Notes below, one can also derive (3.2) by analytical techniques. At the same time, (3.4) follows from (3.2) directly by taking Laplace transforms and noting that the Laplace transform of a convolution of two functions is the product of their Laplace transforms. The Laplace transform of the survival probability φ(u) correspondingly is Z ∞ 1−ρ b φ[−s] = e−su φ(u)du = . b s − β(1 − B[−s]) 0 This can now be used to provide yet another more analytical proof of the ladder height density for a compound Poisson process. From φ(u) = P(M ≤ u) (or from (3.5)) one sees that Z ∞ (1 − ρ)s −sM Ee = φ(0) + e−su φ0 (u) du = . b s − β(1 − B[−s]) 0 On the other hand, as a sum of i.i.d. ladder heights, M is a geometric com¡ ¢ d + [−s]/ρ)N and N is geometric(1 − ρ), leading to pound with E(e−sM ) = E (G ¡ ¢ d + [−s] . A comparison of those two representations for Ee−sM = (1 − ρ)/ 1 − G d + [−s] = β (1 − B[−s])/s, b Ee−sM now gives G so that g+ (x) = ρ b0 (x). 2
3. SPECIAL CASES OF POLLACZECK-KHINCHINE
81
Notes and references Corollary 3.3 is standard, see e.g. [APQ, pp. 144–145] or Feller [362]. The approach there is to condition upon the first claim occurring at time t and having size x, which yields the survival probability as Z ∞ Z u+t φ(u) = βe−βt dt φ(u + t − x)B(dx), 0
0
from which (3.3) can be derived by elementary but tedious manipulations (in Section XII.3 a formal procedure will be discussed that is applicable in much more general models). Of course, it is not surprising that such arguments are more cumbersome since the ladder height representation is not used. Also (3.6) and Corollary 3.5 can be found in virtually any queueing book. In fact, either of these sets of formulas are what many authors call the Pollaczeck-Khinchine formula. In view of (3.4), numerical inversion of the Laplace transform is one of the classical approaches for computing ruin probabilities, see e.g. Abate & Whitt [2], Embrechts, Gr¨ ubel & Pitts [346], Gr¨ ubel [438], Thorin & Wikstad [848] and Albrecher, Avram & Kortschak [14] (see also the Bibliographical Notes in [746, p. 191]).
3d
Deterministic claims
Corollary 3.7 If B is degenerate at µ, then bu/µc
ψ(u) = 1 − (1 − ρ)
X
e
−ρ(k−u/µ)
k=0
£ ¤k ρ(k − u/µ) . k!
Proof. By replacing {St } by {Stµ /µ} if necessary, we may assume µ = 1 so that the stated formula in terms of the survival probability φ(u) = 1 − ψ(u) takes the form £ ¤k buc X −β(k−u) β(k − u) e φ(u) = (1 − β) (3.8) . k! k=0
The renewal equation (3.3) for φ(u) means Z 1∧u φ(u) = 1 − β + φ(u − y)βI(0 ≤ y ≤ 1) dy 0 Z u = 1−β+ φ(y)βI(0 ≤ u − y ≤ 1) dy u−1∧u Z u ( 1−β+β 0 ≤ u ≤ 1, φ(y) dy, =
Z
0 u
1−β+β
φ(y) dy, u−1
1 ≤ u < ∞.
82
CHAPTER IV. THE COMPOUND POISSON MODEL
For 0 ≤ u ≤ 1, differentiation yields φ0 (u) = βφ(u) which together with the boundary condition φ(0) = 1 − β yields φ(u) = (1 − β)eβu so that (3.8) follows e for 0 ≤ u ≤ 1. Assume (3.8) shown for n − 1 ≤ u ≤ n and let φ(u) denote the r.h.s. of (3.8). For n ≤ u ≤ n+1, differentiation yields φ0 (u) = βφ(u)−βφ(u−1), e0
φ (u) =
£ ¤k n X d −β(k−u) β(k − u) (1 − β) e du k! k=0
=
βu
(1 − β)βe
+ (1 − β)
n X
βe
−β(k−u)
k=1
£ ¤k−1 β(k − u) − (1 − β) e (k − 1)! k=1 £ ¤k n−1 X −β(k−u+1) β(k − u + 1) e β φ(u) − β(1 − β) e k! n X
=
£ ¤k β(k − u) k!
−β(k−u) β
k=0
=
e e − 1) . β φ(u) − β φ(u
e e Since φ(n) = φ(n) by the induction hypothesis, it follows that φ(u) = φ(u) for n ≤ u ≤ n + 1. 2 Notes and references Corollary 3.7 is identical to the formula for the M/D/1 waiting time distribution derived by Erlang [356]. See also Iversen & Staalhagen [496] for a discussion of computational aspects and further references.
4
Change of measure via exponential families
If X is a random variable with c.d.f. F and c.g.f. Z ∞ κ(α) = log EeαX = log eαx F (dx) = log Fb[α], −∞
the standard definition of the exponential family {Fθ } generated by F is Fθ (dx) = eθx−κ(θ) F (dx),
(4.1)
or equivalently, in terms of the c.g.f. of Fθ , κθ (α) = κ(α + θ) − κ(θ). (Here θ is any such number such that κ(θ) is well-defined.)
(4.2)
4. CHANGE OF MEASURE VIA EXPONENTIAL FAMILIES
83
The adaptation of this construction to L´evy processes (such as {St }) has been carried out in III.3, but will now be repeated for the sake of self-containedness. X= We could first tentatively consider the claim surplus ¡ ¢ St for a single t, say b − 1 − α, and define κθ by t = 1: recall from Proposition 1.1 that κ(α) = β B[α] (4.2). The question then naturally arises whether κθ is the c.g.f. corresponding to a compound Poisson risk process in the sense that for a suitable arrival intensity βθ and a suitable claim size distribution Bθ we have bθ [α] − 1) − α. κθ (α) = κ(α + θ) − κ(θ) = βθ (B
(4.3)
The answer is yes: inserting in (4.2) shows that the solution is b βθ = β B[θ],
Bθ (dx) =
b eθx bθ [α] = B[α + θ] . (4.4) B(dx), or equivalently B b b B[θ] B[θ]
Repeating for t 6= 1, we just have to multiply (4.3) by t, and thus (4.4) works as well. Formalizing this for the purpose of studying the whole process {St }, we set up Definition 4.1 Let P be the probability measure on D[0, ∞) governing a given compound Poisson risk process with arrival intensity β and claim size distribution B, and define βθ , Bθ by (4.4). Then Pθ denotes the probability measure governing the compound Poisson risk process with arrival intensity βθ and claim size distribution Bθ ; the corresponding expectation operator is Eθ . The following result (Proposition 4.2, with T taking the role of n) is the analogue of the expression © ª exp θ(x1 + · · · + xn ) − nκ(θ) (4.5) for the density of n i.i.d. replications from Fθ (replace x by xi in (4.1) and multiply from 1 to n). Let FT = σ(St : t ≤ T ) denote the σ-algebra spanned by the St , t ≤ T , and (T ) Pθ the restriction of Pθ to FT . (T )
Proposition 4.2 For any fixed T , the Pθ
are mutually equivalent on FT , and
(T ) © ª dPθ = exp θST − T κ(θ) . (T ) dP
That is, for G ∈ FT , £ © ª ¤ P(G) = P0 (G) = Eθ exp − θST + T κ(θ) ; G .
(4.6)
84
CHAPTER IV. THE COMPOUND POISSON MODEL
Proof. We must prove that if Z is FT -measurable, then £ ¤ Eθ Z = E ZeθST −T κ(θ) .
(4.7)
By standard measure theory, it suffices to consider the case where Z is mea¡ ¢ (n) surable w.r.t. FT = σ SkT /n : k = 0, 1, . . . , n for a given n. But let Xk = SkT /n − S(k−1)T /n . Then the Xk are i.i.d. with common c.g.f. T κ(α)/n, Z is measurable w.r.t. σ(X1 , . . . , Xn ), and thus (4.7) follows by discrete exponential family theory, in particular the expression (4.5) for the density. The identity (4.6) now follows by taking Z = e−θST +T κ(θ) I(G). 2 Theorem 4.3 Let τ be any stopping time and let G ∈ Fτ , G ⊆ {τ < ∞}. Then £ © ª ¤ P(G) = P0 (G) = Eθ exp −θSτ + τ κ(θ) ; G . (4.8) Proof. We first note that for any fixed t, Eθ e−θSt +tκ(θ) = 1 .
(4.9)
Now assume first that G ⊆ {τ ≤ T } for some deterministic T . Then G ∈ FT , and hence (4.6) holds. Given Fτ , t = T − τ is deterministic. Thus by (4.9), ¯ £ © ª ¤ Eθ exp −θST + T κ(θ) I(G) ¯ Fτ ) = 1, so that PQ equals ¯ £ © ª ¤ Eθ Eθ exp −θST + T κ(θ) I(G) ¯ Fτ ) £ ¤ = Eθ exp {−θSτ + τ κ(θ)} I(G)Eθ [ exp {−θ(ST − Sτ ) + (T − τ )κ(θ)}| Fτ ] £ © ª ¤ = Eθ exp −θSτ + τ κ(θ) I(G) . Now consider a general G. Then GT = G ∩ {τ ≤ T } satisfies GT ∈ Fτ , GT ⊆ {τ ≤ T }. Thus, according to what has just been proved, (4.8) holds with G replaced by GT . Letting T ↑ ∞ and using monotone convergence then shows that (4.8) holds for G as well. 2
5
Lundberg conjugation
Being a c.g.f., κ(α) is a convex function of α. The behavior at zero is given by the first order Taylor expansion η κ(α) ≈ κ(0) + κ0 (0)α = 0 + ES1 α = α(ρ − 1) = − α. 1+η Thus, subject to the basic assumption η > 0 of a positive safety loading, the typical shape of κ is as in Fig. IV.1(a).
5. LUNDBERG CONJUGATION
85
Figure IV.1 When the tail of the claim size distribution is exponentially bounded, then typically a γ > 0 satisfying ¡ ¢ b −1 −γ 0 = κ(γ) = β B[γ] (5.1) exists. Equation (5.1) is known as the Lundberg equation and plays a fundamental role in risk theory; an equivalent version illustrated in Fig. IV.2 is γ b B[γ] = 1+ . (5.2) β 6
1 + βs b B[s]
1 r γ
s
Figure IV.2 As support for memory, we write PL instead of Pγ , βL instead of βγ and so on in the following. Note that ¡ ¢ bL [α] − 1 − α = κ(α + γ), κL (α) = βL B cf. Fig. IV.1(b). An established terminology is to call γ the adjustment coefficient but there are various alternatives around, e.g. the Lundberg exponent.
86
CHAPTER IV. THE COMPOUND POISSON MODEL
b = δ/(δ − r). It is Example 5.1 Consider the case of exponential claims, B[r] then readily seen that the non-zero solution of (5.1) (or (5.2)) is γ = δ −β. Thus b = δ/β, and (4.4) yields βL = δ and that BL is again exponential with rate B[γ] δL = β. Thus, Lundberg conjugation corresponds to interchanging the rates of the interarrival times and the claim sizes. 2 It is a crucial fact that when governed by PL , the claim surplus process has positive drift EL S1 = κ0L (0) = κ0 (γ) > 0, (5.3) cf. Fig. IV.1(b). Taking τ = τ (u), G = {τ (u) < ∞} in Theorem 4.3, we further note that (5.1) is precisely what is needed for one of the terms in the exponent to vanish so that Theorem 4.3 takes a particular simple form, £ © ª ¤ ψ(u) = P(τ (u) < ∞) = EL exp −γSτ (u) ; τ (u) < ∞ . Letting ξ(u) = Sτ (u) − u be the overshoot and noting that PL (τ (u) < ∞) = 1 by (5.3), we can rewrite this as ψ(u) = e−γu EL e−γξ(u) ,
(5.4)
see also III.(1.5). Theorem 5.2 (Lundberg’s inequality) For all u ≥ 0, ψ(u) ≤ e−γu . Proof. Just note that ξ(u) ≥ 0 in (5.4).
2
´r-Lundberg approximation) ψ(u) ∼ Ce−γu as Theorem 5.3 (the Crame u → ∞, where C =
γ
R∞ 0
1−ρ 1−ρ . = b xeγx βB(x) dx β B 0 [γ] − 1
(5.5)
Proof. By renewal theory, see A.1e, ξ(u) has a limit ξ(∞) (in the sense of weak convergence w.r.t. PL ) with density (L)
(L)
1 − G+ (x) (L)
µ+ (L)
=
G+ (x) (L)
µ+
, (L)
where G+ is the PL – ascending ladder height distribution and µ+ its mean. Since e−γx is continuous and bounded, we therefore have EL e−γξ(u) → C where Z ∞ 1 (L) −γξ(∞) C = EL e = (L) e−γx (1 − G+ (x)) dx µ+ 0 Z ∞ 1 (L) (1 − e−γx )G+ (dx) , (5.6) = (L) γµ+ 0
5. LUNDBERG CONJUGATION
87
and all that is needed to check (5.6) is the same as (5.5). To that end, © is that ª take first θ = γ, τ = τ+ , G = Sτ+ ∈ A in Theorem 4.3. Then £ © ª ¤ P(Sτ+ ∈ A) = EL exp −γSτ+ ; Sτ+ ∈ A , which shows that (L)
G+ (dx) = eγx G+ (dx) = eγx βB(x) dx.
(5.7)
In principle, this solves the problem of evaluating (5.6), but some tedious (though elementary) calculations remain to bring the expressions on a final form. Noting (L) that kG+ k = 1 because of (5.3), we get Z ∞ Z ∞ (L) −γx (1 − e )G+ (dx) = 1 − βB(x) dx = 1 − ρ. 0
0
Using (5.7) yields
Z (L)
µ+
∞
= β
xeγx B(x) dx = βϕ0 (γ),
(5.8)
0
where
Z
∞
ϕ(α) = 0
eαx B(x) dx =
¢ 1¡b B[α] − 1 α
(5.9)
so that
¡ ¢ b 0 [γ] − B[γ] b −1 b 0 [γ] − 1/β γB B ϕ (γ) = = γ2 γ (using (5.1)) and 0
(L)
γµ+
= γβ
b 0 [γ] − 1/β B b 0 [γ] − 1. = βB γ
(5.10) 2
Example 5.4 Consider first the exponential case b(x) = δe−δx . Then ψ(u) = ρe−(δ−β)u where ρ = β/δ. From this it follows, of course, that γ = δ − β (this was already found in Example 5.1 above) and that C = ρ. A direct proof of C = ρ is of course easy: b 0 [γ] B
=
C
=
d δ δ δ = = 2, dγ δ − γ (δ − γ)2 β 1−ρ 1−ρ 1−ρ = = = ρ. b 0 [γ] − 1 βδ/β 2 − 1 1/ρ − 1 βB
The accuracy of Lundberg’s inequality in the exponential case thus depends on how close ρ is to one, or equivalently of how close the safety loading η is to 2 zero.
88
CHAPTER IV. THE COMPOUND POISSON MODEL
Remark 5.5 Noting that b 0 [γ] − 1 , ρL − 1 = βL µBL − 1 = κ0L (0) = κ0 (γ) = β B we can rewrite the Cram´er-Lundberg constant C in the nice symmetrical form C =
|κ0 (0)| 1−ρ = . 0 κ (γ) ρL − 1
(5.11) 2
R∞ b Remark 5.6 Let ψ[−s] = 0 e−su ψ(u) du denote the Laplace transform of the b ruin probability. Obviously, the Laplace transform of ψ(u)eγu is then ψ[−s + γ]. Since from the damping property of Laplace transforms, for any function f (u), limu→∞ f (u) = lims→0 s fb[−s], given that this limit exists, we can also determine the constant C in the Cram´er-Lundberg approximation by b C = lim s ψ[−s + γ], s→0
which from (3.4) again gives (5.5). Although it looks tempting to use this procedure for determining C in more general models where γ exists and only the Laplace transform of ψ may be available explicitly, it is important to note that this procedure does not prove the Cram´er-Lundberg approximation, but just gives the correct value of C in case the approximation holds (the approximation itself usually has to be established by other techniques and often only exists in a weaker logarithmic sense, cf. Chapter XIII). For a related method to obtain the asymptotic behavior of ψ(u) for regularly varying claims, see Chapter X. 2 In Chapter V, we shall need the following result which follows by a variant of the calculations in the proof of Theorem 5.3: Lemma 5.7 For α 6= γ, EL e−αξ(∞) =
b − α] − 1 ´ B[γ γ ³ 1−β . 0 ακ (γ) γ−α
Proof. Replacing γ by α in (5.6) and using (5.7), we obtain Z ∞ ´ 1 ³ EL e−αξ(∞) = 1 − e(γ−α)x βB(x) dx (L) 0 αµ+ ³ b − α] − 1 ´ B[γ 1 1 − β , = (L) γ−α αµ+
5. LUNDBERG CONJUGATION
89
using integration by parts as in (3.5) in the last step. Inserting (5.10), the result follows. 2 Notes and references The results of this section are classical, with Lundberg’s inequality being given first in Lundberg [615] and the Cram´er-Lundberg approximation in Cram´er [265]. Therefore, extensions and generalizations are main topics in the area of ruin probabilities, and in particular numerous such results can be found later in this book; in particular, see Sections V.4, VI.3, VII.3, VII.6, XI.2, and XII.2–3. The mathematical approach we have taken is more recent in risk theory (some of the classical ones can be found in the next subsection). The techniques are basically standard ones from sequential analysis, see for example Wald [869] and Siegmund [810].
5a
Alternative proofs
For the sake of completeness, we shall here give some classical proofs, first one of Lundberg’s inequality which is slightly longer but maybe also slightly more elementary: Alternative proof of Lundberg’s inequality. Let X be the value of {St } just after the first claim, F (x) = P(X ≤ x). Then, since X is the independent difference U − T between an interarrival time T and a claim U , Fb[γ] =
b Eeγ(U −T ) = EeγU · Ee−γT = B[γ]
β = 1, β+γ
where the last equality follows from κ(γ) = 1. Let ψ (n) (u) denote the probability of ruin after at most n claims. Conditioning upon the value x of X and considering the cases x > u and x ≤ u separately yields Z u (n+1) ψ (u) = F (u) + ψ (n) (u − x) F (dx). −∞
We claim that this implies ψ (n) (u) ≤ e−γu , which completes the proof since ψ(u) = limn→∞ ψ (n) (u). Indeed, this is obvious for n = 0 since ψ (0) (u) = 0. Assuming it proved for n, we get Z u ψ (n+1) (u) ≤ F (u) + e−γ(u−x) F (dx) −∞ Z ∞ Z u ≤ e−γu eγx F (dx) + e−γ(u−x) F (dx) u
=
e
−γu
Fb[γ] = e−γu .
−∞
2
90
CHAPTER IV. THE COMPOUND POISSON MODEL
Of further proofs of Lundberg’s inequality, we mention in particular the martingale approach, see III.1. Next consider the Cram´er-Lundberg approximation. Here the most standard proof is via the renewal equation in Corollary 3.3 (however, as will be seen, the calculations needed to identify the constant C are precisely the same as above): Alternative proof of the Cram´er-Lundberg’s approximation. Recall from Corollary 3.3 that Z ∞ Z u ψ(u) = β B(x) dx + ψ(u − x)βB(x) dx. u
0
Multiplying by eγu and letting Z γu
γu
∞
Z(u) = e ψ(u), z(u) = e β
B(x) dx, F (dx) = eγx βB(x) dx,
u
we can rewrite this as Z Z(u)
u
= z(u) +
eγ(u−x) ψ(u − x) · eγx βB(x) dx,
Z0 u = z(u) +
Z(u − x)F (dx) , 0
i.e. Z = z + F ∗ Z. Note that by (5.9) and the Lundberg equation, γ is precisely the correct exponent which will ensure that F is a proper distribution (kF k = 1). It is then a matter of routine to verify the conditions of the key renewal theorem R∞ (Proposition A1.1) to conclude that Z(u) has the limit C = 0 z(x)dx/µF , so that it only remains to check that C reduces to the expression given above. (L) However, µF is immediately seen to be the same as µ+ calculated in (5.8), whereas Z ∞ Z ∞ Z ∞ Z x Z ∞ B(x) dx = B(x) dx z(u) du = βeγu du βeγu du 0 0 0 0 u Z ∞ i β βh1 b (B[γ] − 1) − µB = B(x) (eγx − 1) dx = γ γ γ 0 h i β 1 1−ρ = − µB = , γ β γ using the Lundberg equation and the calculations in (5.9). Easy calculus now gives (5.5). 2
6. MORE ON THE ADJUSTMENT COEFFICIENT
91
Notes and references Another related, but slightly different proof of the Cram´erLundberg’s approximation in the spirit of Feller [362] that utilizes the Blackwell renewal theorem can be found in Albrecher & Teugels [36]. The asymptotic behavior of the ruin probability for heavy-tailed claims will be discussed in X.2.
6
Further topics related to the adjustment coefficient
6a
On the existence of γ
In order that the adjustment coefficient γ exists, it is of course necessary that b B is light-tailed in the sense of I.2a, i.e. that B[α] < ∞ for some α > 0. This excludes heavy-tailed distributions like the log-normal or Pareto, but may in many other cases not appear all that restrictive, and the following possibilities then occur: b < ∞ for all α < ∞. 1. B[α] b b 2. There exists α∗ < ∞ such that B[α] < ∞ for all α < α∗ and B[α] =∞ ∗ for all α ≥ α . b b < ∞ for all α ≤ α∗ and B[α] =∞ 3. There exists α∗ < ∞ such that B[α] ∗ for all α > α . b In particular, monotone convergence yields B[α] ↑ ∞ as α ↑ ∞ in case 1, and ∗ b B[α] ↑ ∞ as α ↑ α in case 2 (in exponential family theory, this is often referred to as the steep case). Thus the existence of γ is automatic in cases 1, 2; standard examples are distributions with finite support or tail satisfying B(x) = o(e−αx ) for all α in case 1, and phase-type or Gamma distributions in case 2. Case 3 may be felt to be rather atypical, but some non-pathological examples exist, for example the inverse Gaussian distribution (see Example 9.7 below for details). In b ∗ ] ≥ 1+α∗ /β and not otherwise, that is, dependent case 3, γ exists provided B[α ¡ ¢ b ∗] − 1 . on whether β is larger or smaller than the threshold value α∗ / B[α Notes and references Ruin probabilities in case 3 with γ non-existent are studied, e.g., by Borovkov [182, p. 132] and Embrechts & Veraverbeke [353]. To the present authors’ mind, this is a somewhat special situation and therefore not treated in this book.
92
6b
CHAPTER IV. THE COMPOUND POISSON MODEL
Bounds and approximations for γ
Proposition 6.1 If the adjustment coefficient exists, it can be bounded by γ <
2(1 − βµB ) (2) βµB
2ηµB
=
(2)
µB
.
(2) b Proof. From U ≥ 0 it follows that B[α] = EeαU > 1 + µB α + µB α2 /2. Hence ¢ ¡ ¡ ¢ (2) (2) b −1 β B[γ] β γµB + γ 2 µB /2 βγµB 1 = > = βµB + , (6.1) γ γ 2
2
from which the results immediately follows.
The upper bound in Proposition 6.1 is also an approximation for small safety loadings (heavy traffic, cf. Section 7c): Proposition 6.2 Let B be fixed but assume that β = β(η) varies with the safety 1 . Then as η ↓ 0, loading such that β = µB (1 + η) γ = γ(η) ∼
2ηµB (2)
µB
.
(6.2)
Further, the Cram´er-Lundberg constant satisfies C = C(η) ∼ 1. Proof. Since ψ(u) → 1 as η ↓ 0, it follows from Lundberg’s inequality that γ → 0. Hence by Taylor expansion, the inequality in (6.1) is also an approximation so that ¡ ¢ ¡ ¢ (2) (2) b −1 β B[γ] β γµB + γ 2 µB /2 βγµB 1 = ≈ =ρ+ , γ γ 2 2(1 − ρ) 2ηµB γ ∼ = . (2) (2) βµB µB That C → 1 easily follows from γ → 0 and C = EL e−γξ(∞) (in the limit, ξ(∞) is distributed as the overshoot corresponding to η = 0). For an alternative analytic proof, note that C
= ≈ ≈
1−ρ ηµB = 0 0 b [γ] − 1 b [γ] − 1/β βB B ηµB η = (2) (2) µB + γµB − µB (1 + η) γµB /µB − η η = 1. 2η − η
2
6. MORE ON THE ADJUSTMENT COEFFICIENT
93
Obviously, the approximation (6.2) is easier to calculate than γ itself. However, it needs to be used with caution say in Lundberg’s inequality or the Cram´er-Lundberg approximation, in particular when u is large.
6c
A refinement of Lundberg’s inequality
The following result gives a sharpening of Lundberg’s inequality (because obviously C+ ≤ 1) as well as a supplementary lower bound: Theorem 6.3 C− e−γu ≤ ψ(u) ≤ C+ e−γu where C− = inf R ∞ x≥0
x
B(x) eγ(y−x) B(dy)
,
C+ = sup R ∞ x≥0
x
B(x) eγ(y−x) B(dy)
.
Proof. Let H(dt, dx) be the PL -distribution of the time τ (u) of ruin and the reserve u − Sτ (u)− just before ruin. Given τ (u) = t, u − Sτ (u)− = x, a claim occurs at time t and has distribution BL (dy)/B L (x), y > x. Hence Z ∞Z ∞ Z ∞ BL (dy) EL e−γξ(u) = H(dt, dx) e−γ(y−x) B L (x) 0 0 x R∞ Z ∞Z ∞ B(dy) x = H(dt, dx) −γx b e B L (x)B[γ] 0 0 Z ∞Z ∞ B(x) = H(dt, dx) R ∞ γ(y−x) e B(dy) 0 0 x Z ∞Z ∞ ≤ C+ H(dt, dx) = C+ . 0
0
The upper bound then follows from ψ(u) = e−γu EL e−ξ(u) , and the proof of the lower bound is similar. 2 Example 6.4 If B(x) = e−δx , then an explicit calculation shows easily that R∞ x
B(x) e−δx β R∞ = = = ρ. γ(y−x) (δ−β)(y−x) −δy δ e B(dy) e δe dy x
Hence C− = C+ = ρ so that the bounds in Theorem 6.3 collapse and yield the exact expression ρ e−γu for ψ(u). 2 The following concluding example illustrates a variety of the topics discussed above (though from a general point of view the calculations are deceivingly simple: typically, γ and other quantities will have to be calculated numerically).
94
CHAPTER IV. THE COMPOUND POISSON MODEL
Example 6.5 Assume as for (3.1) that β = 3 and b(x) =
1 1 · 3e−3x + · 7e−7x , 2 2
and recall that the ruin probability is ψ(u) =
24 −u 1 e + e−6u . 35 35
Since the dominant term is 24/35 · e−u , it follows immediately that γ = 1 and C = 24/35 = 0.686 (also, bounding e−6u by e−u confirms Lundberg’s inequality). For a direct verification, note that the Lundberg equation is µ ¶ 1 3 1 7 b γ = β(B[γ] − 1) = 3 · + · −1 , 2 3−γ 2 7−γ which after some elementary algebra leads to the cubic equation 2γ 3 − 14γ 2 + 12γ = 0 with roots 0, 1, 6. Thus indeed γ = 1 (6 is not in the domain of b and therefore excluded). Further, convergence of B[γ] µ ¶ 1 1 1 1 2 1 − ρ = 1 − βµB = 1 − 3 · + · = , 2 3 2 7 7 ¯ ¯ 3 1 7 17 b 0 [γ] = 1 · ¯ B + · , = 2 2 2 (3 − α) 2 (7 − α) ¯α=γ=1 36 2 1−ρ 24 7 C = = = . 17 b 0 [γ] − 1 35 βB 3· −1 36 For Theorem 6.3, note that the function ¾ Z ∞½ 1 1 · 3e−3x + · 7e−7x dx 3 + 3e−4u 2 2 ½ ¾ Z ∞u = 1 1 9/2 + 7/2e−4u ex−u · 3e−3x + · 7e−7x dx 2 2 u attains its minimum C− = 2/3 = 0.667 for u = ∞ and its maximum C+ = 3/4 = 0.750 for u = 0, so that 0.667 ≤ C ≤ 0.750 in accordance with C = 0.686. 2 Notes and references Theorem 6.3 is from Taylor [836]. Closely related results are given in a queueing setting in Kingman [535], Ross [748] and Rossberg & Siegel [749].
7. VARIOUS APPROXIMATIONS FOR THE RUIN PROBABILITY
95
Some further references on variants and extensions of Lundberg’s inequality are Kaas & Goovaerts [514], Willmot [886], Cai & Garrido [218], Dickson [306], Kalashnikov [516, 518] and Chadjiconstantinidis & Politis [227], all of which also go into aspects of the heavy-tailed case.
7
Various approximations for the ruin probability
7a
The Beekman-Bowers approximation
The idea is to write ψ(u) as P(M > u), fit a gamma distribution with parameters λ, δ to the distribution of M by matching the two first moments and use the incomplete gamma function approximation Z ∞ λ δ ψ(u) ≈ xλ−1 e−δx dx. Γ(λ) u According to Corollary 3.5, this means that λ, δ are given by λ/δ = a1 , 2λ/δ 2 = a2 (2) (3) (2)2 ρµB ρµB β 2 µB a1 = , a2 = + , 2(1 − ρ)µB 3(1 − ρ)µB 2(1 − ρ)2 i.e. δ = 2a1 /a2 , λ = 2a21 /a2 . Notes and references The approximation was introduced by Beekman [151], with the present version suggested by Bowers in the discussion of [151].
7b
De Vylder’s approximation
Given a risk process with parameters β, B, p = 1, the idea is to approximate the ruin probability with the one for a different process with exponential claims, e arrival intensity βe and premium rate pe. In order say with rate parameter δ, to make the processes look as much as possible alike, we make the first three cumulants match, which according to Proposition 1.1 means βe − pe = βµB − 1 = ρ − 1, δe
2βe (2) = βµB , 2 e δ
6βe (3) = βµB . 3 e δ
These three equations have solutions (2)
3µB δe = (3) , µB
(2)3
9βµB βe = , (3)2 2µB
(2)2
pe =
3βµB
(3)
2µB
− ρ + 1.
(7.1)
96
CHAPTER IV. THE COMPOUND POISSON MODEL
e p, ρ∗ = β ∗ /δ, e the approximating risk process has ruin probabilLetting β ∗ = β/e ∗ e ity ψ(u) = ρ∗ e−(δ−β )u , cf. Proposition I.1.3 and Corollary 3.2, and hence the ruin probability approximation is ψ(u) ≈
βe −(δ− e β/e e p)u e . e peδ
(7.2)
Notes and references The approximation (7.2) was suggested by De Vylder [299]. Though of course it is based upon purely empirical grounds, numerical evidence (e.g. Grandell [429, pp. 19–24], [432]) shows that it may produce surprisingly good results, in particular for light-tailed claim distributions. Extensions of this method to approximations with more general involved claim distributions are immediate, but there is a natural trade-off between complexity and accuracy of the approximation. For an investigation on the use of Coxian distributions of order two for the claim distribution of the approximating risk process, see Badescu & Stanford [120]. Due to its simplicity, the De Vylder approximation is also very popular for the study of effects of external mechanisms such as dividend payments and reinsurance on the probability of ruin (see for instance Beveridge, Dickson & Wu [161], Gerber, Shiu & Smith [413]). A related procedure is to approximate ψ(u) by a combination of two exponential terms, where one of them is the Cram´er-Lundberg approximation (5.5) and the coefficient and exponent of the other are determined by matching E[M ] and the mass of M in 0. This leads to the so-called Tijms approximation, see [852] and Lin & Willmot [892, Ch.8].
7c
The heavy traffic approximation
The term heavy traffic comes from queueing theory, but has an obvious interpretation also in risk theory: on the average, the premiums exceed only slightly the expected claims. That is, heavy traffic conditions mean that the safety loading η is positive but small, or equivalently that β is only slightly smaller than βmax = 1/µB . Mathematically, we shall represent this situation with a limit where β ↑ βmax but B is fixed. Proposition 7.1 As β ↑ βmax , (βmax − β)M converges in distribution to the 2µ2B exponential distribution with rate δ = (2) . µB Proof. Note first that 1− ρ = (βmax −β)µB . Letting B0 be the stationary excess life distribution, we have according to the Pollaczeck-Khinchine formula in the
7. VARIOUS APPROXIMATIONS FOR THE RUIN PROBABILITY
97
form (3.6) that Ees(βmax −β)M = ≈ =
1−ρ 1−ρ £ ¤ = © £ ¤ª b0 s(βmax − β) b0 s(βmax − β) 1 − ρB 1−ρ+ρ 1−B 1−ρ 1−ρ ≈ 1 − ρ − ρs(βmax − β)µB0 1 − ρ − s(βmax − β)µB0 µB δ , = µB − sµB0 δ−s (2)
where δ = µB /µB0 = 2µ2B /µB .
2
Corollary 7.2 If β ↑ βmax , u → ∞ in such a way that (βmax − β)u → v, then ψ(u) → e−δv . ¡ ¢ Proof. Write ψ(u) as P (βmax − β)M > (βmax − β)u .
2
These results suggest the approximation ψ(u) ≈ e−δ(βmax −β)u .
(7.3)
It is worth noting that this is essentially the same as the approximation (2)
ψ(u) ≈ Ce−γu ≈ e−2uηµB /µB
(7.4)
suggested by the Cram´er-Lundberg approximation and Proposition 6.2. This follows since η = 1/ρ − 1 ≈ 1 − ρ, and hence δ(βmax − β) =
2µ2B (2) µB
·
1−ρ 2ηµB ≈ . (2) µB µB
However, obviously Corollary 7.2 provides the better mathematical foundation. Notes and references Heavy traffic limit theory for queues goes back to Kingman [534]. The present situation of Poisson arrivals is somewhat more elementary to deal with than the renewal case (see e.g. [APQ, X.7]). We return to heavy traffic from a different point of view (diffusion approximations) in Chapter V and give further references there. In the setting of risk theory, the first results of heavy traffic type seem to be due to Hadwiger [445]. Numerical evidence shows that the fit of (7.3) is reasonable for η being say 10–20% and u being small or moderate, while the approximation may be far off for large u.
98
7d
CHAPTER IV. THE COMPOUND POISSON MODEL
The light traffic approximation
As for heavy traffic, the term light traffic comes from queueing theory, but has an obvious interpretation also in risk theory: on the average, the premiums are much larger than the expected claims. That is, light traffic conditions mean that the safety loading η is positive and large, or equivalently that β is small compared to µB . Mathematically, we shall represent this situation with a limit where β ↓ 0 but B is fixed. Of course, in risk theory heavy traffic is most often argued to be the more typical case. However, light traffic is of some interest as a complement to heavy traffic, as well as it is needed for the interpolation approximation to be studied in the next subsection. Proposition 7.3 As β ↓ 0, Z ∞ £ ¤ B(x) dx = βE U − u; U > u = βE(U − u)+ . ψ(u) ≈ β
(7.5)
u
Proof. According to the Pollaczeck-Khinchine formula, ψ(u) = (1 − ρ) Asymptotically, hence
P∞ n=2
∞ X
∞ X
∗n
β n µnB B 0 (u) ≈
n=1
∗n
β n µnB B 0 (u) .
n=1 2
· · · = O(β ) so that only the first terms matters, and Z
ψ(u) ≈
∞
βµB B 0 (u) = β
B(x)dx. u
The alternative expressions in (7.5) follow by integration by parts.
2
Note that heuristically the light traffic approximation in Proposition 7.3 is the same which comes out by saying that basically ruin can only occur at the time T of the first claim, i.e. ψ(u) ≈ P(U − T > u). Indeed, by monotone convergence Z ∞ Z ∞ P(U − T > u) = B(x + u)βe−βx dx ≈ β B(x) dx. 0
u
Notes and references Light traffic limit theory for queues was initiated by Bloomfield & Cox [178]. For a more comprehensive treatment, see Daley & Rolski [270, 271], Asmussen [61] and references therein. Again, the Poisson case is much easier than the renewal case. Another way to understand that the present analysis is much simpler than in these references is the fact that in the queueing setting light traffic theory is much easier for virtual waiting times (the probability of the conditioning event {M > 0} is explicit) than for actual waiting times, cf. Sigman [811]. Light traffic was first studied in risk theory in the first edition of this book.
7. VARIOUS APPROXIMATIONS FOR THE RUIN PROBABILITY
7e
99
Interpolating between light and heavy traffic
We shall now outline an idea of how the heavy and light traffic approximations can be combined. The crude idea of interpolating between light and heavy traffic leads to µ ¶ β β ψ(u) ≈ 1− lim ψ(u) + lim ψ(u) βmax β↓0 βmax β↑βmax µ ¶ β β β = 1− ·0+ ·1 = = ρ, βmax βmax βmax which is clearly useless. Instead, to get non-degenerate limits, we combine with our explicit knowledge of ψ(u) for the exponential claim size distribution E with the same mean µB as the given one B, that is, with rate 1/µB = βmax . Let (B) ψeLT (u) denote the light traffic approximation given by Proposition 7.3 and use (E) (B) similar notation for ψ (B) (u) = ψ(u), ψ (E) (u) = ρe−(βmax −β)u , ψeLT (u), ψeHT (u), (E) ψeHT (u). Substituting v = u(βmax − β), we see that the following limits exist: ³ ´ (B) ψeHT βmaxv −β e−δv ³ ´ = lim = e(1−δ)v = c HT (v) (say), (2) 2 β↑βmax e(E) e−2µE /µE ·v ψHT βmaxv −β ´ ³ R∞ (B) ψeLT βmaxv −β B(x) dx ³ ´ = R ∞v/βmax lim β↓0 e(E) e−βmax x dx ψLT βmaxv −β v/βmax Z ∞ = βmax ev B(x) dx = c LT (v) (say), v/βmax
and the approximation we suggest is ³h ´ β i β ψ(u) ≈ ψ (E) (u) 1 − cLT (u(βmax − β)) + cHT (u(βmax − β)) βmax βmax Z ∞ = ρ(1 − ρ)βmax B(x) dx + ρ2 e−δ(βmax −β)u . (7.6) u(1−ρ)
The particular features of this approximation are that it is exact for the exponential distribution and asymptotically correct both in light and heavy traffic. Thus, even if the safety loading is not very small, one may hope that some correction of the heavy traffic approximation has been obtained. Notes and references In the queueing setting, the idea of interpolating between light and heavy traffic is due to Burman & Smith [209, 210]. Another main queueing paper is Whitt [882], where further references can be found. The adaptation to risk theory is new; no empirical study of the fit of (7.6) is, however, available.
100
8
CHAPTER IV. THE COMPOUND POISSON MODEL
Comparing the risks of different claim size distributions
Given two claim size distributions B (1) , B (2) , we may ask which one carries the larger risk in the sense of larger values of the ruin probability ψ (i) (u) for a fixed value of β. To this end, we shall need various ordering properties of distributions, for more detail and background on which we refer to M¨ uller & Stoyan [653] or Shaked & Shantikumar [795]. Recall that B (1) is said to be stochastically smaller than B (2) (in symbols, (1) (1) (x) ≤ B (2) (x) for all x; equivalent characterizations are B ≺st B (2) R R ) if B (1) (2) f dB ≤ f dB for any non-decreasing function f , or the existence of random variables U (1) , U (2) such that U (1) has distribution B (1) , U (2) distribution B (2) and U (1) ≤ U (2) a.s. A weaker concept is increasing convex ordering: B (1) is said to be smaller than B (2) in the increasing convex order (in symbols, B (1) ≺icx B (2) ) if Z
Z
∞
∞
B (1) (y) dy ≤ x
B (2) (y) dy
(8.1)
x
R R for all x; an equivalent characterization is f dB (1) ≤ f dB (2) for any nondecreasing convex function f . In the literature on risk theory, most often the term stop-loss ordering is used instead of increasing convex ordering because R∞ for a given distribution B, one can interpret x B(y) dy as the net stop-loss premium in a stop-loss or excess-of-loss reinsurance arrangement with retention limit x, cf. XVI.4. Finally, we have the convex ordering: R B (1) is saidR to be convexly smaller than B (2) (in symbols, B (1) ≺cx B (2) ) if f dB (1) ≤ f dB (2) for any convex function f . Rather than measuring difference in size, this ordering measures difference in variability. In particular (consider the convex functions x and −x) the definition implies that B (1) and B (2) must have the same mean, whereas (consider x2 ) B (2) has the larger variance. One can show that if B (1) and B (2) have the same mean and B (1) ≺icx B (2) , this is equivalent to B (1) ≺cx B (2) . Proposition 8.1 If B (1) ≺st B (2) , then ψ (1) (u) ≤ ψ (2) (u) for all u. Proof. According to the above characterization of stochastic ordering, we can (2) (1) In terms of the assume that St ≤ St for all t. © ª time © to ruin, this ª implies τ (1) (u) ≥ τ (2) (u) for all u so that τ (1) (u) < ∞ ⊆ τ (2) (u) < ∞ . Taking 2 probabilities, the proof is complete.
8. COMPARISONS OF CLAIM SIZE DISTRIBUTIONS
101
Of course, Proposition 8.1 is quite weak, and a particular deficit is that we cannot compare the risks of claim size distributions with the same mean: if B (1) ≺st B (2) and µB (1) = µB (2) , then B (1) = B (2) . Here convex ordering is useful: Proposition 8.2 If B (1) ≺icx B (2) and µB (1) = µB (2) (i.e. B (1) ≺cx B (2) ), then ψ (1) (u) ≤ ψ (2) (u) for all u. Proof. Since the means are equal, say to µ, we have Z Z 1 ∞ (1) 1 ∞ (2) (1) (2) B0 (x) = B (y) dy ≤ B (y) dy = B0 (x). µ x µ x (1)
(8.2)
(2)
I.e., B0 ≺st B0 which implies the same order relation for all convolution powers. Hence by the Pollaczeck-Khinchine formula ψ (1) (u) = (1 − ρ)
∞ X
(1)∗n
β n µn B0
n=1
(u) ≤ (1 − ρ)
∞ X
(2)∗n
β n µn B0
(u) = ψ (2) (u).
n=1
2 Remark 8.3 From the proof u still holds if the assumption weakened to just ask for (8.2). Z ∞ 1 B (1) (y) dy µB (1) x
above it is clear that ψ (1) (u) ≤ ψ (2) (u) for all on the ordering of the claim size distribution is Slightly more general, the ordering defined by Z ∞ 1 ≤ B (2) (y) dy for all x ≥ 0, µB (2) x
is known as the harmonic mean residual life order and is sufficient for ψ (1) (u) ≤ ψ (2) (u) to hold as long as β1 µB (1) ≤ β2 µB (2) . 2 A general picture that emerges from these results and numerical studies like in Example 8.6 below is that (in a rough formulation) increased variation in B increases the risk (assuming that we fix the mean). The problem is to specify what ‘variation’ means. A first attempt would of course be to identify ‘variation’ with variance. The heavy traffic approximation (7.4) certainly supports this view: noting that, with fixed mean, larger variance is paramount to larger second moment, it is seen that asymptotically in heavy traffic larger claim size variance leads to larger ruin probabilities. Proposition 8.2 provides another instance of this, and here is one more result of the same flavor: Corollary 8.4 Let D refer to the distribution degenerate at µB . Then ψ (D) (u) ≤ ψ (B) (u) for all u.
102
CHAPTER IV. THE COMPOUND POISSON MODEL
Proof. If f is convex, we have by Jensen’s inequality that Ef (U ) ≥ f (EU ). This implies that D ≺cx B and we can apply Proposition 8.2. 2 A partial converse to Proposition 8.2 is the following: Proposition 8.5 If ψ (1) (u) ≤ ψ (2) (u) for all u and β, then B (1) ≺cx B (2) . Proof. Consider the light traffic approximation in Proposition 7.1.
2
We finally give a numerical example illustrating how differences in the claim size distribution B may lead to very different ruin probabilities even if we fix the mean µ = µB . Example 8.6 Fix β at 1/1.1 and µB at 1 so that the safety loading η is 10%, and consider the following claim size distributions: B1 : the standard exponential distribution with density e−x ; B2 : the hyperexponential distribution with density 0.1λ1 e−λ1 x + 0.9λ2 e−λ2 x where λ1 = 0.1358, λ2 = 3.4142; B3 : the Erlang distribution with density 4xe−2x ; B4 : the Pareto distribution with density 3/(1 + 2x)5/2 . Let uα denote the α fractile of the ruin function, i.e. ψ(uα ) = α, and consider α = 5%, 1%, 0.1%, 0.01%. One then obtains the following table: u0.05 u0.01 u0.001 u0.0001
B1 32 50 75 100
B2 181 282 425 568
B3 24 37 56 74
B4 35 70 245 1100
(the table was produced using simulation and the numbers are therefore subject to statistical uncertainty). Note to make the figures comparable, all distributions have mean 1. In terms of variances σk2 , we have 1 < σ12 = 1 < σ22 = 10 < σ42 = ∞ 2 so that in this sense B4 is the most variable. However, in comparison to B2 the effect on the uα does not show before α = 0.01%, which appears to be smaller than the range of interest in insurance risk (certainly not in queueing applications!), and this is presumably a consequence of a heavier tail rather than larger variance. For B1 , B2 , B3 the comparison is as expected from the intuition concerning the variability of these distributions, with the hyperexponential distribution being more variable than the exponential distribution and the Erlang 2 distribution less. σ32 =
9. SENSITIVITY ESTIMATES
103
Notes and references Further relevant references are Goovaerts et al. [425], van Heerwarden [454], Kl¨ uppelberg [539], Pellerey [689] and (for the convex ordering) Makowski [623]. For the harmonic mean residual life order, see Michel [636] and Trufin, Albrecher & Denuit [854]. For relations between higher-order stop-loss orderings of claim size distributions and ruin probabilities see Cheng & Pai [236]. Tsai [856] considers orderings in the presence of perturbations. We return to ordering of ruin probabilities in a special problem in VII.4 and also in XIII.8. For the situation that the claim size distribution and the Poisson parameter are unknown, but a sample of data points is available, Politis [709] considers the problem of semi-parametric estimation of ruin probabilities.
9
Sensitivity estimates
In a broad setting, sensitivity analysis (or pertubation analysis) deals with the calculation of the derivative (the gradient in higher dimensions) of a performance measure s(θ) of a stochastic or deterministic system, the behavior of which is governed by a parameter θ. A standard example from queueing theory is a queueing network, with θ the vector of service rates at different nodes and routing probabilities, and s(θ) the expected sojourn time of a customer in the network. In the present setting, s(θ) is of course the ruin probability ψ = ψ(u) (with u fixed) and θ a set of parameters determining the arrival rate β, the premium rate p and the claim size distribution B. For example, we may be interested in ∂ψ/∂p for assessing the effects of a small change in the premium, or we may be interested in ∂ψ/∂β as a measure of the uncertainty on ψ if β is only approximatively known, say estimated from data. Example 9.1 Consider the case of claims which are exponential with rate δ (the premium rate is one). Then ψ = βδ e−(δ−β)u , and hence ∂ψ 1 βu −(δ−β)u = e−(δ−β)u + e = ∂β δ δ
µ
¶ 1 + u ψ(u), β
which is of the order of magnitude uψ(u) for large u. Assume for example that δ is known, while β = βb is an estimate, obtained say in the natural way as the empirical arrival rate Nt /t in [0, t]. Then if t is large, the distribution of βb − β is approximatively normal N (0, β/t). Thus, b b if ψb = βδ e−(δ−β)u , it follows that ψb − ψ is approximatively normal N (0, σ 2 /t), where µ ¶2 ∂ψ σ2 = β ∼ βu2 ψ 2 . ∂β
104
CHAPTER IV. THE COMPOUND POISSON MODEL
b (the relIn particular, the standard deviation on the normalized estimate ψ/ψ 1/2 ative error) is approximatively β u, i.e. increasing in u. Similar conclusions will be found below. 2 Proposition 9.2 Consider a risk process {Rt } with a general constant premium rate p. Then ∂ψ ∂ψ = −β , ∂p ∂β where the partial derivatives are evaluated at p = 1. Proof. This is an easy time transformation argument in a similar way as in © (p) ª (p) Proposition I.1.3. Let Rt = Rt/p . Then the arrival rate β (p) for Rt is β/p, and hence the effect of changing p from 1 to 1 + ∆p corresponds to changing β to β/(1 + ∆p) ≈ β(1 − ∆p). Thus at p = 1, ∂β ∂ψ ∂ψ ∂ψ = = −β . ∂p ∂p ∂β ∂β 2 As a consequence, it suffices to fix the premium at p = 1 and consider only the effects of changing β or/and B. In the case of the claim size distribution B, various parametric families of claim size distributions could be considered, but we shall concentrate on a special structure covering a number of important cases, namely that of a two-parameter exponential family of the form © ª Bθ,ζ (dx) = exp θx + ζt(x) − ω(θ, ζ) µ(dx) , x > 0 (9.1) (see Remark 9.5 below for some discussion of this assumption). Consider first the adjustment coefficient γ as function of β, θ, ζ, and write γβ = ∂γ/∂β and so on. Similar notation for partial derivatives are used below, e.g. for the ruin probabilities ψ = ψ(u) and the Cram´er-Lundberg constant C. Proposition 9.3 γβ
=
γθ
=
γζ
=
γ ¡ ¢, β 1 − ωθ (θ + γ, ζ)(β + γ) £ ¤ (β + γ) ωθ (θ + γ, ζ) − ωθ (θ, ζ) , 1 − (β + γ)ωθ (θ + γ, ζ) £ ¤ (β + γ) ωζ (θ + γ, ζ) − ωζ (θ, ζ) . 1 − (β + γ)ωθ (θ + γ, ζ)
(9.2) (9.3) (9.4)
9. SENSITIVITY ESTIMATES
105
Proof. According to (9.8) below, we can rewrite the Lundberg equation as ω(θ + γ, ζ) − ω(θ, ζ) = log(1 + γ/β). Differentiating w.r.t. β yields ωθ (θ + γ, ζ)γβ =
³γ 1 γ ´ β − 2 . 1 + γ/β β β
From this (9.2) follows by straightforward algebra, and the proofs of (9.3), (9.4) are similar. 2 Now consider the ruin probability ψ = ψ(u) itself. Of course, we cannot expect in general to find explicit expressions like in Example 9.1 or Proposition 9.3, but must look for approximations for the sensitivities ψβ , ψθ , ψζ . The most intuitive approach is to rely on the accuracy of the Cram´er-Lundberg approximation, so that heuristically we obtain ψβ ≈
∂ Ce−γu = Cβ e−γu − uγβ Ce−γu ≈ −uγβ ψ ∂β
(9.5)
as u → ∞. As will be seen below, this intuition is indeed correct. However, mathematically a proof is needed basically to show that two limits (u → ∞ and the differentiation as limit of finite differences) are interchangeable. Consider first the case of ∂ψ/∂β: Proposition 9.4 As u → ∞, it holds that ∂ψ γC 2 ∼ ue−γu . ∂β β(1 − ρ) Proof. We shall use the renewal equation (3.2) for ψ(u), Z ∞ Z u ψ(u) = β B(x) dx + ψ(u − x)βB(x) dx. u
Letting ϕ = ∂ψ/∂β and differentiating (9.6), we get Z ∞ Z u Z ϕ(u) = B(x) dx + ψ(u − x)B(x) dx + u
(9.6)
0
0
u
ϕ(u − x)βB(x) dx.
0
Proceeding in a similar way as in the proof of the Cram´er-Lundberg approximation based upon (9.6) (Section 5), we multiply by eγu and let Z(u) = eγu ϕ(u), F (dx) = eγx βB(x)dx and z = z1 + z2 , where Z u Z ∞ ψ(u − x)B(x) dx . B(x) dx, z2 (u) = eγu z1 (u) = eγu u
0
106
CHAPTER IV. THE COMPOUND POISSON MODEL
Then Z = z + F ∗ Z and F is a proper probability distribution. By dominated convergence, Z Z 1 ∞ C 1 u γ(u−x) e ψ(u − x) F (dx) → C F (dx) = z2 (u) = , β 0 β 0 β b as u → ∞, and also z1 (u) → 0 because of B[γ] < ∞. Hence by a variant of the key renewal theorem (Proposition A1.2 of the Appendix), Z(u)/u → C/βµF where µF is the mean of F . But from the proof of Theorem 5.3 (see in particular (5.10)), µF = (1 − ρ)/Cγ. Combining these estimates, the proof is complete. 2 For the following, we note the formulas Eθ,ζ t(U ) Eθ,ζ e
αU
Eθ,ζ t(U )e
αU
= ωζ (θ, ζ), © ª bθ,ζ [α] = exp ω(θ + α, ζ) − ω(θ, ζ) , = B © ª = ωζ (θ + α, ζ) exp ω(θ + α, ζ) − ω(θ, ζ)
(9.7) (9.8) (9.9)
which are well-known and easy to show (see e.g. Barndorff-Nielsen [136]). Further write £ ¤ © ª dθ = ωθ (θ + γ, ζ) − ωθ (θ, ζ) exp ω(θ + γ, ζ) − ω(θ, ζ) £ ¤³ γ´ = ωθ (θ + γ, ζ) − ωθ (θ, ζ) 1 + , β £ ¤ © ª dζ = ωζ (θ + γ, ζ) − ωζ (θ, ζ) exp ω(θ + γ, ζ) − ω(θ, ζ) £ ¤³ γ´ = ωζ (θ + γ, ζ) − ωζ (θ, ζ) 1 + . β Proposition 9.5 Assume that (9.1) holds. Then as u → ∞, ∂ψ βC 2 dθ ∼ ue−γu , ∂θ 1−ρ
∂ψ βC 2 dζ ∼ ue−γu . ∂ζ 1−ρ
Proof. By straightforward differentiation, Z ∞ © ª ∂B(x) ∂ = exp θy + ζt(y) − ω(θ, ζ) µ(dy) ∂ζ ∂ζ Z ∞x £ ¤ = t(y) − ωζ (θ, ζ) B(dy). x
Letting ϕ = ∂ψ/∂ζ, it thus follows from (9.6) that Z u ϕ(u) = e−γu z1 (u) + e−γu z2 (u) + ϕ(u − x)βB(x) dx , 0
(9.10)
9. SENSITIVITY ESTIMATES
107
where Z = βeγu Z γu = e
z1 (u) z2 (u)
∞
Multiplying by e
∞£
¤ t(y) − ωζ (θ, ζ) B(dy) dx, u x Z ∞ u £ ¤ ψ(u − x)β t(y) − ωζ (θ, ζ) B(dy) dx.
0 γu
Z
x
and letting
Z(u) = eγu ϕ(u),
z = z1 + z2 ,
F (dx) = eγx βB(x)dx,
this implies Z = z + F ∗ Z. By dominated convergence and (9.7)-(9.9), Z ∞ Z ∞ £ ¤ γx z2 (u) → C ·e β t(y) − ωζ (θ, ζ) B(dy) dx 0 x Z ∞ £ ¤1 = βC t(y) − ωζ (θ, ζ) (eγy − 1) B(dy) γ Z0 ∞ £ ¤ βC = t(y) − ωζ (θ, ζ) eγy B(dy) γ 0 βC = dζ γ as u → ∞, and also z1 (u) → 0 because of Z ∞ £ ¤ eγy t(y) − ωζ (θ, ζ) B(dy) < ∞ . 0
Hence,
Z(u) βC → dζ , u γµF
from which the second assertion of (9.10) follows, and the proof of the first one is similar. 2 Example 9.6 Consider the gamma density b(x) =
© ª 1 δ α α−1 −δx x e = exp −δx + α log x − (log Γ(α) − α log δ) · . Γ(α) x
Here (9.1) holds with µ(dx) = x−1 dx, θ = −δ, ζ = α, t(x) = log x, ω(θ, ζ) = log Γ(α) − α log δ = log Γ(ζ) − ζ log(−θ).
108
CHAPTER IV. THE COMPOUND POISSON MODEL 0
We get ωζ (θ, ζ) = Ψ(ζ)−log(−θ) = Ψ(α)−log δ where Ψ = Γ /Γ is the Digamma function, ωθ (θ, ζ) = −ζ/θ = α/δ. It follows after some elementary calculus that ρ = αβ/δ and, by inserting in the above formulas, that C
=
dθ
=
dζ
=
γβ
=
γδ = −γθ
=
γα = γζ
=
1−ρ , − γ)α+1 − 1
αβδ α /(δ
δ α−1 , (δ − γ)α+1 ³ δ ´³ δ ´α , log δ−γ δ−γ γ 2 − δγ , αβ 2 + αβγ + βγ − βδ αβγ + αγ 2 − 2 , δ − δγ − αβδ − αδγ ³ δ ´ (βδ + δγ − βγ − γ 2 ) log . δ − γ − αβ − αγ δ−γ αγ
(9.11) (9.12) (9.13) (9.14)
Finally, (9.10) takes the form ∂ψ ∂ψ βC 2 dθ = − ∼ −ue−γu , ∂δ ∂θ 1−ρ
∂ψ ∂ψ βC 2 dζ = ∼ ue−γu . ∂α ∂ζ 1−ρ 2
Example 9.7 Consider the inverse Gaussian density bξ,c (x) = √
n ´o 1 ³ c2 exp ξc − + ξ2x . 2 x 2x3 π c
This has the form (9.1) with µ(dx) = √
1 2x3 π
dx, θ = − p
ω(θ, ζ) = −ξc − log c = −2 In particular, for α ≤ α∗ =
ξ2 c2 1 , ζ = − , t(x) = , 2 2 x
(−θ)(−ζ) −
1 1 log(−ζ) − log 2. 2 2
ξ2 2
p © ª © ¡ ¢ª bθ,ζ [α] = exp ω(θ + α, ζ) − ω(θ, ζ) = exp c ξ − ξ 2 − 2α . B
9. SENSITIVITY ESTIMATES
109
b ∗ ] ≥ 1 + α∗ /β of Section 6a needed for the existence of Thus the condition B[α ξc γ becomes e ≥ 1 + ξ 2 /2β. Straightforward but tedious calculations, which we omit in part, further yield 0 bθ,ζ βB [γ] − 1 =
= ωζ (θ, ζ)
=
γβ
=
γξ
=
γc
=
dθ
=
dζ
=
p © ª 1 −1 β exp c(ξ − ξ 2 − 2γ) p 2 c ξ − 2γ β+γ p −1 c ξ 2 − 2γ s r θ 1 ξ 1 ζ c − = + , ωθ (θ, ζ) = = , ζ 2ζ c c2 θ ξ p γ ξ 2 − 2γ p , β ξ 2 − 2γ − βc(β + γ) p ξ − ξ 2 − 2γ −ξγθ = −c(γ + β) p , ξ 2 − 2γ − c(γ + β) p ξ 2 − 2γ − ξ ξ 2 − 2γ −cγζ = −(γ + β) p , ξ 2 − 2γ − c(γ + β) h 1 1 i³ γ´ c p − 1− , ξ β ξ 2 − 2γ i³ 1 hp 2 γ´ ξ − 2γ − ξ 1 − . c β
Finally, (9.10) takes the form ∂ψ ∂ψ βC 2 dθ = −ξ ∼ −ξue−γu , ∂ξ ∂θ 1−ρ
∂ψ ∂ψ βC 2 dζ = −c ∼ −cue−γu . ∂c ∂ζ 1−ρ 2
Remark 9.8 The specific form of (9.1) is motivated as follows. In general, the exponent of the density in an exponential family has the form θ1 t1 (x) + · · · + θk tk (x). Thus, we have assumed k = 2 and t1 (x) = x. That it is no restriction to assume one of the ti (x) to be linear follows since the whole set-up requires exponential moments to be finite (thus we can always extend the family if necessary by adding a term θx). That it is no restriction to assume k ≤ 2 follows since if k > 2, we can just fix k − 2 of the parameters. Finally if k = 1, the exponent is either θx, in which case we can just let t(x) = 0, or ζt(x), in which case the extension just described applies. 2
110
CHAPTER IV. THE COMPOUND POISSON MODEL
Notes and references The general area of sensitivity analysis (gradient estimation) is currently receiving considerable interest in queueing theory. However, the models there (e.g. queueing networks) are typically much more complicated than the one considered here, and hence explicit or asymptotic estimates are in general not possible. Thus, the main tool is simulation, for which we refer to XV.7 and references therein. Comparatively less work seems to have been done in risk theory; thus, to our knowledge, the results presented here are new. Van Wouve et al. [861] consider a special problem related to reinsurance. For the study of perturbation via perturbed renewal equations, see Gyllenberg & Silvestrov [444].
10
Estimation of the adjustment coefficient
We consider a non-parametric set-up where β, B are assumed to be completely unknown, and we estimate γ by means of the empirical solution γT to the Lundberg equation. To this end, let βT =
NT , T
NT X bT [α] = 1 eαUi , B NT i=1
¡ ¢ bT [α] − 1 − α , κT (α) = βT B
and let γT be defined by κT (γT ) = 0. bT and hence γT is undefined. Also, if Note that if NT = 0, then B ρT = β T
1 (U1 + · · · + UNT ) > 1 , NT
then γT < 0. However, by the LLN both P(NT = 0) and P(ρT > 1) converge to 0 as T → ∞. a.s. b Theorem 10.1 As T → ∞, γT → γ. If furthermore B[2γ] < ∞, then ³ 1 ´ γT − γ ≈ N 0, σγ2 , T
where σγ2 = βκ(2γ)/κ0 (γ)2 . For the proof, we need a lemma. Lemma 10.2 As T → ∞, bT [γ] B
≈
κT (γ) ≈
³ b b 2´ B[2γ] − B[γ] b N B[γ], , βT ³ κ(2γ) ´ . N T
(10.1) (10.2)
10. ESTIMATION OF THE ADJUSTMENT COEFFICIENT
111
Proof. Since ¡ ¢2 b b 2, Var(eγU ) = Ee2γU − EeγU = B[2γ] − B[γ] we have
³ b b 2´ 1 X γUi b B[2γ] − B[γ] . e ≈ N B[γ] n i=1 n n
a.s.
Hence (10.1) follows from NT /T → β and Anscombe’s theorem. More generally, since NT /T ≈ N (β, β/T ), it is easy to see that we can write √ β V1 ³ β ´ ³ β ´ 1 T , ≈ + √ √ q bT [γ] b B B[γ] 2 b b T β B[2γ] − B[γ] V2 where V1 , V2 are independent N (0, 1) r.v.’s. Hence κT (γ)
= ≈ ≈ D = =
¡
¢¡ ¢ bT [γ] − B[γ]) b b − 1) − γ β + (βT − β) (B + (B[γ] ¡ ¢ ¡ ¢ ¡ ¢ b − 1 − γ + (βT − β) B[γ] b −1 +β B bT [γ] − B[γ] b β B[γ] p q ª ¢ 1 ©p ¡ b b b 2 · V2 − B[γ] 0+ √ β B[γ] − 1 V1 + β B[2γ] T ³ βn o´ b − 1)2 + B[2γ] b b 2 N 0, B[γ] − B[γ] T ³β n o´ 2γ b N B[2γ] − −1 T β
which is the same as (10.2).
2
Proof of Theorem 10.1. By the law of large numbers, a.s. a.s. bT [α] a.s. b βT → β, B → B[α], κT (α) → κ(α).
Let 0 < ² < γ. Then κ(γ − ²) < 0 < κ(γ + ²) and hence κT (γ − ²) < 0 < κT (γ + ²) for all sufficiently large T . I.e., γT ∈ (γ − ², γ + ²) eventually, and the truth of a.s. this for all ² > 0 implies γT → γ. Now write κT (γT ) − κT (γ) = κ0T (γT∗ )(γT − γ), (10.3)
112
CHAPTER IV. THE COMPOUND POISSON MODEL
where γT∗ is some point between γT and γ. If γT ∈ (γ − ², γ + ²), we have κ0T (γ − ²) < κ0T (γT∗ ) < κ0T (γ + ²). By the law of large numbers, bT0 [α] = B
NT 1 X a.s. b 0 [α]. Ui eαUi → EU eαU = B NT i=1
a.s.
Hence κ0T (α) → κ0 (α) for all α so that for all sufficiently large T κ0 (γ − ²) < κ0T (γT∗ ) < κ0 (γ + ²), a.s.
which implies κ0T (γT∗ ) → κ0 (γ). Combining (10.3) and Lemma 10.2, it follows that γT − γ
≈ ≈
κT (γT ) − κT (γ) κT (γ) = − 0 0 κ (γ) κ (γ) ³ κ(2γ) ´ ¡ ¢ = N 0, σγ2 /T . N T κ0 (γ)
2 Theorem 10.1 can be used to obtain error bounds on the ruin probabilities when the parameters β, θ are estimated from data. To this end, first note that ¡ ¢ e−γT u ≈ N e−γu , u2 e−2γu σγ2 /T . Thus an asymptotic upper α confidence bound for e−γu (and hence by Lundberg’s inequality for ψ(u)) is fα e−γT u + √ u e−γu σγ;T T 2 = βT κT (2γT )/κ0T (γT )2 is the empirical estimate of σγ2 and fα where σγ;T satisfies Φ(−fα ) = α (e.g., fα = 1.96 if α = 2.5%).
Notes and references Theorem 10.1 is from Grandell [428]. A major restriction b of the approach is the condition B[2γ] < ∞ which may be quite restrictive. For example, if B is exponential with rate δ so that γ = δ − β, it means 2(δ − β) < δ, i.e. δ < 2β or equivalently ρ > 1/2 or η < 100%. For this reason, various alternatives have been developed. One (see Schmidli [771]) is to let {Vt } be the workload process of an M/G/1 queue with the same arrival epochs as the risk process and service times U1 , U2 , . . ., i.e. Vt = St − inf 0≤v≤t Sv . Letting ˘ ¯ ω0 = 0, ωn = inf t > ωn−1 : Vt = 0, Vs > 0 for some t ∈ [ωn−1 , t] ,
10. ESTIMATION OF THE ADJUSTMENT COEFFICIENT
113
the nth busy cycle is then [ωn−1 , ωn ), and the known fact that the Yn =
max
t∈[ωn−1 ,ωn )
Vt
are i.i.d. with a tail of the form P(Y > y) ∼ C1 e−γy (see e.g. Asmussen [65]) can then be used to produce an estimate of γ. This approach in fact applies also for many models more general than the compound Poisson one. Further work on estimation of γ with different methods can be found in Cs¨ org˝ o& Steinebach [268], Cs¨ org˝ o & Teugels [269], Deheuvels & Steinebach [285], Embrechts & Mikosch [348], Herkenrath [459], Hipp [464, 465], Frees [371], Mammitzsch [628], Brito & Freitas [202], Conti [256] and Pitts, Gr¨ ubel & Embrechts [707].
This page intentionally left blank
Chapter V
The probability of ruin within finite time This chapter is concerned with the finite time ruin probabilities ψ(u, T )
¡ ¢ = P τ (u) ≤ T ³ ´ = P inf Rt < 0 | R0 = u 0≤t≤T ³ ´ = P sup St > u . 0≤t≤T
Only the compound Poisson case is treated; generalizations to other models are either discussed in the Notes and References or in relevant chapters. The notation is essentially as in Chapter IV. In particular, the premium rate is 1, the Poisson intensity is β and the claim size distribution is B with b and mean µB . The safety loading is η = 1/ρ − 1 where ρ = βµB . m.g.f. B[·] Unless otherwise stated, it is assumed that η > 0 and that the adjustment coefficient (Lundberg exponent) γ, defined as solution of κ(γ) = 0 where κ(α) = b − 1) − α, exists. Further let γm be the unique point in (0, γ) where κ(α) β(B[α] attains its minimum value, see Fig. V.1 (the role of γy will be explained in Section 4b). The claims surplus is {St }, the time of ruin is τ (u) and ξ(u) = Sτ (u) − u is the overshoot. 115
116
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
Figure V.1
1
Exponential claims
Proposition 1.1 In the compound Poisson model with exponential claims with rate ν and safety loading η > 0, the conditional mean and variance of the time to ruin are given by ¯ £ ¤ E τ (u) ¯ τ (u) < ∞ = ¯ £ ¤ Var τ (u) ¯ τ (u) < ∞ =
βu + 1 , ν−β 2βνu + β + ν . (ν − β)3
(1.1) (1.2)
Proof. Let as in Example IV.5.1 PL , EL refer to the exponentially tilted process with arrival intensity ν and exponential claims with rate β (thus, ρL = ν/β = 1/ρ > 1). By the likelihood identity IV.(4.8), we have for k = 1, 2 that £ ¤ E τ (u)k ; τ (u) < ∞ = EL τ (u)k e−γSτ (u) = e−γu EL e−γξ(u) EL τ (u)k β = e−γu EL τ (u)k = ψ(u)EL τ (u)k , ν using that the overshoot ξ(u) is exponential with rate β w.r.t. PL and independent of τ (u). In particular, ¯ ¯ £ ¤ £ ¤ E τ (u) ¯ τ (u) < ∞ = EL τ (u), Var τ (u) ¯ τ (u) < ∞ = VarL τ (u) . For (1.1), we have by Wald’s identity that (note that EL St = t(ρL − 1)) EL Sτ (u) EL τ (u)
= (ρL − 1)EL τ (u), =
u + 1/β βu + 1 u + EL ξ(u) = = . ρL − 1 ν/β − 1 ν−β
1. EXPONENTIAL CLAIMS
117
For (1.2), Wald’s second moment identity yields ¡ ¢2 2 EL Sτ (u) − (ρL − 1)τ (u) = σL EL τ (u) 2 where σL = κ00 (γ) = 2ν/β 2 . Since Sτ (u) and (ρL − 1)τ (u) are independent with the same mean, the l.h.s. is
VarL Sτ (u) + VarL ((ρL − 1)τ (u))
= =
VarL ξ(u) + (ρL − 1)2 VarL τ (u) µ ¶2 1 ν + − 1 VarL τ (u). β2 β
Thus the l.h.s. of (1.2) is 2 EL τ (u) − 1/β 2 σL 2ν(βu + 1)/(ν − β) − 1 = , (ν/β − 1)2 (ν − β)2
which is the same as the r.h.s.
2
Proposition 1.2 In the compound Poisson model with exponential claims with rate ν and safety loading η > 0, the Laplace transform of the time to ruin is given by ³ £ ¤ ρδ ´ Ee−δτ (u) = E e−δτ (u) ; τ (u) < ∞ = e−ρδ u 1 − (1.3) ν √ for δ ≥ κ(γm ) = 2 βν − β − ν, where p ν − β − δ + (ν − β − δ)2 + 4δν ρδ = . 2 √ Proof. It is readily checked that γm = ν − βν and hence that the value of κ(γm ) is as asserted. Let ρδ > γm be determined by κ(ρδ ) = δ. This means that β(ν/(ν − ρδ ) − 1)−ρδ = δ, which leads to the quadratic ρ2δ +(β −ν +δ)ρδ −νδ = 0 with solution ρδ (the sign of the square root is + because ρδ > 0). But by the fundamental likelihood ratio identity (Theorem IV.4.3) we have £ ¤ E e−δτ (u) ; τ (u) < ∞ £ © ª ¤ = Eρδ exp −δτ (u) − ρδ Sτ (u) + τ (u)κ(ρδ ) ; τ (u) < ∞ νρδ = e−ρδ u Eρδ e−ρδ ξ(u) = e−ρδ u , νρδ + ρδ where we used that Pρδ (τ (u) < ∞) = 1 because ρδ > γm and hence Eρδ S1 = 2 κ0 (ρδ ) > 0. Using νρδ = ν − ρδ , the result follows.
118
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME Note that it follows from Proposition 1.3 that we can write Ee−δτ (u) = e−ρδ u Ee−δτ (0) .
(1.4)
The interpretation of this is that τ (u) can be written as the independent sum of τ (0) plus a r.v. Y (u) belonging to a convolution semigroup. More precisely, M (u)
τ (u) = τ +
X
τk
(1.5)
k=1
where τ = τ (0) is the length of the first ladder segment, τ1 , τ2 , . . . are the lengths of the ladder segments 2, 3, . . ., and M (u) + 1 is the index of the ladder segment corresponding to τ (u). Cf. Fig. V.2, where Y1 , Y2 , . . . are the ladder heights which form a terminating sequence of exponential r.v.’s with rate ν. S τ (u) 6 t 6
Y2 τ1 Y1
t τ
τ1
u Y1
-
τ
Y2
Figure V.2 For numerical purposes, the following formula is convenient by allowing ψ(u, T ) to be evaluated by numerical integration: Proposition 1.3 Assume that claims are exponential with rate ν = 1. Then Z 1 π f1 (θ)f2 (θ) −(1−β)u ψ(u, T ) = βe − dθ (1.6) π 0 f3 (θ) where f1 (θ) = f2 (θ) = f3 (θ) =
n p ¡p ¢o β exp 2 βT cos θ − (1 + β)T + u β cos θ − 1 , ¡ p ¢ ¡ p ¢ cos u β sin θ − cos u β sin θ + 2θ , p 1 + β − 2 β cos θ .
1. EXPONENTIAL CLAIMS
119
Note that the case ν 6= 1 is easily reduced to the case ν = 1 via the formula ψβ,ν (u) = ψβ/ν,1 (νu, νT ). Proof. We use the formula ψ(u, T ) = P(VT > u) where {Vt } is the workload process in an initially empty M/M/1 queue with arrival rate β and service rate ν = 1, cf. Corollary III.3.6. Let {Qt } be the queue length process of the queue (number in system, including the customer being currently served). If QT = N > 0, then VT = U1,T + · · · + UN,T , where U1,T is the residual service time of the customer being currently served and U2,T , . . . , UN,T the service times of the customers awaiting service. Since U1,T , U2,T , . . . , UN,T are conditionally i.i.d. and exponential with rate ν = 1, the conditional distribution of VT given QT = N is that of EN where the r.v. EN has an Erlang distribution with parameters (N, 1), i.e. density xN −1 e−x /(N − 1)!. Hence ψ(u, T ) =
P(VT > u) =
∞ X
P(QT = N )P(EN > u)
N =1
= =
∞ X
P(QT = N )
N =1 ∞ X
e−u
k=0
e−u
k=0
N −1 X
uk k!
k
u P(QT ≥ k + 1) . k!
(1.7)
For j = 0, 1, 2, . . ., let (cf. [4]) Z ∞ X (x/2)2n+j 1 π x cos θ Ij (x) = = e cos jθ dθ n!(n + j)! π 0 n=0
(1.8)
denote the modified Bessel function of order j, let I−j (x) = Ij (x), and define √ ιj = e−(1+β)T β j/2 Ij (2 βT ). Then (see Prabhu [712, pp. 9–12], in particular equations (1.38), (1.44); similar formulas are in [APQ, pp. 87–89]) ∞ X
ιj
= 1,
j=−∞
P(QT ≥ k + 1)
=
1−
k X
ιj + β k+1
j=−∞
=
β k+1 +
∞ X j=k+1
−k−2 X
ιj
j=−∞
ιj − β k+1
∞ X j=−k−1
ιj .
120
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
By Euler’s formulas, ∞ i h β (k+1)/2 ei(k+1)θ i h X β j/2 eijθ = < β j/2 cos(jθ) = < β 1/2 eiθ − 1 j=k+1 j=k+1 £ ¡ ¢¤ < β (k+1)/2 ei(k+1)θ β 1/2 e−iθ − 1 = ¯ ¯ ¯β 1/2 eiθ − 1¯2 £ ¡ ¢¤ β (k+1)/2 β 1/2 cos(kθ) − cos (k + 1)θ = , f3 (θ) ∞ X
∞ X
β k+1
β j/2 cos(jθ) = β k+1 <
j=−k−1
∞ h X
β j/2 eijθ
j=−k−1
i = <
β (k+1)/2 e−i(k+1)θ β 1/2 eiθ − 1
¡ ¢¤ £ < β (k+1)/2 e−i(k+1)θ β 1/2 e−iθ − 1 ¯ ¯ ¯β 1/2 eiθ − 1¯2 £ ¡ ¢ ¡ ¢¤ β (k+1)/2 β 1/2 cos (k + 2)θ − cos (k + 1)θ . f3 (θ)
= =
Hence the integral expression in (1.8) yields P(QT ≥ k + 1) − β k+1 £ ¤ Z π β (k+1)/2 β 1/2 cos(kθ) − cos((k + 2)θ) −(1+β)T 1 2β 1/2 T cos θ = e dθ . e · π 0 f3 (θ) Since P(Q∞ ≥ k + 1) = β k+1 , it follows as in (1.7) that ψ(u) =
∞ X k=0
e−u
uk k+1 β . k!
A further application of Euler’s formulas yields ∞ X uk k=0
k!
β
k/2
¡
cos (k + 2)θ
¢
= =
∞ X uk k=0
k!
β k/2 cos(kθ) = =
∞ h X 1/2 iθ (uβ 1/2 eiθ )k i 2iθ < e = <euβ e +2iθ k! k=0 ¡ ¢ uβ 1/2 cos θ e cos uβ 1/2 sin θ + 2θ , ∞ hX 1/2 iθ (uβ 1/2 eiθ )k i = <euβ e < k! k=0 ¡ ¢ uβ 1/2 cos θ e cos uβ 1/2 sin θ .
2. THE RUIN PROBABILITY WITH NO INITIAL RESERVE The rest of the proof is easy algebra.
121 2
Notes and references Proposition 1.3 was given in Asmussen [55] (as pointed out by Barndorff-Nielsen & Schmidli [138], there are several misprints in the formula there; however, the numerical examples in [55] are correct). Related formulas are in Tak´ acs [827]. Seal [785] gives a different numerical integration fomula for 1 − ψ(u, T ) which, however, is numerically unstable for large T . Alternatively, by using generators one can also represent ψ(u, T ) as the solution of the partial integro-differential equation Z u ` ´ ∂ψ(u, T ) ∂ψ(u, T ) − − βψ(u, T ) + β ψ(u − y, T ) dB(y) + β 1 − B(u) = 0 ∂u ∂T 0 with boundary conditions limu→∞ ψ(u, T ) = 0 for all T > 0 and ψ(u, 0) = 0 for all u ≥ 0. For exponential claims this equation can be transformed into a second-order partial differential equation, which in Pervozvansky [694] was solved by Laplace transformation w.r.t. T and careful applications of the Cauchy residue theorem, resulting in an alternative integral representation of (1.6) in terms of trigonometric functions.
2
The ruin probability with no initial reserve
In this section, we are concerned with describing the distribution of the ruin time τ (0) in the case where the initial reserve is u = 0. We allow a general ¡ claim size¢ distribution B and recall that we have the explicit formula ψ(0) = P τ (0) < ∞ = ρ. We first prove two classical formulas which are remarkable by showing that the ruin probabilities can be reconstructed from the distributions of the St , or, equivalently, from the accumulated claim distribution F (x, t) = P
Nt ³X
´ Ui ≤ x
i=1
(note that P(St ≤ x) = F (x + t, t)). The first formula, going back to Cram´er, expresses ψ(0, T ) in terms of F (·, T ), and the next one (often called Seal’s formula but originating from Prabhu [711]) shows how to reduce the case u 6= 0 to this. Z 1 T Theorem 2.1 1 − ψ(0, T ) = F (x, T )dx. T 0 © (v) ª Proof. For any v ∈ [0, T ], we define a new claim surplus process St 0≤t≤T by a ‘cyclic translation’, meaning that we interchange the two segments of the arrival process of {St }0≤t≤T corresponding to the intervals [0, v], resp. [v, T ]. See Fig. V.3.
122
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
6
6 (v)
St
St T
T −v
T
v
Figure V.3 In formulas, ½ (v) St
=
St+v − Sv ST − Sv + St−T +v
0≤t≤T −v . T −v ≤t≤T
Define
ª © (v) (v) ,0≤w≤t M (v, t) = St ≤ Sw © (v) ª as the event that Sw is at a minimum at time t. Then ¡ ¢ ¡ ¢ 1 − ψ(0, T ) = P τ (0) > T = P M (0, T ) Z Z T ¢ ¡ ¢ 1 T ¡ 1 = P M (v, T ) dv = E I M (v, T ) dv, T 0 T 0 where the second equality follows from III.(5.2) with A = (0, ∞), and the third from the obvious fact (exchangeability properties of the Poisson process) that © (0) ª ¡ ¢ © (v) ª so that P M (v, T ) does not St has the same distribution as St = St depend on v. ¢ RT ¡ Now consider the evaluation of 0 I M (v, T ) dv. Obviously, this integral (v) is 0 if ST ≡ ST > 0. If ST < 0, there exist v such that M (v, T ) occurs. For example, letting ω = inf {t > 0 : St− = min0≤w≤T Sw }, we can take v ∈ (ω − ², ω) for some small ². We claim that if M (0, T ) occurs, then M (v, T ) = M (0, v). Indeed, we can write M (v, T ) as © ª © ª ST ≤ St+v − Sv , 0 ≤ t ≤ T − v ∩ ST ≤ ST − Sv + St−T +v , T − v ≤ t ≤ T © ª © ª = ST ≤ St − Sv , v ≤ t ≤ T ∩ ST ≤ ST − Sv + St , 0 ≤ t ≤ v = {ST ≤ St − Sv , v ≤ t ≤ T } ∩ M (0, v) = M (0, v),
2. THE RUIN PROBABILITY WITH NO INITIAL RESERVE
123
where the last equality follows from ST ≤ St on M (0, T ) and Sv ≤ 0 on M (0, v). It follows that if M (0, T ) occurs, then 1 T
Z
T 0
¡ ¢ 1 I M (v, T ) dv = T
Z
T
¡ ¢ I M (0, v) dv = −ST
0
(note that the Lebesgue measure of the v for which {St } is at a minimum at v is exactly −ST on M (0, T )). It is then clear from the cyclical nature of the problem that this holds irrespective of whether M (0, T ) occurs or not as long as ST < 0. Hence Z
T
¡ ¢ I M (v, T ) dv 0 Z 1 1 ∞ = EST− = P(ST ≤ −x) dx T T 0 Z Z NT ´ 1 T 1 T ³X = P(ST ≤ −x) dx = P Ui ≤ T − x dx . T 0 T 0 i=1
1 E T
2 Let f (·, t) denote the density of F (·, t). Z Theorem 2.2 1 − ψ(u, T ) = F (u + T, T ) −
T¡
¢ 1 − ψ(0, T − t) f (u + t, t) dt.
0
o nP NT can occur in two ways: either Proof. The event {ST ≤ u} = 1 Ui ≤ u + T ruin does not occur in [0, T ], or it occurs, in which case there is a last time σ where St downcrosses level u, cf. Fig V.4. Here σ ∈ [t, t + dt] occurs if and only if St ∈ [u, u + dt] and there is no upcrossing of level u after time t, which occurs w.p. ψ(T − t). Hence Z P(ST ≤ u) = 1 − ψ(u, T ) +
T¡
¢ ¡ ¢ 1 − ψ(0, T − t) P St ∈ [u, u + dt] ,
0
which is the same as the assertion of the theorem.
2
124
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME 6
u
σ
T
Figure V.4 The following representation of τ (0) will be used in the next section. The proof will be combined with the proof of Theorem IV.2.2. Proposition 2.3 Define τ− (z) = inf {t > 0 : St = −z}, z > 0. Let Z be a r.v. which is independent ¢of St and ¡ ¡ has the ¢stationary excess distribution B0 . Then P τ (0) ∈ · | τ (0) < ∞ = P τ− (Z) ∈ · . Proof of Theorem IV.2.2. For a fixed T > 0, define St∗ = ST − ST −t− and let © ª A(z, T ) = St < 0, 0 < t < T, ST − = −z , © ª C(z, T ) = St > −z, 0 < t < T, ST − = −z , © ∗ ª C ∗ (z, T ) = St > −z, 0 < t < T, ST∗ − = −z . Then ¡ ¢ ¡ ¢ P τ (0) ∈ [T, T + dT ], −Sτ (0)− ∈ [z, z + dz] = P A(z, T ) βB(z) dz dT. (2.1) But by sample path inspection (cf. Fig. V.5), A(z, T ) = C ∗ (z, T ), ¡and since¢ {St }0≤t≤T , {St∗ }0≤t≤T have the same distribution, we therefore have P A(z, T ) ¡ ¢ = P C(z; T ) . Hence integrating (2.1) yields Z ∞ ¡ ¢ ¡ ¢ P C(z, T ) dT P −Sτ (0)− ∈ [z, z + dz], τ (0) < ∞ = βB(z) dz ¡ 0 ¢ = βB(z) dz P τ− (z) < ∞ = βB(z) dz.
2. THE RUIN PROBABILITY WITH NO INITIAL RESERVE
6
6
St
St∗
T = τ+
−z
125
T -
Figure V.5 Thus ¡ ¢ P −Sτ (0)− > x, Sτ (0) > y; τ (0) < ∞ Z ∞ ¯ ¡ ¢ ¡ ¢ = P U > y + z ¯ U > z P −Sτ (0)− ∈ [z, z + dz], τ (0) < ∞ x ∞
Z =
x
B(y + z) βB(z) dz = β B(z)
Z
Z
∞
∞
B(y + z) dz = β x
B(z) dz , x+y
which is the assertion of Theorem IV.2.2.
2
Proof of Proposition 2.3. It follows by division by ¡ ¢ P Sτ (0)− ∈ [z, z + dz], τ (0) < ∞ = βB(z) dz in (2.1) that ¡ ¢ ¡ ¢ P τ (0) ∈ [T, T + dT ] | Sτ (0)− ∈ [z, z + dz], τ (0) < ∞ = P C(z) dT. Hence ¡ ¢ P τ (0) ∈ [T, T + dT ] | τ (0) < ∞ Z ∞ ¡ ¢ ¡ ¢ = dT P C(z) P Sτ (0)− ∈ [z, z + dz], τ (0) < ∞ Z0 ∞ ¡ ¢ ¡ ¢ = dT P C(z) P Z ∈ [z, z + dz], τ (0) < ∞ ¡0 ¢ = dT P τ− (Z) ∈ [T, T + dT ] . 2
126
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
Notes and references For Theorems 2.1, 2.2, see in addition to Prabhu [711] also Seal [784, 787]. Theorem 2.1 and the present proof is in the spirit of Ballot theorems, cf. Tak´ acs [827]; a martingale proof is in Delbaen & Haezendonck [287]. For related inequalities for positive u, see De Vylder & Goovaerts [304]. Proposition 2.3 was noted by Asmussen & Kl¨ uppelberg [86], who instead of the present direct proof gave two arguments, one based upon a result of Asmussen & Schmidt [103] generalizing Theorem III.5.5 and one upon excursion theory for Markov processes (see X.4a). For discrete claim size distributions, Picard & Lef`evre [701] used generalized Appell polynomials to develop recursion formulae for finite time ruin probabilities, see also Rulli`ere & Loisel [757]. This was later extended to more general set-ups including dependent claims, cf. for instance Ignatov & Kaishev [493, 494] and Lef`evre & Loisel [575]. Continuous versions of the discrete expressions of [701] are given in De Vylder & Goovaerts [303]. In the setting of general L´evy processes, some relevant references are Shtatland [798] and Gusak & Korolyuk [442].
3
Laplace transforms
As usual, −ρδ denotes the negative solution of the equation ¡ ¢ b − 1 − r = δ. κ(r) = β B[r]
(3.1)
Let τ− (y) be defined as Proposition 2.3. Note that τ− (y) < ∞ a.s. because of η > 0. Lemma 3.1 Ee−δτ− (y) = e−ρδ y . Proof. Optional stopping at τ− (y) ∧ T of the martingale © −ρ St −tκ(−ρ ) ª © −ρ St −δt ª δ e δ = e δ and letting T → ∞ using dominated convergence yields 1 = eρδ y Ee−δτ− (y) . 2 £ ¤ Let gδ (x) be the density of the measure E e−δτ (0) ; τ (0) < ∞, ξ(0) ∈ dx (recall that ξ(0) = Sτ (0) ). Z Lemma 3.2 gδ (x) = β eρδ x
∞
e−ρδ y B(dy).
x
Proof. Let Z be the surplus −Sτ (0)− just before ruin. Then by Proposition 2.3, ¯ £ ¤ E e−δτ (0) ¯ τ (0) < ∞, Z = y = Ee−δτ− (y) = e−ρδ y .
3. LAPLACE TRANSFORMS
127
Further by Theorem IV.2.2 ¡ ¢ P Z ∈ [y, y + dy], ξ(0) ∈ dx = βB(x + dy) dx and hence Z gδ (x) =
∞
Z e−ρδ y βB(x + dy) = β
0
∞
e−ρδ (y−x) B(dy) .
2
x
Lemma 3.3 For the Laplace transform gbδ [−s] = gbδ [−s] =
R∞ 0
e−sx gδ (x) dx we have
κ(−s) − s − δ + ρδ . ρδ − s
Proof. Z gbδ [−s] = = = =
∞
Z
∞
e−ρδ y B(dy) dx 0 x Z ∞ Z y −ρδ y β e B(dy) ex(−s+ρδ ) dx 0 0 Z ∞ β e−ρδ y B(dy)[ey(ρδ −s) − 1] ρδ − s 0 ¢ β ¡b b B[−s] − B[−ρ δ] . ρδ − s β
x(−s+ρδ )
e
b The result follows by inserting β B[−s] = κ(−s) + β − s and κ(−ρδ ) = δ. Corollary 3.4 E[e−δτ (0) ; τ (0) < ∞) = 1 −
2
δ . ρδ
Proof. Let b = 0.
2
Here is a classical result: the double Laplace transform of the ruin time τ (u): Z ∞ £ ¤ κ(−s)/s − δ/ρδ Corollary 3.5 e−su E e−δτ (u) ; τ (u) < ∞ du = . κ(−s) − δ 0 £ ¤ Proof. Define Zδ (u) = E e−δτ (u) ; τ (u) < ∞ . It is then easily seen that Zδ (u) Ru is the solution of the renewal equation Zδ (u) = zδ (u) + 0 Zδ (u − x)gδ (x) dx R∞ where zδ (u) = u gδ (x)dx. Hence Z 0
∞
£ ¤ e−su du E e−δτ (u) ; τ (u) < ∞ = Zbδ [−s] =
gbδ [0] − gbδ [−s] zbδ [−s] = . 1 − gbδ [−s] s(1 − gbδ [−s])
128
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
Using Lemma 3.3, the result follows after simple algebra.
2
Notes and references An explicit inversion of the double Laplace transform in Corollary 3.5 to obtain expressions for ψ(u, t) in terms of infinite series can be found for claim size distributions of mixed Erlang type in Garcia [389] and Dickson & Willmot [322], see also Willmot & Woo [893] and Dickson [310]. For a power series expansion, see e.g. Usabel [859, 860]. An alternative very accurate numerical method is to randomize the time horizon T and exploit the resulting additional smoothness of the problem, in particular in a matrix-analytic framework, cf. Section IX.8. In Chapter XII the results of this section will be extended in various directions in the context of Gerber-Shiu functions.
4
When does ruin occur?
For the general compound Poisson model, the known results are even less explicit than for the exponential claims case, and take basically the form of approximations and inequalities. The first main result of the present section is that the value u mL , where mL =
1 1 C 1 = = = , 0 b κ (γ) βL EL U − 1 1−ρ β B [γ] − 1 0
is in some appropriate sense critical as the most ‘likely’ time of ruin (here C is the Cram´er-Lundberg constant). Later results then deal with more precise and refined versions of this statement. P
Theorem 4.1 Assume η > 0. Then given τ (u) < ∞, τ (u)/u → mL as u → ∞. That is, for any ² > 0 ¯ ¯ ³¯ τ (u) ´ ¯ ¯ ¯ P ¯ (4.1) − mL ¯ > ² ¯ τ (u) < ∞ → 0 . u Further, for any m ψ(u, mu) → ψ(u)
½
0 1
m < mL m > mL .
(4.2)
For the proof, we need the following auxiliary result: Proposition 4.2 Assume η < 0, i.e. ρ = βµB > 1. Then as u → ∞, τ (u) a.s. 1 → m = , u ρ−1 τ (u) − mu D √ → N (0, ω 2 ) u
Eτ (u) 1 → , u ρ−1 (2)
where ω 2 = βµB m3 .
(4.3) (4.4)
4. WHEN DOES RUIN OCCUR?
129 a.s.
Proof. The assumption η < 0 ensures that P(τ (u) < ∞) = 1 and τ (u) → ∞. a.s. By Proposition IV.1.2, St /t → 1/m, and hence a.s. m = lim
t→∞
t τ (u) τ (u) τ (u) = lim = lim = lim , u→∞ Sτ (u) u→∞ u + ξτ (u) u→∞ u St
using ξτ (u) = o(u) a.s., cf. Proposition A1.6. This proves the first assertion of (4.3). For the second, note that by Wald’s identity u + Eξ(u) = ESτ (u) = Eτ (u) · ES1 = (ρ − 1)Eτ (u) and that Eξ(u)/u → 0, cf. again Proposition A1.6. For (4.4), note first that (Proposition IV.1.5) ³ ´ St − t/m D (2) √ → N 0, βµB . t According to Anscombe’s theorem (e.g. Theorem 7.3.2 of [246]) and (4.3), the same conclusion holds with t replaced by τ (u). If Z ∼ N (0, 1), this can be rewritten as q u + ξ(u) − τ (u)/m (2) p ≈ βµB Z, implying τ (u) q q τ (u) − mu D (2) (2) p ≈ −m βµB Z = m βµB Z, τ (u) q τ (u) − mu (2) 3/2 √ βµB Z = ωZ. ≈ m u 2 Proof of Theorem 4.1. The l.h.s. of (4.1) is ¯ ³¯ τ (u) ´ ¯ ¯ P ¯ − mL ¯ > ², τ (u) < ∞ u P(τ (u) < ∞) ¯ τ (u) ¯ h i ¯ ¯ e−γu EL e−γξ(u) ; ¯ − mL ¯ > ², τ (u) < ∞ u = ψ(u) ¯ ³¯ τ (u) ´ ¯ ¯ e−γu PL ¯ − mL ¯ > ² u . ≤ O(e−γu ) By Proposition 4.2, PL (·) → 0, proving (4.1), and (4.2) follows immediately 2 from (4.1).
130
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
Notes and references Theorem 4.1 is standard, though it is not easy to attribute priority to any particular author. Thus, the result comes out not only by the present direct proof but also from any of the results in the following subsections. For a study of the distribution of the number of claims until ruin, see Egidio dos Reis [340].
4a
Segerdahl’s normal approximation
We shall now prove a classical result due to Segerdahl, which may be viewed both as a refinement of Theorem 4.1 (by considering ψ(u, T ) for T which are close to the critical value umL ), and as a time-dependent version of the Cram´erLundberg approximation. Corollary 4.3 (Segerdahl [791]) Let C be the Cram´er-Lundberg constant 2 b 00 [γ]m3 where mL = 1/(ρL −1) = 1/(β B b 0 [γ]− and define ωL = βL EL U 2 m3L = β B L 1). Then for any y, ¡ √ ¢ eγu ψ u, umL + yωL u → CΦ(y). (4.5) For the proof, we need the following auxiliary result: Proposition 4.4 (Stam’s lemma) If η < 0, then ξ(u) and τ (u) are asymptotically independent in the sense that, letting Z be a N (0, ω 2 ) r.v. with ω 2 as in (4.4), one has ¡ ¢ ¡ ¢ ³ τ (u) − mu ´ √ → Ef ξ(∞) · Eg(Z) (4.6) Ef ξ(u) g u whenever f, g are continuous and bounded on [0, ∞), resp. (−∞, ∞). Proof. Define u0 = u − u1/4 . Then the distribution of τ (u) − τ (u0 ) given Fτ (u0 ) is readily seen to be degenerate at zero if Sτ (u0 ) > u and otherwise that of τ (v) ¡ ¢ with v = u − Sτ (u0 ) = u1/4 − ξ τ (u0 ) . Using (4.3), we get £ ¤ £ ¡ ¢ ¤ E τ (u) − τ (u0 ) = E τ u1/4 − ξ(u0 ) ; ξ(u0 ) ≤ u1/4 ≤ Eτ (u1/4 ) = O(u1/4 ), ¡ ¢ 0 and thus in (4.6), we ¡ can¢replace τ (u) by τ (u ). Let h(u) = Ef ξ(u) . Then h(u) → h(∞) = Ef ξ(∞) , and similarly as above we get £ ¡ ¢¯ ¤ E f ξ(u) ¯ Fτ (u0 ) ¡ ¢ ¡ ¢ ¡ ¢ ¡ ¢ = h u1/4 − ξ(u0 ) I ξ(u0 ) ≤ u1/4 + f ξ(u0 ) − u1/4 I ξ(u0 ) > u1/4 P
→
h(∞) + 0,
4. WHEN DOES RUIN OCCUR?
131
P D using that u1/4 − ξ(u0 ) → ∞ w.r.t. P because of ξ(u0 ) → ξ(∞) (recall that η < 0). Hence
¡ ¢ ³ τ (u0 ) − mu ´ √ Ef ξ(u) g u
= ∼
h £ ¡ ¤ ³ τ (u0 ) − mu ´i ¢¯ √ E E f ξ(u) ¯ Fτ (u0 ) g u ³ τ (u0 ) − mu ´ √ h(∞)Eg ∼ h(∞)Eg(Z) . u 2
Proof of Corollary 4.3. ¡ √ ¢ eγu ψ u, umL + yωL u
= = ∼ →
¡ √ ¢ eγu P τ (u) ≤ umL + yωL u £ √ ¤ EL e−γξ(u) ; τ (u) ≤ umL + yωL u ¡ √ ¢ EL e−γξ(u) · PL τ (u) ≤ umL + yωL u CΦ(y),
where we used Stam’s lemma in the third step and (4.4) in the last.
2
For practical purposes, Segerdahl’s result suggests the approximation µ ¶ T − umL −γu √ ψ(u, T ) ≈ Ce Φ (4.7) . ωL u √ To arrive at this, just substitute T = umL + yωL u in (4.5) and solve for y = y(T ). The precise condition for (4.7) to be valid is that T varies with u in such a way that y(T ) has a limit in (−∞, ∞) as u → ∞. Thus, in practice one would trust (4.7) whenever u is large and |y(T )| moderate or small (numerical evidence presented in [55] indicates, however, that for the fit of (4.7) to be good, u needs to be very large). A remarkably sharp and explicit asymptotic result in terms of the time horizon T is the following: Theorem 4.5 For every fixed u ≥ 0, we have, as T → ∞, ¡ ¢ ψ(u) − ψ(u, T ) ∼ C1 e−γm u−|κ(γm )|T T −3/2 1 + H(u) ,
(4.8)
¡ ¢−1/2 −2 where C1 = 2πβB 00 [γm ] γm and H(u) is a renewal function which satisfies ¡ 00 ¢−1 H(u) ∼ 2 βB [γm ] u as u → ∞. The proof is quite involved and uses deep results from random walk theory; we refer to Teugels [841].
132
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
Notes and references Corollary 4.3 is due to Segerdahl [791]. The present proof is basically that of Siegmund [806]; see also von Bahr [121] and Gut [443]. For refinements of Corollary 4.3 in terms of Edgeworth expansions, see Asmussen [55] and Malinovskii [625]. Cf. also H¨ oglund [478].
4b
Gerber’s time-dependent version of Lundberg’s inequality
For y > 0, define αy , γy by κ0 (αy ) =
1 , y
γy = αy − yκ(αy ).
(4.9)
Note that αy > γm and that γy > γ (unless for the critical value y = 1/mL ), cf. Fig. V.1. Theorem 4.6 ψ(u, yu) ≤
e−γy u ,
y<
ψ(u) − ψ(u, yu) ≤
e−γy u ,
y>
1
,
(4.10)
1 . κ0 (γ)
(4.11)
κ0 (γ)
Proof. Consider first the case y < 1/κ0 (γ). Then κ(αy ) > 0 (see Fig. V.1), and hence £ ¤ ψ(u, yu) = e−αy u Eαy e−αy ξ(u)+τ (u)κ(αy ) ; τ (u) ≤ yu £ ¤ ≤ e−αy u Eαy eτ (u)κ(αy ) ; τ (u) ≤ yu ≤ e−αy u+yuκ(αy ) . Similarly, if y > 1/κ0 (γ), we have κ(αy ) < 0 and get £ ¤ ψ(u) − ψ(u, yu) = e−αy u Eαy e−αy ξ(u)+τ (u)κ(αy ) ; yu < τ (u) < ∞ £ ¤ ≤ e−αy u Eαy eτ (u)κ(αy ) ; yu < τ (u) < ∞ ≤ e−αy u+yuκ(αy ) . 2 Remark 4.7 It may appear that the proof uses considerably less information on αy than is inherent in the definition (4.9). However, the point is that we want to select an α which produces the largest possible exponent in the inequalities. From the proof it is seen that this amounts to that α should maximize α−yκ(α). 2 Differentiating w.r.t. α, we arrive at the expression in (4.9).
4. WHEN DOES RUIN OCCUR?
133
In view of Theorem 4.6, γy is sometimes called the time-dependent Lundberg exponent. An easy combination with the proof of Theorem IV.6.3 yields the following sharpening of (4.10): Proposition 4.8 ψ(u, yu) ≤ C+ (αy )e−γy u where C+ (αy ) = sup R ∞ x≥0
x
B(x) eαy (y−x) B(dy)
.
Notes and references Theorem 4.6 is due to Gerber [397], who used a martingale argument. For a different proof, see Martin-L¨ of [631]. Numerical comparisons are in Grandell [430]; the bound e−γy u turns out to be rather crude, which may be understood from Theorem 4.9 below, which shows that the correct rate of decay of ψ(u, yu) is √ e−γy u / u. Some further discussion is given in XVI.2, and generalizations to more general models are given in Chapter VII. H¨ oglund [477] treats the renewal case.
4c
Arfwedson’s saddlepoint approximation
Our next objective is to strengthen the time-dependent Lundberg inequalities to approximations. As a motivation, it is instructive to reinspect the choice of the change of measure in the proof, i.e. the choice of αy . For any α > γm , Proposition 4.2 yields Eα τ (u) ∼
u κ0α (0)
=
u κ0 (α)
.
I.e., if we want Eα τ (u) ≈ T , then the relevant choice is precisely α = αy where y = T /u. We thereby obtain that T is ‘in the center’ of the Pα -distribution of τ (u). This idea is precisely what characterizes the saddlepoint method. The traditional application of the saddlepoint method is to derive approximations, not inequalities, and in case of ruin probabilities the approach leads to the following result: Theorem 4.9 If y < 1/κ0 (γ), then the solution α ey < αy of κ(e α) = κ(αy ) is < 0, and ψ(u, yu) ∼
αy − α ey e−γy u q · √ , u b 00 [αy ] αy |e αy | 2πyβ B
u → ∞.
(4.12)
134
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
If y > 1/κ0 (γ), then α ey > 0, and ψ(u) − ψ(u, yu) ∼
α −α ey e−γy u qy · √ , u b 00 [αy ] αy α ey 2πyβ B
u → ∞.
(4.13)
Proof. In view of Stam’s lemma, the formula £ ¤ ψ(u, yu) = e−αy u Eαy e−αy ξ(u)+τ (u)κ(αy ) ; τ (u) ≤ yu suggests heuristically that £ ¤ ψ(u, yu) ≈ e−αy u Eαy e−αy ξ(∞) · Eαy eτ (u)κ(αy ) ; τ (u) ≤ yu .
(4.14)
Here the first expectation can be estimated similarly as in the proof of the Cram´er-Lundberg’s approximation in Chapter IV. Using Lemma IV.5.7 with P replaced by Pαey and PL by Pαy , we have γαey = αy − α ey and get
Eαy e−αy ξ(∞)
³ bαe [γαe − αy ] − 1 ´ γαey B y y 1 − β α ey αy κ0αey (γαey ) γαey − αy
=
³ b b αy ] − 1 ´ ey ]/B[e αy − α ey b αy ] B[γαey − αy + α 1 + β B[e 0 αy κ (γαey + α ey ) α ey ³ ´ b αy ] αy − α ey 1 − B[e 1+β 0 αy κ (αy ) α ey ¡ ¢ b αy ] ey + β 1 − B[e y(αy − α ey ) α · αy α ey −y(αy − α ey )κ(e αy ) y(αy − α ey )κ(αy ) = . α ey αy |e αy |
= = = =
For the second term in (4.14), it seems tempting to apply the normal approximation (4.4). Writing τ (u) ≈ yu + u1/2 ωV , where V is normal(0, 1) under Pαy and (2)
b 00 [αy ]/(ρα − 1)3 = y 3 β B b 00 [αy ] , ω 2 = βαy µBαy /(ραy − 1)3 = β B y
4. WHEN DOES RUIN OCCUR?
135
we get heuristically that £ ¤ Eαy eτ (u)κ(αy ) ; τ (u) ≤ yu £ ¤ 1/2 = eyuκ(αy ) Eαy eκ(αy )u ωV ; V ≤ 0 Z ∞ 1/2 = eyuκ(αy ) e−κ(αy )u ωx ϕ(x) dx 0 Z ∞ ¡ ¢ 1 yuκ(αy ) e−z ϕ z/(κ(αy )u1/2 ω) dz = e κ(αy )u1/2 ω 0 Z ∞ 1 1 yuκ(αy ) ∼ e e−z · √ dz κ(αy )u1/2 ω 0 2π 1 yuκ(αy ) √ = e . κ(αy ) 2πuω 2 Inserting these estimates in (4.14), (4.12) follows. The proof of (4.13) is completely similar. 2 The difficulties in making the proof precise is in part to show (4.14) rigorously, and in part that for the final calculation one needs a sharpened version of the CLT for ψ(u) (basically a local CLT with remainder term). ¡ ¢ Example 4.10 Assume that B(x) = e−νx . Then κ(α) = β ν/(ν − α) − 1 − α, κ0 (α) = βα/(ν − α)2 − 1, and the equation κ0 (α) = 1/y is easily seen to have solution s βν αy = ν − 1 + 1/y (the sign of the square root is negative because the c.g.f. is undefined for α > ν). It follows that s s βν βν ναy = ν − αy = , βαy = β + αy = β + ν − , 1 + 1/y 1 + 1/y s αy − α fy = βαy − ναy = β + ν − 2
b 00 [αy ] = B
s βν , 1 + 1/y
α fy =
2ν 1/2 (1 + y)3/2 2ν = , 3 (ν − αy ) β 3/2
βν − β, 1 + 1/y
136
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
and (4.12) gives the approximation r ³ βν ´ β 1/4 β + ν − 2 e−γy u 1 + 1/y r r · √ ³ ´³ ´ √ u βν βν ν− β− ν 1/4 (1 + 1/y)3/4 4πy 1 + 1/y 11/ + y for ψ(u, yu) when y < 1/κ0 (γ) = ρ/1 − ρ.
2
Notes and references Theorem 4.9 is from Arfwedson [51]. A related result appears in Barndorff-Nielsen & Schmidli [138].
5
Diffusion approximations
The idea behind the diffusion approximation is to first approximate the claim surplus process by a Brownian motion with drift by matching the two first moments, and next to note that such an approximation in particular implies that the first passage probabilities are close. The mathematical result behind is Donsker’s theorem for a simple random walk {Sn∗ }n=0,1,... in discrete time: if µ = ES1∗ is the drift and σ 2 = Var(S1∗ ) the variance, then n 1 o ª D © ∗ √ (Sbtcc → W0 (t) t≥0 , c → ∞, − tcµ) (5.1) σ c t≥0 where {Wζ (t)} is Brownian motion with drift ζ and variance (diffusion constant) D 1 (here → refers to weak convergence in D = D[0, ∞)). It is fairly straightforward to translate Donsker’s theorem into a parallel statement for continuous time random walks (L´evy processes), of which a particular case is the claim surplus process (see the proof of Theorem 5.1 below). However, for the purpose of approximating ruin probabilities the centering around the mean (the tcµ term in (5.1)) is inconvenient. We want an approximation of the claim surplus process itself, and this can be obtained under the assumption that the safety loading η is small and positive. This is the regime of the diffusion approximation (note that this is just the same as for the heavy traffic approximation for infinite horizon ruin probabilities studied in IV.7c). © (p) ª Mathematically, we shall represent this assumption on η by a family St t≥0 of claim surplus processes indexed by the premium rate p, such that the claim size distribution B and the Poisson rate β are the same for all p (i.e., St = PNt i=1 Ui − tp), and consider the limit p ↓ ρ, where ρ is the critical premium rate βµB .
5. DIFFUSION APPROXIMATIONS
137
Theorem 5.1 As p ↓ ρ, we have n |µ| σ
o
(p)
S 2 tσ 2 /µ2
ª D © → W−1 (t) t≥0
t≥0
(5.2)
(2)
where µ = µp = ρ − p, σ 2 = βµB . Proof. The first step is to note that n 1 ¡ n 1 ¡ ¢o ¢o D © ª (p) (ρ) √ Stc √ Sct − tcµp − ρct = → W0 (t) σ c σ c
(5.3)
whenever c = cp ↑ ∞ as p ↓ ρ. Indeed, this is an easy consequence of (5.1) with (p) Sn∗ = Sn and the inequalities (ρ)
(ρ)
Sn/c − ρ/c ≤ St
(ρ)
≤ S(n+1)/c + ρp/c,
n/c ≤ t ≤ (n + 1)/c ,
cf. Lemma IV.1.3. Letting c = σ 2 /µ2p , (5.3) takes the form n |µ|
o D (p) → S + t 2 2 σ 2 tσ /µ n |µ| o D (p) → S 2 2 σ 2 tσ /µ
©
ª W0 (t) ,
©
ª © ª W0 (t) − t = W−1 (t) . 2
Now let © ª (p) τp (u) = inf t ≥ 0 : St > u ,
© ª τζ (u) = inf t ≥ 0 : Wζ (t) > u .
It is well-known (Corollary III.1.6 or [APQ, p. 263]) that the distribution IG(·; ζ; u) of τζ (u) (often referred to as the inverse Gaussian distribution) is given by ³ u ³ u ¡ ¢ √ ´ √ ´ IG(x; ζ; u) = P τζ (u) ≤ x = 1−Φ √ −ζ x +e2ζu Φ − √ −ζ x . (5.4) x x Note that IG(·; ζ; u) is defective when ζ < 0. Corollary 5.2 As p ↓ ρ, ψp
³ uσ 2 T σ 2 ´ , → IG(T ; −1; u) . |µ| µ2
138
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
Proof. Since f → sup0≤t≤T f (t) is continuous on D a.e. w.r.t. any probability measure concentrated on the continuous functions, the continuous mapping theorem yields |µ| (p) D sup 2 Stσ2 /µ2 → sup W−1 (t). σ 0≤t≤T 0≤t≤T Since the r.h.s. has a continuous distribution, this implies ³ ´ ³ ´ |µ| (p) P sup 2 Stσ2 /µ2 > u → P sup W−1 (t) > u . 0≤t≤T σ 0≤t≤T ¡ ¢ But the l.h.s. is ψp uσ 2 /|µ|, T σ 2 /µ2 , and the r.h.s. is IG(T ; −1; u).
2
For practical purposes, Corollary 5.2 suggests the approximation ψ(u, T ) ≈ IG(T µ2 /σ 2 ; u|µ|/σ 2 ).
(5.5)
Note that letting T → ∞ in (5.5), we obtain formally the approximation 2
ψ(u) ≈ IG(∞; u|µ|/σ 2 ) = e−2u|µ|/σ .
(5.6)
This is the same as the heavy-traffic approximation derived in IV.7c. However, since ψ(u) has infinite horizon, the continuity argument above does not generalize immediately, and in fact some additional arguments are needed to justify (5.6) from Theorem 5.1. Because of the direct argument in Chapter IV, we omit the details; see Grandell [426], [427] or [APQ, pp. 196, 199]. Checks of the numerical fits of (5.5) and (5.6) are presented, e.g., in Asmussen [55]. The picture which emerges is that the approximations are not terribly precise, in particular for large u. In view of the excellent fit of the Cram´erLundberg approximation, (5.6) therefore does not appear to be of much practical relevance for the compound Poisson model. However, for more general models it may be easier to generalize the diffusion approximation than the Cram´erLundberg approximation; as an example of such a generalization we mention the paper [342] by Emanuel et al. on the premium rule involving interest. In contrast, the simplicity of (5.5) combined with the fact that finite horizon ruin probabilities are so hard to deal with even for the compound Poisson model makes this approximation more appealing. However, in the next subsection we shall derive a refinement of (5.5) for the compound Poisson model which does not require much more computation, and which is much more precise. We conclude this section by giving a more general triangular array version of Theorem 5.1. The proof is a straightforward combination of the proof of Theorem 5.1 and Section VIII.6 of [APQ].
6. CORRECTED DIFFUSION APPROXIMATIONS
139
© (θ) ª Theorem 5.3 Consider a family St of claim surplus processes indexed by a parameter θ, such that the Poisson rate βθ , the claim size distribution Bθ and the premium rate pθ depends on θ. Assume further that βθ µBθ < pθ , that D βθ → βθ0 , Bθ → Bθ0 , pθ → pθ0 , pθ − βθ µBθ → 0, as θ → θ0 and that the U 2 are uniformly integrable w.r.t. the Bθ . Then as θ → θ0 , we have n |µ| o ª D © (θ) S → W−1 (t) t≥0 (5.7) 2 /µ2 tσ σ2 t≥0 (2)
where µ = µθ = ρθ − pθ = βθ µBθ − pθ , σ 2 = σθ2 = βθ µBθ . Notes and references Diffusion approximations of random walks via Donsker’s theorem is a classical topic of probability theory. See for example Billingsley [167]. The first application in risk theory is Iglehart [492], and two further standard references in the area are Grandell [426], [427]. All material of this section can be found in these references. For claims with infinite variance, Furrer, Michna & Weron [383] suggested an approximation by a stable L´evy process rather than a Brownian motion. Further relevant references in this direction are Furrer [382], Boxma & Cohen [194] and Whitt [883].
6
Corrected diffusion approximations
The idea behind the simple diffusion approximation is to replace the risk process by a Brownian motion (by fitting the two first moments) and use the Brownian first passage probabilities as approximation for the ruin probabilities. Since Brownian motion is skip-free, this idea ignores (among other things) the presence of the overshoot ξ(u), which we have seen to play an important role for example for the Cram´er-Lundberg approximation. The objective of the corrected diffusion approximation is to take this and other deficits into consideration. The set-up is the exponential family of compound risk processes with parameters βθ , Bθ constructed in IV.4. However, whereas there we let the given risk process with safety loading η > 0 correspond to θ = 0, it is more convenient here to use some value θ0 < 0 and let θ = 0 correspond to η = 0 (zero drift); this is because in the regime of the diffusion approximation, η is close to zero, and we want to consider the limit η ↓ 0 corresponding to θ0 ↑ 0. In terms of the given with Poisson intensity β, claim size dis¡ risk process ¢ b − 1 − α and ρ = βµB < 1, η = 1/ρ − 1 > 0, this tribution B, κ(α) = β B[α] means the following: 1. Determine γm > 0 by κ0 (γm ) = 0 and let θ0 = −γm .
140
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
2. Let P0 refer to the risk process with parameters b β0 = β B[−θ 0 ],
B0 (dx) =
e−θ0 x B(dx). b B[−θ 0]
b (k) [0] = B b (k) [−θ0 ]/B[−θ b Then E0 U k = B 0 ] and κ0 (s) = κ(s−θ0 )−κ(−θ0 ), 0 0 κ0 (0) = 0. 3. For each θ, let Pθ refer to the risk process with parameters b0 [θ] = β B[θ−θ b βθ = β0 B 0 ], Bθ (dx) =
e(θ−θ0 )x eθx B0 (dx) = B(dx). b0 [θ] b − θ0 ] B B[θ
Then κθ (s) = κ0 (s + θ) − κ0 (θ) = κ(s + θ − θ0 ) − κ(θ − θ0 ) and the given risk process corresponds to Pθ0 where θ0 = −γm . ¡ ¢ ¡ ¢ In this set-up, Pθ τ (u) < ∞ = ¡ 1 for θ ≥ ¢ 0, Pθ τ (u) < ∞ < 1 for θ < 0, and we are studying ψ(u, T ) = Pθ0 τ (u) ≤ T for θ0 < 0, θ0 ↑ 0. Recall that IG(x; ζ; u) denotes the distribution function of the passage time of Brownian motion {Wζ (t)} with unit variance and drift ζ from level 0 to level u > 0. One has IG(x; ζ; u) = IG(x/u2 ; ζu; 1) . (6.1) The corrected diffusion approximation to be derived is ³Tν ν2 γu ν2 ´ 1 ψ(u, T ) ≈ IG + ; − ; 1 + u2 u 2 u
(6.2)
where as ususal γ > 0 is the adjustment coefficient for the given risk process, i.e. the solution of κ(γ) = 0, and b 00 [γm ], ν1 = β0 E0 U 2 = β B
ν2 =
b 000 [γm ] E0 U 3 B . = 2 b 00 [γm ] 3E0 U 3B
Write the initial reserve u for the given risk process as u = ζ/θ0 (note that ζ < 0) and, for brevity, write τ = τ (u), ξ = ξ(u) = Sτ − u. The first step in the derivation is to note that µ Varθ0 S1
= κ0 (0) = κ00 (θ0 ) ∼ θ0 κ000 (0) = θ0 ν1 = ∼ Var0 S1 = β0 E0 U 2 = ν1 , θ0 ↑ 0.
ζν1 , u
6. CORRECTED DIFFUSION APPROXIMATIONS
141
Theorem 5.3 applies and yields n |ζ|ν
1
uν1
o Stν1 u2 /ζ 2 ν12
t≥0
ª D © → W−1 (t) t≥0
which easily leads to n
o ª 1 D © → Wζ √ν1 (t) t≥0 , √ Stu2 u ν1 t≥0
³ √ 1 ´ ψ(u, tu2 ) → IG t; ζ ν1 ; √ = IG(tν1 ; ζ; 1) . ν1 Since Z
∞
e−αt IG(dt; ζ, u) = e−uh(λ,ζ)
where h(λ, ζ) =
p
2λ + ζ 2 − ζ,
(6.3)
0
this implies (take u = 1) © ª Eθ0 exp −λν1 τ (u)/u2 → e−h(λ,ζ) .
(6.4)
The idea of the proof is to improve upon this by an O(u−1 ) term (in the following, ≈ means up to o(u−1 ) terms): Proposition 6.1 As u → ∞, θ0 ↑ 0 in such a way that ζ = θ0 u is fixed, it holds for any fixed λ > 0 that © ª © ªh λν2 i Eθ0 exp −λν1 τ (u)/u2 ≈ exp −h(λ, −γu/2)(1 + ν2 /u) 1 + . (6.5) u Once this is established, we get by formal Laplace transform inversion that ³ tu2 ´ ¡ ν2 γu ν2 ´ ψ u, ≈ IG t + ; − ; 1 + . ν1 u 2 u Indeed, the r.h.s. is the c.d.f. of a (defective) r.v. distributed as Z − ν2 /u where Z has distribution IG (· ; −γu/2; 1 + ν2 /u). But the Laplace transform of such a r.v. is Ee−λZ eλν2 /u ≈ Ee−λZ [1 + λν2 /u] where the last expression coincides with the r.h.s. of (6.5) according to (6.3). To arrive at (6.2), just replace t by T ν1 /u2 . Note, however, that whereas the proof of Proposition 6.1 below is exact, the formal Laplace transform inversion is heuristic: an additional argument would be required to infer that the remainder term in (6.2) is indeed o(u−1 ). The
142
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
justification for the procedure is the wonderful numerical fit which has been found in numerical examples and which for a small or moderate safety loading η is by far the best among the various available approximations [note, however, that the saddlepoint approximation of Barndorff-Nielsen & Schmidli [138] is a serious competitor and is in fact preferable if η is large]. A numerical illustration is given in Fig. V.5, which is based upon exponential claims with mean µB = 1. The solid line represents the exact value, calculated using numerical integration and Proposition 1.3, and the dotted line the corrected diffusion approximation (6.2). In (1) and (2), we have ρ = β = 0.7, in (3) and (4), ρ = 0.4. The initial reserve u has been selected such that the infinite horizon ruin probability ψ(u) is 10% in (1) and (3), 1% in (2) and (4). (1)
(2)
0.1 ψ (u,T)
0.01
0.08
0.008
0.06
0.006
ψ (u,T)
0.004
0.04
0.002 0.02
0
40
80
120
160
200
240
280 T
0 40
80
120
(3)
160
200
240
280 T
(4)
ψ (u,T)
ψ (u,T) 0.01
0.1
0.09 0.008 0.08
0.07
0.006
0.06 0.004 0.05
0.04 0.002 0
20
40
60
80
T
100
0
20
40
60
80
T
100
Figure V.5 It is seen that the numerical fit is extraordinary for ρ = 0.7. Note that the ordinary diffusion approximation requires ρ to be close to 1 and ψ(u) to be not too small, and all of the numerical studies the authors knows of indicate that its fit at ρ = 0.7 or at values of ψ(u) like 1% is unsatisfying. Similarly, the fit at ρ = 0.4 may not be outstanding but nevertheless, it gives the right order
6. CORRECTED DIFFUSION APPROXIMATIONS
143
of magnitude and the ordinary diffusion approximation hopelessly fails for this value of ρ. For further numerical illustrations, see Asmussen [55], BarndorffNielsen & Schmidli [138] and Asmussen & Højgaard [81]. The proof of Proposition 6.1 proceeds in several steps. n ¢o ξ λν1 τ ν1 ν2 τ ¡ e3 3 Lemma 6.2 e−h(λ,ζ) ≈ Eθ0 exp h(λ, ζ) − 2 − θ − ζ . u u 2u3 Proof. For θe ≥ 0, © ¡ ¢ª e − κ0 (θ0 ) . 1 = Pθe(τ < ∞) = Eθ0 exp (θe − θ0 )(u + ξ) − τ κ0 (θ) e and θ0 by ζ/u yields Replacing θe by θ/u © ¡ ¡ ¢ ¢ª e e e−(θ−ζ) = Eθ0 exp (θe − ζ)ξ/u − τ κ0 θ/u − κ0 (ζ/u) . Let θe = (2λ + ζ 2 )1/2 = h(λ, ζ) + ζ and note that κ0 (θ) =
1 2 1 ν1 θ2 ν1 ν2 θ3 θ β0 E0 U 2 + θ3 β0 E0 U 3 + · · · = + + · · · . (6.6) 2 6 2 2
Using θe2 − ζ 2 = 2λ, the result follows. Lemma 6.3 lim E0 ξ(u) = E0 ξ(∞) = ν2 = u→∞
2 E0 U 3 . 3E0 U 2
Proof. By partial integration, the formulas ¡ ¢ P0 ξ(0) > x = ¡ ¢ P0 ξ(∞) > x =
Z ∞ 1 P0 (Sτ (0) > x) = P0 (U > y) dy , E0 U x Z ∞ ¡ ¢ 1 P0 ξ(0) > y dy E0 ξ(0) x
imply E0 ξ(0)k =
E0 U k+1 E0 ξ(0)k+1 , E0 ξ(∞)k = . (k + 1)E0 U (k + 1)E0 ξ(0) 2
n ν τo 1 Lemma 6.4 Eθ0 exp − 2 u io n ³ ν2 ´on ν2 h ζ3 . ≈ exp −h(λ, ζ) 1 + 1 + 2λ + ζ 2 − u 2u (2λ + ζ)1/2
144
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
Proof. It follows by a suitable variant of Stam’s lemma (Proposition 4.4) that the r.h.s. in Lemma 6.2 behaves like n λν τ oh i ξ ν1 ν2 τ e3 1 3 Eθ0 exp − 2 1 + h(λ, ζ) − ( θ − ζ ) u u 2u3 n λν τ o ν2 1 ≈ Eθ0 exp − 2 + e−h(λ,ζ) h(λ, ζ) u u n λν τ oi ¢ h ν1 τ ν2 ¡ e3 1 3 θ − ζ Eθ0 − exp − 2 . (6.7) 2u u2 u The last term is approximately ¢ d −h(λ,ζ) ν2 ¡ e3 θ − ζ3 e 2u dλ h i ν2 ζ3 = − 2λ + ζ 2 − e−h(λ,ζ) 2u (2λ + ζ)1/2 i n ³ ν2 h ζ3 ν2 ´o 2λ + ζ 2 − exp −h(λ, ζ) 1 + . ≈ − 1/2 2u u (2λ + ζ) The result follows by combining Lemma 6.2 and (6.7) and using n ³ ν2 ν2 ´o e−h(λ.ζ) − e−h(λ,ζ) h(λ, ζ) ≈ exp −h(λ, ζ) 1 + . u u 2 The last step is to replace h(λ, ζ) by h(λ, −γu/2). There are two reasons for this: in this way, we get the correct asymptotic exponential decay parameter γ in the approximation (6.2) for ψ(u) (indeed, letting formally T → ∞ yields ψ(u) ≈ C 0 e−γu where C 0 = e−γν2 ); and the correction terms which need to be added cancels conveniently with some of the more complicated expressions in Lemma 6.4. n ³ ν2 ´o Lemma 6.5 exp −h(λ, ζ) 1 + u n ³ io ν2 ´on ν2 h ζ3 p ≈ exp −h(λ, −γu/2) 1 + 1− − ζ2 . u 2u 2λ + ζ 2 Proof. Use first (6.6) and κ0 (θ0 ) = κ0 (γ + θ0 ) to get 0 = i.e.
ν1 2 ν1 ν2 3 (γ + 2γθ0 ) + (γ + 3γ 2 θ0 + 3γθ02 ) + O(u−4 ), 2 2 ν2 γ + θ0 = − (γ 2 + 3γθ0 + 3θ02 ) + O(u−3 ). 2 2
6. CORRECTED DIFFUSION APPROXIMATIONS
145
Thus γ = −2θ0 + O(u−2 ), and inserting this and θ0 = ζ/u on the r.h.s. yields γ ν2 θ02 ν2 ζ 2 + θ0 = − + O(u−3 ) = − 2 + O(u−3 ). 2 2 2u Thus by Taylor expansion around ζ = θ0 u, we get h i ζ h(λ, −γu/2) ≈ h(λ, ζ) − p − 1 (γ/2 + θ0 )u , 2λ + ζ 2 n ³ ν2 ´o exp −h(λ, −γu/2) 1 + u n ³ i o ³ ν2 ´on ν2 ´h ζ p ≈ exp −h(λ, ζ) 1 + − 1 (γ/2 + θ0 )u 1 − 1+ u u 2λ + ζ 2 n ³ ν2 ´o ≈ exp −h(λ, ζ) 1 + u ³ i ν ζ2 © ª ν2 ´h ζ 2 p − 1+ −1 exp −h(λ, ζ) u 2u 2λ + ζ 2 ´o n ³ i © ª ν2 h ζ3 ν2 p − ≈ exp −h(λ, ζ) 1 + − ζ 2 exp −h(λ, ζ) . 2 u 2u 2λ + ζ Proof of Proposition 6.1: Just insert Lemma 6.5 in Lemma 6.4.
2 2
Notes and references Corrected diffusion approximations were introduced by Siegmund [809] in a discrete random walk setting, with the translation to risk processes being carried out by Asmussen [55]; this case is in part simpler than the general random walk case because the ladder height distribution G+ can be found explicitly (as ρB0 ) which avoids the numerical integration involving characteristic functions which was used in [809] to determine the constants. In Siegmund’s book [810], the approach to the finite horizon case is in part different and uses local central limit theorems. The adaptation to risk theory has not been carried out. The corrected diffusion approximation was extended to the renewal model in Asmussen & Højgaard [81], and to the Markov-modulated model of Chapter VII in Asmussen [58]; Fuh [379] considers the closely related case of discrete time Markov additive processes. Hogan [473] considered a variant of the corrected diffusion approximation which does not require exponential moments. His ideas were adapted by Asmussen & Binswanger [72] to derive approximations for the infinite horizon ruin probability ψ(u) when claims are heavy-tailed; the analogous analysis of finite horizon ruin probabilities ψ(u, T ) has not been carried out and seems non-trivial. For corrected diffusion approximations with higher-order terms, see Blanchet & Glynn [174]; their results also cover some heavy-tailed cases.
146
7
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME
How does ruin occur?
We saw in Section 4 that given that ruin occurs, the ‘typical’ value (say in sense of the conditional mean) was umL , that is, the same as for the unconditional Lundberg process. We shall now generalize this question by asking what a sample path of the risk process looks like given it leads to ruin. The answer is similar: the process behaved as if it changed its whole distribution to PL , i.e. changed its arrival rate from β to βL and its claim size distribution from B to BL . Recall that Fτ (u) is the stopping time σ-algebra carrying all relevant information about τ (u) and {St }0≤t≤τ (u) . Define P(u) = P(·|τ (u) < ∞) as the distribution of the risk process given ruin with initial reserve u. We are concerned with describing the P(u) -distribution of {St }0≤t≤τ (u) (note that the behavior after © ª τ (u) is trivial: by the strong Markov property, Sτ (u)+t − Sτ (u) t≥0 is just an independent copy of {St }t≥0 ). © ª Theorem 7.1 Let F (u) u≥0 be any family of events with F (u) ∈ Fτ (u) and satifying PL F (u) → 1, u → ∞. Then also P(u) F (u) → 1. Proof. P
(u)
F (u)
c
= ≤
¡ ¢ £ ¤ P F (u)c ; τ (u) < ∞ EL e−γSτ (u) ; F (u)c ¡ ¢ = ψ(u) P τ (u) < ∞ £ −γu ¤ c −γu EL e ; F (u) e PL F (u)c ∼ → 0. ψ(u) Ce−γu 2
Corollary 7.2 If B is exponential, then P(u) and PL coincide on ³ ´ Fτ (u)− = σ τ (u), {St }0≤t<τ (u) . Proof. Write e−γSτ (u) = e−γu e−γξ(u) . In the exponential case, Fτ (u)− and ξ(u) are independent, so in the proof, the numerator becomes e−γu EL e−γξ(u) PL (F (u)c ) = e−γu CPL (F (u)c ) when F (u) ∈ Fτ (u)− and similarly the denominator is exactly equal to Ce−γu . 2 Note that basically the difference between Fτ (u) and Fτ (u)− is that ξ(u) is not Fτ (u)− -measurable. In fact, ξ(u) is exponential with rate ν w.r.t. P(u) and rate β = νL w.r.t. PL .
7. HOW DOES RUIN OCCUR?
147
As example, we give a typical application of Theorem 7.1, stating roughly that under P(u) , the Poisson rate changes from β to βL and the claim size disb and BL (dx) = eγx B(dx)/B[γ], b tribution from B to BL . Recall that βL = β B[γ] and let M (u) be the index of the claim leading to ruin (thus τ (u) = T1 + T2 + · · · + TM (u) ). Corollary 7.3 M (u) 1 X I(Tk ≤ x) M (u)
P(u)
→
1 − e−βL x ,
k=1
1 M (u)
M (u)
X
I(Uk ≤ x)
P(u)
→
BL (x).
k=1
Proof. For the first assertion, take n¯ ¯ F (u) = ¯
M (u) ¯ o 1 X ¯ I(Tk ≤ x) − (1 − e−βL x )¯ > ² . M (u) k=1
The proof of the second is similar.
2
We finally consider the limiting joint distribution of ζ(u) = u − Sτ (u)− = Rτ (u)− and
ξ(u) = Sτ (u) − u = −Rτ (u)
(the surplus prior to ruin, resp. the deficit at ruin). of ¢the Cram´er-Lundberg approximation, ¡Proposition ¢ 7.4 Under the conditions ¡ ζ(u), ξ(u) has a proper limit ζ(∞), ξ(∞) as u → ∞ in P(u) -distribution. The limiting distribution is given by ¡ ¢ P ζ(∞) ∈ dx, ξ(∞) ≥ y =
β B(x + y)(eγx − 1) . 1−ρ
¡ ¢ Proof. Define Z(u) = P ζ(u) ∈ dx, ξ(u) ≥ y . Consider first the case where ζ(u) ∈ dx, ξ(u) ≥ y occurs in the first ladder step, illustrated in Fig. V.6.
148
CHAPTER V. PROBABILITY OF RUIN IN FINITE TIME u+y 6 u
0
-
u−x Figure V.6 For occurrence in the first ladder step, we need x > u and ζ(0) = u − y. Also, by Theorem IV.2.2 the (defective) density of ζ(0) is βB(z) and if ζ(0) = 0, the available information on ξ(0) given ζ(0) = z is that it has the distribution of a claim U conditioned to exceed z. Thus, taking z = u−x, we get the contribution to Z(u) from the first ladder step as βB(y − u)
B(x + y) I(u < x) = βB(x + y)I(u < x) . B(y − u)
If ξ(0) = z < u, everything repeats itself from z, and thus, since also ξ(0) has density βB(z), Z u Z(u) = βB(x + y)I(u < x) + Z(u − z)βB(z) dz . 0
R∞ This is a defective renewal equation, and since κ(γ) = 0 implies 0 eγv βB(v) dv = 1, the usual exponential technique gives that eγu Z(u) has the limit ÁZ u Z x eγx − 1 γC eγu du βB(v)veγv dv = βB(x + y) βB(x + y) , γ 1−ρ 0 0 where C is the Cram´er-Lundberg constant (for the last equality, see the calculations around IV.(5.8) and IV.(5.11)). Thus Z(u)/Ce−γu has the asserted limit which is what was to show. That the limit is proper follows from Z ∞ β B(x)(eγx − 1) dx 1−ρ 0 Z ´ ´ ¢ 1 ³ ∞ 1 ³β ¡ b = βB(x)eγx dx − ρ = B[γ] − 1 − ρ 1−ρ 0 1−ρ γ 1 = (1 − ρ) = 1 . 2 1−ρ
7. HOW DOES RUIN OCCUR?
149
Notes and references Proposition 7.4 can be found in Schmidli [773]. It will be shown in X.4 that in the heavy-tailed case, ζ(u) and ξ(u) need to be scaled down before a conditional limit can be obtained. The remaining results of the present section are part of a more general study carried out by the first author [54]. A somewhat similar study was carried out in the queueing setting by Anantharam [48], who also treated the heavy-tailed case; however, the queueing results are of a somewhat different type because of the presence of reflection at 0. From a mathematical point of view, the subject treated in this section leads into the area of large deviations theory. This is currently a very active area of research, see further XIII.1. Convergence properties of empirical finite-time ruin probabilities are investigated in Loisel, Mazza & Rulli`ere [608]. Schmidli [781] derives some exact expressions for the distribution of the risk process given that ruin occurs. These may be seen as special h-transform calculations for piecewise deterministic Markov processes (recall that the distribution of a Markov chain or Markov process conditioned to hit a set is always a h-tranform, see e.g. Asmussen & Glynn [79, VI.7]).
This page intentionally left blank
Chapter VI
Renewal arrivals 1
Introduction
The basic assumption of this chapter states that the arrival epochs σ1 , σ2 , . . . of the risk process form a renewal process: letting Tn = σn − σn−1 (T1 = σ1 ), the Tn are independent, with the same distribution A (say) for T2 , T3 , . . . In the so-called zero-delayed case, the distribution A1 of T1 is A as well. A different important possibility is A1 to be the stationary delay distribution A0 with density A(x)/µA . Then the arrival process is stationary which could be a reasonable assumption in many cases (for these and further basic facts from renewal theory, see A.1). We use much of the same notation as in Chapter I. Thus the premium rate is 1, the claim sizes U1 , U2 , . . . are i.i.d. with common distribution B, {St } is the claim surplus process given by I.(1.5), with Nt = # {n : σn ≤ t} the number of arrivals before t, and M is the maximum of {St }, τ (u) the time to ruin. The ruin probability corresponding to the zero-delayed case is denoted by ψ(u), the one corresponding to the stationary case by ψ (s) (u), and the one corresponding to T1 = s by ψs (u). µB Proposition 1.1 Define ρ = . Then regardless of the distribution A1 of T1 , µA St St = lim E = ρ − 1, t→∞ t t→∞ t
(1.1)
Var(St ) µ2 σ 2 + µ2 σ 2 = B A 3 A B. t→∞ t µA
(1.2)
lim
lim
151
152
CHAPTER VI. RENEWAL ARRIVALS
Furthermore for any a > 0, lim E [St+a − St ] = a(ρ − 1).
(1.3)
t→∞
Proof. Obviously, ESt = E E
Nt hX
¯ i ¯ Ui ¯ Nt − t = ENt · µB − t.
i=1
However, by the elementary renewal theorem (cf. A.1) ENt /t → 1/µA . From this (1.1) follows, and (1.3) follows similarly by Blackwell’s renewal theorem, stating that E[Nt+a − Nt ] → a/µA . For (1.2), we get in the same way by using known facts about ENt and Var Nt that Var(St )
Nt Nt ¯ i ¯ i hX hX ¯ ¯ = Var E Ui ¯ Nt + E Var Ui ¯ Nt i=1
i=1
2 = Var(µB Nt ) + E(σB Nt ) 2 2 σ σ = tµ2B A + t B + o(t). µ3A µA
2 Of course, Proposition 1.1 gives the desired interpretation of the constant ρ as the expected claims per unit time. Thus, the definition η = 1/ρ − 1 of the safety loading appears reasonable here as well. The renewal model is often referred to as the Sparre Andersen process, after E. Sparre Andersen whose 1959 paper [816] was the first to treat renewal assumptions in risk theory in more depth. The simplest case is of course the Poisson case where A and A1 are both exponential with rate β. This has a direct physical interpretation (a large portfolio with claims arising with small rates and independently). Here are two special cases of the renewal model with a similar direct interpretation (see also the discussion in I.3): Example 1.2 (Deterministic arrivals) If A is degenerate, say at a, one could imagine that the claims are recorded only at discrete epochs (say each week or month) and thus each Un is really the accumulated claims over a period of length a. 2 Example 1.3 (Switched Poisson arrivals) Assume that the process has a random environment with two states on, off, such that no arrivals occur in the off state, but the arrival rate in the on state is β > 0. If the environment
1. INTRODUCTION
153
is Markovian with transition rate λ from on to off and µ from off to on, the interarrival times become i.i.d. (an arrival occurs necessarily in the on state, and then the whole process repeats itself). More precisely, A is phase-type (Example I.2.4) with phase space {on,off}, initial vector (1 0) and phase generator ³ −β − λ µ
λ ´ . −µ
2
However, in general the mechanism generating a renewal arrival process appears much harder to interpret in the risk theory context and therefore the relevance of the model has been questioned repeatedly, see the discussion in I.3. Nevertheless we will present at least some basic features of the renewal model, if only for the mathematical elegance of the subject, the fundamental connections to the theory of queues and random walks, and for historical reasons. The following representation of the ruin probability (already discussed in Section IV.1) will be a basic vehicle for studying the ruin probabilities: Proposition 1.4 The ruin probabilities for the zero-delayed case can be repreª ¡ ¢ © (d) sented as ψ(u) = P M (d) > u where M (d) = max Sn : n = 0, 1, . . . with © (d) ª a discrete time random walk with increments distributed as the indepenSn dent difference U − T between a claim U and an interarrival time T . Proof. The essence of the argument is that ruin can only occur at claim times. The values of the claim surplus process just after claims has the same distri© (d) ª bution as Sn . Since the claim surplus process {St } decreases in between arrival times, we have max St = max Sn(d) . n=0,1,...
0≤t<∞
From this the result immediately follows.
2
For later use, we note that the ruin probabilities for the delayed case T1 = s can be expressed in terms of the ones for the zero-delayed case as Z ψs (u) = B(u + s) +
u+s
ψ(u + s − y)B(dy).
(1.4)
0
Indeed, the first term represents the probability P(U ¡ 1 − s > u) of ruin at¢ the time s of the first claim whereas the second is P τ (u) < ∞, U1 − s ≤ u , as follows easily by noting that the evolution of the risk process after time s is that of a renewal risk model with initial reserve U1 − s. For the stationary case, integrate (1.4) w.r.t. A0 .
154
2
CHAPTER VI. RENEWAL ARRIVALS
Exponential claims. The compound Poisson model with negative claims
We first consider a variant of the compound Poisson model obtained essentially by sign-reversion. That is, the claims and the premium rate are negative so that the risk reserve process, resp. the claim surplus process are given by ∗
Rt∗
= u+
Nt X
∗
Ui∗
− t,
St∗
i=1
= t−
Nt X
Ui∗ ,
i=1
where {Nt∗ } is a Poisson process with rate β ∗ (say) and the Ui∗ are independent of {Nt } and i.i.d. with common distribution B ∗ (say) concentrated on (0, ∞). This model is sometimes referred to as the dual risk model in the literature1 . A typical sample path of {Rt∗ } is illustrated in Fig. VI.1. 6
u
Figure VI.1
∗
τ (u)
One interpretation of the model is to have continuous expenses and events according to a Poisson process (e.g. innovations) which increase the value of the portfolio or company. Another interpretation is of course the workload in an M/G/1 queue in its first busy period. Define the time of ruin τ ∗ (u) = inf {t > 0 : Rt∗ < 0}. Using Lundberg conju-¢ ¡ gation, we shall be able to compute the ruin probability ψ ∗ (u) = P τ ∗ (u) < ∞ for this model very quickly. A simple sample path comparison will then provide us with the ruin probabilities for the renewal model with exponential claim size distribution. 1 Although
this terminology is not related to the other duality concepts used in this book.
2. EXPONENTIAL OR NEGATIVE CLAIMS
155
Theorem 2.1 If β ∗ µB ∗ ≤ 1, then ψ ∗ (u) = 1 for all u ≥ 0. If β ∗ µB ∗ > 1, then ψ ∗ (u) = e−γu where γ > 0 is the unique solution of ¡ ∗ ¢ b [−γ] − 1 + γ. (2.1) 0 = κ∗ (−γ) = β ∗ B [Note that κ∗ (α) = log Ee−αS1 .] Proof. Define St∗ = u − Rt∗ , Set = Rt∗ − u = −St∗ . © ª Then Set is the claim surplus process of a standard compound Poisson risk process with parameters β ∗ , B ∗ . If β ∗ µB ∗ ≤ 1, then by Proposition IV.1.2 sup St∗ = − inf Set = ∞ t≥0
t≥0
and hence ψ ∗ (u) = 1 follows.
Figure VI.2 Assume now β ∗ µB ∗ > 1. Then the function κ∗ is defined on the whole of (−∞, 0) and has typically the shape on Fig. VI.2(a). Hence γ exists and is unique. Let b ∗ [−γ], β = β∗B
B(dx) =
e−γx B ∗ (dx), b ∗ [−γ] B
and let {St } be a compound Poisson risk process with parameters β, B. Then the c.g.f. of {St } is κ(α) = κ∗ (α − γ), cf. Fig. VI.2(b), and the Lundberg conjugate © ª of {St } is Set and vice versa. Define © ª © ª τ− (u) = inf t ≥ 0 : St = −u , τe− (u) = inf t ≥ 0 : Set = −u = −u . Since κ0 (0) < 0, the safety loading of {St } is > 0. Hence τ− (u) < ∞ a.s., and thus ¡ ¢ £ ¤ e e−γ Seτe− (u) ; τe− (u) < ∞ 1 = P τ− (u) < ∞ = E ¡ ¢ = eγu P τe− (u) < ∞ = eγu ψ ∗ (u). 2 Now return to the renewal model.
156
CHAPTER VI. RENEWAL ARRIVALS
Theorem 2.2 If B is exponential, with rate δ (say), and δµA > 1, then ψ(u) = π+ e−γu where γ > 0 is the unique solution of 1 = Eeγ(U −T ) = and π+ = 1 −
δ b A[−γ] δ−γ
(2.2)
γ . δ
Proof. We can couple the renewal model {St } and the compound Poisson model {St∗ } with negative claims in such a way that the interarrival times of {St∗ } are T0∗ , T1∗ = U1 , T2∗ = U2 , . . . Then B ∗ = A, β ∗ = δ, and (2.1) means that b δ(A[−γ] − 1) + γ = 0 which is easily seen to be the same as (2.2). Now the value of {St∗ } just before the nth claim is T0∗ + T1∗ + · · · + Tn∗ − U1∗ − · · · − Un∗ , and from Fig. VI.1 it is seen that ruin is equivalent to one of these values being > u. Hence © ª M ∗ = max St∗ = max T0∗ + T1∗ + · · · + Tn∗ − U1∗ − · · · − Un∗ n=0,1,...
t≥0
D =
T0∗ + max
D =
T0∗ + M (d)
©
n=0,1,...
U1 + · · · + Un − T1 − · · · − Tn
ª
in the notation of Proposition 1.4. Taking m.g.f.’s and noting that ψ ∗ (u) = P(M ∗ > u) so that Theorem 2.1 means that M ∗ is exponentially distributed with rate γ, we get ∗
EeαM
(d)
=
EeαM γ/(γ − α) γ = = 1 − π+ + π+ . ∗ αT 0 δ/(δ − α) γ−α Ee
I.e. the distribution of M (d) is a mixture of an atom at zero and an exponential distribution with rate parameter γ with weights 1 − π+ and π+ , respectively. Hence P(M (d) > u) = π+ e−γu . 2 Remark 2.3 A variant of the last part of the proof, which has the advantage of avoiding transforms and leading up to the basic ideas of the study of the phase-type case in IX.4 goes as follows: define π+ = P(M (d) > 0) and consider {St∗ } only when the process is at a maximum value. According to Theorem 2.1, the failure rate of this process is γ. However, alternatively termination occurs at a jump time (having rate δ), with the probability that a particular jump time
3. CHANGE OF MEASURE VIA EXPONENTIAL FAMILIES
157
is not followed by any later maximum values being 1 − π+ , and hence the failure rate is δ(1 − π+ ). Putting this equal to γ, we see that γ = δ(1 − π+ ) and hence π+ = 1−γ/δ. However, consider instead the failure rate of M (d) and decompose M (d) into ladder steps as in III.6, IV.2. The probability that the first ladder step is finite is π+ . Furthermore, a ladder step is the overshoot of a claim size, hence exponential with rate δ. Thus a ladder step terminates at rate δ and is followed by one more with probability π+ . Hence failure rate of M (d) is ¡ the ¢ −γu (d) (d) δ(1 − π+ ) = γ and consequently P(M > u) = P M > 0 e = π+ e−γu . 2
3
Change of measure via exponential families
We shall discuss two points of view, the imbedded discrete time random walk and Markov additive processes.
3a
The imbedded random walk
The key steps have already been carried out in Corollary III.3.5, which states that for a given α, the relevant exponential change of measure corresponds to changing the distribution F (d) of Y = U − T to Z x (d) Fα(d) (x) = e−κ (α) eαy F (d) (dy) −∞
where b + log A[−α] b κ(d) (α) = log Fb(d) [α] = log B[α] .
(3.1)
It only remains to note that this change of measure can be achieved by changing (d) (d) the interarrival distribution A and the claim distribution B to Aα , resp. Bα , where e−αt eαx (d) (dt) = A(d) (dx) = A(dt), B B(dx) . α α b b A[−α] B[α] (d)
This follows since, letting Pα refer to the renewal risk model with these changed parameters, we have βY E(d) α e
= =
b + β] A[−α b B[α − β] (d) bα(d) [β]A bα B [−β] = · b b B[α] A[−α] (d) Fb [α + β] = Fbα(d) [β] . Fb(d) [α]
158
CHAPTER VI. RENEWAL ARRIVALS Let
© ª M (u) = inf n = 1, 2, . . . : Sn(d) > u
be the number of claims leading to ruin and (d)
ξ(u) = Sτ (u) − u = SM (u) − u the overshoot, then we get: 0
Proposition 3.1 For any α such that κ(d) (α) ≥ 0, (d)
−αξ(u)+M (u)κ ψ(u) = e−αu E(d) α e
(α)
.
Consider now the Lundberg case, i.e. let γ > 0 be the solution of κ(d) (γ) = 0. We have the following versions of Lundberg’s inequality and the Cram´erLundberg approximation: Theorem 3.2 In the zero-delayed case, (a) ψ(u) ≤ e−γu ; (d) (b) ψ(u) ∼ Ce−γu where C = limu→∞ Eγ e−γξ(u) , provided the distribution F of U − T is non-lattice. Proof. Proposition 3.1 implies −αξ(u) ψ(u) = e−αu E(d) , γ e
and claim (a) follows immediately from this and ξ(u) > 0 a.s. For claim (b), just (d) note that Fγ is non-lattice when F is so. This is known to be sufficient for ξ(0) (d) to be non-lattice w.r.t. Pγ ([APQ, p. 222]) and thereby for ξ(u) to converge in ¡ ¢ 0 (d) distribution, since Pγ τ (0) < ∞ = 1 because of κ(d) (γ) > 0. 2 It should be noted that the computation of the Cram´er-Lundberg constant C is much more complicated the renewal case than for the compound Poisson ¡ for ¢ b 0 [γ] − 1 is explicit given γ. In fact, in the easiest case where C = (1 − ρ)/ β B non-exponential case where B is phase-type, the evaluation of C is at the same level of difficulty as the evaluation of ψ(u) in matrix-exponential form, cf. IX.4. Corollary 3.3 For the delayed case T1 = s, ψs (u) ∼ Cs e−γu where Cs = b Ce−γs B[γ]. For the stationary case, ψ (s) (u) ∼ C (s) e−γu where C
(s)
¢ ¡ b −1 C B[γ] = . γµA
3. CHANGE OF MEASURE VIA EXPONENTIAL FAMILIES
159
Proof. Using (1.4), B(x) = o(e−γx ) and dominated convergence, we get Z u+s γu γu e ψs (u) = e B(u + s) + eγ(y−s) eγ(u+s−y) ψ(u + s − y) B(dy) 0 Z ∞ → 0 + eγ(y−s) C B(dy) = Cs . 0
For the stationary case, another use of dominated convergence combined with b0 [s] = (A[s] b − 1)/sµA yields A Z ∞ Z ∞ b A0 (ds) eγu ψ (s) (u) = eγu ψs (u) A0 (ds) → Ce−γs B[γ] 0 0 ¡ ¢ b b C B[γ] A[−γ] −1 = = C (s) . −γµA 2 Of course, a delayed version of Lundberg’s inequality can be obtained in a similar manner. The expressions are slightly more complicated and we omit the details.
3b
Markov additive representations
We take the Markov additive point of view of III.5. Markov © The underlying ª process {Jt } for the Markov additive process {Xt } = (Jt , St ) can be defined by taking Jt as the residual time until the next arrival. According to Remark III.4.9, we look for a function h(s) and a κ (both depending on α) such that Ghα (s, 0) = κ(α)h(s), where G is the generator of {Xt } = {(Jt , St )} and hα (s, y) = eαy h(s). Let Ps , Es refer to the case J0 = s. For s > 0, ¡ ¢ Es hα (Jdt , Sdt ) = h(s − dt)e−αdt = h(s) − dt αh(s) + h0 (s) so that Ghα (s, 0) = −αh(s) − h0 (s). Equating this to κh(s) and dividing by h(s) yields h0 (s)/h(s) = −α − κ, h(s) = e−(α+κ(α))s
(3.2)
(normalizing by h(0) = 1). To determine κ, we invoke the behavior at the boundary 0. Here £ ¤ 1 = hα (0, 0) = E0 hα (Jdt , Sdt ) = EeαU h(T ) means
Z 1 = 0
∞
Z eαy B(dy)
∞
h(s)A(ds) , 0
160
CHAPTER VI. RENEWAL ARRIVALS
i.e.
£ ¤ b A b −α − κ(α) = 1. B[α]
(3.3)
As in III.5, we ªcan now for each α define a new probability measure Pα;s © governing (Jt , St ) t≥0 by letting the likelihood ratio Lt restricted to Ft = ¡ ¢ σ (Jv , Sv ) : 0 ≤ v ≤ t be Lt = eαSt −tκ(α)
h(Jt ) = eαSt −tκ(α) e−(α+κ(α))(Jt −s) h(s)
where κ(α) is the solution of (3.3). Proposition 3.4 The probability measure Pα;s is the probability measure governing a renewal risk process with J0 = s and the interarrival distribution A and the service time distribution B changed to Aα , resp. Bα where Aα (dt) =
e−(α+κ(α))t £ ¤ A(dt), b −α − κ(α) A
Bα (dx) =
eαx B(dx) . b B[α]
Proof. Pα;s (J0 = s) = 1 follows trivially from L0 = 1. Further, since JT1 = Js = T2 , £ ¤ Eα;s eβU1 +δT2 = Es eβU1 +δT2 LT1 £ ¤ = Es eβU1 +δT2 eα(U1 −s)−sκ(α) e−(α+κ(α))(T2 −s) £ ¤ b b £ ¤ b + β]A b δ − α − κ(α) = B[α + β] A δ£ − α − κ(α)¤ = B[α b b −α − κ(α) B[α] A bα [β]A bα [δ], = B which shows that U1 , T2 are independent with distributions Bα , resp. Aα as asserted. An easy extension of the argument shows that U1 , . . . , Un , T2 , . . . , Tn+1 are independent with distribution Aα for the Tk and Bα for the Uk . 2 Remark 3.5 For the compound Poisson case with rate ¡ ¢ where A is exponential ¡ ¢ b b β, (3.3) means 1 = B[α]β/ β + α + κ(α) , i.e. κ(α) = β B[α] − 1 − α in agreement with Chapter IV. 2 Note that the changed distributions of A and B are in general not the same (d) for Pα;s and Pα . An important exception is, however, the determination of the adjustment coefficient γ where the defining equations κ(d) (γ) = 0 and κ(γ) = 0 are the same.
4. THE DUALITY WITH QUEUEING THEORY
161
The Markov additive point of view is relevant when studying problems which cannot be reduced to the imbedded random walk, say finite horizon ruin probabilities where the approach via the imbedded random walk yields results on the probability of ruin after N claims, not after time T . Using the Markov additive approach yields for example the following analogue of Theorem V.4.6: Proposition 3.6 Let y < 1/κ0 (γ), let αy > 0 be the solution of κ0 (αy ) = 1/y, and define γy = αy − yκ(αy ). Then ψs (u, yu) ≤
e−(αy +κ(αy ))s −γy u b y ]e−γy u . = e−(αy +κ(αy ))s B[α £ ¤e b A −αy − κ(αy )
In particular, for the zero-delayed case ψs (u, yu) ≤ e−γy u . Proof. As in the proof of Theorem V.4.6, it is easily seen ¡ that ¢ κ(αy ) > 0. Let M (u) be the number of claims leading to ruin. Then J τ (u) = TM (u)+1 and hence i h h(s) ; τ (u) ≤ yu ψs (u, yu) = Eαy ;s e−αy Sτ (u) +τ (u)κ(αy ) h(Jτ (u) ) h e−(αy +κ(αy ))s i ≤ e−αy u+yuκ(αy ) Eαy ;s −(α +κ(α ))T y M (u)+1 e y £ ¤ −(αy +κ(αy ))s −γy u b = e e Aαy αy + κ(αy ) , which is the same as the asserted inequality for ψs (u, yu). The claim for the zero-delayed case follows by integration w.r.t. A(ds). 2 Notes and references The approach via the imbedded random walk is standard, see e.g. [APQ]. The random walk interpretation also allows to translate general asymptotic results for finite time-horizon ruin probabilities of random walks to the corresponding renewal model, for instance the sharp time-horizon asymptotics of Veraverbeke & Teugels [864]. For the approach via Markov additive processes, see in particular Dassios & Embrechts [273] and Asmussen & Rubinstein [99].
4
The duality with queueing theory
We first review some basic facts about the GI/G/1 queue, defined as the single server queue with first in first out (FIFO; or FCFS = first come first served) queueing discipline and renewal interarrival times. Label the customers 1, 2, . . . and assume that Tn is the time between the arrivals of customers n − 1 and n, and Un the service time of customer n. The actual waiting time Wn of customer
162
CHAPTER VI. RENEWAL ARRIVALS
n is defined as his time spent in queue (excluding the service time), that is, the time from which he arrives to the queue until he starts service. The virtual waiting time Vt at time t is the residual amount of work at time t, that is, the amount of time the server will have to work until the system is empty provided no new customers arrive (for this reason often the term workload process is used) or, equivalently, the waiting time a customer would have if he arrived at time t. Thus, since customer n arrives at time σn , we have (4.1)
Wn = Vσn − (left limit). The traffic intensity of the queue is ρ = EU/ET .
The following result shows that {Wn } is a Lindley process in the sense of III.4: +
Proposition 4.1 Wn+1 = (Wn + Un − Tn )
.
Proof. The amount of residual work just before customer n arrives is Vσn − . It then jumps to Vσn − + Un , whereas in [σn , σn+1 ) = [σn , σn + Tn ) the residual work decreases linearly until possibly zero is hit, in which case {Vt } remains at + zero until time σn+1 . Thus Vσn+1 − = (Wn + Un − Tn ) , and combining with (4.1), the proposition follows. 2 Applying Theorem III.3.1, we get: ¡ ¢ (d) Corollary 4.2 Let Mn = maxk=0,...,n−1 U1 +· · ·+Uk −T1 −· · · Tk . If W1 = 0, D (d) then Wn = Mn . The next result summarizes the fundamental duality relations between the steady-state behavior of the queue and the ruin probabilities (part (a) was essentially derived already in III.4): Proposition 4.3 Assume η > 0 or, equivalently, ρ < 1. Then: (a) as n → ∞, Wn converges in distribution to a random variable W , and we have P(W > u) = ψ(u); (4.2) (b) as t → ∞, Vt converges in distribution to a random variable V , and we have P(V > u) = ψ (s) (u).
(4.3)
Proof. Part (a) is contained in Theorem III.3.1 and Corollary III.3.2, but we shall present a slightly different proof via the duality result given in Theorem III.2.1. Let the T there be the random time σN . Then P(τ (u) ≤ T ) is
4. THE DUALITY WITH QUEUEING THEORY
163
the probability ψ (N ) (u) of ruin after at most N claims, and obviously ψ(u) = limN →∞ ψ (N ) (u). Also {Zt }0≤t≤T evolves like the left-continuous version of the virtual waiting time process up to just before the N th arrival, but interchanging the set (T1 , . . . , TN ) with (TN , . . . , T1 ) and similarly for the Un . However, by an obvious reversibility argument this does not affect the distribution, and hence in particular ZT is distributed as the virtual waiting time just before the N th arrival, i.e. as WN . It follows that P(WN > u) = ψ (N ) (u) has the limit ψ(u) for all u, which implies the convergence in distribution and (4.2). For part (b), we let T be deterministic. Then the arrivals of {Rt } in [0, T ] form a stationary renewal process with interarrival distribution A, hence (since the residual lifetime at 0 and the age at T have the same distribution, cf. A.1e) the same is true for the time-reversed point process which is the interarrival process for {Zt }0≤t≤T . Thus as before, {Zt }0≤t≤T has the same distribution as the left-continuous version of the virtual waiting time process so that ¡ ¢ P(s) (VT > u) = P(s) τ (u) ≤ T , (4.4) ¡ ¢ lim P(s) (VT > u) = lim P(s) τ (u) ≤ T = ψ (s) (u). T →∞
T →∞
2 It should be noted that this argument only establishes the convergence in distribution subject to certain initial conditions, namely W1 = 0 in (a) and V0 = 0, T1 ∼ A0 in (b). In fact, convergence in distribution holds for arbitrary initial conditions, but this requires some additional arguments (involving regeneration at 0, but not difficult) that we omit. Letting n → ∞ in Corollary 4.2, we obtain: Corollary 4.4 The steady-state actual waiting time W has the same distribution as M (d) . Corollary 4.5 (Lindley’s integral equation) Let F (x) = P(U1 −T1 ≤ x), K(x) = P(W ≤ x). Then Z x K(x) = K(x − y)F (dy), x ≥ 0 . (4.5) −∞
D Proof. Letting n → ∞ in Proposition 4.1, we get W = (W + U ∗ − T ∗ )+ , ∗ ∗ where U , T are independent and distributed as U1 , resp. T1 . Hence for x ≥ 0, conditioning upon U ∗ − T ∗ = y yields ¡ ¢ K(x) = P (W + U ∗ − T ∗ )+ ≤ x = P(W + U ∗ − T ∗ ≤ x) Z x = K(x − y)F (dy) −∞
164
CHAPTER VI. RENEWAL ARRIVALS
(x ≥ 0 is crucial for the second equality!).
2
Now return to the Poisson case. Then the corresponding queue is M/G/1, and we get: Corollary 4.6 For the M/G/1 queue with ρ < 1, the actual and the virtual D waiting time have the same distribution in the steady state. That is, W = V . Proof. For the Poisson case, the zero-delayed and the stationary renewal processes are identical. Hence ψ(u) = ψ (s) (u), implying P(W > u) = P(V > u) for all u. 2 Notes and references The GI/G/1 queue is a favorite of almost any queueing book (see e.g. Cohen [249] or [APQ, Ch. X]), despite the fact that the extension from M/G/1 is of equally doubtful relevance as we argued in Section 1 to be the case in risk theory. Some early classical papers are Smith [814] and Lindley [598]. Note that (4.5) looks like the convolution equation K = F ∗ K but is not the same (one would need (4.5) to hold for all x ∈ R and not just x ≥ 0). Equation (4.5) is in fact a homogeneous Wiener-Hopf equation, see e.g. Asmussen [66] and references therein. For some further explicit treatments beyond exponential claim sizes, see e.g. Malinovski [627] and Rongming & Haifeng [747]. The imbedded random walk approach also leads to a Pollaczeck-Khinchine type formula in the renewal case, which will be exploited for the asymptotic behavior of the ruin probability with heavy-tailed claims in Section X.3. A detailed exposition of the compound geometric approach to renewal models is Willmot & Lin [892]. Whenever the interclaim time is phase-type, renewal models are a special case of Markov additive processes and hence we also refer to Chapter IX for related material. Exploiting some links between wave governed random motions and the renewal risk process, Mazza & Rulli`ere [632] give an algorithm for computing finite-time ruin probabilities for non-exponential interarrival times. A number of further results on ruin-related quantities in renewal models will be discussed in XII.3.
Chapter VII
Risk theory in a Markovian environment 1
Model and examples
We assume that the arrivals form an inhomogeneous Poisson process, more precisely determined by a Markov process {Jt }0≤t<∞ with a finite state space E as follows: • The arrival intensity is βi when Jt = i; • Claims arriving when Jt = i have distribution Bi ; • The premium rate when Jt = i is pi . Thus, {Jt } describes the environmental conditions for the risk process. The intensity matrix governing {Jt } is denoted by Λ = (λij )i,j∈E and its stationary limiting distribution by π; here π exists whenever Λ is irreducible which is assumed throughout, and can be computed as the positive solution of πΛ = 0, πe = 1 where e is the E-column-vector of ones. As in Chapter I, {St } denotes the claim surplus process, Z t Nt X St = Ui − pJv dv, 0
i=1
and τ (u) = inf {t ≥ 0 : St > u}, M = supt≥0 St . The ruin probabilities with initial environment i are ¡ ¢ ¡ ¢ ψi (u) = Pi τ (u) < ∞ = Pi (M > u), ψi (u, T ) = Pi τ (u) ≤ T , 165
166
CHAPTER VII. MARKOVIAN ENVIRONMENT
where as usual Pi refers to the case J0 = i. Unless otherwise stated, we shall assume that pi = 1; this is no restriction when studying infinite horizon ruin probabilities, cf. the operational time argument given in Example 1.5 below. We let X 1−ρ ρi = βi µBi , ρ = πi ρi , η = . (1.1) ρ i∈E
Then ρi is the average amount of claims received per unit time when the environment is in state i, and ρ is the overall average amount of claims per unit time, cf. Proposition 1.11 below. An example of how such a mechanism could be relevant in risk theory follows. Example 1.1 Consider car insurance, and assume that weather conditions play a major role for the occurrence of accidents. For example, we could distinguish between normal and icy road conditions, leading to E having two states n, i and corresponding arrival intensities βn , βi and claim size distributions Bn , Bi ; one expects that βi > βn and presumably also that Bn 6= Bi , meaning that accidents occurring during icy road conditions lead to claim amounts which are different from the normal ones. 2 The versatility of the model in terms of incorporating (or at least approximating) many phenomena which look very different or more complicated at a first sight goes in fact much further (note that for the following discussion a basic knowledge of phase-type distributions is needed, cf. IX.1): Example 1.2 (alternating renewal environment) The model of Example 1.1 implicitly assumes that the sojourn times of the environment in the normal and the icy states are exponential, with rates λni and λin , respectively, which is clearly unrealistic. Thus, assume that the sojourn time in the icy state has a more general distribution A(i) . According to Theorem A5.14, we can approximate A(i) with a phase-type distribution (cf. Example I.2.4) with ¡ ¢ representation E (i) , α(i) , T (i) , say. Assume similarly that the sojourn time in the normal state has distribution ¡A(n) which we approximate with a phase-type ¢ distribution with representation E (n) , α(n) , T (n) , say. Then the state space for the environment is the disjoint union of E (n) and E (i) , and we have βj = βi when j ∈ E (i) , βj = βn when j ∈ E (n) ; in block-partitioned form, the intensity matrix is ³ ´ T (n) t(n) α(i) Λ = , t(i) α(n) T (i) where t(n) = −T (n) e, t(i) = −T (i) e are the exit rates.
2
1. MODEL AND EXAMPLES
167
Example 1.3 Consider again the alternating renewal model for car insurance in Example 1.2, but assume now that the arrival intensity changes during the icy period, say it is larger initially. One way to model this would be to take A(i) to be Coxian (cf. Example IX.1.4) with states i1 , . . . , iq (visited in that order) and let βi1 > . . . > βiq . 2 Example 1.4 (semi-Markovian environment) Dependence between the length of an icy period and the following normal one (and vice versa) ¡ ¢ can be modelled by semi-Markov structure. This amounts to a family A(η) η∈H of sojourn time distributions, such that a sojourn time of type η is followed by one of type ι w.p. wηι where W = (wηι )η,ι∈H is a transition matrix. Approximating ¡ ¢ each A(η) by a phase-type distribution with representation E (η) , α(η) , T (η) , ª © say, the state space E for the environment is (η, i) : η ∈ H, i ∈ E (η) , and Λ =
T (1) + ω11 t(1) α(1) ω21 t(2) α(1) .. .
ω12 t(1) α(2) T (2) + ω22 t(2) α(2)
··· ··· .. .
ω1q t(1) α(q) ω2q t(2) α(q) .. .
ωq1 t(q) α(1)
ωq2 t(q) α(2)
···
T (q) + ωqq t(q) α(q)
where q = |H|, t(η) = −T (η) e. The simplest model for the arrival intensity amounts to βη,j = βη depending only on η. In the car insurance example, one could for example have H = {i` , is , n` , ns }, such that the icy period is of two types (long and short) each with their sojourn time distribution A(i` ) , resp. A(is ) , and similarly for the normal period. Then for example wi` ns is the probability that a long icy period is followed by a short normal one. 2 Example 1.5 (Markov-modulated premiums) Returning for a short while to the case of general premium rates pi depending on the environment i, let Z T θ(T ) = pJt dt, Jet = Jθ−1 (t) , Set = Sθ−1 (t) . 0
© ª Then (by standard operational time arguments) Set is a risk process in a Markovian environment with unit premium rate, and ψei (u) = ψi (u). Indeed, eij = λij /pi , βei = βi /pi . the parameters are λ 2 From now on, we assume again pi = 1 so that the claim surplus is St =
Nt X i=1
Ui − t.
168
CHAPTER VII. MARKOVIAN ENVIRONMENT
We turn to some more mathematically oriented basic discussion. The key property for much of the analysis presented below is the following immediate observation: Proposition 1.6 The claim surplus process {St } of a risk process in a Markovian environment is a Markov additive process corresponding to the parameters µi = −pi , σi2 = 0, νi (dx) = βi Bi (dx), qij = 0 in the notation of Chapter III.4. In particular, the Markov additive structure will be used for exponential change of measure and thereby versions of Lundberg’s inequality and the Cram´erLundberg approximation. Next we note a semi-Markov structure of the arrival process: Proposition 1.7 ¡ 0 ¢ The Pi -distribution of T1 is phase-type with representation ei , Λ − (βi )diag . More precisely, Pi (T1 ∈ dx, JT1 = j) = βj · e0i e(Λ−(βi )diag )x ej dx. Proof. The result immediately follows by noting that T1 is obtained as the lifelength of {Jt } killed at the time of the first arrival and that the exit rate obviously is βj in state j. 2 A remark which is fundamental for much of the intuition on the model consists in noting that to each risk process in a Markovian environment, one can associate in a natural way a standard Poisson one by averaging over the environment. More precisely, we put β∗ =
X
πi βi ,
i∈E
B∗ =
X πi βi i∈E
β∗
Bi .
These parameters are the ones which the statistician would estimate if he ignored the presence of Markov-modulation: Proposition 1.8 As t → ∞, Nt a.s. ∗ → β , t
Nt 1 X a.s. I(U` ≤ x) → B ∗ (x) . Nt `=1
Note that the last statement of the proposition just means that in the limit, the empirical distribution of the claims is B ∗ . Note also that (as the proof shows) πi βi /β ∗ gives the proportion of the claims which are of type i (arrive in state i). Rt (i) Proof. Let ti = 0 I(Js = i) ds be the time spent in state i up to time t and Nt a.s. the number of claim arrivals in state i. Then it is standard that ti /t → πi as
1. MODEL AND EXAMPLES
169 (i)
t → ∞. However, given {Jt }0≤t<∞ , we may view Nt as the number of events in a Poisson process where the accumulated intensity at time t is βi ti . Hence (i)
Nt ti
a.s.
→ βi ,
(i)
Nt t
XN Nt t = t t
(i)
a.s.
→ πi βi ,
a.s.
→ β∗.
i∈E
(i)
(i)
Also, denoting the sizes of the claims arriving in state i by U1 , U2 , . . ., the standard law of large numbers yields N 1 X a.s. (i) I(Uk ≤ x) → Bi (x), N → ∞ . N k=1
Hence Nt 1 X I(U` ≤ x) Nt
(i)
=
`=1
∼
Nt X N (i) 1 XX (i) t I(Uk ≤ x) ∼ Bi (x) Nt Nt i∈E k=1 i∈E X tπi βi Bi (x) = B ∗ (x). tβ ∗
i∈E
2 A different interpretation of B ∗ is as the Palm distribution of the claim size, cf. Example III.5.4. The next result shows that we can think of the averaged compound Poisson risk model as the limit of the Markov-modulated one obtained by speeding up the Markov-modulation. Proposition 1.9 Consider a Markov-modulated risk process {St } with parame© (a) ª ters βi , Bi , Λ, and let St refer to the one with parameters βi , Bi , aΛ, {St∗ } © (a) ª D → {St∗ } to the compound Poisson model with parameters β ∗ , B ∗ . Then St (a) in D[0, ∞) as a → ∞. In particular, ψi (u) → ψ ∗ (u) for all u and i. © (a) ª Proof. According to Proposition the Pi -distribution of T1 in St is ¡ 1.7, ¢ 0 phase-type with representation E, ei , aΛ − (βi )diag . By Proposition A5.2, this converges to the exponential distribution with rate β ∗ as a → ∞, and furthermore in the limit JT1 has distribution (πi βi /β ∗ )i∈E and is independent of T1 . In particular, the limiting distribution of the first claim size U1 is B ∗ . Conditioning upon FT1 shows similarly that in the limit (T2 , U2 ) are independent of FT1 , with T2 being exponential with rate β ∗ and U2 having distribution B ∗ . Continuing in this manner shows that the limiting distribution of (Tn , Un )n=1,2,... is as
170
CHAPTER VII. MARKOVIAN ENVIRONMENT
in {St∗ }. From this the convergence in distribution follows by general facts on weak convergence in D[0, ∞), which also yields ψ (a) (u, T ) → ψ ∗ (u, T ) for all u (a) and T . The fact that indeed ψi (u) → ψ ∗ (u) follows, e.g., from Theorem 3.2.1 of [370]. 2 Example 1.10 Let E = {1, 2} , 9 , 2 3 β2 = , 2 β1 =
³ −a a ´ a −a 3 2 B1 = E3 + E7 , 5 5 1 4 B2 = E3 + E7 , 5 5 Λ=
where Eδ denotes the exponential distribution with intensity parameter δ and a > 0 is arbitrary. That is, we may imagine that we have two types of claims such that the claim size distributions are E3 and E7 . Claims of type E3 arrive 3 1 3 with intensity 92 · 35 = 27 10 in state 1 and with intensity 2 · 5 = 10 in state 2, 9 2 9 those of type E7 with intensity 2 · 5 = 5 in state 1 and with intensity 23 · 45 = 65 in state 2. Thus, since E3 is a more dangerous claim size distribution than E7 (the mean is larger and the tail is heavier), state 1 appears as more dangerous than state 2, and in fact µ 9 3 2 5 µ 3 1 = 2 5
ρ1
= β1 µB1 =
ρ2
= β1 µB2
¶ 1 2 1 81 + · = , 3 5 7 70 ¶ 1 4 1 19 · + · = . 3 5 7 70 ·
Thus in state 1 where ρ1 > 1, the company even suffers an average loss, and (at least when a is small such that state changes of the environment are infrequent), the paths of the surplus process will exhibit the type of behavior in Fig. VII.1 with periods with positive drift alternating with periods with negative drift; the overall drift is negative since π = ( 12 12 ) so that ρ = π1 ρ1 + π2 ρ2 = 57 < 1. On Fig. VII.1, there are p = 2 background states of {Jt }, marked by thin, resp. thick, lines in the path of {St }. Computing the parameters of the averaged compound Poisson model, we first get that 1 9 1 3 · + · = 3. β∗ = 2 2 2 2
1. MODEL AND EXAMPLES
171
Figure VII.1 Thus, a fraction π1 β1 /β ∗ = 3/4 of the claims occurs in state 1 and the remaining fraction 1/4 in state 2. Hence B∗ =
3³3 2 ´ 1³1 4 ´ 1 1 E3 + E7 + E3 + E7 = E3 + E7 . 4 5 5 4 5 5 2 2
That is, the averaged compound Poisson model is the same as in IV.(3.1).
2
The definition (1.1) of the safety loading η is (as for the renewal model in Chapter VI) based upon an asymptotic consideration given by the following result: Proposition 1.11 (a) ESt /t → ρ − 1, t → ∞; (b) St /t → ρ − 1 a.s., t → ∞. Proof. In the notation of Proposition 1.8, we have X X ¯ £ ¤ E St + t ¯ (ti )i∈E = ti βi µBi = t i ρi . i∈E
i∈E
Taking expectations and using the well-known fact Eti /t → πi yields (a). For PN (i) a.s. (b), note first that 1 Uk /N → µBi . Hence (i)
Nt X N (i) X St + t 1 X (i) a.s. t = · (i) Uk → πi βi · µBi = ρ. t t Nt k=1 i∈E i∈E
2
172
CHAPTER VII. MARKOVIAN ENVIRONMENT
Corollary 1.12 If η ≤ 0, then M = ∞ a.s., and hence ψi (u) = 1 for all i and u. If η > 0, then M < ∞ a.s., and ψi (u) < 1 for all i and u. Proof. The case η < 0 is trivial since then the a.s. limit ρ − 1 of St /t is > 0, and hence M = ∞. The case η > 0 is similarly easy. Now let η = 0, let some state i be fixed and define ω = ω1 = inf {t > 0 : Jt− 6= i, Jt = i} , X1 = Sω1 ,
ω2 = inf {t > ω1 : Jt− 6= i, Jt = i} ,
X2 = Sω2 − Sω1 ,
and so on. Then by standard Markov process formulas (e.g. [APQ, Th. II.4.2(i), p. 50]) Ei ω1 = −1/πi λii and Z ω Ei X1 = Ei βJt µBJt dt − Ei ω 0 ¡X ¢ = Ei ω · πj βj µBj − 1 = (ρ − 1)Ei ω = 0. j∈E a.s.
Now obviously the ωn form a renewal process, and hence ωn /n → Ei ω. Since the Xn are independent, with X2 , X3 , . . . having the Pi -distribution of X, also Sωn X1 + · · · + Xn a.s. → Ei X = 0. = n n Thus {Sωn } is a discrete time random walk with mean zero, and hence oscillates between −∞ and ∞ so that also here M = ∞. 2 Notes and references The Markov-modulated Poisson process has been very popular in queueing theory since the early 1980s, see the Notes to Section 7. In risk theory, some early studies are in Janssen & Reinhard [501, 730, 502], and a more comprehensive treatment in Asmussen [58]. The mainstream of the present chapter follows [58], with some important improvements being obtained in Asmussen [59] in the queueing setting and being implemented numerically in Asmussen & Rolski [97]. Statistical aspects are not treated here. See Meier [634] and Ryd´en [760, 761]. There seems still to be more to be done in this area, in particular in order to treat more than low-dimensional state spaces E. Proposition 1.1 and the Corollary are standard. The proof of Proposition 1.1(b) is essentially the same as the proof of the strong law of large numbers for cumulative processes, see [APQ, p. 178] or A.1d.
2
The ladder height distribution
Our mathematical treatment of the ruin problem follows the model of Chapter IV for the simple compound Poisson model, and involves a version of the
2. THE LADDER HEIGHT DISTRIBUTION
173
Pollaczeck-Khinchine formula (see Proposition 2.2(a) below) where the ladder height distribution is evaluated by a time reversion argument. Define the ladder epoch τ+ by τ+ = inf {t : St > 0} = τ (0), let ¡ ¢ G+ (i, j; A) = Pi Sτ+ ∈ A, Jτ+ = j, τ+ < ∞ and let G+ be the measure-valued matrix with ijth element G+ (i, j; ·). The form of G+ turns out to be explicit (or at least computable), but is substantially more involved than for the compound Poisson case. However, by specializing results for general stationary risk processes (Theorem III.5.5; see also Example III.5.4) we obtain the following result, which represents a nice simplified form of the ladder height distribution G+ when taking certain averages: starting {Jt } stationary, we get the same ladder height distribution as for the averaged compound Poisson model, cf. the definition of β ∗ , B ∗ in Section 1. ∗
Proposition 2.1 πG+ (dy)e = β ∗ B (y)dy. For measure-valued matrices, we define the convolution operation by the same rule as for multiplication of real-valued matrices, only with the product of real numbers replaced by convolution of measures. Thus, e.g., G∗2 + is the matrix whose ijth element is X G+ (i, k; ·) ∗ G+ (k, j; ·). k∈E
Also, kG+ k denotes the matrix with ijth element Z ∞ ° ° °G+ (i, j; ·)° = G+ (i, j; dx). 0
Let further R denote the pre-τ+ occupation kernel, Z τ+ R(i, j; A) = Ei I(St ∈ A, Jt = j) dt, 0
and S(dx) the measure-valued diagonal matrix with βi Bi (dx) as ith diagonal element. Proposition 2.2 (a) The distribution of M is given by 1 − ψi (u) = Pi (M ≤ u) = eT i Z (b) G+ (y, ∞) =
∞ X
¡ ¢ G∗n + (u) I − kG+ k e.
(2.1)
n=0 0
¡ ¢ R(dx)S (y − x, ∞) . That is, for i, j ∈ E,
−∞
¡ ¢ G+ i, j; (y, ∞) =
Z
0
R(i, j; dx)βj B j (y − x). −∞
(2.2)
174
CHAPTER VII. MARKOVIAN ENVIRONMENT
Proof. The probability that there are n proper ladder steps not exceeding x and ∗n that the environment is j at the nth when we start from i is eT i G+ (x)ej , and the probability that ¡ ¢ there are no further ladder steps starting from environment j is eT j I − kG+ k e. From this (2.1) follows by summing over n and j. The proof of (2.2) is just the same as the proof of Lemma III.5.3. 2 To make Proposition 2.2 useful, we need as in Chapters III, IV to bring R and G+ on a more explicit form. To this end, we need to invoke the time-reversed version {Jt∗ } of {Jt }; the intensity matrix Λ∗ has ijth element λ∗ij = and we have Pi (JT∗ = j) =
πj λji , πi πj Pj (JT = i). πi
(2.3)
We let {St∗ } be defined as {St }, only with {Jt } replaced by {Jt∗ } (the βi and Bi are the same), and let further {mx } be the E-valued process obtained by observing {Jt∗ } only when {St∗ } is at a minimum value. That is, mx = j when for some (necessarily unique) t we have St∗ = −x, Jt∗ = j, St∗ < Su∗ for u < t; see Figure VII.2 for an illustration in the case of p = 2 environmental states of {Jt }, marked by thin, resp. thick, lines in the path of {St }.
Figure VII.2 The following observation is immediate: Proposition 2.3 When η > 0, {mx } is a non-terminating Markov process on E, hence uniquely specified by its intensity matrix Q (say).
2. THE LADDER HEIGHT DISTRIBUTION
175
Proposition 2.4 Q satisfies the non-linear matrix equation Q = ϕ(Q) where Z ϕ(Q) = Λ∗ − (βi )diag +
∞
S(dx) eQx ,
0
and S(dx) is the diagonal matrix with the βi Bi (dx) on the diagonal. Further© ª more, the sequence Q(n) defined by ¡ ¢ Q(n+1) = ϕ Q(n)
Q(0) = Λ∗ − (βi )diag , converges monotonically to Q.
Note that the integral in the definition of ϕ(Q) is the matrix whose ith row is the ith row of Z ∞ bi [Q] = βi βi B eQx Bi (dx). 0
Proof. The argument relies on an interpretation in terms of excursions. An ∗ excursion of {St∗ } above level −x starts at time t if St− = −x, {Sv∗ } is a minimum value at v = t− and a jump (claim arrival) occurs at time t, and the excursion ends at time s = inf {v > t : Sv∗ = −x}. If there are no jumps in (t, s], we say that the excursion has depth 0. Otherwise each jump at a minimum level during the excursion starts a subexcursion, and the excursion is said to have depth 1 if each of these subexcursions have depth 0. In general, we recursively define the depth of an excursion as 1 plus the maximal depth of a subexcursion. The definitions are illustrated on Figure VII.3 where there are three excursions of depth 1,0,2. For example the excursion of depth 2 has one subexcursion which is of depth 1, corresponding to two subexcursions of depth 0.
Figure VII.3
176
CHAPTER VII. MARKOVIAN ENVIRONMENT (n)
Let pij be the probability that an excursion starting from Jt∗ = i has depth at most n and terminates at Js∗ = j and pij the probability that an excursion starting from Jt∗ = i terminates at Js∗ = j. By considering minimum values within the excursion, it becomes clear that Z ∞ £ Qy ¤ pij = e (2.4) B (dy) . ij i 0
To show Q = ϕ(Q), we first compute qij for i 6= j. Suppose mx = i. Then a jump to j (i.e., mx+dx = j) occurs in two ways, either due to a jump of {Jt∗ } which occurs with intensity λ∗ij , or through an arrival starting an excursion terminating with Js∗ = j. It follows that qij = λ∗ij + βi pij . Similarly, Pi (mh = i) = 1 + λ∗ii h − βi h + βi hpii + o(h) implies qii = λ∗ii − βi + βi pii . Writing out in matrix notation, Q = ϕ(Q) follows. © (n) ª Now let mx be {mx } killed at the first time ηn (say) a subexcursion of © (n) ª is a terminating Markov process depth at least n occurs. It is clear that mx © (0) ª has subintensity matrix Λ∗ − (βi )diag = Q(0) . The proof of and that mx Q = ϕ(Q) then immediately carries over to show that the subintensity matrix © (1) ª ¡ ¢ of mx is ϕ Q(0) = Q(1) . Similarly by induction, the subintensity matrix of © (n+1) ª ¡ (n) ¢ is ϕ Q mx = Q(n+1) which implies that (n+1)
qij
(n)
= λ∗ij − βi + βi pij .
(n)
Now just note that pij ↑ pij and insert (2.4).
2
Define a further kernel U by Z Z U (i, j; A) = Pi (mx = j) dx = −A
−A
Qx eT ej dx ie
(2.5)
(note that we use −A = {x : −x ∈ A} on the r.h.s. of the definition to make U be concentrated on (−∞, 0)). Theorem 2.5 R(i, j; A) =
πj U (j, i; A). πi
Proof. We shall show that ¢ ¡ ¢ πj ¡ ∗ Pj Jt = i, St∗ ∈ A, St∗ < Su∗ , u < t , Pi Jt = j, St ∈ A, τ+ > t = πi
(2.6)
2. THE LADDER HEIGHT DISTRIBUTION
177
from which the result immediately follows by integrating from 0 to ∞ w.r.t. dt. To this end, consider stationary versions of {Jt }, {Jt∗ }. We may then assume Ju∗ = Jt−u , Su∗ = St − St−u , 0 ≤ u ≤ t, and get ¡ ¢ πi Pi Jt = j, St ∈ A, τ+ > t ¡ ¢ = Pπ Jt = j, J0 = i, St ∈ A, Su < 0, 0 < u < t ¡ ¢ ∗ = Pπ J0∗ = j, Jt∗ = i, St∗ ∈ A, St∗ < St−u ,0 < u < t ¡ ¢ = πj Pj Jt∗ = i, St∗ ∈ A, St∗ < Su∗ , 0 < u < t , 2
and this immediately yields (2.6).
It is convenient at this stage to rewrite the above results in terms of the matrix K = ∆−1 QT ∆, where ∆ is the diagonal matrix with π on the diagonal: Corollary 2.6 (a) R(dx) = Re−Kx dx, ¡x ≤ 0; ¢ ∞ (b) for z ≥ 0, G+ ((z, ∞)) = 0 eKx S (x + z, ∞) dx; (c) the matrix K satisfies the non-linear matrix equation K = ϕ(K) where Z ∞ eKx S(dx); ϕ(K) = Λ − (βi )diag + 0
©
(n)
ª
defined by K (d) the sequence K converges monotonically to K.
(0)
¡ ¢ = Λ − (βi )diag , K (n+1) = ϕ K (n)
[The ϕ(·) here is of course not the same as in Proposition 2.4.] From Qe = 0, it is readily checked that π is a left eigenvector of K corresponding to the eigenvalue 0 (when ρ < 1), and we let k be the corresponding right eigenvector normalized by πk = 1. Remark 2.7 It is instructive to see how Proposition 2.1 can be rederived using the more detailed form of G+ in Corollary 2.6(b): from πK = 0 we get Z ∞ πG+ (dy)e = πeKx (βi Bi (dy + x))diag dx · e 0 Z ∞ = π(βi Bi (dy + x))col dx 0 X ∗ = πi βi B i (y) dy = β ∗ B (y)dy. i∈E
2 Though maybe Corollary 2.6 is hardly all that explicit in general, we shall see that nevertheless we have enough information to derive, e.g., the Cram´erLundberg approximation (Section 3), and to obtain a simple solution in the
178
CHAPTER VII. MARKOVIAN ENVIRONMENT
special case of phase-type claims (Chapter IX). As preparation, we shall give at this place some simple consequences of Corollary 2.6. ¡ ¢ Lemma 2.8 I − kG+ k e = (1 − ρ)k. Proof. Using Corollary 2.6(b) with z = 0, we get Z ∞ ¡ ¢ kG+ k = eKx S (x, ∞) dx.
(2.7)
0
In particular, multiplying by K and integrating by parts yields Z ∞ KkG+ k = (eKx − I)S(dx) 0 Z ∞ = K − Λ + (βi )diag − S(dx) = K − Λ.
(2.8)
0
Let L = (kπ − K)−1 . Then (kπ − K)k = k implies Lk = k. Now using (2.7), (2.8) and πeK x = π, we get Z ∞ ¡ ¢ kπkG+ ke = k πS (x, ∞) e dx = k(πi βi µBi )row e = ρk, 0
KkG+ ke = ¡ ¢ (kπ − K) I − kG+ k e =
Ke, k − Ke − ρk + Ke = (1 − ρ)k.
Multiplying by L to the left, the proof is complete.
2
Here is an alternative algorithm to the iteration scheme in Corollary 2.6 for computing K. Let |A| denote the determinant of the matrix A and d the number of states in E. Proposition 2.9 The following assertions are equivalent: (a) all d eigenvalues of K are distinct; (b) there exist d distinct solutions s1 , . . . , sd ∈ {s ∈ C : <(s) ≤ 0} of ¯ ¯ ¯ bi [s] − 1))diag − sI ¯¯ = 0. ¯Λ + (βi (B
(2.9)
In that case, then s1 , . . . , sd are precisely the eigenvalues of K, and the corresponding left row eigenvectors a1 , . . . , ad can be computed by ³ ´ ¡ ¢ bi [si ] − 1) ai Λ − βi (B − s I = 0. (2.10) i diag
2. THE LADDER HEIGHT DISTRIBUTION Thus,
−1 a1 s1 a 1 K = ... ... . ad sd a d
179
(2.11)
Proof. Since K is similar to the subintensity matrix Q, all eigenvalues must indeed be in {s ∈ C : <(s) ≤ 0}. Assume aK = sa. Then multiplying K = ϕ(K) by a to the left, we get Z ∞ ³ ´ ³ ´ bi [s])diag . sa = a Λ − (βi )diag + esx S(dx) = a Λ − (βi )diag + (βi B 0
It follows that if (a) holds, then so does (b), and the eigenvalues and eigenvectors can be computed as asserted. The proof that (b) implies (a) is more involved and omitted; see Asmussen [58]. 2 In the computation of the Cram´er-Lundberg constant C, we shall also need some formulas which are only valid if ρ > 1 instead of (as up to now) ρ < 1. Let M + denote the matrix with ijth entry Z ∞ M+ (i, j) = x G+ (i, j; dx) . 0
Lemma 2.10 Assume ρ > 1. Then kG+ k is stochastic with invariant probability vector ζ + (say) proportional to −πK, ζ + = −πK/(−πKe). Furthermore, −πKM + e = ρ − 1. a.s.
Proof. From ρ > 1 it follows that St → ∞ and hence kG+ k is stochastic. That −πK = −eT Q0 ∆ is non-zero and has non-negative components follows since −Qe has the same property for ρ > 1. Thus the formula for ζ + follows immediately by multiplying (2.8) by −π, which yields −πKkG+ k = −πK. Further Z ∞ Z ∞ ¡ ¢ M+ = dz eKx S (x + z, ∞) dx Z0 ∞ Z0 y ¡ ¢ = dy eKx dx S (y, ∞) 0 Z ∞0 ¡ ¢ −1 = K (eKy − I) S (y, ∞) dy, Z ∞0 ¡ ¢ dy(I − eKy ) S (y, ∞) e −πKM + e = π 0
=
π(βi µBi )diag e − πkG+ ke = ρ − 1
180
CHAPTER VII. MARKOVIAN ENVIRONMENT
(since kG+ k being stochastic implies kG+ ke = e).
2
Notes and references The exposition follows Asmussen [59] closely (the proof of Proposition 2.4 is different). The problem of computing G+ may be viewed as a special case of Wiener-Hopf factorization for continuous-time random walks with Markov-dependent increments (Markov additive processes); the discrete-time case is surveyed in Asmussen [57] and references given therein.
3
Change of measure via exponential families
We first recall some notation and some results which were given in Chapter III in a more general Markov additive process context. Define F t as the measureb t [s] as the valued matrix with ijth entry Ft (i, j; x) = Pi [St ≤ x; Jt = j], and F sSt b b matrix with ijth entry Ft [i, j; s] = Ei [e ; Jt = j] (thus, F [s] may be viewed as the matrix m.g.f. of F t defined by entrywise integration). Define further ³ ¡ ¢´ bi [α] − 1 K[α] = Λ + βi B − αI diag
(the matrix function K[α] is of course not related to the matrix K of the preceding section). Then (Proposition III.4.2): b t [α] = etK[α] . Proposition 3.1 F It follows from III.4 that K[α] has a simple and unique eigenvalue κ(α) with maximal real part, such that the corresponding left and right eigenvectors ν (α) , h(α) may be taken with strictly positive components. We shall use the normalization ν (α) e = ν (α) h(α) = 1. Note that since K[0] = Λ, we have ν (0) = π, h(0) = e. The function κ(α) plays the role of an appropriate generalization of the c.g.f., see Theorem III.4.7. bi [θ] and hence κ(θ), ν (θ) , h(θ) etc. Now consider some θ such that all B are well-defined. The aim is to define governing parameters βθ;i , Bθ;i , Λθ = (θ) (λij )i,j∈E for a risk process, such that one can obtain suitable generalizations of the likelihood ratio identitites of Chapter III and thereby of Lundberg’s inequality, the Cram´er-Lundberg approximation etc. According to Theorem III.4.11, the appropriate choice is eθx B (dx) , bi [θ] i B
βθ;i
bi [θ], = βi B
Λθ
= ∆−1 θ K[θ]∆θ − κ(θ)I ¡ ¢ −1 bi [θ] − 1) = ∆ Λ∆θ + βi (B θ
Bθ;i (dx) =
diag
¡ ¢ − κ(θ) + θ I
3. CHANGE OF MEASURE VIA EXPONENTIAL FAMILIES
181
(θ)
where ∆θ is the diagonal matrix with hi as ith diagonal element. That is, (θ) hj i 6= j λij (θ) (θ) λij = . hi bi [θ] − 1) − κ(θ) − θ i = j λii + βi (B (θ)
We recall that it was shown in III.4 that Λθ is an intensity matrix, that Ei eθSt hJt © (θ) (θ) ª = etκ(θ) hi and that eθSt −tκ(θ) hJt t≥0 is a martingale. We let Pθ;i be the governing probability measure for a risk process with (T ) parameters βθ;i , Bθ;i , Λθ and initial environment J0 = i. Recall that if Pθ;i is © ª (T ) (T ) (T ) the restriction of Pθ;i to FT = σ (St , Jt ) : t ≤ T and Pi = P0;i , then Pθ;i (T )
and Pi are equivalent for T < ∞. More generally, allowing T to be a stopping time, Theorem III.1.3 takes the following form: Proposition 3.2 Let τ be any stopping time and let G ∈ Fτ , G ⊆ {τ < ∞}. Then # " 1 (θ) (3.1) Pi G = P0;i G = hi Eθ;i (θ) exp {−θSτ + τ κ(θ)} ; G . hJ τ b θ;t [s], κθ (s) and ρθ be defined the same way as F b t [s], κ(s) and ρ, only Let F with the original risk process replaced by the one with changed parameters. b θ;t [s] = e−tκ(θ) ∆−1 F b t [s + θ]∆. Lemma 3.3 F Proof. Use III.(4.5).
2
Lemma 3.4 κθ (s) = κ(s + θ) − κ(θ). In particular, ρθ > 1 whenever κ0 (s) > 0. Proof. The first formula follows by Lemma 3.3 and the second from ρθ = κ0θ (s). 2 Notes and references The exposition here and in the next two subsections (on likelihood ratio identities and Lundberg conjugation) follows Asmussen [58] closely (but is somewhat more self-contained).
3a
Lundberg conjugation
Since the definition of κ(s) is a direct extension of the definition for the Cram´erLundberg model, the Lundberg equation is κ(γ) = 0. We assume that a solution γ > 0 exists and use notation like PL;i instead of Pγ;i ; also, for brevity we write h = h(γ) and ν = ν (γ) .
182
CHAPTER VII. MARKOVIAN ENVIRONMENT
Substituting θ = γ, τ = τ (u), G = {τ (u) < ∞} in Proposition 3.2, letting ξ(u) = Sτ (u) − u be the overshoot and noting that PL;i (τ (u) < ∞) = 1 by Lemma 3.4, we obtain: Corollary 3.5 ψi (u, T ) =
hi e−γu EL,i
ψi (u) =
hi e−γu EL,i
h e−γξ(u) hJτ (u)
i ; τ (u) ≤ T ,
e−γξ(u) . hJτ (u)
(3.2) (3.3)
Noting that ξ(u) ≥ 0, (3.3) yields Corollary 3.6 (Lundberg’s inequality) ψi (u) ≤
hi e−γu . minj∈E hj
Assuming it has been shown that C = limu→∞ EL;i [e−γξ(u) /hJτ (u) ] exists and is independent of i (which is not too difficult, cf. the proof of Lemma 3.8 below), it also follows immediately that ψi (u) ∼ hi Ce−γu . However, the calculation of C is non-trivial. Recall the definition of G+ , K, k from Section 2. ´r-Lundberg approximation) In the light-tailed Theorem 3.7 (the Crame −γu case, ψi (u) ∼ hi Ce , where C =
1−ρ νk. (ρL − 1)
(3.4)
To calculate C, we need two lemmas. For the first, recall the definition of ζ + , M + in Lemma 2.10. ¡ ¢ Lemma 3.8 As u → ∞, ξ(u), Jτ (u) ¡ converges¢in distribution w.r.t. PL;i , with the density gj (x) (say) of the limit ξ(∞), Jτ (∞) at ξ(∞) = x, Jτ (∞) = j being independent of i and given by gj (x) =
X
¢ 1 L;` L ¡ ζ+ G+ `, j; (x, ∞) . L L ζ + M + e `∈E
Proof. We shall need to invoke the concept of semi-regeneration, see A.1f. Interpreting the ladder points as semi-regeneration pointsª(the types being the © environmental states in which they occur), (ξ(u), Jτ (u) ) is semi-regenerative with the first semi-regeneration point being (ξ(0), Jτ (0) ) = (Sτ+ , Jτ+ ). The formula for gj (x) now follows immediately from Proposition A1.7, noting that the 2 non-lattice property is obvious because all GL + (`, j; ·) have densities.
3. CHANGE OF MEASURE VIA EXPONENTIAL FAMILIES
183
b L [−γ] = ∆−1 kG+ k∆, G b + [γ]h = h. Lemma 3.9 K L = ∆−1 K∆ − γI, G + Proof. Appealing to the occupation measure interpretation of K, cf. Corollary 2.6, we get for x < 0 that Z ∞ ¡ ¢ −Kx eT e e dx = Pi St ∈ dx, Jt = j, τ+ > t dt j i 0 Z ¡ ¢ hi −γx ∞ = e PL;i St ∈ dx, Jt = j, τ+ > t dt hj 0 hi −γx 0 −K L x = e ei e ej dx, hj which is equivalent to the first statement of the lemma. The proof of the second is a similar but easier application of the basic likelihood ratio identity Proposib + [γ] = ∆kGL k∆−1 , and since kGL ke = e, tion 3.2. In the same way we get G + + it follows that b + [γ]h = ∆kGL k∆−1 h = ∆kGL ke = ∆e = h. G + + 2 Proof of Theorem 3.7. Using Lemma 3.8, we get Z ∞ £ −γξ(∞) ¤ EL e ; Jτ (∞) = j = e−γx gj (x) dx 0 X L;` Z ∞ ¡ ¢ 1 = ζ+ e−γx GL + `, j; (x, ∞) dx L L ζ + M + e `∈E 0 Z ∞ X 1 1 L;` = (1 − e−γx )GL ζ+ + (`, j; dx) L γ ζL M e 0 + + `∈E X L;` ¡ ¢ 1 bL = ζ+ kGL + (`, j)k − G+ [`, j; −γ] . L L γζ + M + e `∈E In matrix formulation, this means that C
= = =
¢ −1 ¡ L e−γξ(∞) 1 bL = ζL e + kG+ k − G+ [−γ] ∆ L L hJτ (∞) γζ + M + e ¡ ¢ −1 1 bL ζL e + I − G+ [−γ] ∆ L L γζ + M + e ¡ ¢ 1 b L [−γ] ∆−1 e, (−π L K L ) I − G + γ(ρL − 1)
EL;i
184
CHAPTER VII. MARKOVIAN ENVIRONMENT
using Lemma 2.10 for the last two equalities. Inserting first Lemma 3.9 and next Lemma 2.8, this becomes ¡ ¢ 1 π L ∆−1 (γI − K) I − kG+ k e γ(ρL − 1) 1−ρ 1−ρ = π L ∆−1 (γI − K)k = π L ∆−1 k . γ(ρL − 1) (ρL − 1) Thus, to complete the proof it only remains to check that π L = ν∆. The normalization νh = 1 ensures ν∆e = 1. Finally, ν∆ΛL = ν∆∆−1 K[γ]∆ = 0 since by definition νK[γ] = κ(γ)ν = 0.
3b
2
Ramifications of Lundberg’s inequality
We consider first the time-dependent version of Lundberg’s inequality, cf. V.4. The idea is as there to substitute T = yu in ψi (u, T ) and to replace the Lundberg exponent γ by γy = αy − yκ(αy ), where αy is the unique solution of κ0 (αy ) =
1 . y
(3.5)
Graphically, the situation is just as in Fig. V.1. Thus, one always has γy > γ, whereas αy > γ, κ(αy ) > 0 when y < 1/κ0 (γ), and αy < γ, κ(αy ) < 0 when y > 1/κ0 (γ).
(0)
Theorem 3.10 Let C+ (y) =
1 (αy )
mini∈E hi
. Then
(0)
(αy ) −γy u
e
,
(0)
(αy ) −γy u
,
ψi (u, yu)
≤ C+ (y)hi
ψi (u) − ψi (u, yu)
≤ C+ (y)hi
e
1 , κ0 (γ) 1 . y> 0 κ (γ) y<
(3.6) (3.7)
3. CHANGE OF MEASURE VIA EXPONENTIAL FAMILIES
185
Proof. Consider first the case y < 1/κ0 (γ). Then, since κ(αy ) > 0, (3.1) yields ψi (u, yu) (αy )
=
hi
h Eαy ;i
1 (α )
=
hJτ y(u) h (α ) hi y e−αy u Eαy ;i
≤
hi
≤
hi
(αy ) (αy )
i © ª exp −αy Sτ (u) + τ (u)κ(αy ) ; τ (u) ≤ yu 1 (α ) hJτ y(u)
i exp {−αy ξ(u) + τ (u)κ(αy )} ; τ (u) ≤ yu
£ ¤ (0) C+ (y)e−αy u Eαy ;i eτ (u)κ(αy ) ; τ (u) ≤ yu (0)
C+ (y)e−αy u+yuκ(αy ) .
Similarly, if y > 1/κ0 (γ), we have κ(αy ) < 0 and get ψi (u) − ψi (u, yu) (αy ) −αy u
=
hi
≤
hi
≤
hi
(αy ) (αy )
e
h Eαy ;i
i
1 (α )
hJτ y(u)
exp {−αy ξ(u) + τ (u)κ(αy )} ; yu < τ (u) < ∞
£ ¤ (0) C+ (y)e−αy u Eαy ;i eτ (u)κ(αy ) ; yu < τ (u) < ∞ (0)
C+ (y)e−αy u+yuκ(αy ) .
2 Note that the proof appears to use less information than is inherent in the definition (3.5). However, as in the classical case (3.5) will produce the maximal γy for which the argument works. Our next objective is to improve upon the constant in front of e−γu in Lundberg’s inequality as well as to supplement with a lower bound: Theorem 3.11 Let C−
= min
B j (x) 1 · inf R , hj x≥0 x∞ eγ(y−x) Bj (dy)
C+
= max
1 B j (x) · sup R . hj x≥0 x∞ eγ(y−x) Bj (dy)
j∈E
j∈E
(3.8)
Then for all i ∈ E and all u ≥ 0, C− hi e−γu ≤ ψi (u) ≤ C+ hi e−γu .
(3.9)
For the proof, we shall need the matrices G+ and R of P Section 2.¡ We further¢ write G(u) for the vector with ith component Gi (u) = j∈E G+ i, j; (u, ∞)
186
CHAPTER VII. MARKOVIAN ENVIRONMENT
and, for a vector ϕ(u) = (ϕi (u))i∈E of functions, we let G+ ∗ ϕ(u) be the vector with ith component X
XZ
(G+ (i, j) ∗ ϕj )(u) =
j∈E
j∈E
u
ϕj (u − y)G+ (i, j; dy).
0
¯ (0) ¯ Lemma 3.12 Assume supi,u ¯ϕi (u)¯ < ∞, and define ϕ(n+1) (u) = G(u) + (n)
(G+ ∗ ϕ(n) )(u). Then ϕi (u) → ψi (u) as n → ∞. PN P∞ ∗n Proof. Write U N = 0 G∗n + , U = U∞ = 0 G+ . Then iterating the defining (n+1) (n) equation ϕ = G + G+ ∗ ϕ we get ∗(N +1)
ϕ(N +1) = U N ∗ G + G+
∗ ϕ(0) .
However, if τ+ (n) is the nth ladder epoch, we have h
G∗(N +1) ∗ ϕ(0)
i i
¯ (0) ¯ ¡ ¢ (u) ≤ sup¯ϕi (u)¯Pi τ+ (N + 1) < ∞ → 0. i,u
Hence lim ϕ(n) exists and equals U ∗ G. To see that the ith component of U ∗ G(u) equals ψi (u), just note that the (n) recursion ϕ(n+1) = G + G+ ∗ ϕ(n) holds for the particular case where ϕi (u) is the probability of ruin after at most n ladder steps and that then obviously (n) ϕi (u) → ψi (u), n → ∞. 2 Lemma 3.13 For all i and u, C−
X j∈E
Z
∞
hj
eγ(y−u) G+ (i, j; dy) ≤ Gi (u) ≤ C+
u
X j∈E
Z
∞
hj
eγ(y−u) G+ (i, j; dy).
u
Proof. According to (2.2), Z
0
G+ (i, j; dy) = βj
Bj (dy − x)R(i, j; dx). −∞
3. CHANGE OF MEASURE VIA EXPONENTIAL FAMILIES Thus C+
X
Z
∞
hj
j∈E
= C+
eγ(y−u) G+ (i, j; dy)
u
X
Z
X
−∞
Z
≥
j∈E
eγ(y−u) Bj (dy − x)
u
R∞
0
βj hj
R(i, j; dx)
u−x
eγ(y−u+x) Bj (dy) B j (u − x)
−∞
Z
∞
R(i, j; dx)
j∈E
X
Z
0
βj hj
j∈E
= C+
187
B j (u − x)
0
βj
R(i, j; dx)B j (u − x) = Gi (u), −∞
proving the upper inequality, and the proof of the lower one is similar.
2
(0)
Proof of Theorem 3.11. Let first ϕi (u) = C− hi e−γu in Lemma 3.13. We claim (n) by induction that then ϕi (u) ≥ C− hi e−γu for all n, from which the lower inequality follows by letting n → ∞. Indeed, this is obvious if n = 0, and assuming it shown for n, we get X Z u (n) (n+1) ϕi (u) = Gi (u) + ϕj (u − y)G+ (i, j; dy) (3.10) j∈E ∞
≥
C−
XZ j∈E
+C−
XZ
−γu
C− e
hj eγ(y−u) G+ (i, j; dy)
u
j∈E
=
0
u
hj eγ(y−u) G+ (i, j; dy)
0
X
b + [i, j; γ]hj = C− e−γu hi , G
(3.11)
j∈E
estimating the first term in (3.10) by Lemma 3.13 and the second by the induction hypothesis, and using Lemma 3.9 for the last equality in (3.11). (0) The proof of the upper inequality is similar, taking ϕi (u) = 0. 2 Here is an estimate of the rate of convergence of the finite horizon ruin probabilities ψi (u, T ) = Pi (τ (u) ≤ T ) to ψi (u) which is different from Theorem 3.10: Theorem 3.14 Let γ0 > 0 be the solution of κ0 (γ0 ) = 0, let C+ (γ0 ) be as in (γ ) (3.8) with γ replaced by γ0 and hi by hi 0 , and let δ = eκ(γ0 ) . Then (γ0 ) −γ0 u T
0 ≤ ψi (u) − ψi (u, T ) ≤ C+ (γ0 )hi
e
δ .
(3.12)
188
CHAPTER VII. MARKOVIAN ENVIRONMENT
Proof. We first note that just as in the proof of Theorem 3.11, it follows that (γ0 ) −γ0 u
ψi (u) ≤ C− (γ0 )hi
e
.
(3.13)
Hence, letting MT = max0≤t≤T St , we have ψi (u) − ψi (u, T ) = = ≤
Pi (M > u) − Pi (MT > u) = Pi (MT ≤ u, M > u) ¡ ¢ Pi ST ≤ u, MT ≤ u, M > u £ ¤ Ei ψJT (u − ST ); MT ≤ u, ST ≤ u ¤ £ (γ ) C+ (γ0 )e−γ0 u Ei hJT0 eγ0 ST
=
C+ hi
=
(γ0 ) −γ0 u T
e
δ . 2
Notes and references The results and proofs are from Asmussen & Rolski [98]. Further related discussion is given in Grigelionis [435, 436]. Jasiulewicz [503] uses an integral equation approach to study the ruin probability in a Markov-modulated model with surplus-dependent premium rates, for approaches involving systems of IDEs see Siegl & Tichy [805] and Lu & Li [610]. For moments of discounted aggregate claims, see Kim & Kim [532]. Yin, Liu & Yang [906] deal with effects of state-space reduction of Jt on Lundberg-type bounds for the ruin probability. Zhu & Yang [921] investigate general regularity issues for ruin-related functions in a Markovian environment. For the stability of ruin probabilities w.r.t. parameter changes, see Enikeeva, Kalashnikov & Rusaityte [355]. Discrete-time models with Markovian environment are e.g. studied in Reinhard & Snoussi [731] and Wagner [866].
4
Comparisons with the compound Poisson model
4a
Ordering of the ruin functions
For two risk functions ψ 0 , ψ 00 , we define the stochastic ordering by ψ 0 ≺st ψ 00 if ψ 0 (u) ≤ ψ 00 (u),
u ≥ 0.
(4.1)
Obviously, this corresponds to the usual stochastic ordering of the maxima M 0 , M 00 of the corresponding two claim surplus processes (note that ψ 0 (u) = P(M 0 > u), ψ 00 (u) = P(M 00 > u)). environment and define ψπ (u) = P Now consider the risk process in a Markovian ∗ ∗ ψ ≺ π ψ (u). It was long conjectured that st ψπ , where ψ (u) is the ruin i∈E i i
4. COMPARISONS WITH THE COMPOUND POISSON MODEL
189
probability for the averaged compound Poisson model defined in Section 1 and ψπ is the one for the Markov-modulated one in the stationary case (the distribution of J0 is π). The motivation that such a result should be true came in part from numerical studies, in part from the folklore principle that any added stochastic variation increases the risk, and finally in part from queueing theory, where it has been observed repeatedly that Markov-modulation increases waiting times and in fact some partial results had been obtained. The results to be presented show that quite often this is so, but that in general the picture is more diverse. The conditions which play a role in the following are: β1 ≤ β2 . . . ≤ βp .
(4.2)
B1 ≺st B2 ≺st . . . ≺st Bp .
(4.3)
The Markov process {Jt } is stochastically monotone.
(4.4)
To avoid trivialities, we also assume that there exist i 6= j such that either βi < βj or Bi 6= Bj . Occasionally we strengthen (4.3) to B = Bi does not depend on i.
(4.5)
Note that whereas (4.2) alone just amounts to an ordering of the states, this is not the case for (4.3). For the notion of monotone Markov processes, we refer to M¨ uller & Stoyan [653]; note that (4.4) is automatic in some simple examples like birth-death processes or p = 2. Conditions (4.2)–(4.4) say basically that if i < j, then j is the more risky state, and it is in fact easy to show that ψi (u) ≤ ψj (u) (this is used in the derivation of (4.9) below). Theorem 4.1 Assume that conditions (4.2)–(4.4) hold. Then ψ ∗ ≺st ψπ . For the proof, we need two lemmas. The first is a standard result going back to Chebycheff and appearing in a more general form in Esary, Proschan & Walkup [357], the second follows from an extension of Theorem III.5.5 (cf. also Proposition 2.1) which with basically the same proof can be found in Asmussen & Schmidt [103]. Lemma 4.2 If a1 ≤ . . . ≤ ap , b1 ≤ . . . ≤ bp and πi > 0 (i = 1, . . . , p), P p 1 πi = 1, then p p p X X X πi ai bi ≥ πi ai πj bj . i=1
i=1
j=1
The equality holds if and only if a1 = . . . = ap or b1 = . . . = bp .
190
CHAPTER VII. MARKOVIAN ENVIRONMENT
¡ ¢ (+) (+) Lemma 4.3 (a) P¯π Jτ (0) = i, τ (0) < ∞ = ρπi , where πi = βi µBi πi /ρ; ¡ ¢ (b) Pπ Sτ (0) ∈ dx ¯ Jτ (0) = i, τ (0) < ∞ = B i (x) dx/µBi . Proof of Theorem 4.1. Conditioning upon the first ladder epoch, we obtain (cf. Proposition 2.1 for the first term in (4.7) and Lemma 4.3 for the second) Z u ψ ∗ (u) = β ∗ B ∗ (u) + β ∗ ψ ∗ (u − x)B ∗ (x) dx, (4.6) 0
ψπ (u)
= β ∗ B ∗ (u) + ρ Z =
p X
u
β ∗ B ∗ (u) + Z β ∗ B ∗ (u) +
i=1 p uX
0
=
p X
β ∗ B ∗ (u) + β ∗
u
ψi (u − x)B i (x)/µBi dx
0
i=1
0
≥
Z (+)
πi
(4.7)
πi βi B i (x)ψi (u − x) dx πi βi B i (x) ·
i=1 Z u
p X
(4.8)
πi ψi (u − x) dx
(4.9)
i=1
B(x)ψπ (u − x) dx .
(4.10)
0
Here (4.9) follows by considering the increasing functions βi B i (x) and ψi (u − x) of i and using Lemma 4.2. Comparing (4.10) and (4.6), it follows by a standard argument from renewal theory that ψπ dominates the solution ψ ∗ to the renewal equation (4.6). 2 Here is a counterexample showing that the inequality ψ ∗ (u) ≤ ψπ (u) is not in general true: Proposition 4.4 Assume that βi µi < 1 for all i, that p X
πi βi2 µBi
i=1
<
p X
πi βi ·
i=1
p X
πi βi µBi ,
(4.11)
i=1‘
and that Λ has the form ²Λ0 for some fixed intensity matrix Λ0 . Then ψ ∗ (u) ≤ ψπ (u) fails for all sufficiently small ² > 0. 0
0 Proof. Since ψπ (0) = ψ ∗ (0), it is sufficient to show that ψπ (0) < ψ ∗ (0) for ² small enough. Using (4.6), (4.8) we get
0
ψ ∗ (0) =
−β ∗ + β ∗ ψ ∗ (0) =
p X i=1
0 ψπ (0) =
p X i=1
πi βi ψi (0) − β ∗ .
πi βi ·
p X i=1
πi βi µBi − β ∗ ,
4. COMPARISONS WITH THE COMPOUND POISSON MODEL
191
But it is intuitively clear (see Theorem 3.2.1 of [370] for a formal proof) that ψi (u) converges to the ruin probability for the compound Poisson model with parameters βi , Bi as ² ↓ 0. For u = 0, this ruin probability is βi µBi , and from this the claim follows. 2 To see that Proposition 4.4 is not vacuous, let ¡ ¢ 1/2 1/2 , β1 = 10−3 , β2 = 1, µB1 = 102 , µB2 = 10−4 . π = Then the l.h.s. of (4.11) is of order 10−4 and the r.h.s. of order 10−1 . Notes and references The results are from Asmussen, Frey, Rolski & Schmidt [78]. As is seen, they are at present not quite complete. What is missing in relation to Theorem 4.1 and Proposition 4.4 is the understanding of whether the stochastic monotonicity condition (4.4) is essential (the present authors conjecture it is).
4b
Ordering of adjustment coefficients
Despite the fact that ψ ∗ (u) ≤ ψπ (u) may fail for some u, it will hold for all sufficiently large u, except possibly for a very special situation. Recall that the adjustment coefficient for the Markov-modulated model is defined as the solution γ > 0 of κ(γ) = 0 where κ(α) is the eigenvalue with maximal real part ¡ ¢ bi [α] − 1 −α. The adjustment of the matrix Λ + (κi (α))diag where κi (α) = βi B coefficient γ ∗ for the averaged compound Poisson model is the solution > 0 of κ∗ (γ ∗ ) = 0 where X ¡ ∗ ¢ b [α] − 1 − α = κ∗ (α) = β ∗ B (4.12) πi κi (α). i∈E
Theorem 4.5 γ ≤ γ ∗ , with equality only when κi (γ ∗ ) does not depend on i ∈ E. P Lemma 4.6 Let (δi )i∈E be a given set of constants satisfying i∈E πi δi = 0 and define λ(α) as the eigenvalue with maximal real part of the matrix Λ + α(δi )diag . Then λ(α) ≥ 0, with strict inequality unless α = 0 or δi = 0 for all i ∈ E. Proof. Define
Z
t
Xt = 0
δJs ds.
© ª Then (Jt , Xt ) is a Markov additive process (a so-called Markovian fluid model, cf. e.g. Asmussen [62]) as discussed in III.5, and by Proposition III.4.2 we have ¡ ¢ Ei [eαXt ; Jt = j] i,j∈E = eΛ+α(δi )diag .
192
CHAPTER VII. MARKOVIAN ENVIRONMENT
Further (see Corollary III.4.7) λ is convex with λ0 (0) =
X EXt = πi δi = 0, t→∞ t lim
(4.13)
i∈E
λ00 (0) =
lim
t→∞
Var Xt . t
(4.14)
By convexity, (4.13) implies λ(α) ≥ 0 for all α. Now we can view {Xt } as a cumulative process (see 1d) with generic cycle ¯ © ª ω = inf t > 0 : Jt− 6= k, Jt = k ¯ J0 = k (the return time of k) where k ∈ E is some arbitrary but fixed state. It is clear that the distribution of XωPis non-degenerate except when δi does not depend on i ∈ E, which in view of i∈E πi δi = 0 is only possible if δi = 0 for all i ∈ E. Hence if δi 6= 0 for some i ∈ E, it follows by Proposition A1.4(b) that the limit in (4.14) is non-zero so that λ00 (0) > 0. This implies that λ is strictly convex, in particular λ(α) > 0 for all α 6= 0. 2 P ∗ Proof of Theorem 4.5. Let δi = κi (γ ), α = 1 in Lemma 4.6. Then πi δi = 0 because of (4.12) and κ∗ (γ ∗ ) = 0. Further λ(1) = κ(γ ∗ ) by definition of λ(·) and κ(·). Hence κ(γ ∗ ) ≥ 0. Since κ is convex with κ0 (0) < 0, this implies that the solution γ > 0 of κ(γ) = 0 must satisfy γ ≤ γ ∗ . If κi (γ ∗ ) is not a constant function of i ∈ E, we get κ(γ ∗ ) > 0 which in a similar manner implies that γ < γ∗. 2 Notes and references Theorem 4.5 is from Asmussen & O’Cinneide [93], improving upon more incomplete results from Asmussen, Frey, Rolski & Schmidt [78].
4c
Sensitivity estimates for the adjustment coefficient
Now assume that the intensity matrix for the environment is Λ² = Λ0 /², whereas the βi and Bi are fixed. The corresponding adjustment coefficient is denoted by γ(²). Thus γ(²) → γ ∗ as ² ↓ 0, and our aim is to compute the sensitivity ¯ ∂γ ¯¯ . ∂² ¯²=0 A dual result deals with the limit ² → ∞. Here we put a = 1/², note that γ(a) → mini=1,...,p γi and compute ¯ ∂γ ¯¯ . ∂a ¯a=0
4. COMPARISONS WITH THE COMPOUND POISSON MODEL
193
¡ ¢ In both cases, the basic equation is Λ + (κi (γ))diag h = 0, where Λ, γ, h depend on the parameter (² or a). In the case of ², multiply the basic equation by ² to obtain ¡ ¢ 0 = Λ0 + ²(κi (γ))diag h, ¡ ¢ ¡ ¢ 0 = (κi (γ))diag + ²γ 0 (κ0i (γ))diag h + Λ0 + ²(κi (γ))diag h0 .
(4.15)
Normalizing h by πh = 0, we have πh0 = 0, h(0) = e. Hence letting ² = 0 in (4.15) yields ¡ ¢ ¡ ¢ 0 = κi (γ ∗ ) diag e + Λ0 h0 (0) = κi (γ ∗ ) diag e + (Λ0 − eπ)h0 (0), ¡ ¢ h0 (0) = −(Λ0 − eπ)−1 κi (γ ∗ ) diag e. (4.16) Differentiating (4.15) once more and letting ² = 0 we get ¡ ¢ ¡ ¢ 0 = 2γ 0 (0) κ0i (γ ∗ ) diag e + 2 κi (γ ∗ )r diag h0 (0) + Λ0 h00 (0), ¡ ¢ 0 = 2γ 0 (0)ρ + 2π κi (γ ∗ ) diag h0 (0),
(4.17) (4.18)
multiplying (4.17) by π to the left to get (4.18). Inserting (4.16) yields ¯ ¡ ¢ ∂γ ¯¯ 1 ¡ 0 ∗ ¢ Proposition 4.7 π κi (γ ) diag (Λ0 − eπ)−1 κi (γ ∗ ) diag e . = ¯ ∂² ²=0 ρ Now turn to the case of a. We assume that 0 < γ1 < γi ,
i = 2, . . . , p.
(4.19)
Then γ → γ1 as a ↓ 0 and we may take h(0) = e1 (the first unit vector). We get ¡ ¢ 0 = aΛ0 + (κi (γ))diag h, ¢ ¡ ¡ ¢ 0 = Λ0 + γ 0 (κ0i (γ) diag )h + aΛ0 + (κi (γ))diag h0 . (4.20) Letting a = 0 in (4.20) and multiplying by e1 to the left we get 0 = λ11 + γ 0 (0)κ01 (0) + 0 (here we used κ1 (γ(0)) = 0 to infer that the first component of K[γ(0)]h0 (0) is 0), and we have proved: ¯ ∂γ ¯¯ λ11 . Proposition 4.8 If (4.19) holds, then = − 0 ∂a ¯a=0 κ1 (0) Notes and references The results are from Asmussen, Frey, Rolski & Schmidt [78]. The analogue of Proposition 4.8 when γi < 0 for some i is open.
194
5
CHAPTER VII. MARKOVIAN ENVIRONMENT
The Markovian arrival process
We shall here briefly survey an extension of the model, which has recently received much attention in the queueing literature, and has some relevance in risk theory as well. The additional feature of the model is the following: • Certain transitions of {Jt } from state i to state j are accompanied by a claim with distribution Bij ; the intensity for such a transition (referred to (2) as marked in the following) is denoted by λij and the remaining intensity (1)
(1)
(2)
for a transition i → j by λij (thus λij = λij + λij ). For i = j, we use (2)
the convention that λii = βi where βi is the Poisson rate in state i, that (1) Bii = Bi , and that the λii are determined by Λ = Λ(1) + Λ(2) where Λ is the intensity matrix governing {Jt }. Thus, the Markov-modulated compound Poisson model considered so far corresponds to Λ(2) = (βi )diag , Λ(1) = Λ − (βi )diag , Bii = Bi ; the definition of Bij is redundant for i 6= j. Note that the case that 0 < qij < 1, where qij is the probability that a transition i → j is accompanied by a claim, is covered by letting Bij have an atom of size qij at 0. Again, the claim surplus is a Markov additive process (cf. III.3). The extension of the model can also be motivated via Markov additive processes: if {Nt } is the counting process of a point process, then {Nt } is a Markov additive process if and only if it corresponds to an arrival mechanism of the type just considered. Here are some main examples: Example 5.1 (Phase-type renewal arrivals) Consider a risk process where the claim sizes are i.i.d. with common distribution B, but the point process of arrivals is not Poisson but renewal with interclaim times having common distribution A of phase-type with representation (ν, T ). In the above setting, we may let {Jt } represent the phase processes of the individual interarrival times glued together (see further IX.2 for details), and the marked transitions are then the ones corresponding to arrivals. This is the only way in which arrivals can occur, and thus βi = 0, Λ(1) = T , Λ(2) = tν, Bij = B; the definition of Bi is redundant because of βi = 0.
2
5. THE MARKOVIAN ARRIVAL PROCESS
195
Example 5.2 (superpositions) A nice feature of the set-up is that it is closed © (1) ª © (2) ª under superposition of independent arrival streams. Indeed, let Jt , Jt (k) be two independent environmental processes and let E (k) , Λ(1;k) , Λ(2;k) , Bij © (k) ª etc. refer to Jt . We then let (see the Appendix for the Kronecker notation) ¡ (1) (2) ¢ E = E (1) × E (2) , Jt = Jt , Jt , Λ(1) = Λ(1;1) ⊕ Λ(1;2) , Λ(2) = Λ(2;1) ⊕ Λ(2;2) , (1)
(2)
Bij,kj = Bik , Bij,ik = Bjk
(the definition of the remaining Bij,k` is redundant). In this way we can model, e.g., superpositions of renewal processes. 2 Example 5.3 (an individual model) In contrast to the collective assumptions (which underly most of the topics treated so far in this book and lead to Poisson arrivals), assume that there is a finite number N of policies. Assume further that the ith policy leads to a claim having distribution Ci after a time which is exponential, with rate αi , say, and that the policy then expires. This means that the environmental states are of the form i1 i2 · · · iN with i1 , i2 , . . . ∈ {0, 1}, where ik = 0 means that the kth policy has not yet expired and ik = 1 that it has expired. Thus, claims occur only at state transitions for the environment so that λ0i2 ···iN ,1i2 ···iN = α1 , B0i2 ···iN ,1i2 ···iN = C1 , λi1 0···iN ,i1 1···iN = α2 , Bi1 0···iN ,i1 1···iN = C2 , .. . All other off-diagonal elements of Λ are zero so that all other Bii are redundant. Similarly, all βi1 i2 ···iN are zero and all Bi are redundant. Easy modifications apply to allow for • the time until expiration of the kth policy is general phase-type rather than exponential; • upon a claim, the kth policy enters a recovering state, possibly having a general phase-type sojourn time, after which it starts afresh. 2 Example 5.4 (a single life insurance policy) Consider the life insurance of a single policy holder which can be in one of several states, E = {working, retired, married, divorced, widowed, invalidized, dead etc.}. The individual pays at rate pi when in state i and receives an amount having distri2 bution Bij when his/her state changes from i to j.
196
CHAPTER VII. MARKOVIAN ENVIRONMENT
Notes and references The point process of arrivals was studied in detail by Neuts [658] and is often referred to in the queueing literature as Neuts’ versatile point process, or, more recently, as the Markovian arrival process (MAP). However, the idea of arrivals at transition epochs can be found in Hermann [460] and Rudemo [755]. The versatility of the set-up is even greater than for the Markov-modulated model. In fact, Hermann [460] and Asmussen & Koole [88] showed that in some appropriate sense any arrival stream to a risk process can be approximated by a model of the type studied in this section: any marked point process is the weak limit of a sequence of such models. For the Markov-modulated model, one limitation for approximation purposes is the inequality Var Nt ≥ ENt which needs not hold for all arrival streams. Some main queueing references using the MAP are Ramaswami [722], Sengupta [794], Lucantoni [612], Lucantoni et al. [612], Neuts [662] and Asmussen & Perry [95]. For recent applications in risk theory, see e.g. Badescu, Drekic & Landriault [118] and Cheung & Landriault [239].
6
Risk theory in a periodic environment
6a
The model
We assume as in the previous part of the chapter that the arrival mechanism has a certain time-inhomogeneity, but now exhibiting (deterministic) periodic fluctuations rather than (random) Markovian ones. Without loss of generality, let the period be 1; for s ∈ E = [0, 1), we talk of s as the ‘time of the year’. The basic assumptions are as follows: • The arrival intensity at time t of the year is β(t) for a certain function β(t), 0 ≤ t < 1; • Claims arriving at time t of the year have distribution B (t) ; • The premium rate at time t of the year is p(t). By periodic extension, we may assume that the functions β(t), p(t) and B (t) are defined also for t 6∈ [0, 1). Obviously, one needs to assume also (as a minimum) that they are measurable in t; from an application point of view, continuity would hold in presumably all reasonable examples. We denote throughout the initial season by s and by P(s) the corresponding governing probability measure for the risk process. Thus at time t the premium rate is p(s + t), a claim arrives with rate β(s + t) and is distributed according to B (s+t) . Let Z 1 Z 1 Z 1 β(t) p(t) dt. (6.1) β∗ = β(t) dt, B ∗ = B (t) ∗ dt, p∗ = β 0 0 0
6. RISK THEORY IN A PERIODIC ENVIRONMENT
197
Then the average arrival rate is β ∗ and the safety loading η is η = (p∗ − ρ)/ρ, where Z 1 Z ∞ β(v) dv xB (v) (dx) = β ∗ µ∗B . ρ = (6.2) 0
0
Note that ρ is the average net claim amount per unit time and µ∗ = ρ/β ∗ the average mean claim size. In a similar manner as in Proposition 1.8, one may think of the standard compound Poisson model with parameters β ∗ , B ∗ , p∗ as an averaged version of the periodic model, or, equivalently, of the periodic model as arising from the compound Poisson model by adding some extra variability. Many of the results given below indicate that the averaged and the periodic model share a number of main features. In particular, it turns out that they have the same adjustment coefficient. In contrast, for Markov-modulated model typically the adjustment coefficient is larger than for the averaged model (cf. Section 4b), in agreement with the general principle of added variation increasing the risk (cf. the discussion in IV.9). The behavior of the periodic model does not need to be seen as a violation of this principle, since the added variation is deterministic, not random. Example 6.1 As an example to be used for numerical illustration throughout this section, let β(t) = 3λ(1 + sin 2πt), p(t) = λ and let B (t) be a mixture of two exponential distributions with intensities 3 and 7 and weights w(t) = (1 + cos 2πt)/2 and 1 − w(t), respectively. It is easily seen that β ∗ = 3λ, p∗ = λ whereas B ∗ is a mixture of exponential distributions with intensities 3 and 7 and weights 1/2 for each (1/2 = R1 R1 w(t) dt = 0 (1 − w(t)) dt). Thus, the average compound Poisson model is 0 the same as in IV.(3.1) and Example 1.10, and we recall from there that the ruin probability is 24 −u 1 ψ ∗ (u) = e + e−6u . (6.3) 35 35 Note that λ enters just as a scaling factor of the time axis, and thus the averaged standard compound Poisson models have the same risk for all λ. In contrast, we shall see that for the periodic model increasing λ increases the effect of the periodic fluctuations. 2 Remark 6.2 Define
Z θ(T ) =
T
p(t) dt, 0
Set = Sθ−1 (t) .
© ª Then (by standard operational time arguments) Set is a periodic risk process with unit premium rate and the same infinite horizon ruin probabilities. We 2 assume in the rest of this section that p(t) ≡ 1.
198
CHAPTER VII. MARKOVIAN ENVIRONMENT
The arrival process {Nt }t≥0 is a time-inhomogeneous Poisson process with © ª intensity function β(s + t) t≥0 . The claim surplus process {St }t≥0 is defined PNt in the obvious way as St = 1 Ui − t. Thus, the conditional distribution of Ui given that the ith claim occurs at time t is B (s+t) . As usual, τ (u) = inf {t > 0 : St > u} is the time to ruin, and the ruin probabilities are ¡ ¢ ¡ ¢ ψ (s) (u) = P(s) τ (u) < ∞ , ψ (s) (u, T ) = P(s) τ (u) ≤ T . The claim surplus process {St } may be seen as a Markov additive process, with the underlying Markov process {Jt } being deterministic period motion on E = [0, 1), i.e. Jt = (s + t) mod 1 P(s) -a.s. (6.4) At a first sight this point of view may appear quite artificial, but it turns out to have obvious benefits in terms of guidelining the analysis of the model as a parallel of the analysis for the Markovian environment risk process. Notes and references The model has been studied in risk theory by, e.g., Daykin et.al. [279], Dassios & Embrechts [273] and Asmussen & Rolski [97], [98] (the literature in the mathematical equivalent setting of queueing theory is somewhat more extensive, see the Notes to Section 7). The exposition of the present chapter is basically an extract from [98], with some variants in the proofs. Recently, K¨ otter & B¨ auerle [558] addressed the stochastic optimization problem to minimize the ruin probability through investment in the framework of a periodic environment, see also Chapter XIV.
6b
Lundberg conjugation
Motivated by the discussion in Chapter III.4 (see in particular Remark III.4.8), we start by deriving formulas giving the m.g.f. of the claim surplus process. To this end, let ¡ ∗ ¢ b [α] − 1 − α = κ∗ (α) = β ∗ B
Z
s+1
¡ (v) ¢ b [α] − 1 dv − α β(v) B
s
be the c.g.f. of the averaged compound Poisson model (the last expression is independent of s by periodicity), and define ½ Z sh i ¾ ¡ (v) ¢ b [α] − 1 − α − κ∗ (α) dv ; h(s; α) = exp − β(v) B 0
then h(·; α) is periodic on R.
6. RISK THEORY IN A PERIODIC ENVIRONMENT Theorem 6.3 E(s) eαSt =
199
h(s; α) tκ∗ (α) e . h(s + t; α)
Proof. Conditioning upon whether a claim occurs in [t, t + dt] or not, we obtain £ ¤ E(s) eαSt+dt |Ft ¡ ¢ b (s+t) [α] = 1 − β(s + t)dt eαSt −αdt + β(s + t)dt · eαSt B ¡ £ (s+t) ¤¢ b = eαSt · 1 − αdt + β(s + t)dt B [α] − 1 , E(s) eαSt+dt d (s) αSt E e dt
= =
¡ £ (s+t) ¤¢ b E(s) eαSt 1 − αdt + β(s + t)dt B [α] − 1 , ¡ £ (s+t) ¤¢ b E(s) eαSt −α + β(s + t) B [α] − 1 ,
d log E(s) eαSt dt
=
log E(s) eαSt
=
£ (s+t) ¤ b −α + β(s + t) B [α] − 1 , Z t ¡ (s+v) ¢ b −αt + β(s + v) B [α] − 1 dv
=
log e h(s + t; α) − log e h(s; α),
0
where
½Z e h(t; α) = exp
t
¡ (v) ¢ b [α] − 1 dv − αt β(v) B
¾
0
Thus E(s) eαSt =
∗
=
etκ (α) . h(t; α)
e h(s; α) tκ∗ (α) h(s + t; α) = e . e h(s + t; α) h(s; α)
(6.5) 2
Corollary 6.4 For each θ such that the integrals in the definition of h(t; θ) exist and are finite, ½ ¾ h(s + t; θ) θSt −tκ∗ (θ) {Lθ,t }t≥0 = e h(s; θ) t≥0 is a P(s) -martingale with mean one. Proof. In the Markov additive sense of (6.4), we can write Lθ,t =
h(Jt ; θ) θSt −tκ∗ (θ) e h(J0 ; θ)
P(s) -a.s. so that obviously {Lθ,t } is a multiplicative functional for the Markov process {(Jt , St )}. According to Remark III.1.8, it then suffices to note that E(s) Lθ,t = 1 by Theorem 6.3. 2
200
CHAPTER VII. MARKOVIAN ENVIRONMENT
Remark 6.5 The formula for h(s) = h(s; α) as well as the fact that κ = κ∗ (α) is the correct exponential growth rate of EeαSt can be derived via Remark III.4.9 as follows. With G the generator of {Xt } = {(Jt , St )} and hα (s, y) = eαy h(s), the requirement is Ghα (i, 0) = κh(s). However, as above E(s) hα (Jdt , Sdt ) = = Ghα (s, 0) =
¢ ¡ b (s) [α]h(s) h(s + dt)e−αdt 1 − β(s)dt + β(s)dt · B © ª b (s) [α]h(s) , h(s) + dt −αh(s) − β(s)h(s) + h0 (s) + β(s)B b (s) [α]h(s). −αh(s) − β(s)h(s) + h0 (s) + β(s)B
Equating this to κh(s) and dividing by h(s) yields h0 (s) h(s) h(s)
b (s) [α] + κ, α + β(s) − β(s)B ½ Z sh i ¾ ¡ (v) ¢ b = exp − β(v) B [α] − 1 − α − κ dv
=
0
(normalizing by h(0) = 1). That κ = κ∗ (α) then follows by noting that h(1) = h(0) by periodicity. 2 For each θ satisfying the conditions of Corollary 6.4, it follows by Theorem III.1.7 that we can define a new Markov process {(Jt , St )} with governing prob(s) ability measures Pθ , say, such that for any s and T < ∞, the restrictions of (s) P(s) and Pθ to Ft are equivalent with likelihood ratio Lθ,T . (s)
Proposition 6.6 The Pθ , 0 ≤ s < 1, correspond to a new periodic risk model with parameters b (t) [θ], βθ (t) = β(t)B
(t)
Bθ (dx) =
eθx B (t) (dx). b (t) [θ] B
Proof. (i) Check that m.g.f. of St is as for the asserted periodic risk model, cf. Proposition 6.3; (ii) use Markov-modulated approximations (Section 6c); (iii) use approximations with piecewiese constant β(s), B (s) ; (iv) finally, see [98] for a formal proof. 2 Now define γ as the positive solution of the Lundberg equation for the averaged model. That is, γ solves κ∗ (γ) = 0. When α = γ, we put for short h(s) = h(s; γ). A further important constant is the value γ0 (located in (0, γ)) at which κ∗ (α) attains its minimum. That is, γ0 is determined by 0
0
b ∗ [γ0 ] − 1. 0 = κ∗ (γ0 ) = β B
(6.6)
6. RISK THEORY IN A PERIODIC ENVIRONMENT
201
¢ (s) ¡ Lemma 6.7 When α ≥ γ0 , Pα τ (u) < ∞ = 1 for all u ≥ 0. Proof. According to (6.2), the mean number of claims per unit time is Z 1 Z ∞ ρα = β(v) dv xeαx B (v) (dx) 0 0 Z ∞ 0 ∗ αx ∗ b ∗ [α] = κ∗0 (α) + 1, = β xe B (dx) = β ∗ B 0
which is ≥ 1 by convexity.
2
The relevant likelihood ratio representation of the ruin probabilities now follows immediately from Corollary III.1.5. Here and in the following, ξ(u) = Sτ (u) − u is the overshoot and θ(u) = (τ (u) + s) mod 1 the season at the time of ruin. Corollary 6.8 The ruin probabilities can be computed as · −αξ(u)+τ (u)κ∗ (α) ¸ e ψ (s) (u, T ) = h(s; α)e−αu E(s) ; τ (u) ≤ T , α h(θ(u); α) ψ
(s)
(u)
ψ (s) (u)
= h(s; α)e
−αu
−αξ(u)+τ (u)κ∗ (α) (s) e Eα ,
h(θ(u); α)
= h(s)e−γu E(s) γ
e−γξ(u) . h(θ(u))
α ≥ γ0
(6.7) (6.8) (6.9)
To obtain the Cram´er-Lundberg approximation from Corollary 3.1, we need the following auxiliary result. The proof involves machinery from the ergodic theory of Markov chains on a general state space, which is not used elsewhere in the book, and we refer to [98]. Lemma 6.9 Assume that there exist open intervals I ⊆ [0, 1), J ⊆ R+ such that the B (s) , s ∈ I, have components with densities b(s) (x) satisfying inf
s∈I, x∈J
β(s)b(s) (x) > 0.
(6.10)
©¡ ¢ª Then for each α, the Markov process ξ(u), θ(u) u≥0 , considered with gov© (s) ª erning probability measures Pα s∈[0,1) , has a unique stationary distribution, ¡ ¢ say the distribution of ξ(∞), θ(∞) , and no matter what is the initial season ¡ ¢D¡ ¢ s, ξ(u), θ(u) → ξ(∞), θ(∞) . Letting u→∞ ¡ ¢ in (6.9) and noting that weak convergence entails convergence of Ef ξ(u), θ(u) for any bounded continuous function (e.g. f (x, q) = e−γx /h(q)), we get:
202
CHAPTER VII. MARKOVIAN ENVIRONMENT
Theorem 6.10 Under the condition (6.10) of Lemma 3.1, ψ (s) (u) ∼ Ch(s)e−γu ,
u → ∞,
(6.11)
e−γξ(∞) ¢. where C = Eγ ¡ h θ(∞) Note that (6.11) gives an interpretation of h(s) as a measure of how the risks of different initial seasons s vary. For our basic Example 6.1, elementary calculus yields ¶¾ ½ µ 1 1 9 1 cos 2πs − sin 2πs + cos 4πs − . h(s) = exp λ 2π 4π 16π 16π Plots of h for different values of λ are given in Fig. VII.4, illustrating that the effect of seasonality increases with λ.
1
0.8
0.6
0.4
0.2
0
0
0.2
0.4
0.6
0.8
1
Figure VII.4 In contrast to h, it does not seem within the range of our methods to compute C explicitly, which may provide one among many motivations for the Markovmodulated approximation procedure to be considered in Section 6c. Among other things, this provides an algorithm for computing C as a limit. At this stage, Theorem 6.10 shows that certainly γ is the correct Lundberg exponent. Noting that ξ(u) ≥ 0 in (6.9), we obtain immediately the following version of Lundberg’s inequality which is a direct parallel of the result given in Corollary 3.6 for the Markov-modulated model: (0)
Theorem 6.11 ψ (s) (u) ≤ C+ h(s)e−γu , where (0)
C+
=
1 inf 0≤t≤1 h(t)
.
6. RISK THEORY IN A PERIODIC ENVIRONMENT
203 (0)
Thus, e.g., in our basic example with λ = 1, we obtain C+ = 1.42 so that ½ ¾ 1 1 1 9 (s) ψ (u) ≤ 1.42 · exp cos 2πs − sin 2πs + cos 4πs − e−u . 2π 4π 16π 16π (6.12) As for the Markovian environment model, Lundberg’s inequality can be considerably sharpened and extended. We state the results below; the proofs are basically the same as in Section 3 and we refer to [98] for details. Consider first the time-dependent version of Lundberg’s inequality. Just as in V.4, we substitute T = yu in ψ(u, T ) and replace the Lundberg exponent γ by γy = αy − yκ(αy ), where αy is the unique solution of κ0 (αy ) =
1 . y
(6.13)
Elementary convexity arguments show that we always have γy > γ and αy > γ, κ(αy ) > 0 when y < 1/κ0 (γ), whereas αy < γ, κ(αy ) < 0 when y > 1/κ0 (γ). (0)
Theorem 6.12 Let C+ (y) =
1 . Then inf 0≤t≤1 h(t; αy ) (0)
ψ (s) (u, yu)
≤ C+ (y)h(s)e−γy u ,
ψ (s) (u) − ψ (s) (u, yu)
≤ C+ (y)h(s)e−γy u ,
(0)
y< y>
1
,
(6.14)
1 . κ0 (γ)
(6.15)
κ0 (γ)
(0)
The next result improves upon the constant C+ in front of e−γu in Theorem 6.11 as well as it supplements with a lower bound. Theorem 6.13 Let (t)
C−
1 B (x) , = inf · inf R ∞ γ(y−x) (t) 0≤t≤1 h(t) x≥0 e B (dy) x
C+
=
(t)
1 B (x) · sup R ∞ γ(y−x) (t) . B (dy) 0≤t≤1 h(t) x≥0 x e sup
(6.16)
Then for all s ∈ [0, 1) and all u ≥ 0, C− h(s)e−γu ≤ ψ (s) (u) ≤ C+ h(s)e−γu .
(6.17)
In order to apply Theorem 6.13 to our basic example, we first note that the function R∞ {w · 3e−3x + (1 − w) · 7e−7x } dx 6w + 6(1 − w)e−4u © ª R∞u = 9w + 7(1 − w)e−4u ex−u w · 3e−3x + (1 − w) · 7e−7x dx u
204
CHAPTER VII. MARKOVIAN ENVIRONMENT
attains its minimum 2/3 for u = ∞ and its maximum 6/(7 + 2w) for u = 0. Thus ½ µ ¶¾ 2 1 1 1 9 C− = inf exp −λ cos 2πs − sin 2πs + cos 4πs − 3 0≤s≤1 2π 4π 16π 16π 2 −0.013λ = e , 3 © ¡1 ¢ª 1 1 9 6 exp −λ 2π cos 2πs − 4π sin 2πs + 16π cos 4πs − 16π C+ = sup . 8 + cos 2πs 0≤s≤1 Thus e.g. for λ = 1 (where 23 e−0.013λ = 0.66, C+ = 1.20), ½ 1 1 1 ψ (s) (u) ≥ 0.66 · exp cos 2πs − sin 2πs + cos 4πs − 2π 4π 16π ½ 1 1 1 ψ (s) (u) ≤ 1.20 · exp cos 2πs − sin 2πs + cos 4πs − 2π 4π 16π
¾ 9 e−u , 16π ¾ 9 e−u . 16π
Finally, we have the following result: Theorem 6.14 Let C+ (γ0 ) be as in (6.16) with γ replaced by γ0 and h(t) by ∗ h(t; γ0 ), and let δ = eκ (γ0 ) . Then 0 ≤ ψ (s) (u) − ψ (s) (u, T ) ≤ C+ (γ0 )h(s; γ0 )e−γ0 u δ T .
(6.18)
Notes and references The material is from Asmussen & Rolski [98]. Some of the present proofs are more elementary by avoiding the general point process machinery of [98], but thereby also slightly longer.
6c
Markov-modulated approximations
A periodic risk model may be seen as a varying environment model, where the environment at time t is (s + t) mod 1 ∈ [0, 1), with s the initial season. Of course, such a deterministic periodic environment may be seen as a special case of a Markovian one (allowing a continuous state space E = [0, 1) for the environment), and in fact, much of the analysis of the preceding section is modelled after the techniques developed in the preceding sections for the case of a finite E. This observation motivates to look for a more formal connection between the periodic model and the one evolving in a finite Markovian environment. The idea is basically to approximate the (deterministic) continuous clock by a discrete (random) Markovian one with n ‘months’. Thus, the nth Markovian environmental process {Jt } moves cyclically on {1, . . . , n}, completing a cycle
7. DUAL QUEUEING MODELS
205
within one unit of time on the average, so that the intensity matrix is Λ(n) given by −n n 0 ··· 0 0 −n n · · · 0 Λ(n) = (6.19) . .. .. .. . . .. .. . . . n
0
0
···
−n
Arrivals occur at rate βni and their claim sizes are distributed according to Bni if the governing Markov process is in state i. We want to choose the βni and Bni in order to achieve good convergence to the periodic model. To this end, one simple choice is βni = β
³i − 1´ n
and
Bni = B ((i−1)/n) ,
(6.20)
© (n) ª but others are also possible. We let St be the claim surplus process of t≥0 (n)
the nth approximating Markov-modulated model, M (n) = supt≥0 St , and the ruin probability corresponding to the initial state i of the environment is then (n)
ψi (t) = Pi (M (n) > t),
(6.21)
which serves as an approximation to ψ (s) (u) whenever n is large and i/n ≈ s. Notes and references See Rolski [745].
7
Dual queueing models
The essence of the results of the present section is that the ruin probabilities ψi (u), ψi (u, T ) can be expressed in a simple way in terms of the waiting time probabilities of a queueing system with the input being the time-reversed input of the risk process. This queue is commonly denoted as the Markov-modulated M/G/1 queue and has received considerable attention in the last decades. Thus, since the settings are equivalent from a mathematical point of view, it is desirable to have formulas permitting freely to translate from one setting into the other. Let βi , Bi , Λ be the parameters defining the risk process in a random environment and consider a queueing system governed by a Markov process {Jt∗ } (‘Markov-modulated’) as follows: • The intensity matrix for {Jt∗ } is the time-reversed intensity matrix Λ∗ = (λ∗ij )i,j∈E of the risk process, λ∗ij = λji πj /πi . • The arrival intensity is βi when Jt∗ = i;
206
CHAPTER VII. MARKOVIAN ENVIRONMENT • Customers arriving when Jt∗ = i have service time distribution Bi ; • The queueing discipline is FIFO.
The actual waiting time process {Wn }n=1,2,... and the virtual waiting time (workload) process {Vt }t≥0 are defined exactly as for the renewal model in Chapter VI. Proposition 7.1 Assume V0 = 0. Then ¡ ¢ ¢ πj ¡ Pi τ (u) ≤ T, JT = j = Pj VT > u, JT∗ = i . πi
(7.1)
In particular, ψi (u, T ) =
¡ ¢ ¡ ¢ 1 Pπ VT > u, JT∗ = i = Pπ VT > u | JT∗ = i , πi
1 P(V > u, J ∗ = i) = Pπ (V > u | J ∗ = i), πi where (V, J ∗ ) is the steady-state limit of (Vt , Jt∗ ). ψi (u) =
(7.2) (7.3)
Proof. Consider stationary versions of {Jt }0≤t≤T , {Jt∗ }0≤t≤T . Then we may assume that Jt∗ = JT −t , 0 ≤ t ≤ T and that the risk process {Rt }0≤t≤T is coupled to the virtual waiting process {Vt }0≤t≤T as in the basic duality lemma (Theorem III.2.1). The first conclusion of that result then states that the events {τ (u) ≤ T, J0 = i, JT = j} and {VT > u, J0∗ = j, JT∗ = i} coincide. Taking probabilities and using the stationarity yields ¡ ¢ πi Pi τ (u) ≤ T, JT = j = πj Pj (VT > u, JT∗ = i), and (7.1) follows. For (7.2), just sum (7.1) over j, and for (7.3), let T → ∞ in (7.2) and use that lim Pj (VT > u, JT∗ = i) = P(V > u, J ∗ = i) for all j. 2 Now let In∗ denote the environment when customer n arrives and I ∗ the steady-state limit. Proposition 7.2 The relation between the steady-state distributions of the actual and the virtual waiting time distribution is given by P(W > u, I ∗ = i) = where β ∗ =
P j∈E
βi P(V > u, J ∗ = i), β∗
(7.4)
πj βj . In particular, ψi (u) =
β∗ P(W > u, I ∗ = i). πi βi
(7.5)
7. DUAL QUEUEING MODELS
207
Proof. Identifying the distribution of (W, I ∗ ) with the time-average, we have N 1 X a.s. I(Wn > u, In∗ = i) → P(W > u, I ∗ = i), N → ∞. N n=1
However, if T is large, on average β ∗ T customers arrive in [0, T ], and of these, on average βi T P(V > u, J ∗ = i) see W > u, I ∗ = i. Taking the ratio yields (7.4), and (7.5) follows from (7.4) and (7.3). 2 Notes and references One of the earliest papers drawing attention to the Markovmodulated M/G/1 queue is Burman & Smith [210]. The first comprehensive solution of the waiting time problem is Regterschot & de Smit [729], a paper relying heavily on classical complex plane methods. A more probabilistic treatment was given by Asmussen [59], and further references (to which we add Prabhu & Zhu [714]) can be found therein. Proposition 7.1 is from Asmussen [58], with (7.3) improving somewhat upon (2.7) of that paper. The relation (7.4) can be found in Regterschot & de Smit [729]; a general formalism allowing this type of conclusion is ‘conditional PASTA’, see Regterschot & van Doorn [327]. In the setting of the periodic model of Section 6, the dual queueing model is a periodic M/G/1 queue with arrival rate β(−t) and service time distribution B (−t) at time t of the year (assuming w.l.o.g. that β(t), B (t) have been periodically extended to negative t). With {Vt } denoting the workload process of the periodic queue, ρ < 1 then ensures that V (s) = limN →∞ VN +s exists in distribution, and one has ` ´ P(s) τ (u) ≤ T = P(−s−T ) (VT > u), (7.6) ` ´ P(−s−T ) τ (u) ≤ T = P(s) (VT > u), ` ´ P(1−s) τ (u) < ∞ = P(s) (V (0) > u).
(7.7) (7.8)
For treatments of periodic M/G/1 queues, see in particular Harrison & Lemoine [450], Lemoine [579, 580], and Rolski [745].
This page intentionally left blank
Chapter VIII
Level-dependent risk processes 1
Introduction
We assume as in Chapter IV that the claim arrival process {Nt } is Poisson with rate β, and that the claim sizes U1 , U2 , . . . are i.i.d. with common distribution B and independent of {Nt }. Thus, the aggregate claims in [0, t] are At =
Nt X
Ui
(1.1)
i=1
(other terms are accumulated claims or total claims). However, the increase of the surplus process Rt in between the claim payments now does not have to be linear with constant slope, but can depend on the current surplus level. This can always be interpreted as a modified premium rate p(r) charged at the current reserve Rt = r (but note that the actual reason for the level dependence of the increase may be quite different, see the examples below). Thus, in between jumps, {Rt } moves according to the differential equation R˙ = p(R), and the evolution of the reserve may be described by the equation1 Z Rt = u − At +
t
p(Rs ) ds.
(1.2)
0 1 Here it is assumed that p(r) is a deterministic function. Stochastic p(r) will be discussed in Sections 5 and 6.
209
210
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
As earlier, ¯ ³ ´ ¯ ψ(u) = P inf Rt < 0 ¯ R0 = u , t≥0
³ ψ(u, T ) = P
¯ ´ ¯ inf Rt < 0 ¯ R0 = u
0≤t≤T
denote the ruin probabilities with initial reserve u and infinite, resp. finite horizon, and τ (u) = ¡inf {t > 0 :¢ Rt < u} is the ¡ time to ¢ruin starting from R0 = u so that ψ(u) = P τ (u) < ∞ , ψ(u, T ) = P τ (u) ≤ T . The following examples provide some main motivation for studying the model: Example 1.1 Assume that the company reduces the premium rate from p1 to p2 when the reserve comes above some critical value v. That is, p1 > p2 and ½ p1 r ≤ v p(r) = (1.3) p2 r > v. One reason could be competition, where one would try to attract new customers as soon as the business has become reasonably safe. Another could be the payout of dividends: here the premium paid by the policy holders is the same for all r, but when the reserve comes above v, dividends are paid out at rate p1 − p2 . Possibilities for more general level-dependent premium (dividend payment) schemes than the two-step rule above are obvious. 2 Example 1.2 (interest) If the company charges a constant premium rate p but invests its money at interest rate i, we get p(r) = p + ir. 2 Example 1.3 (absolute ruin) Consider the same situation as in Example 1.2, but assume now that the company borrows the deficit in the bank when the reserve goes negative, say at interest rate i0 . Thus at deficit x > 0 (meaning Rt = −x), the payout rate of interest is i0 x and absolute ruin occurs when this exceeds the premium inflow p, i.e. when x > p/i0 , rather than when the reserve et = Rt + p/i0 , itself becomes negative. In this situation, we can put R ½ p + i(r − p/i0 ) r > p/i0 , pe(r) = p − i0 (p/i0 − r) 0 ≤ r ≤ p/i0 . © ª et is of the type defined above, and the probability Then the ruin problem for R e + p/i0 ). 2 of absolute ruin with initial reserve u ∈ [−p/i0 , ∞) is given by ψ(u Example 1.4 (tax) If the insurance company makes profit, it will have to pay tax. One way to model this is to assume that whenever the risk process Rt is in a running maximum, a certain proportion ϑ of the premium income is paid
1. INTRODUCTION
211
to the tax authority (such a model is related to the so-called loss-carried-forward scheme). The resulting premium rule is p(r) = ϑ p in the running maxima and p(r) = p otherwise. Due to the non-Markovian character, the analysis for this 2 model is somewhat different from the above examples, see Section 4. Now let us return to the general Markovian model. Proposition 1.5 Either ψ(u) = 1 for all u, or ψ(u) < 1 for all u. Proof. Obviously ψ(u) ≤ ψ(v) when u ≥ v. Assume ψ(u) < 1 for some u. If R0 = v < u, there is positive probability, say ², that {Rt } will reach level u before the first claim arrives. Hence in terms of survival probabilities, 1 − ψ(v) ≥ ²(1 − ψ(u)) > 0 so that ψ(v) < 1. 2 A basic question is thus which premium rules p(r) ensure that ψ(u) < 1. No tractable necessary and sufficient condition is known in complete generality of the model. However, it seems reasonable to assume monotonicity (p(r) is decreasing in Example 1.1 and increasing in Example 1.2) for r sufficiently large so that p(∞) = limr→∞ p(r) exists. This is basically covered by the following result (but note that the case p(r) ↓ βµB requires a more detailed analysis and that µB < ∞ is not always necessary for ψ(u) < 1 when p(r) → ∞, cf. [APQ, pp. 388–389]): Theorem 1.6 (a) If p(r) ≤ βµB for all sufficiently large r, then ψ(u) = 1 for all u; (b) If p(r) > βµB + ² for all sufficiently large r and some ² > 0, then ψ(u) < 1 for all u, and P(Rt → ∞) > 0. Proof. This follows by a simple comparison with the compound Poisson model. Let ψp (u) refer to the compound Poisson model with the same β, B and (constant) premium rate p. In case (a), choose u0 such that p(r) ≤ p = βµB for r ≥ u0 . Starting from R0 = u0 , the probability that Rt ≤ u0 for some t is at least ψp (0) = 1 (cf. Proposition IV.1.2(d)), hence Rt ≤ u0 also for a whole sequence of t’s converging to ∞. However, obviously inf u≤u0 ψ(u) > 0, and hence by a geometric trials argument ψ(u0 ) = 1 so that ψ(u) = 1 for all u by Proposition 1.5. In case (b), choose u0 such that p(r) ≥ p = βµB + ² for r ≥ u0 . Then if u ≥ u0 , we have ψ(u) ≤ ψp (u − u0 ) and, appealing to Proposition IV.1.2 once more, that ψp (u − u0 ) < 1. Hence ψ(u) < 1 for all u by Proposition IV.1.2(d). 2 We next recall the following result, which was proved in III.3. Here {Vt }t≥0 is a storage process which has reflection at zero and initial condition V0 = 0.
212
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
In between jumps, {Vt } decreases at rate p(v) when Vt = v (i.e., V˙ = −p(V )). That is, instead of (1.2) we have Z
t
p(Vs ) ds,
Vt = At −
(1.4)
0
and we use the convention p(0) = 0 to make zero a reflecting barrier (when hitting 0, {Vt } remains at 0 until the next arrival). Theorem 1.7 For any T < ∞, one can couple the risk process and the storage process on [0, T ] in such a way that the events {τ (u) ≤ T } and {VT > u} coincide. In particular, ψ(u, T ) = P(VT > u), (1.5) and the process {Vt } has a proper limit in distribution, say V , if and only if ψ(u) < 1 for all u. Then ψ(u) = P(V > u). (1.6) In order to make Theorem 1.7 applicable, we thus need to look more into the stationary distribution G, say, for the storage process {Vt }. It is intuitively obvious and not too hard to prove that G is a mixture of two components, one having an atom at 0 of size g0 , say, and the other being given by a density g(x) on (0, ∞). It follows in particular that Z ∞ (1.7) ψ(u) = g(y) dy . u
Proposition 1.8 Z
x
p(x)g(x) = g0 βB(x) + β
B(x − y)g(y) dy.
(1.8)
0
Proof. In stationarity, the flow of mass from [0, x] to (x, ∞) must be the same as the flow the other way. In view of the path structure of {Vt }, this means that the rate of upcrossings of level x must be the same as the rate of downcrossings. Now obviously, the l.h.s. of (1.8) is the rate of downcrossings (the event of an arrival in [t, t + dt] can be neglected so that a path of {Vt } corresponds to a downcrossing in [t, t + dt] if and only if Vt ∈ [x, x + p(x)dt]). An attempt of an upcrossing occurs as a result of an arrival, say when {Vt } is in state y, and is successful if the jump size is larger than x − y. Considering the cases y = 0 and 0 < y ≤ x separately, we arrive at the desired interpretation of the r.h.s. of 2 (1.8) as the rate of upcrossings.
1. INTRODUCTION
213
Define
Z ω(x) = 0
x
1 dt. p(t)
Then ω(x) is the time it takes for the reserve to reach level x provided it starts with R0 = 0 and no claims arrive. Note that it may happen that ω(x) = ∞ for all x > 0, say if p(r) goes to 0 at rate r or faster as r ↓ 0. −δx and that Corollary 1.9 Assume that B is exponential with rate δ, B(x) R ∞= e ω(x) < ∞ for all x > 0. Then the ruin probability is ψ(u) = u g(y) dy, where
g(x) =
© ª g0 β 1 exp βω(x) − δx and =1+ p(x) g0
Z 0
∞
© ª β exp βω(x) − δx dx . p(x) (1.9)
Proof. We may rewrite (1.8) as Z x o 1 n β −δx −δx −δx g(x) = g0 βe + βe eδy g(y) dy = e κ(x) p(x) p(x) 0 Rx where κ(x) = g0 + 0 eδy g(y) dy so that κ0 (x) = eδx g(x) =
β κ(x). p(x)
Thus Z log κ(x)
=
log κ(0) + 0
κ(x) g(x)
x
β dt = log κ(0) + βω(x), p(t)
= κ(0)eβω(x) = g0 eβω(x) , = e−δx κ0 (x) = e−δx g0 βω 0 (x)eβω(x)
which is the same as the expression R ∞in (1.9). That g0 has the asserted value is a consequence of 1 = kGk = g0 + 0 g(y)dy. 2 Remark 1.10 The exponential case in Corollary 1.9 is the only one in which explicit formulas are known (or almost so; see further the notes to Section 2), and thus it becomes important to develop algorithms for computing the ruin probabilities. We next outline one possible approach based upon the integral equation (1.8) (another one is based upon numerical solution of a system of differential equations which can be derived under phase-type assumptions, see further IX.7).
214
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES A Volterra integral equation has the general form Z x g(x) = h(x) + K(x, y)g(y) dy,
(1.10)
0
where g(x) is an unknown function (x ≥ 0), h(x) is known and K(x, y) is a suitable kernel. Dividing (1.8) by p(x) and letting K(x, y) =
βB(x − y) , p(x)
h(x) =
g0 βB(x) , p(x)
we see that for fixed g0 , the function g(x) in (1.8) satisfies (1.10). For the purpose of explicit computation of g(x) (and thereby ψ(u)), the general theory of Volterra equations does not seem to lead beyond the exponential case already treated in Corollary 1.9. However, one might try instead a numerical solution. We consider the simplest possible approach based upon the most basic numerical integration procedure, the trapezoidal rule Z xN ¤ h£ f (x) dx = f (x0 ) + 2f (x1 ) + 2f (x2 ) + · · · + 2f (xN −1 ) + f (xN ) , 2 x0 where xk = x0 + kh. Fixing h > 0, letting x0 = 0 (i.e. xk = kh) and writing gk = g(xk ), Kk,` = K(xk , x` ), this leads to gN = hN + i.e. gN =
h {KN,0 g0 + KN,N gN } + h {KN,1 g1 + · · · + KN,N −1 gN −1 } , 2
hN + h2 KN,0 g0 + h {KN,1 g1 + · · · + KN,N −1 gN −1 } 1 − h2 KN,N
.
(1.11)
In the case of (1.8), the unknown g0 is involved. However, (1.11) is easily seen to be linear in g0 . One therefore first makes a trial solution gR∗ (x) corre∞ sponding to g0 = 1, i.e. h(x) = h∗ (x) = βB(x)/p(x), and computes 0 g ∗ (x)dx numerically (by truncation and using the gk∗ ). Then g(x) = g0 g ∗ (x), and kGk = 1 then yields Z ∞ 1 =1+ g ∗ (x)dx (1.12) g0 0 from which g0 and hence g(x) and ψ(u) can be computed.
2
Remark 1.11 Plugging (1.7) into (1.8), one obtains by partial integration and reordering Z u (1.13) p(u)ψ 0 (u) − β ψ(u) + β ψ(u − y) dB(y) + β B(u) = 0, 0
1. INTRODUCTION
215
where in the last term it was used that g0 + ψ(0) = 1. It is also possible to derive (1.13) directly (without reference to storage processes) in the following way. For h > 0, consider the time interval (0, h) and condition on the time t and the amount y of the first claim in (0, h). Since the probability that there is no claim in (0, h) is e−βh and the probability that the first claim occurs between time t and t + dt is e−βt β dt, one obtains, using the Markov property of the process Rt , ψ(u) =
¡ ¢ Rh ¡ ¢ Rh Rt e−βh ψ u + 0 p(Rs ) ds + e−βt β dt B u + 0 p(Rs ) ds +
Rh 0
e−βt βdt
R u+ 0t p(Rs )ds
R 0
0
¡ ¢ Rt ψ u + 0 p(Rs )ds − y dB(y).
¡ Since every other part of the above equation is differentiable w.r.t. h, also ψ u + ¢ Rh p(Rs ) ds has to be (by symmetry this also establishes the differentiability 0 w.r.t. u). Taking the derivative w.r.t. h and subsequently setting h = 0 then gives (1.13). The formal framework for this approach are of course generators (cf. Chapter II). For the particular case B(x) = e−δx , one can multiply (1.13) by eδu and differentiate the resulting equation w.r.t. u. In this way one obtains the secondorder differential equation p(u) ψ 00 (u) + (p0 (u) + δp(u) − β) ψ 0 (u) = 0 ¡ ¢ with the boundary conditions p(0)ψ 0 (0) = β ψ(0) − 1 and limu→∞ ψ(u) = 0. This leads to R ∞ 1 β ω(v)−δ v β u p(v) e dv R∞ 1 ψ(u) = , (1.14) β ω(v)−δ v dv 1 + β 0 p(v) e which is again the result of Corollary 1.9.
1a
2
Two-step premium functions
We now assume the premium function to be constant in two levels as in Example 1.1, ½ p1 r ≤ v (1.15) p(r) = p2 r > v. We may think of the risk reserve process Rt as pieced together from two risk (1) (2) reserve processes Rt and Rt with constant premiums p1 , p2 , such that Rt (1) (2) coincide with Rt under level v and with Rt above level v. If, as outlined
216
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
in Example 1.1, the reduced income above v is due to dividend payments, this model is usually referred to as the threshold dividend model.2 For an example of a sample path of such a refracted process, see Fig. VIII.1.
Figure VIII.1 © (i) ª Proposition 1.12 Let ψ (i) (u) denote the ruin probability of Rt , define σ = inf {t ≥ 0 : Rt < v}, let π(u) be the probability of ruin between σ and the next upcrossing of v (including ruin possibly at σ), and let φv (u) =
1 − ψ (1) (u) , 0 ≤ u ≤ v. 1 − ψ (1) (v)
(1.16)
Then 1 − φv (u) + φv (u)ψ(v), 0 ≤ u ≤ v, π(v) , u = v, ψ(u) = 1 + π(v) − ψ (2) (0) ¡ ¢ π(u) + ψ (2) (u − v) − π(u) ψ(v), v ≤ u < ∞. Proof. Recall from Proposition II.2.6 that φv (u) = 1 − ψv (u) is the probability © (1) ª for Rt (and hence also for {Rt }) of upcrossing level v before ruin given the process starts at u ≤ v. Hence, for u < v the probability of ruin for {Rt } will be the sum of the probability of being ruined before upcrossing v, 1 − φv (u), and the probability of ruin given we hit v first, φv (u)ψ(v). 2 The corresponding dividend payout scheme, namely to pay nothing when R < v and to t pay out at rate p1 − p2 when Rt ≥ v, turns out to maximize the expected discounted sum of dividend payments until ruin under certain assumptions, see e.g. Gerber & Shiu [412].
1. INTRODUCTION
217
Similarly, if u ≥ v then the probability of ruin is the sum of being ruined between σ and the next upcrossing of v which is π(u), and the probability of ruin given the process hits v before (−∞, 0) again after σ, ¡ ¢ ¡ ¢ Pu (σ < ∞) − π(u) ψ(v) = ψ (2) (u − v) − π(u) ψ(v). This yields the expression for u ≥ v, and the one for u = v then immediately follows. 2 Example 1.13 Assume that B is exponential, B(x) = e−δx . Then β −γ1 u e , p1 δ
ψ (1) (u) =
ψ (2) (u) =
β −γ2 u e , p2 δ
where γi = δ − β/pi , so that β −γ1 u e p1 δ φv (u) = . β −γ1 v e 1− p1 δ 1−
Furthermore, for u ≥ v, P(σ < ∞) = ψ (2) (u−v) and the conditional distribution of v − Rσ given σ < ∞ is exponential with rate δ. If v − Rσ < 0, ruin occurs at time σ. If v − Rσ = x ∈ [0, v], the probability of ruin before the next upcrossing of v is 1 − φv (v − x). Hence Z v n o ¡ ¢ (2) −δv π(u) = ψ (u − v) e + 1 − φv (v − x) δe−δx dx 0
β −γ1 (v−x) ) e p1 δ −δx δe dx β −γ1 v 0 1− e p1 δ ¡ ¢ β ( 1 − e−δv − e−γ1 v e(γ1 −δ)v − 1 ) β −γ2 (u−v) π(γ1 − δ) e 1− β −γ1 v p2 δ 1− e p1 δ ( ) β −γ2 (u−v) 1 − e−γ1 v e 1− . β −γ1 v p2 δ 1− e p1 δ (
=
=
=
β −γ2 (u−v) e 1− p2 δ
Z
v
1−
2 Also for general phase-type distributions, all quantities in Proposition 1.12 can be found explicitly, see IX.7.
218
1b
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Multi-step premium functions
In a similar manner one can investigate a more general model with a premium rule of the form p1 0 = v0 ≤ r < v1 , p2 v1 ≤ r < v2 , p(r) = (1.17) .. . pk r ≥ vk−1 . Assume that pk > ρ. A similar approach as in Remark 1.11 then gives the piece-wise integro-differential equation Z u pi ψ 0 (u) − βψ(u) + β ψ(u − z)dB(z) + βB(u) = 0 (1.18) 0
for vi−1 ≤ u < vi and i = 1, . . . , k − 1. For the solution ψ(u) to be continuous, we require the boundary conditions (contact conditions) lim ψ(u) = lim ψ(u)
(1.19)
lim ψ(u) = 0.
(1.20)
u→vi +
u→vi −
and from η > 0 we have u→∞
Note that ψ(u) is not differentiable at the boundaries of the layers, as in view of (1.18) and continuity of ψ the conditions (1.19) can be rewritten in the form ¯ ¯ ¯ ¯ ∂+ ∂− ¯ pi+1 ψ(u)¯ ψ(u)¯¯ = pi . ∂u ∂u u=vi u=vi For exponential claim distribution B(x) = e−δx , the system (1.18) can be solved explicitly in the following way. Akin to the procedure in Remark 1.11, first transform (1.18) into pi ψ 00 (u) + (pi δ − β)ψ 0 (u) = 0,
u ∈ [vi−1 , vi ).
(1.21)
Using the notation ψ(u) =
k X
I(bi−1 ≤ u < bi ) ψ [i] (u),
(1.22)
i=1
where the function ψ [i] (u) is the solution of (1.21) for u ∈ [vi−1 , vi ) for each i, we obtain ψ [i] (u) = A(i) + C (i) e−γi u ,
1. INTRODUCTION
219
where γi = δ − β/pi is the (unique) positive solution of the Lundberg equation ¡ ¢ b − 1 − pi α = 0. β B[α] It remains to establish the constants in the above representation: from (1.20), we have A(k) = 0. From the continuity conditions (1.19) we immediately get A(i+1) + C (i+1) e−γi+1 vi − A(i) − C (i) e−γi vi = 0,
(i = 1, 2, . . . , k − 1). (1.23)
Using (1.18) and comparing the coefficients of e−δu , we further obtain after elementary algebra −A(i+1) − C (i+1)
δe−γi+1 vi δe−γi vi + A(i) + C (i) = 0, δ − γi+1 δ − γi
(i = 1, 2, . . . , k − 1), (1.24)
δ together with A(1) + C (1) δ−γ = 1. Adding (1.23) and (1.24) leads to 1
C (i+1)
© ª (δ − γi+1 )γi exp (γi+1 − γi )vi C (i) (δ − γi )γi+1 n ³1 β − δ(pi ) 1 ´ o (i) exp β − vi C β − δ(pi+1 ) pi pi+1
= =
so that =
nX o (δ − γi )γ1 exp (γj+1 − γj )vj C (1) (δ − γ1 )γi j=1
=
i−1 n X o β − δ(p1 ) 1 1 exp β )vj C (1) ( − β − δ(pi ) p pj+1 j=1 j
i−1
C (i)
for i = 1, . . . , k. Define Li = γ1 e−γ1 v1
¶ j i−1 µ o nX X 1 1 (v`−1 − v` )γ` . − exp γj γj+1 j=1 `=2
Then, again from (1.23), we have A(i) = A(1) + C (1) and hence A(1) = −
Lk 1 − Lk
δ Li = A(1) + (1 − A(1) )Li δ − γ1 and C (1) =
δ − γ1 1 . δ 1 − Lk
(1.25)
220
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Altogether we thus arrive at the explicit formula (1.22) with [i]
ψ (u) =
=
µ i−1 n o¶ X 1 (δ − γi )γ1 Li − Lk + exp −γ1 u + (γj+1 − γj )vj 1 − Lk δ γi j=1 µ ¶ i−1 nX o γ1 1 (i) Li − Lk + exp (γj+1 − γj )vj ψ (u) 1 − Lk γi j=1
for i = 1, . . . , k, where ψ (i) (u) again denotes the ruin probability in the classical model with constant premium intensity pi (u) ≡ pi . Note that for k = 2, the formula from Example 1.13 is retained. Remark 1.14 The main tool in the above calculation was the reformulation of the integro-differential equations as ordinary differential equations, which allowed to find the fundamental solution for each layer locally and separately and subsequently to determine the coefficients through the continuity assumptions between the solutions in different layers (through a system of linear equations). This program can still be carried out for, say, Erlang(n) claim sizes, in which case the ODEs (with constant coefficients) that generalize (1.21) are of order n + 1. However, the solution of the resulting linear system of equations usually is highly involved and can only be evaluated numerically. 2 Notes and references Some early references drawing attention to the model are Dawidson [277] and Segerdahl [790]. For the absolute ruin problem, see Gerber [396], Dassios & Embrechts [273] and, for a recent extension to finite-time horizons in a more general L´evy set-up, Loeffen & Patie [605]. Equation (1.6) was derived by Harrison & Resnick [450] by a different approach, whereas (1.5) is from Asmussen & Schock Petersen [104]; see further the notes to III.3. The analytic derivation of (1.14) can be found in Tichy [851]. For some explicit solutions beyond Corollary 1.9, see the notes to Section 2. Remark 1.10 is based upon Schock Petersen [695]; for complexity- and accuracy aspects, see the Notes to IX.7. Extensive discussion of the numerical solution of Volterra equations can be found in Baker [125]; see also Jagerman [499, 500]. An (2) (1) extension of Proposition 1.12, in which the switch from Rt to Rt only takes place (1) if the risk process has gone below a threshold w < v first, but the switch from Rt to (2) Rt still takes place at the upcrossing of v is given in Bratiychuk & Derfla [196], see also Frostig [377]. The special case p2 = 0 in the premium rule (1.15) refers to the situation when all original premium income is paid out as dividends to shareholders whenever the surplus level is above v. If in addition it is specified that for initial capital u > v, the difference u − v is immediately paid out as a lump sum dividend payment, then the resulting strategy is known as the horizontal dividend barrier strategy. The ruin probability is
1. INTRODUCTION
221
ψ(u) = 1 for the corresponding risk process (namely Rt reflected at v) and hence this case is not of interest for the main focus of this book. However, already back in 1957 de Finetti [283] suggested to consider the expected discounted accumulated dividend payments until ruin in a portfolio as an (economically motivated) alternative to the ruin probability for measuring the value of a portfolio, and the identification of the optimal dividend strategy to maximize this quantity leads to challenging sto chastic control problems. The horizontal barrier strategy often turns out to be optimal (see Gerber [394] for early results; the weakest currently known criteria on the risk process under which horizontal dividend barrier strategies are optimal among all admissible payout strategies are due to Loeffen [604], Kyprianou, Rivero & Song [568] and Loeffen & Renaud [606]). For duality considerations of the reflected risk processes with G/M/1 queues, see L¨ opker & Perry [609]. An analysis of exit problems for the threshold model (1.15) in a general L´evy setup (with particular emphasis on the spectrally negative case) is given in Kyprianou & Loeffen [565]. The threshold and multi-step premium rules are a somewhat popular alternative to horizontal dividend strategies that are still to some extent analytically tractable and lead to ruin probabilities smaller than 1. The multi-step rule was first studied by Kerekesha [530], who looked at (1.18) for arbitrary u > 0 using correction terms for the different premium intensities outside the respective layer, which he expressed through truncated Fourier transforms. The explicit solution for exponential claims given above is due to Albrecher & Hartinger [25]; see also Zhou [919] and Lin & Sendova [594], where (1.18) is derived by a renewal approach that directly implies the continuity conditions (1.19). In [25, 594, 919] the analysis is also considerably extended to cover quantities like the time value of ruin, deficit at ruin and the surplus prior to ruin. To improve upon the problem described in Remark 1.14, an alternative recursive approach that iteratively calculates the full solution for the same model with one layer less is developed in [25]. For extensions of these results to the renewal model see Yang & Zhang [904]. In the literature also other surplus-dependent risk processes have been discussed in connection with dividend payout schemes that lead to a positive probability of survival. Among them are time-dependent barrier strategies, for which the barrier itself is an increasing function of time and if the risk process touches the barrier it stays at the barrier until the next claim occurs and the additional premium income is paid out as dividends. The ruin probability for the resulting risk process can then often be obtained as the solution of partial integro-differential equations, see Gerber [399], Siegl & Tichy [804, 805] and Albrecher & Tichy [41]. Albrecher, Hartinger & Thonhauser [26] analytically compare the performance of linear barrier strategies with the threshold strategies of (1.15). Albrecher & Kainhofer [30] and Albrecher, Kainhofer & Tichy [31] investigate risk processes with a non-linear time-dependent barrier structure including constant interest on the surplus. See also Garrido [390] in a diffusion setting. For general surveys on dividend models in risk theory, see Avanzi [109] and Albrecher & Thonhauser [40].
222
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
2
The model with constant interest
In this section, we assume that p(x) = p + ix. This example is of particular application relevance because of the interpretation of i as interest rate. However, it also turns out to have nice mathematical features. A basic tool is a representation of the ruin probability in terms of a discounted stochastic integral Z ∞ Z = − e−it dSt (2.1) 0
PN w.r.t. the claim surplus process St = At − pt = 1 t Ui − pt of the associated (u) compound Poisson model without interest. Write Rt when R0 = u. We first note that: (u)
Proposition 2.1 Rt
(0)
= eit u + Rt .
Proof. The result is obvious if one thinks in economic terms and represents the reserve at time t as the initial reserve u with added interest plus the gains/deficit from the claims and incoming premiums. For a more formal mathematical proof, note that (u)
dRt
=
£ (u) ¤ d Rt − eit u = (u)
(u)
Since R0 − ei·0 u = 0 for all u, Rt which yields the result.
(u)
p + iRt − dAt , £ (u) ¤ p + i Rt − eit u − dAt . − eit u must therefore be independent of u 2
Let (0)
Zt = e−it Rt
= e−it
³Z t ³ ´ ´ p + iRs(0) ds − At . 0
Then dZt
= e
−it
Z
³ − i dt ·
0
t¡
´ ¢ ¡ (0) ¢ p + iRs(0) ds + p + iRt dt + i dt · At − dAt
= e−it (p dt − dAt ) = −e−it dSt . Thus
Z Zv
= −
v
e−it dSt ,
0
where the last integral exists pathwise because {St } is of locally bounded variation.
2. THE MODEL WITH CONSTANT INTEREST
223
Proposition 2.2 The r.v. Z in (2.1) is well-defined and finite, with distribution H(z) = P(Z ≤ z) given by the m.g.f. nZ ∞ ¡ nZ α 1 o ¢ o αZ −it b H[α] = Ee = exp κ −αe dt = exp κ (−y) dy , 0 0 iy ¡ ¢ b − 1 − pα. Further Zt a.s. where κ(α) = β B[α] → Z as t → ∞. Proof. Let Mt = At − tβµB . Then St = Mt + t(βµ ©RBv −−itp) and ª {Mv } is a martingale. From this it follows immediately that e dM is again a t 0 (2) martingale. The mean is 0 and (since Var(dMt ) = βµB dt) ³Z
v
Var
−it
e
Z
´ dMt
v
=
0
0
(2)
βµB (1 − e−2iv ). 2i
(2)
e−2it βµB dt =
Hence the limit as v → ∞ exists by the convergence theorem for L2 -bounded martingales, and we have Z v Z v ¡ ¢ Zv = − e−it dSt = − e−it dMt + (βµB − p)dt 0 Z0 ∞ ¡ ¢ a.s. → − e−it dMt + (βµB − p)dt Z0 ∞ = − e−it dSt = Z. 0
if X1 , X2 , . . . are i.i.d. with c.g.f. φ and ρ < 1, we obtain the c.g.f. of P∞Now n ρ X n at α as 1 log E
∞ Y
eαρ
n
Xn
= log
n=1
∞ Y
eφ(αρ
n
)
∞ X
=
n=1
φ(αρn ).
n=1
Letting ρ = e−ih , Xn = Snh − S(n+1)h , we have φ(α) = hκ(−α), and obtain the R∞ c.g.f. of Z = − 0 e−it dSt as lim h↓0
∞ X
n
φ(αρ ) = lim h
n=1
h↓0
∞ X n=1
Z κ(−αe
−inh
) =
∞
¡ ¢ κ −αe−it dt ;
0
b follows by the substitution y = αe−it . the last expression for H[α] Theorem 2.3 ψ(u) =
H(−u) ¯ ¤. E H(−Rτ (u) ) ¯ τ (u) < ∞ £
2
224
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Proof. Write τ = τ (u) for brevity. On {τ < ∞}, we have Z h −iτ iτ u + Z = (u + Zτ ) + (Z − Zτ ) = e e (u + Zτ ) −
∞
e−i(t−τ ) dSt
i
τ
e−iτ [Rτ(u) + Z ∗ ], R ∞ where Z ∗ = − τ e−i(t−τ ) dSt is independent of Fτ and distributed as Z. The (u) last equality followed from Rt = eit (Zt + u), cf. Proposition 2.1, which also yields τ < ∞ on {Z < −u}. Hence ¡ ¢ H(−u) = P(u + Z < 0) = P Rτ + Z ∗ < 0; τ < ∞ ¯ £ ¤ = ψ(u)E P(Rτ + Z ∗ < 0 ¯ Fτ , τ < ∞) ¯ £ ¤ = ψ(u)E H(−Rτ (u) ) ¯ τ (u) < ∞ . =
2 −δx
Corollary 2.4 Assume that B is exponential, B(x) = e , and that p(x) = p + ix with p > 0. Then ³ δ(p + iu) β ´ ; βiβ/i−1 Γ i i ψ(u) = (2.2) ³ δp β ´ , β/i β/i −δp/i β/i−1 δ p e + βi Γ ; i i R ∞ η−1 −t e dt is the incomplete Gamma function. where Γ(x; η) = x t Proof 1. We use Corollary 1.9 and get Z
x
1 1 1 dt = log(p + ix) − log p, p + it i i 0 nβ o γ0 β β g(x) = exp log(p + ix) − log p − δx p + ix i i γ0 β = (p + ix)β/i−1 e−δx , pβ/i Z ∞ © ª 1 β = 1+ exp βω(x) − δx dx γ0 p(x) Z0 ∞ β = 1+ (p + ix)β/i−1 e−δx dx β/i p 0 Z ∞ β = 1 + β/i y β/i−1 e−δ(y−p)/i dy ip p βiβ/i−1 eδp/i ³ δp β ´ = 1+ Γ ; , i i δ β/i pβ/i
ω(x) =
2. THE MODEL WITH CONSTANT INTEREST Z
ψ(u)
225
∞
β exp {βω(x) − δx} dx p(x) u βiβ/i−1 eδp/i ³ δ(p + iu) β ´ = γ0 ; , Γ i i δ β/i pβ/i = γ0
from which (2.2) follows by elementary algebra.
2
Proof 2. We use Theorem 2.3. From κ(α) = βα/(δ − α) − pα, it follows that Z α Z ¢ 1 1 α¡ b log H[α] = κ (−y) dy = p − β/(δ + y) dy i 0 0 iy µ ¶β/i i h £ ¤ 1 δ pα + β log δ − β log(δ + α) = log epα/i = , i δ+α which shows that Z is distributed as p/i − V , where V is Gamma(δ, β/i), i.e. with density xβ/i−1 δ β/i −δx fV (x) = e , x > 0. Γ (β/i) In particular, H(−u) = P(Z < −u) = P(V > u + p/i) =
¡ ¢ Γ δ(p + iu)/i; β/i . Γ (β/i)
By the memoryless property of the exponential distribution, −Rτ (u) has an exponential distribution with rate (δ) and hence ¯ £ ¤ E H(−Rτ (u) )¯ τ (u) < ∞ Z ∞ = δe−δx P(p/i − V ≤ x) dx 0 Z ∞ £ −δx ¤∞ = −e P(p/i − V ≤ x) 0 + e−δx fV (p/i − x) dx Z
p/i
0 β/i−1 β/i
(p/i − x) δ = P(V ≥ p/i) + e−δp/i dx Γ (β/i) 0 ½ ¾ 1 (p/i)β/i δ β/i e−δp/i = Γ (δp/i; β/i) + . Γ (β/i) β/i From this (2.2) follows by elementary algebra.
2
Proof 3. Just insert p(x) = p + i x into (1.14) and identify the resulting integral as the incomplete Gamma function. 2
226
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Example 2.5 The analysis leading to Theorem 2.3 is also valid if {Rt } is obtained by adding interest to a more general process with stationary independent increments. As an example, assume Brownian motion {Bt } with drift µ and variance σ 2 ; then {Rt } is the diffusion with drift function µ + ix and constant variance σ 2 . The process {St } corresponds to {−Bt } so that κ(α) = σ 2 α2 /2 − µα, and the c.g.f. of Z is Z
Z ´ 1 1 α ³ σ2 y κ (−y) dy = + µ dy i 0 2 0 iy σ 2 α2 µα = + . 4i i ¡ ¢ I.e., Z is normal µ/i, σ 2 /2i , and since Rτ = 0 by the continuity of Brownian motion, it follows that the ruin probability is b log H[α] =
ψ(u) =
α
H(−u) = H(0)
³ −u − µ/i ´ √ σ/ 2i ³ −µ/i ´ . √ Φ σ/ 2i
Φ
(2.3)
2 Notes and references Theorem 2.3 is from Harrison [449]; for a martingale proof, see e.g. Gerber [398, p. 134] (the time scale there is discrete but the argument is easily adapted to the continuous case). Corollary 2.4 is classical. Formula (2.3) was derived by Emanuel et al. [342] and Harrison [449]; it is also used as a basis for a diffusion approximation by these authors. Paulsen & Gjessing [687] found some remarkable explicit formulas for ψ(u) beyond the exponential case in Corollary 1.9. The solution is in terms of Bessel functions for an Erlang(2) B and in terms of confluent hypergeometric functions for a H2 B (a mixture of two exponentials). It must be noted, however, that the analysis does not seem to carry over to general phase-type distributions, not even Erlang(3) or H3 , nor to non-linear premium rules p(·). Explicit formulas for the finite-time ruin probabilities ψ(u, T ) for exponential claims in terms of finite gamma series were obtained in Albrecher, Teugels & Tichy [39] whenever β = ki for some integer k. See also Knessl & Peters [548] for a detailed asymptotic study of ψ(u, T ) for i > 0 and exponential claims. Avram, Leonenko & Rabehasaina [110] extend the method of [39] to certain jump-diffusion models. A numerical algorithm for determining ψ(u, T ) based on discrete time Markov chains can be found in Cardoso & Waters [221, 222]. P n A r.v. of the form ∞ 1 ρ Xn with the Xn i.i.d. as in the proof of Proposition 2.2 is a special case of a perpetuity; see e.g. Goldie & Gr¨ ubel [422] and Section 5.
3. THE LOCAL ADJUSTMENT COEFFICIENT
227
Further studies of the model with interest can be found in Boogaert & Crijns [180], Gerber [396], Delbaen & Haezendonck [288], Emanuel et al. [342], Paulsen [680, 681, 682], Paulsen & Gjessing [687], Sundt & Teugels [822, 823], Yang [899], Cai & Dickson [215] and Rulli`ere & Loisel [758]. Some of these references also go into a stochastic interest rate.
3
The local adjustment coefficient. Logarithmic asymptotics
For the classical risk model with constant premium rule p(x) ≡ p∗ , write γ ∗ for the solution of the Lundberg equation ¡ ¢ b ∗ ] − 1 − γ ∗ p∗ = 0 , β B[γ (3.1) write ψ ∗ (u) for the ruin probability etc., and recall Lundberg’s inequality ∗
u
ψ ∗ (u) ∼ C ∗ e−γ
∗
ψ ∗ (u) ≤ e−γ
(3.2)
and the Cram´er-Lundberg approximation u
.
(3.3)
When trying to extend these results to the model of this chapter where p(x) depends on x, a first step is the following: b Theorem 3.1 Assume that for some 0 < δ0 ≤ ∞, it holds that B[s] ↑ ∞, log ψ(u) s ↑ δ0 , and that p(x) → ∞, x → ∞. Then lim sup ≤ −δ0 . If δ0 < ∞ u u→∞ log ψ(u) and e−²r p(r) → 0, e(δ0 +²)x B(x) → ∞ for all ² > 0, then → −δ0 , u u → ∞. In the proof as well as in the remaining part of the section, we will use the local adjustment coefficient γ(x), which for a fixed x is defined as the adjustment coefficient of the classical risk model with p∗ = p(x), i.e. as the solution of the equation ¡ ¢ b − 1) − αp(x). κ x, γ(x) = 0 where κ(x, α) = β(B[α] (3.4) We assume existence of γ(x) for all x, as will hold under the steepness assumption of Theorem 3.1, and (for simplicity) that inf p(x) > βµB ,
x≥0
(3.5)
228
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
which implies inf x≥0 γ(x) > 0. The intuitive idea behind introducing local adjustment coefficients is that the classical risk model with premium rate p∗ = p(x) serves as a ‘local approximation’ at level x for the general model when the reserve is close to x.3 Proof of Theorem 3.1. The steepness assumption and p(x) → ∞ ensure γ(x) → δ0 . Let γ ∗ < δ0 , let p∗ be as in (3.1) and for a given ² > 0, choose u0 such that p(x) ≥ p∗ when x ≥ u0 ². When u ≥ u0 , obviously ψ(u) can be bounded with the probability that the Cram´er-Lundberg compound Poisson model with premium rate p∗ downcrosses level u² starting from u, which in turn by Lund∗ berg’s inequality can be bounded by e−γ (1−²)u . Hence lim supu→∞ log ψ(u)/u ∗ ≤ −γ (1 − ²). Letting first ² → 0 and next γ ∗ ↑ δ0 yields the first statement of the theorem. (1) (2) (1) For the last assertion, choose c² , c² such that p(x) ≤ c² e²x , B(x) ≥ (2) −(δ0 +²)x c² e for all x. Then we have the following lower bound for the time for the reserve to go from level u to level u + v without a claim: Z v 1 −²u ω(u + v) − ω(u) = dt ≥ c(3) ² e p(u + t) 0 (3)
(1)
where c² = (1 − e−²v )/(²c² ). Therefore the probability that a claim arrives (4) before the reserve has reached level u + v is at least c² e−²u . Given such an arrival, ruin will occur if the claim is at least u + v, and hence −²u (2) −(δ0 +²)u c e . ψ(u) ≥ c(4) ² e
The truth of this for all ² > 0 implies lim inf log ψ(u) ≥ −δ0 .
2
Obviously, Theorem 3.1 only presents a first step, and in particular, the result is not very informative if δ0 = ∞. The rest of this section deals with tail estimates involving the local adjustment coefficient. The first main result in this direction is the following version of Lundberg’s inequality: Theorem 3.2 Assume that p(x) is a non-decreasing function of x and let I(u) = Ru γ(x) dx. Then 0 (3.6) ψ (u) ≤ e−I(u) . The second main result to be derived states that the bound in Theorem 3.2 is also an approximation under appropriate conditions. The form of the result is superficially similar to the Cram´er-Lundberg approximation, noting that in many cases the constant C is close to 1. However, the limit is not u → ∞ but 3 Note
that this was also the motivation behind the approach of Section 1b.
3. THE LOCAL ADJUSTMENT COEFFICIENT
229
the slow Markov walk limit in large deviations theory (see e.g. Bucklew [207]). © (²) ª For ² > 0, let ψ² (u) be evaluated for the process Rt defined as in (1.2), only with β replaced by β/² and Ui by ²Ui . Theorem 3.3 Assume that either (a) p(r) is a non-decreasing function of r, or (b) Condition 3.13 below holds. Then lim −² log ψ² (u) = I(u). ²↓0
(3.7)
Remarks: 1. Condition 3.13 is a technical condition on the claim size distribution B, which essentially says that an overshoot r.v. U |U > x cannot have a much heavier tail than the claim U itself. (²)
2. If p(x) ≡ p is constant, then Rt = ²Rt/² for all t so that ψ² (u) = ψ(u/²), I.e., the asymptotics u → ∞ and ² → 0 are the same. 3. The slow Markov walk limit is appropriate if p(x) does not vary too much compared to the given mean interarrival time 1/β and the size U of the claims; one can then assume that ² = 1 is small enough for Theorem 3.3 to be reasonably precise and use e−I(u) as approximation to ψ (u). 4. As typical in large deviations theory, the logarithmic form of (3.7) only captures ‘the main term in the exponent’, but is not precise to describe the asymptotic form of ψ(u) in terms of ratio limit theorems (the precise asymptotics could be log I(u)e−I(u) or I(u)α e−I(u) , say, rather than e−I(u) ).
3a
Examples
Before giving the proofs of Theorems 3.2, 3.3, we consider some simple examples. First, we show how to rewrite the explicit solution for ψ(u) in Corollary 1.9 in terms of I(u) when the claims are exponential: Example 3.4 Consider again the exponential case B(x) = e−δx as in Corollary 1.9. Then γ(x) = δ − β/p(x), and Z
Z
u
u
γ(x) dx = δu − β 0
0
p(x)−1 dx = δu − βω(u).
230
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Integrating by parts, we get Z ∞ © ª β 1 = 1+ exp βω(x) − δx dx γ0 p(x) Z0 ∞ © ª dβω(x) = 1+ exp βω(x) − δx dx dx 0 Z ∞ £ © ª¤∞ © ª = 1 + exp βω(x) − δx 0 + δ exp βω(x) − δx dx 0 Z ∞ −I(x) = 1+0−1 + δ e dx, 0
1 γ0
Z
Z
∞
g(x) dx = u
= =
∞
© ª β exp βω(x) − δx dx p(x) u Z ∞ £ © ª¤∞ © ª exp βω(x) − δx u + δ exp βω(x) − δx dx u Z ∞ © ª © ª δ exp βω(x) − δx dx − exp βω(u) − δu , u
and hence R∞ ψ(u) =
u
e−I(y) dy − e−I(u) /δ R∞ = e−I(u) e−I(y) dy 0
R∞ 0
Ry
e− 0 γ(x+u) dx dy − 1/δ . (3.8) R ∞ − R y γ(x)dx dy e 0 0 2
We next give direct derivations of Theorems 3.2, 3.3 in the particularly simple case of diffusions: Example 3.5 Assume that {Rt } is a diffusion on [0, ∞) with drift µ(x) and variance σ 2 (x) > 0 at x. The appropriate definition of the local adjustment coefficient γ(x) is then as the one 2µ(x)/σ 2 (x) for the locally approximating Brownian motion. It is well known (see Theorem XIII.4.4 or Karlin & Taylor [522, pp. 191–195]) that R ∞ −I(y) R ∞ − R y γ(x+u)dx e dy e 0 dy ψ(u) = Ru∞ −I(y) = e−I(u) 0R ∞ − R y γ(x)dx . 0 e dy e dy 0 0
(3.9)
If γ(x) is increasing, applying the inequality γ(x + u) ≥ γ(x) yields immediately the conclusion of Theorem 3.2. For Theorem 3.3, note first that the appropriate
3. THE LOCAL ADJUSTMENT COEFFICIENT
231
slow Markov walk assumption amounts to µ² (x) = µ(x), σ²2 (x) = ²σ 2 (x) so that γ² (x) = γ(x)/², I² (u) = I(u)/², and (3.9) yields (3.10)
−² log ψ² (u) = I(u) + A² − B² , where
³Z
∞
A² = ² log
e
−
Ry 0
γ(x)dx/²
³Z
´ dy ,
B² = ² log
∞
e−
Ry 0
γ(x+u)dx/²
´ dy .
0
0
The analogue of (3.5) is inf x≥0 γ(x) > 0 which implies that the integral in the definition of A² converges to 0. In particular, the integral is bounded by 1 eventually and hence lim sup A² ≤ lim sup ² log 1 = 0. Choosing y0 , γ0 > 0 such that γ(x) ≤ γ0 for y < y0 , we get Z ∞ R Z y0 y ² ² e− 0 γ(x)dx/² dy ≥ (1 − e−y0 γ0 /² ) ∼ . e−yγ0 /² dy = γ0 γ0 0 0 This implies lim inf A² ≥ lim ² log ² = 0 and A² → 0. Similarly, B² → 0, and (3.7) follows. 2 The analogue of Example 3.5 for risk processes with exponential claims is as follows: Example 3.6 Assume that B is exponential with rate δ. Then the solution of the Lundberg equation is γ ∗ = δ − β/p∗ so that Z u 1 I(u) = δu − β dx. p(x) 0 Note that this expression shows up also in the explicit formula for ψ(u) in the form given in Example 3.4. Ignoring 1/δ in the formula there, this leads to (3.6) exactly as in Example 3.5. Further, the slow Markov walk assumption means δ² = δ/², β² = β/². Thus γ² (x) = γ(x)/² and (3.10) holds if we redefine A² as ´ ³Z ∞ R y A² = ² log e− 0 γ(x)dx/² dy − ²/δ 0
and similarly for B² . As in Example 3.5, lim sup A² ≤ lim sup ² log(1 − 0) = 0 . ²→0
²→0
By (3.5) and γ ∗ = δ − β/p∗ , we have δ > γ0 and get ³ ³1 1 ´´ − ≥ 0. lim inf A² ≥ lim ² log ² γ0 δ Now (3.7) follows just as in Example 3.5.
2
232
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
We next investigate what the upper bound (or approximation) e−I(u) looks like in the case p(x) = p + ix (interest) subject to various forms of the tail B(x) of B. Of course, γ(x) is typically not explicit, so our approach is to determine standard functions G1 (u), . . . , Gq (u) representing the first few terms in the asymptotic expansion of I(u) as u → ∞. I.e., Gi (u) → ∞,
Gi+1 (u) = o(1), Gi (u)
¡ ¢ I(u) = G1 (u) + · · · + Gq (u) + o Gq (u) .
It should be noted, however, that the interchange of the slow Markov walk limit ² → 0 and the limit u → ∞ is not formally justified and in fact, the slow Markov walk approximation deteriorates as x becomes large. Nevertheless, the results are suggestive in their form and much more explicit than anything else in the literature. Example 3.7 Assume that B(x) ∼ c1 xα−1 e−δx ,
x→∞
(3.11)
with α > 0. This covers mixtures or convolutions of exponentials or, more generally, phase-type distributions (Example I.2.4) or gamma distributions; in the phase-type case, the typical case is α = 1 which holds, e.g., if the phase b → generator is irreducible (Proposition IX.1.8). It follows from (3.11) that B[s] ∞ as s ↑ δ and hence γ ∗ ↑ δ as p∗ → ∞. More precisely, Z ∞ ¢ c1 δΓ(α) ¡ b B[s] = 1+s esx B(x)dx = 1 + 1 + o(1) α (δ − s) 0 as s ↑ δ, and hence (3.1) leads to (δ − γ ∗ )α ≈
βc1 Γ(α) , p∗ Z
I(u) ≈ δu − c2 0
u
γ ∗ ≈ δ − c2 p∗
−1/α
,
¡ ¢1/α c2 = βc1 Γ(α) ,
δu 1 δu − c3 log u dx ≈ (p + ix)1/α δu − c4 u1−1/α
where c3 = c2 /i, c4 = c2 i−1/α /(1 − 1/α).
α<1 α=1 α>1
, 2
Example 3.8 Assume next that B has bounded support, say 1 is the upper limit and B(x) ∼ c5 (1 − x)η−1 , x ↑ 1, (3.12)
3. THE LOCAL ADJUSTMENT COEFFICIENT
233
with η ≥ 1. For example, η = 1 if B is degenerate at 1, η = 2 if B is uniform on (0, 1) and η = k + 1 if B is the convolution of k uniforms on (0, 1/k). Here b is defined for all s and B[s] Z b −1 B[s]
= ≈
1
Z s
s
e B(x) dx = e e−y B(1 − y/s) dy 0 0 Z c5 es ∞ −y η−1 c5 es Γ(η) e y dy = sη−1 0 sη−1
s
sx
∗
η
as s ↑ ∞. Hence (3.1) leads to βc5 eγ Γ(η) ∼ γ ∗ p∗ , γ ∗ ≈ log p∗ + η log log p∗ ,
I(u) ≈ u(log u + η log log u). 2
Example 3.9 As a case intermediate between (3.11) and (3.12), assume that B(x) ∼ c6 e−x
2
/2c7
, x ↑ ∞.
(3.13)
We get Z
b −1 B[s]
≈ =
Z ∞ 2 2 dx = c6 sec7 s /2 e−(x−c7 s) /2c7 dx 0 0 ³ s ´ √ √ 2 c7 s2 /2 c6 s 2πc7 e Φ √ ∼ c6 s 2πc7 ec7 s /2 , c7 p p ∼ log p∗ , γ ∗ ∼ c8 log p∗ , I(u) ≈ c8 u log u, c6 s
∞
2
esx e−x
/2c7
c7 ∗2 γ 2 p where c8 = 2/c7 .
3b
2
Proof of Theorem 3.2
We first remark that the definition (3.4) of the local adjustment coefficient is not the only possible one: whereas the motivation for (3.4) is the formula 1 b − 1) − sp(u), h ↓ 0, log Eu es(Rh −u) ∼ β(B[s] h
(3.14)
for the m.g.f. of the increment in a small time interval [0, h], one could also have considered the increment ru (T1 )−u−U1 up to the first claim (here ru (·) denotes the solution of r˙ = p(r) starting from ru (0) = u). This leads to an alternative local adjustment coefficient γ0 (u) defined as solution of Z ∞ b 0 (u)] · 1 = Eeγ0 (u)(U1 +u−ru (T1 )) = B[γ βe−βt eγ0 (u)(u−ru (t)) dt. (3.15) 0
234
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Proposition 3.10 Assume that p(x) is a non-decreasing function of x. Then: (a) γ(x) and γ0 (x) are also non-decreasing functions of x; (b) γ(x) ≤ γ0 (x). Proof. That γ(x) is non-decreasing follows easily by inspection of (3.4). The assumption implies that ru (t) − u is a non-decreasing function of u. Hence for u < v, 1 =
Eeγ0 (u)(U1 +u−ru (T1 )) ≥ Eeγ0 (u)(U1 +v−rv (T1 )) .
By convexity of the m.g.f. of U1 + v − rv (T1 ), this is only possible if γ0 (v) ≥ γ0 (u). For (b), note that the assumption implies that ru (t) − u ≥ tp(u). Hence 1
= =
0
≤
Eeγ0 (u)(U1 +u−ru (T1 )) ≤ Eeγ0 (u)(U1 −p(u)T1 ) £ ¤ β b γ0 (u) B , β + γ0 (u)p(u) ¡ ¢ b 0 (u)] − 1 − γ0 (u)p(u). β B[γ
Since (3.4) considered as function of γ is convex and equals 0 for γ = 0, this is only possible if γ0 (u) ≥ γ(u). 2 We prove Theorem 3.2 in terms of γ0 ; the case of γ then follows immediately by Proposition 3.10(b): Theorem 3.11 Assume that p(x) is a non-decreasing function of x. Then Ru
ψ(u) ≤ e− 0 γ0 (x) dx . (3.16) ¡ ¢ Proof. Define ψ (n) (u) = P τ (u) ≤ σn as the ruin probability after at most n claims (σn = T1 + · · · + Tn ). We shall show by induction that ψ (n) (u) ≤ e−
Ru 0
γ0 (x) dx
,
(3.17)
from which the theorem follows by letting n → ∞. The case n = 0 is clear since (0) here ¡ T0 = 0 so that ψ¢ (u) = 0. Assume (3.17) shown for n and let Fu (x) = P U1 + u − ru (T1 ) ≤ x . Separating after whether ruin occurs at the first claim or not, we obtain ψ (n+1) (u) ≤ ≤ =
Z u 1 − Fu (u) + ψ (n) (u − x)Fu (dx) −∞ Z ∞ Z u R u−x Fu (dx) + e− 0 γ0 (y)dy Fu (dx) u −∞ ½Z ∞ R ¾ Z u R Ru u u e− 0 γ0 (x)dx e 0 γ0 (y)dy Fu (dx) + e u−x γ0 (y)dy Fu (dx) . u
−∞
3. THE LOCAL ADJUSTMENT COEFFICIENT
235
the cases x ≥ 0R and x < 0 separately, it is easily seen that RConsidering u u γ (y)dy ≤ xγ0 (u). Also, 0 γ0 (y)dy ≤ uγ0 (u) ≤ xγ0 (u) for x ≥ u. Hence 0 u−x Z u nZ ∞ o Ru ψ (n+1) (u) ≤ e− 0 γ0 (x)dx exγ0 (u) Fu (dx) + exγ0 (u) Fu (dx) =
e−
=
e−
Ru 0
Ru 0
u
γ0 (x)dx
£ ¤ Fbu γ0 (u)
γ0 (x)dx
,
−∞
where the last identity immediately follows from (3.15); we used also Proposition 3.10(a) for some of the inequalities. 2 It follows from Proposition 3.10(b) that the bound provided by Theorem 3.11 is sharper than the one given by Theorem 3.2. However, γ0 (u) appears more difficult to evaluate than γ(u). Also, for either of Theorems 3.2, 3.11 be reasonably tight something like the slow Markov walk conditions in Theorem 3.3 is required, and here it is easily seen that γ0 (u) ≈ γ(u). For these reasons, we have chosen to work with γ(u) as the fundamental local adjustment coefficient.
3c
Proof of Theorem 3.3
© (²) ª The idea of the proof is to bound Rt above and below in a small interval [x − x/n, x + x/n] by two classical risk processes with a constant p and appeal to the classical results (3.2), (3.3). To this end, define uk,n =
k u, n
pk,n =
sup
p(x),
uk−1,n ≤x≤uk+1,n
pk,n =
inf
uk−1,n ≤x≤uk+1,n
p(x),
and, in accordance with the notation ψ² (u), ψp∗∗ (u), let ψp∗∗ ;² (u) denote the ruin probability for the classical model with β replaced by β/² and Ui by ²Ui . Lemma 3.12 lim sup²↓0 −² log ψ² (u) ≤ I(u). © (²) ª Proof. For ruin to occur, Rt (starting from u = un,n ) must first downcross un−1,n . The probability of this is at least φp∗n,n ;² (u/n), the probability that ruin occurs in the Cram´er-Lundberg model with p∗ = pn,n (starting from u/n) without that 2u/n is upcrossed before ruin. Further, given downcrossing occurs, © (²) ª the value of Rt at the time of downcrossing is < un−1,n so that ψ² (u)
≥ φ∗pn,n ;² (u/n) ψ² (un−1,n ) ≥ φ∗pn,n ;² (u/n) φ∗pn−1,n ;² (u/n) ψ² (un−2,n ) ≥ ... ≥
n Y k=1
φ∗pk,n ;² (u/n) .
236
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Now as ² ↓ 0,
ψp∗∗ ;² (u) = ψp∗∗ (u/²) ∼ C ∗ e−γ
∗
u/²
,
where the first equality follows by an easy scaling argument and the approximation by (3.3). Let Ck,n , γ k,n be C ∗ , resp. γ ∗ evaluated for p∗ = pk,n ; in particular, since γ ∗ is an increasing function of p∗ , also γ k,n =
sup
γ(x).
uk−1,n ≤x≤uk,n
Clearly, ψp∗∗ ;² (u/n) − φ∗p∗ ;² (u/n) ≤ φp∗k,n ;² (u/n) ≥ ∼ =
ψp∗∗ ;² (2u/n) , ψp∗k,n ;² (u/n) − ψp∗k,n ;² (2u/n) ¡ ¢ Ck,n e−γ k,n u/²n 1 − e−γ k,n u/²n ¡ ¢ Ck,n e−γ k,n u/²n 1 + o(1) ,
where o(1) refers to the limit ² ↓ 0 with n and u fixed. It follows that − log ψ² (u)
≤ −
n X
log φ∗pk,n ;² (u/n)
k=1
=
n n X u X γ k,n − log Ck,n + o(1), ²n
≤
n uX γ k,n . n
k=1
lim sup −² log ψ² (u) ²↓0
k=1
k=1
Letting n → ∞ and using a Riemann sum approximation completes the proof. 2 Theorem 3.3 now follows easily in case (a). Indeed, in obvious notation one has γ² (x) = γ(x)/², so that Theorem 3.2 gives ψ² (u) ≤ e−I(u)/² ⇒ lim inf −² log ψ² (u) ≥ I(u). ²↓0
Combining with the upper bound of Lemma 3.12 completes the proof. In case (b), we need the following condition: Condition 3.13 There exists a r.v. V < ∞ such that (i) for any u < ∞ there exist Cu < ∞ and δ(u) > supx≤u γ(x) such that P(V > x) ≤ Cu e−δ(u)x ;
(3.18)
3. THE LOCAL ADJUSTMENT COEFFICIENT
237
(ii) the family of claim overshoot distributions is stochastically dominated by V , i.e. for all x, y > 0 it holds that ¯ ¡ ¢ B(x + y) P U > x + y¯U > x = ≤ P(V > y). B(x) To complete the proof, let v ≤ u and define © ª (²) (²) τ (²) (u, v) = inf t > 0 : Rt < v | R0 = u ,
(3.19)
(²)
ξ (²) (u, v) = v − Rτ (²) (u,v) .
Then ψ² (u) £ ¡ ¢ ¤ = E ψ² Rτ (²) (u,u/n) ; τ (²) (u, u/n) < ∞ £ ¡ ¢ ¤ = E ψ² u/n − ξ (²) (u, u/n) ; τ (²) (u, u/n) < ∞ £ ¡ ¢¯ ¤ ¡ ¢ = E ψ² u/n − ξ (²) (u, u/n) ¯τ (²) (u, u/n) < ∞ · P τ (²) (u, u/n) < ∞ ¡ ¢ ≤ Eψ² (u/n − ²V ) · P τ (²) (u, u/n) < ∞ . Write Eψ² (u/n − ²V ) = E1 + E2 , where E1 is the contribution from the event that the process does not reach level 2u/n before ruin and E2 is the rest. Then the standard Lundberg inequality yields E1
Eψp∗
≤
(u/n − ²V ) = Eψp∗ (u/²n − V ) 1,n ¤ u/²n £ γ1,n V −γ 1,n E e ; V ≤ u/²n + P(V > u/²n) e
=
e
≤
1,n
−γ
1,n
;²
u/²n
O(1)
(using (3.18) for the last equality). For E2 , we first note that the number of (²) downcrossings of 2u/n starting from R0 = 2u/n is bounded by a geometric r.v. N with
EN ≤
1 1−
∗ ψinf x≥2u/n p(x);²
(0)
=
inf x≥2u/n p(x) = O(1), inf x≥2u/n p(x) − βEU
cf. (3.5) and the standard formula for ψ(0). The probability of ruin in between two downcrossings is bounded by Eψp∗
1,n
so that E2 ≤ e
−2γ
;²
1,n
(2u/n − ²V ) = e
u/²n
O(1),
−2γ
1,n
u/²n
−γ
E1 + E2 ≤ e
O(1)
1,n
u/²n
O(1).
238
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Hence lim inf −² log ψ² (u) ²↓0 © ¡ ¢ª ≥ lim inf −² log(E1 + E2 ) + log P τ (²) (u, u/n) < ∞ ²↓0
≥
¡ ¢ u γ + lim inf −² log P τ (²) (u, u/n) < ∞ ²↓0 n 1,n
.. . n
≥
uX γ . n i=1 i,n
Another Riemann sum approximation completes the proof.
2
Notes and references With the exception of Theorem 3.1, the results are from Asmussen & Nielsen [92]; they also discuss simulation based upon ‘local exponential change of measure’ for which the likelihood ratio is n Z Lt = exp −
o
t
γ(Rs− ) dRs 0
n Z = exp −
t
γ(Rs )p(Rs ) ds + 0
Nt X
o γ(RTi − )Ui .
i=1
An approximation similar to (3.7) for ruin probabilities in the presence of an upper barrier b appears in Cottrell et al. [263], where the key mathematical tool is the deep Wentzell-Freidlin theory of slow Markov walks (see e.g. Bucklew [207]). Djehiche [324] gives an approximation for ψ(u, T ) = Pu (inf 0≤t≤T Rt < 0) via related large deviations techniques. Comparing these references with the present work shows that in the slow Markov walk set-up, the risk process itself is close to the solution of the differential equation r(x) ˙ = −κ0 (x, 0) (= p(x) − βEU ) (3.20) (with κ(x, s) as in (3.4) and the prime meaning differentiation w.r.t. s), whereas the most probable path leading to ruin is the solution of ` ´ r(x) ˙ = −κ0 x, γ(x) (3.21) (the initial condition is r(0) = u in both cases). Whereas the result of [324] is given in terms of an action integral which does not look very explicit, one can in fact arrive at the optimal path by showing that the approximation for ψ(u, T ) is maximized over T by taking T as the time for (3.21) to pass from u to 0; the approximation (3.7) then comes out (at least heuristically) by analytical manipulations with the action integral. Similarly, it might be possible to show that the limits ² ↓ 0 and b ↑ ∞ are interchangeable in the setting of [263]. Typically, the rigorous implementation of these ideas via large deviations techniques would require slightly stronger smoothness conditions on p(x) than ours and conditions somewhat different from Condition 3.13, b to be defined for all s > 0 (thus excluding, e.g., the the simplest being to require B[s]
4. THE MODEL WITH TAX
239
exponential distribution). We would like, however, to point out as a maybe much more important fact that the present approach is far more elementary and self-contained than that using large deviations theory. For different types of applications of large deviations to ruin probabilities, see XIII.3. Asymptotic results for surplus-dependent premium under heavy-tailed claims are given in Section X.5.
4
The model with tax (ϑ)
Consider now a compound Poisson risk process Rt with constant premium income intensity (1 − ϑ) p (0 < ϑ ≤ 1) whenever the risk process is in its © (ϑ) ª (ϑ) running maximum Mt = max Rs , 0 ≤ s ≤ t and constant premium income intensity p otherwise. So the dynamics of the risk process are given by ( (ϑ) (ϑ) p dt − dAt , if Rt < Mt , (ϑ) dRt = (4.1) (ϑ) (ϑ) (1 − ϑ) p dt − dAt , if Rt = Mt , P Nt Ui are the aggregate claims up to time t. As outlined in Exwhere At = i=1 ample 1.4, a natural interpretation for this model is that the insurance company needs to pay tax at rate ϑ whenever the risk process is at a new record height (which is considered to be profit) and does not need to pay tax if it is below the running maximum, as then the incoming premium is needed to amortize the previous claim payments until a new running maximum is reached. But one can also simply think of a profit-participation in terms of dividend payments to shareholders according to the above scheme. Figure VIII.2 depicts a sample path of the resulting risk process. Rt
u
t
Figure VIII.2 The resulting ruin probability ψϑ (u) has a strikingly simple relation to the ruin probability ψ(u) = ψ0 (u) of the original risk process.
240
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Theorem 4.1 In case of positive safety loading η > 0 and ϑ < 1, ψϑ (u) < 1 holds for all u ≥ 0. In particular, in this case ¡ ¢1/(1−ϑ) 1 − ψϑ (u) = 1 − ψ0 (u) .
(4.2)
Proof. Recall from Theorem II.2.3 that the survival probability φ(u) = 1 − ψ(u) in the classical compound Poisson risk model can be interpreted as the probability to have zero events during [u, ∞) of an inhomogeneous Poisson process with rate β(s) = β/p P(Vmax > s), where Vmax denotes the maximum workload of an M/G/1 queue.4 But now one realizes that the survival probability with tax φϑ (u) can also be interpreted in a similar way, since when we cut out the excursions away from the running maximum that do not lead to ruin (which are identical to those witho ut tax), then a straight line with slope p(1 − ϑ) remains. After rescaling to slope 1, the probability to survive is to have no events during ¡ ¢ [u, ∞) of the inhomogeneous Poisson process with rate β(s) = β/ p(1 − ϑ) P(Vmax > s), where Vmax is again the maximum workload of the original M/G/1 queue. In view of (2.5) from Chapter II, this leads to Z ∞ ³ ´ ¡ ¢1/(1−ϑ) β φϑ (u) = exp − P(Vmax > s) ds = φ0 (u) . p(1 − ϑ) u 2 Remark 4.2 If one defines φϑ (u, v) for u < v as the probability that, starting from level u at time 0, the process reaches level v before ruin occurs (clearly φϑ (u) = φϑ (u, ∞)), then — along the same line of arguments as above — we have Z v ³ ´ ¡ ¢1/(1−ϑ) β φϑ (u, v) = exp − P(Vmax > s) ds = φ0 (u, v) . (4.3) p(1 − ϑ) u 2 It is now straightforward to extend identity (4.2) to a surplus-dependent tax rate. Corollary 4.3 If the tax rate ϑ(r) (0 ≤ ϑ(r) < 1) depends on the current surplus level Rt = r, then the corresponding survival probability φΓ (u) is given by ³ Z ∞³ d ´ ´ 1 φΓ (u) = exp − (4.4) log φ0 (s) ds . ds 1 − ϑ(s) u 4 In Theorem II.2.3 we had p = 1. Here we have a general p, so we first need to rescale time by the factor p, i.e. the Poisson process with intensity β/p and the new premium rate 1 leads to the same φ(u) as the original process, but now can be linked with the M/G/1 queue.
4. THE MODEL WITH TAX
241
Proof. In this case φΓ (u) is the probability to have zero ¡ events during ¢ [u, ∞) of an inhomogeneous Poisson process with rate β(s) = β/ p(1 − ϑ(s)) P(Vmax > s), where Vmax is again the maximum workload of a busy period in a classical M/G/1 queue. Now just again invoke Theorem II.2.3. 2 Remark 4.4 From (4.4) one sees that even in the case ϑ(r) → 1 as r → ∞ there can be a positive probability of survival, as long as the convergence rate is sufficiently low. 2 Consider finally a further generalization of the risk process given by the surplus-dependent dynamics ½ p1 (Rtg ) dt − dAt , if Rtg < Mtg , dRtg = (4.5) p2 (Rtg ) dt − dAt , if Rtg = Mtg . Denote with q(u) the probability that if a claim occurs in the running maximum u, then ruin occurs before Rtg reaches level u again (note that q(u) depends on p1 (·), but not on p2 (·)). Then, the same reasoning as above (where now q(u) takes the role of P(Vmax > u)) shows that the survival probability is given by Z ∞ ³ ´ q(s) g φ (u) = exp −β ds . (4.6) p2 (s) u It immediately follows that if p2 (s) = (1 − ϑ)p1 (s), then the tax identity (4.2) holds again, where ψ0 (u) then refers to the ruin probability of the risk process with premium rule p1 (x) for all x ≥ 0. In particular, this shows that the tax identity also holds for the compound Poisson risk process with interest (where p1 (x) = p + ix) discussed in Section 2. As a by-product, one obtains with p1 (x) = p2 (x) = p + ix that the ruin probability of the classical risk process with constant interest (without tax) can be expressed as Z ∞ ³ ´ q(s) ψ(u) = 1 − exp −β ds , p + is u which can be compared with (1.6). It then remains, however, to identify an explicit expression for the quantity q(u). Notes and references The tax model was introduced in Albrecher & Hipp [28], where the identity (4.2) was derived by a different approach. The simpler proof given here is based on Albrecher, Borst, Boxma & Resing [16], where also the treatment of the surplus-dependent tax rate can be found. Albrecher, Renaud & Zhou [35] used excursion theory to extend the identity (4.2) to arbitrary spectrally negative L´evy processes and also generalized a formula from [28] for the moments of the accumulated discounted tax payments until ruin in terms of scale functions. Kyprianou & Zhou [569]
242
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
then further extended this approach to surplus-dependent tax rates and quantities like the time of ruin, the deficit at ruin and the surplus prior to ruin in the tax model; see also Renaud [736]. A more direct analysis of these latter quantities in the compound Poiss on setting with tax can be found in Ming & Wang [645] and absolute ruin under the tax payment scheme is studied in Ming, Wang & Xao [646]. A treatment of the tax problem for the model (4.5) can be found in Wei [878], where (4.6) is derived by a direct differential argument and in Wang et al. [868], where the accumulated discounted tax payments until ruin is considered. For an extension to a Markov-modulated model, see Wei, Yang & Wang [877]. A slightly different model is considered in Hao & Tang [448], where the authors give a fine asymptotic study of the ruin probabilities of a spectrally negative L´evy risk model that is subject to periodic taxation on its net gains during each period. The effect of tax payments on a non-Markovian risk process is investigated in Albrecher, Badescu & Landriault [15] in the context of the dual risk model, in which the sign of the premium income and the aggregate claims are reverted. The simple tax identity (4.2) then does not hold anymore, but a similar relationship holds for arbitrary interarrival times and exponential jump sizes.
5
Discrete-time ruin problems with stochastic investment
We consider a discrete-time risk reserve process R0 , R1 , . . . given by R0 = u > 0 and the recursion Rn = An Rn−1 − Bn , (5.1) where {An }, {Bn } are independent sequences each consisting of i.i.d. r.v.’s and An > 0. The interpretation is that the reserve is invested in risky assets yielding a stochastic interest rate of An − 1 in period n, whereas Bn is the claim surplus, that is, the difference between claims and premiums received. The reserve may decrease if either An < 1 or Bn > 0, so that financial risk enters via the An and traditional insurance risk via the Bn . As usual, the ruin time τ (u) corresponding to R0 = u is the first n with Rn < 0, and the ruin probability ψ(u) is the probability that Rn < 0 for some n. To avoid trivialities, we assume P(Bn > 0) > 0 since otherwise ψ(u) = 0 for all u > 0, and also P(An < 1) > 0 since otherwise there is no investment risk. A first question is when ψ(u) = 1 for all u and when not. One could expect the first possibility to occur when EA1 < 1 but not when EA1 > 1 (then one would expect Rn → ∞ with positive probability). However, the relevant criterion is in terms of E log An : Proposition 5.1 Assume E log |Bn | < ∞. If E log An < 0, then ψ(u) = 1 for all u > 0. If E log An > 0, then ψ(u) < 1 for all large u > 0.
5. DISCRETE-TIME RUIN WITH STOCHASTIC INVESTMENT
243
Proof for E log An < 0. First note that for Rn−1 = x > 0, we have
¡ ¢ log Rn+ = log An + log x + log(1 − Bn /x)+ ≤ log An + log x + log 1 + |Bn |/x . ¡ ¢ By assumption, there exists x0 such that E log An + E log 1 + |Bn |/x ≤ 0 for all x > x0 . I.e., ¯ £ ¤ E log Rn+ − log x+ ¯ Rn−1 = x ≤ 0 for all x > x0 . By standard recurrence criteria for Markov processes ([APQ, p. 21), this implies that Rn cannot go to ∞ so that some interval of the form [0, x1 ] is visited i.o. by {Rn+ }. Since (unless for trivial cases) inf 0≤u≤x1 ψ(u) > 0, a geometric trial argument therefore gives ψ(u) = 1. 2 The proof for the case E log An > 0 will be given after Proposition 5.3. In view of Proposition 5.1, we henceforth assume E log |Bn | < ∞ and E log An > 0. This implies in particular P(An > 1) > 0 (recall that we also assumed P(An < 1) > 0). We next note some representations of Rn and the ruin time, which are similar to some from Section 2 in the constant interest rate case (with the −Y chain taking the role of the Z process there). −1 ∗ Proposition 5.2 Define Dn = A−1 1 · · · An , Rn = Dn Rn and
Yn = D1 B1 + D2 B2 + · · · + Dn Bn =
n X
Dk Bk .
k=1
Then
Rn∗ = u − Yn , τ (u) = inf{n ≥ 1 : Yn > u} .
(5.2)
A−1 k
Note that is simply the discounting factor for period k and Dn the one for the totality of periods 1, . . . , n. Thus Rn∗ is simply the present value of the reserve, and the formula Rn∗ = u − Yn tells that, as should be, this is the initial reserve minus the present value of claim surpluses from the different periods. ∗ Proof. We can rewrite (5.1) (with n replaced by k) as Rk∗ − Rk−1 = −Dk Bk . Thus n X ∗ Rn∗ = u − (Rk∗ − Rk−1 ) = u − Yn . k=1
From this the claim on τ (u) follows by noting that Rn < 0 if and only if Rn∗ < 0, because Ak > 0. 2 −1 ∗ Proposition 5.3 Assume A−1 1 > 0, µ = E log A1 < 0 and E log |B1 | < ∞. P∞ a.s. Then the r.v. Y = 1 Dn Bn satisfies P(−∞ < Y < ∞) = 1, and Yn → Y as n → ∞.
244
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES ∗
Proof. We have a.s. that Dn = eµ n(1+o(1)) . Furthermore, a standard application of the Borel-Cantelli lemma shows that E log |Bn | < ∞ ensures that for all c1 one has log |Bn | > nc1 , i.e. |Bn | > enc1 , only for finitely many n. Choosing c1 < −µ∗ , it follows that the terms in the series in (5.3) decay at least geometrically fast, which implies the assertions. 2 As a corollary, we can give the Proof of Proposition 5.1 when E log An > 0. Note that ψ(u) = P(Yn > u for some n) ≤ P
∞ ³X
´ Di Bi > u .
i=1
By the above, the sum is a finite r.v., and therefore the r.h.s. goes to 0 as u → ∞. 2 The ruin probability can be represented in terms of Y as follows: Theorem£5.4 Define ¯ H(u) = ¤P(Y > u). Then ψ(u) = H(u)/C1 (u) where C1 (u) = E H(Rτ (u) ) ¯ τ (u) < ∞ . Proof. For brevity, write τ = τ (u). On {τ < ∞} we have u − Y = u − Yτ − (Y − Yτ ). Here Y − Yτ =
∞ X
Di Bi = Dτ
i=τ +1
where Ye =
∞ X Dτ +i i=1
Dτ
∞ X Dτ +i i=1
Bi+τ =
∞ X
Dτ
Bτ +i = Dτ Ye
−1 A−1 τ +1 · · · Aτ +i Bτ +i
i=1
is a copy of Y independent of τ and Rτ . Thus u − Y = Dτ (Dτ−1 (u − Yτ ) − Ye ) = Dτ (Rτ − Ye ) . Since Yn → Y , we also have Yn > u for some n (and hence τ < ∞) when Y > u. Thus ¡ H(u) = P(u − Y < 0) = P Rτ − Ye < 0, τ < ∞) ¯ ¡ £ ¤ = ψ(u)P Rτ − Ye < 0 ¯ τ < ∞) = ψ(u)E H(Rτ ) | τ < ∞ . 2 D ˘ ˘ Proposition 5.5 The r.v. Y satisfies Y = A−1 1 (B1 + Y ) where Y is a copy of Y which is independent of A1 , B1 .
5. DISCRETE-TIME RUIN WITH STOCHASTIC INVESTMENT
245
Proof. Take Y˘ =
∞ X
−1 A−1 2 . . . A i Bi .
2
i=2
The representation in Theorem 5.4 is in general quite intractable, because usually H and C1 (u) cannot be calculated. An obvious and important question is therefore to ask for tail asymptotics. The question that immediately comes up is how strongly C1 (u) depends on u. The following result shows that under suitable conditions, this dependence is weak so that the important part of the tail asymptotics is H(u) itself. Proposition 5.6 0 < lim inf u→∞
ψ(u) ψ(u) ≤ lim sup ≤ 1. H(u) u→∞ H(u)
Proof. Since −∞ < Rτ ≤ 0, we have H(0) ≤ C1 (u) ≤ 1, so all that remains to show is H(0) > 0. Assume otherwise. Then the upper point a in the support of Y satisfies −∞ < a ≤ 0. Assume first a < 0. Recall that by assumption, p1 = P(A1 ≥ 1) > 0 and/or that B1 ≤ 0 is excluded. Choose ² > 0 with p2 = P(B1 > 2²) > 0 and let p3 = P(Y > a − ²). Then p3 > 0 and hence P(Y > a + ²) = ≥
¡ ¢ ˘ P A−1 1 (B1 + Y ) > a + ² ¡ ¢ p1 P B1 + Y˘ > a + ² ≥ p1 p2 p3 > 0 .
If instead a = 0, we have similarly that P(Y > a + ²) ≥ p4 p2 p3 where p4 = P(A1 ≤ 1) > 0. In both cases, we have reached a contradiction with the definition of a. 2 It thus remains to get some hold on H(u). We shall here involve a classical result due to Kesten [531] and Goldie [421] on perpetuities. By a perpetuity one understands a r.v. of the form Ye = B1 + D1 B2 + D2 B3 + · · · =
∞ X
Di−1 Bi
(5.3)
i=1
where {An }, {Bn } are independent sequences each consisting of i.i.d. r.v.’s and −1 Dn = A−1 1 · · · An (the use of reciprocals is unusual but made to conform with the above risk theoretic setting). The result of [421, 531] states that under suitable conditions, H(u) = P(Y > u) decays like an α-power of u. Before stating the result (the proof of which is outside the scope of this book), we give as a help for intuition some heuristic steps that give a heuristic motivation of the heavy tail and allow one to identify α.
246
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Remark P∞ Tn 5.7 Let Tn be the random walk − log A1 − · · · − log AnTnso that Y = 1 e Bn . With light-tailed Bn , we expect that a single term e Bn can only be large if Tn is so. By assumption, Tn has negative drift and we will assume that the conditions of the Cram´er Lundberg approximation are satisfied. Then the probability that Tn > x for some x is approximately CT e−αx where α solves 1 = E e−α log A = E
1 . Aα
(5.4)
Choose b0 > 0 with B(b0 ) = P(Bn > b0 ) > 0. For an n with Tn > x we then have P(eTn Bn > ex b0 ) > B(b0 ). Taking x = log u − log b, it follows that P(eTn Bn > u for some n) ≥ CT e−αx B(b0 ) =
CT B(b0 )bα . uα
This motivates that Y is heavy-tailed and that the tail decays at least as a power. The first trial solution for tail asymptotics is therefore a power tail, P(Y > u) ∼ C/(1 + u)β . Assume as before that B1 is light-tailed. Then Proposition 5.5 ˘ implies that Y and A−1 1 Y have equivalent tails, i.e. C (1 + u)β
∼ = =
˘ P(Y > u) ∼ P(A−1 1 Y > u) Z ∞ Z ∞ C P(Y˘ > u/a) P(A−1 ∈ da) ∼ P(A−1 1 1 ∈ da) (1 + u/a)β 0 0 Z ∞ Caβ P(A−1 1 ∈ da) . (a + u)β 0
Multiplying by (1 + u)β and going to the limit under the integral, the r.h.s. becomes EA−β . This suggests that β = α, where α is as in (5.4). 2 Here is the result of Kesten [531] and Goldie [421]: Theorem 5.8 Assume that there exists α > 0 such that EA1 −α = 1 together with EA1 −α log− A1 < ∞ and E|B1 | < ∞. Assume further that the distribution of A−1 1 is non-lattice. Then for some C2 > 0, P(Y > u) ∼
C2 , u → ∞. (1 + u)α
(5.5)
The (untractable) expression for C2 is given in [531, 421] (it is shown in Nyrhinen [669] that C2 > 0). The proof of Theorem 5.8 is much too technical to be given here. However, up to the untractable constant we can now obtain the desired asymptotics of the ruin probability by combining with Theorem 5.4:
5. DISCRETE-TIME RUIN WITH STOCHASTIC INVESTMENT Corollary 5.9 Under the conditions of Theorem 5.8, ψ(u) ∼ particular,
247
C2 1 . In C1 (u) uα
0 < lim inf uα ψ(u) ≤ lim sup uα ψ(u) < ∞ . u→∞
u→∞
The result follows immediately by combining Theorems 5.8, 5.4 and Proposition 5.6 with the following lemma: Lemma 5.10 Under the conditions of Theorem 5.8, P(Ye > u) ∼ P(Y > u) ∼ C2 /uα . e ∗ where Ye ∗ = P∞ Bi Qn A−1 is a copy of Ye Proof. We have Y = A−1 1 Y i 1 2 independent of A1 . Rewrite Theorem 5.8 as P(Ye ∗ > y) ∼ C2 /(1 + y)α . Then also P(Ye ∗ > y) ≤ C3 (1 + y)α for all y > 0 since clearly such an inequality holds on any finite interval. Thus Z ∞ uα P(Y > u) = uα P(Ye ∗ > au) P(A1 ∈ da) 0 Z ∞ uα = P(Ye ∗ > au)(1 + au)α P(A1 ∈ da) (1 + au)α Z0 ∞ 1 → C2 α P(A1 ∈ da) = C2 a 0 by dominated convergence.
2
Remark 5.11 The reason that Corollary 5.9 gives a heavier tail asymptotics than in Section 2 is not so much that the interest is random, but that it is inherent in the set-up that negative returns are possible. Namely, if A1 ≥ 1 (and is not degenerate at 1), then EA−α is always < 1 so the conditions of 1 Corollary 5.9 cannot hold. 2 Remark 5.12 Nyrhinen [669] gives conditions under which C1 (u) in Corollary 5.9 is not significant in terms of logarithmic asymptotics. 2 Notes and references Rather than assuming that {An }, {Bn } are independent sequences each consisting of i.i.d. r.v.’s, much of the literature relaxes this to the case that (An , Bn ) being i.i.d. I.e. some dependence between An and Bn is allowed. See, for example, Nyrhinen [669, 668]. For models where the independence among the Aj themselves or among the Bj is relaxed see e.g. Cai [212], Cai & Dickson [214], Goovaerts et al. [424], Weng, Zhang & Tan [881], Shen, Lin & Zhang [796] and Collamore [252]. The recursion Rn = An (Rn−1 − Bn ) also has some relevance as a model for the risk reserve in the presence of investments. The results are much as for (5.1), but will not be given here, see again Nyrhinen [669, 668].
248
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
Tail asymptotics for finite horizon ruin probabilities ψ(u, n) in a setting where n goes to infinity with u and either A−1 or B1 (or both) are heavy-tailed are given in 1 Tang & Tsitsiashvili [830, 831]. For extensions to other ruin-related quantities see Yang & Zhang [903]. An important early paper is Paulsen [680]. Paulsen [682] surveys the literature up to 1998 and Paulsen [684] in the decade after that.
6
Continuous-time ruin problems with stochastic investment
Results for continuous-time models with stochastic investment can be obtained as a suitable limit of corresponding discrete-time set-ups (see the Notes). However, continuous-time models often also enable a direct analysis that can have a quite different flavor from its discrete counterpart. In this section this will be illustrated on a heuristic level for the case of a risk reserve process of compound Poisson type (with Poisson intensity β), where all the reserve is continuously invested in a financial market of Black-Scholes type, i.e. the risky asset is a geometric Brownian motion. More precisely, the resulting reserve is given by Z t Z t Nt X Rt = u + t − Ui + a Rs− ds + σ Rs− dBs , i=1
0
0
where {Bt } is standard Brownian motion, σ is the volatility and a is the drift of a geometric Brownian motion. In view of the generators for the diffusion and the compound Poisson process derived in Examples II.4.1 and II.4.2 one observes that the generator of the resulting risk process is given by Z ∞ ¡ ¢ σ 2 2 00 Af = au f 0 (u) + u f (u) + f 0 (u) + β f (u − x) − f (u) B(dx). 2 0 Using Itˆo’s Lemma, one can now show that if a twice continuously differentiable and bounded function f (u) with limu→∞ f (u) = 0 satisfies Af (u) = 0 for u > 0 and f (u) = 1 for u < 0, then f (u) must be the ruin probability ψ(u) of the process. Hence ψ(u) satisfies Z u σ 2 u2 00 au ψ 0 (u)+ ψ (u)+ψ 0 (u)−β ψ(u)+β ψ(u−x) B(dx)+βB(u) = 0. (6.1) 2 0 with limu→∞ ψ(u) = 0.5 In this way the problem of studying the ruin probability with stochastic investment has been reduced to the purely analytical problem of solving an integro-differential equation. 5 Note that for σ = 0 the investment is riskless and we get back to the risk model with constant interest rate (cf. (1.11) with p(u) = p + a u).
6. CONTINUOUS-TIME RUIN WITH STOCHASTIC INVESTMENT
249
Example 6.1 Assume that the claim size distribution is exponential(ν). Then one can add the derivative of (6.1) to (6.1) multiplied by ν to get rid of the convolution term,6 which leads to ¡ ¢ σ 2 u2 000 ψ (u) + au + σ 2 u + 1 + νσ 2 u2 /2 ψ 00 (u) + (a − β + uaν + ν) ψ 0 (u) = 0 2 with additional boundary condition ψ 0 (0) = βψ(0). After substituting ψ 0 (u) by another function, this is in fact a second-order ODE with polynomial coefficients which can be solved analytically in terms of special functions (of Heun type). Although the resulting formula is explicit, it is quite lengthy and we do not state it here. 2 Looking at the drift of the geometric Brownian motion, one can show that for σ 2 ≥ 2a, ψ(u) = 1 holds for all u ≥ 0 (cf. e.g. Paulsen [681] or Pergamenshchikov & Zeitouny [691]), so it is enough to restrict to σ 2 < 2a. In general, it is impossible to obtain an explicit solution of the above IDE, but one can retrieve asymptotic results as u → ∞ for a large class of claim size distributions. Theorem 6.2 Assume that the free reserve in the Cram´er-Lundberg model is invested in a financial asset that is modeled by a geometric Brownian motion with drift a > 0 and volatility σ > 0 with 2a > σ 2 . If the claim size distribution is exponentially bounded, then 2
ψ(u) ∼ C u1−2a/σ ,
u → ∞,
for some constant C > 0. If the claim size distribution is regularly varying (B(x) ∼ L(x)x−α , α > 0), then ψ(u) ∼ L1 (u) umax{1−2a/σ
2
,−α}
,
u → ∞,
(6.2)
where L(u), L1 (u) are slowly varying functions. Proof. For the full proof, we refer to Paulsen [683]. Here we only give a sketch of an analytical proof for 1 < 2a/σ 2 < 2 to highlight the origin of the involved power terms. In view of the convolution term in (6.1), it is natural to take the Laplace transform of (6.1) and then try to apply Tauberian theorems to use b the asymptotic behavior of ψ[−s] for s → 0 to infer information about ψ(u) as b u → ∞. For simplicity of notation, call g(s) = ψ[−s] the Laplace transform of ¡ ¢0 the ruin probability. Since the Laplace transform of uψ 0 (u) is − sg(s) and the 6 Cf. Section XII.3c for a more general procedure to eliminate convolution terms for a large class of claim size distributions.
250
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
¡ ¢00 Laplace transform of u2 ψ 00 (u) is s2 g(s) , one obtains from (6.1) after some elementary calculations that s2 g 00 (s) + p0 s g 0 (s) + (q0 + q1 (s)) g(s) = h(s) with p0 = 4 −
2a , σ2
q0 = 2 −
2a , σ2
¡ ¢ 2 b q1 (s) = 2 s − β + β B[−s] /σ ,
c0 [−s]/σ 2 , h(s) = 2ψ(0)/σ 2 − 2βµB B ¡ ¢ c0 [−s] = 1 − B[−s] b /(µB s) is the Laplace transform of the integrated where B tail distribution. It follows that s = 0 is a regular singular point of the homogeneous equation s2 g 00 (s) + p0 s g 0 (s) + (q0 + q1 (s)) g(s) = 0
(6.3)
which by the usual Frobenius method has a solution of the form g(s) = sr
∞ X
ck sk .
(6.4)
k=0
Substituting this into (6.3) gives the condition r(r − 1) + p0 r + q0 = 0 for r, i.e. r1 = −1
and
r2 = −2 +
2a . σ2
(6.5)
For 1 < 2a/σ 2 < 2, r1 − r2 is not an integer, so we obtain two independent solutions of the homogeneous ODE. The particular solution gp (s) can now be obtained by the classical method of variation of constants. With considerable but purely analytical effort (the details are omitted here) one can show that for exponentially bounded claim size distribution B, gp (s) tends to a constant for s → 0. We now look at the asymptotics for s → 0 of the full solution 2a
g(s) = C1 s−1 η1 (s) + C2 s−2+ σ2 η2 (s) + gp (s) (due to (6.4), η1 (s), η2 (s) also tend to a constant for s → 0). A priori the first R u term would dominate, but from Theorem A6.1 this would translate into ψ(x)dx ∼ C1 u and by the Monotone Density Theorem ψ(u) → C1 , which 0 contradicts limu→∞ ψ(u) = 0. Hence we must have C1 = 0 and the second term asymptotic behavior at s → 0. Theorem A6.1 now gives R u dominates the 2−2a/σ 2 ψ(x)dx ∼ C u /Γ(3 − 2a/σ 2 ) and the Monotone Density Theorem 2 0
6. CONTINUOUS-TIME RUIN WITH STOCHASTIC INVESTMENT
251
2
implies ψ(u) ∼ C · u1−2a/σ (one still needs to ensure that C2 6= 0 which is omitted here). If, on the other hand, B is regularly varying with parameter α, then one can show that gp (s) ∼ sα−1 L(1/s), so that now the dominating term (which is either 2a the particular solution or the second term above) is of order smin{α−1,−2+ σ2 } . 2 The same arguments as above then imply the claimed result. Remark 6.3 Theorem 6.2 states that (as in the discrete risk model of the previous section) full investment in geometric Brownian motion leads to Pareto-type asymptotic decay of the ruin probability even for light-tailed claim distributions. If the tail of the claim size distribution is heavy enough (and from (6.2) one sees that the tail needs to be very heavy), insurance risk can still dominate the financial risk. 2 Remark 6.4 If only a constant fraction η (0 < η < 1) of the current wealth is invested in the risky asset, the analysis above is exactly the same, one just needs to replace a by aη and σ by ση. In Chapter XIV we will see how to improve the asymptotic behavior of the ruin probability by dynamically changing the investment fraction η as a function of the current risk reserve level. 2 Notes and references Early results on ruin probabilities with investments can be found in Frolova, Kabanov & Pergamenshchikov [374] for a Cram´er-Lundberg model with exponential claim sizes and investments into geometric Brownian motion (the explicit solution of Example 6.1 can also be found there) and bounds are derived in Kalashnikov & Norberg [520] in a more general set-up. For extensions to more general claim size distributions, see Constantinescu & Thomann [255]. Results for the continuous-time risk model can also be derived by using methods motivated by discrete-time models, see e.g. Nyrhinen [669] and for a fairly general account Paulsen [683]. Martingale techniques are exploited in Ma & Sun [618]. In order to assess ψ(u) for moderate size u, Paulsen, Kasozi & Steigen [688] transform the IDE (6.1) into an ordinary Volterra integral equation of the second k ind and design an effective numerical solution procedure for the latter. The proof technique of Theorem 6.2 outline here is made rigorous in Albrecher, Constantinescu & Thomann [22], and it is shown there that the method in principle also extends to renewal risk models with interclaim times of rational Laplace transform (in particular it turns out that the asymptotic result is insensitive to the choice of interclaim time distribution within that class). See also Wei [879] for a different method in the renewal set-up. Pergamenshchikov & Zeitouny [691] deal with more general premium rate functions and Cai & Xu [220] add perturbation to the original risk process. For absolute ruin probabilities in this context, see Gerber & Yang [414]. Kl¨ uppelberg & Kostadinova [540], Brokate et al. [205], Tang, Wang & Yuen [833] and Heyde & Wang [462] study the investment into exponential L´evy models in more
252
CHAPTER VIII. LEVEL-DEPENDENT RISK PROCESSES
detail. For further references in this active field of research we refer again to the recent survey by Paulsen [684].
Chapter IX
Matrix-analytic methods 1
Definition and basic properties of phase-type distributions
Phase-type distributions are the computational vehicle of much of modern applied probability. Typically, if a problem can be solved explicitly when the relevant distributions are exponentials, then the problem may admit an algorithmic solution involving a reasonable degree of computational effort if one allows for the more general assumption of phase-type structure, and not in other cases. A proper knowledge of phase-type distributions seems therefore a must for anyone working in an applied probability area like risk theory. A distribution B on (0, ∞) is said to be of phase-type if B is the distribution of the lifetime of a terminating Markov process {Jt }t≥0 with finitely many states and time homogeneous transition rates. More precisely, a terminating Markov process {Jt } with state space E ©andªintensity matrix T is defined as the restriction to E of a Markov process J t 0≤t<∞ on E∆ = E ∪ {∆} where ∆ is some extra state which is absorbing, that is, Pi (J t = ∆ eventually) = 1 for all i ∈ E 1 and where all states © iª∈ E are transient. This implies in particular that the intensity matrix for J t can be written in block-partitioned form as µ ¶ T t . (1.1) 0 0 We often write p for the number of elements of E. Note that since (1.1) is the intensity matrix of a non-terminating Markov process, the rows sum to zero 1 Here as usual, P refers to the case J = i; if ν = (ν ) a probability distribution, we 0 i i i∈E is P write Pν for the case where J0 has distribution ν so that Pν = i∈E νi Pi .
253
254
CHAPTER IX. MATRIX-ANALYTIC METHODS
which in matrix notation can be rewritten as t + T e = 0 where e is the column E-vector with all components equal to one. In particular, T is a subintensity matrix,2 and we have t = −T e . (1.2) The interpretation of the column vector t is as the exit rate vector, i.e. the ith component ti gives the intensity in state i for leaving E and going to the absorbing state ∆. We now say that B is of phase-type with representation (E, α, T ) (or sometimes just (α, T )) if B is the Pα -distribution of ζ = inf{t > 0 : J t = ∆} (the absorption time), i.e. B = Pα (ζ ≤ t). Equivalently, ζ is the lifetime sup {t ≥ 0 : Jt ∈ E} of {Jt }. A convenient graphical representation is the phase diagram in terms of the entrance probabilities αi , the exit rates ti and the transition rates (intensities) tij :
j
tij 3 ¾
αi ti
¾
i
+ tji tkj k tki
tjk ?
tik s
-
αj
6 -
tj
k
¾
tk
-
αk Figure IX.1: The phase diagram of a phase-type distribution with 3 phases, E = {i, j, k}. The initial vector α is written as a row vector. Here are some important special cases: Example 1.1 Suppose that p = 1 and write β = −t11 . Then α = α1 = 1, t1 = β, and the phase-type distribution is the lifetime of a particle with constant failure rate β, that is, an exponential distribution with rate parameter β. Thus the phase-type distributions with p = 1 are exactly the class of exponential distributions. 2 2 This
means that tii ≤ 0, tij ≥ 0 for i 6= j and
P
j∈E tij
≤ 0.
1. PHASE-TYPE DISTRIBUTIONS
255
Example 1.2 The Erlang distribution Ep with p phases is defined as the Gamma distribution with integer parameter p and density δp
xp−1 −δx e . (p − 1)!
(1.3)
Since this corresponds to a convolution of p exponential densities with the same rate δ, the Ep distribution may be represented by the phase diagram (p = 3)
α1 =1 1
δ
δ
- 2
δ
- 3
- ∆
Figure IX.2 corresponding to E = {1, . . . , p}, α = (1 0 0 . . . 0 0),
−δ 0 .. .
T = 0 0
δ −δ 0 0
0 ··· δ ··· .. . 0 ··· 0 ···
0 0 −δ 0
0 0 .. .
, δ −δ
0 0 .. .
t= 0 δ
. 2
Example 1.3 The hyperexponential distribution Hp with p parallel channels is defined as a mixture of p exponential distributions with rates δ1 , . . . , δp so that the density is p X αi δi e−δi x . (1.4) i=1
Thus E = {1, . . . , p}, T =
−δ1 0 .. .
0 −δ2
0 0
··· ··· .. .
0 0
0 0 .. .
0 0
0 0
0 0
··· ···
−δp−1 0
0 −δp
and the phase diagram is (p = 2)
,
δ1 δ2 .. .
t= δp−1 δp
,
256
CHAPTER IX. MATRIX-ANALYTIC METHODS α1 1
δ1 j
α2 2
*
∆
δ2
Figure IX.3 2 Example 1.4 (Coxian distributions) This class of distributions is popular in much of the applied literature, and is defined as the class of phase-type distributions with a phase diagram of the following form:
Figure IX.4 For example, the Erlang distribution is a special case of a Coxian distribution. 2 The basic analytical properties of phase-type distributions are given by the following result. Recall the matrix-exponential eK is defined by the stanPthat ∞ dard series expansion n=0 K n /n!. 3 Theorem 1.5 Let B be phase-type with representation (E, α, T ). Then: (a) the c.d.f. is B(x) = 1 − αeT x e; (b) the density is b(x) = B 0 (x) = αeT x t; R b = ∞ erx B(dx) is α(−rI − T )−1 t; (c) the m.g.f. B[r] 0 R∞ (d) the nth moment 0 xn B(dx) is (−1)n n! αT −n e. © ª s Proof. Let P = (psij ) be the s-step E∆ × E∆ transition matrix for J t and s P s the s-step E × E-transition matrix for {Jt }, © i.e. ª the restriction of P to E. Then for i, j ∈ E, the backwards equation for J t (e.g. [APQ, p. 48]) yields X X dpsij dpsij = = ti psδj + tik pskj = tik pskj . ds ds k∈E
3 For
k∈E
a number of additional important properties of matrix-exponentials and discussion of computational aspects, see Appendix A3.
1. PHASE-TYPE DISTRIBUTIONS That is, Since
s d ds P
257
= T P s , and since obviously P 0 = I, the solution is P s = eT s .
1 − B(x) = Pα (ζ > x) = Pα (Jx ∈ E) =
X
αi pxij = αP x e,
i,j∈E
this proves (a), and (b) then follows from B 0 (x) = −α
d x P e = −αeT x T e = αeT x t dx
(since T and eT x commute). For (c), the rule (A.12) for integrating matrixexponentials yields Z ∞ ³Z ∞ ´ rx Tx b e αe t dx = α B[r] = e(rI+T )x dx t = α(−rI − T )−1 t. 0
0 rζ
Alternatively, define hi = Ei e . Then o X tij −tii n ti hi = + hj . −tii − r −tii −tii
(1.5)
j6=i
Indeed, −tii is the rate of the exponential holding time of state i and hence (−tii )/(−tii − r) is the m.g.f. of the initial sojourn in state i. After that, we either go to state j 6= i w.p. tij / − tii and have an additional time to absorption which has m.g.f. hj , or w.p. ti / − tii we go to ∆, in which case the time to absorption is 0 with m.g.f. 1. Rewriting (1.5) as X X hi (tii + r) = −ti − tij hj , tij hj + hi r = −ti , j∈E
j6=i
this means in vector notation that (T + rI)h = −t, i.e. h = −(T + rI)−1 t, and b = αh, we arrive once more at the stated expression for B[r]. b since B[r] Part (d) follows by differentiating the m.g.f., dn α(−rI − T )−1 t = (−1)n+1 n! α(rI + T )−n−1 t, drn b (n) [0] = (−1)n+1 n! αT −n−1 t = (−1)n n!αT −n−1 T e B =
(−1)n n! αT −n e.
Alternatively, for n = 1 we may put ki = Ei ζ and get as in (1.5) X tij 1 ki = + kj , −tii −tii j6=i
which is solved as above to get k = −αT −1 e.
2
258
CHAPTER IX. MATRIX-ANALYTIC METHODS
Example 1.6 Though typically the evaluation of matrix-exponentials is most conveniently carried out on a computer, there are some examples where it is appealing to write T on diagonal form, making the problem trivial. One obvious instance is the hyperexponential distribution, another the case p = 2 where explicit diagonalization formulas are always available, see the Appendix. Consider for example ! Ã ! Ã 6/7 −3/2 9/14 . α = (1/2 1/2) , T = so that t = 2 7/2 −11/2 Then (cf. Example A3.7) the diagonal form of T is ! Ã Ã 9/10 9/70 1/10 T = − −6 7/10 1/10 −7/10
−9/70 9/10
! ,
where the two matrices on the r.h.s. are idempotent. This implies that we can compute the nth moment as à ! 9/10 9/70 µ 1 ¶ −n n n (−1) n! αT e = 1 n! (1/2 1/2) 1 7/10 1/10 à ! 1/10 −9/70 µ 1 ¶ + 6−n n! (1/2 1/2) 1 −7/10 9/10 µ ¶ 32 3 = n! + . 35 35 · 6n Similarly, we get the density as µ αe
Tx
t
=
e
−x
1 1 2 2 µ
+ e−6x =
¶ Ã 9/10 9/70 ! Ã 6/7 !
7/10 1/10 2 ¶ Ã 1/10 −9/70 ! Ã 6/7 ! 1 1 2 2 −7/10 9/10 2
32 −x 18 −6x e + e . 35 35 2
The following result becomes basic in Sections 4, 5 and serves at this stage to introduce Kronecker notation and calculus (see Section 4b for definitions and basic rules):
1. PHASE-TYPE DISTRIBUTIONS
259
Proposition 1.7 If B is phase-type with representation (ν, T ), then the matrix b m.g.f. B[Q] of B is Z ∞ b B[Q] = eQx B(dx) = (ν ⊗ I)(−T ⊕ Q)−1 (t ⊗ I). (1.6) 0
Proof. According to (A.29) and Proposition A4.4, µZ ∞ ¶ Z ∞ T x Qx Tx Qx b νe te dx = (ν ⊗ I) B[Q] = e ⊗ e dx (t ⊗ I) 0 0 µZ ∞ ¶ = (ν ⊗ I) e(T ⊕Q)x dx (t ⊗ I) = (ν ⊗ I)(−T ⊕ Q)−1 (t ⊗ I). 0
2 Sometimes it is relevant also to consider phase-type distributions, where the P initial vector α is substochastic, kαk = i∈E αi < 1. There are two ways to interpret this: • The phase-type distribution B is defective, i.e. kBk = kαk < 1; a random variable U having a defective phase-type distribution with representation (α, T ) is then defined to be ∞ on a set of probability 1 − kαk, or one just lets U be undefined on this additional set. • The phase-type distribution B is zero-modified, i.e a mixture of a phasetype distribution with representation (α/kαk, T ) with weight kαk and an atom at zero with weight 1 − kαk. This is the traditional choice in the literature, and in fact one also most often there allows α to have a component α∆ at ∆.
1a
Asymptotic exponentiality
Writing T on the Jordan canonical form, it is easily seen that the asymptotic form of the tail of a general phase-type distribution has the form B(x) ∼ Cxk e−ηx , where C, η > 0 and k = 0, 1, 2 . . . The Erlang distribution gives an example where k > 0 (in fact, then k = p − 1), but in many practical cases, one has k = 0. Here is a sufficient condition: Proposition 1.8 Let B be phase-type with representation (α, T ), assume that T is irreducible, let −η be the eigenvalue of largest real part of T , let ν, h be the corresponding left and right eigenvectors normalized by νh = 1 and define C = αh · νe. Then the tail B(x) is asymptotically exponential, B(x) ∼ Ce−ηx .
(1.7)
260
CHAPTER IX. MATRIX-ANALYTIC METHODS
Proof. By Perron-Frobenius theory (A.4c), η is real and positive, ν, h can be chosen with strictly positive component, and we have eT x ∼ hνe−ηx , x → ∞. Using B(x) = αeT x e, the result follows (with C = (αh)(νe)).
2
Of course, the conditions of Proposition 1.8 are far from necessary (a mixture of phase-type distributions with the respective T (i) irreducible has obviously an asymptotically exponential tail, but the relevant T is not irreducible, cf. Example A5.8). In Proposition A5.1 of the Appendix, we give a criterion for asymptotical exponentiality of a phase-type distribution B, not only in the tail but in the whole distribution. Notes and references The idea behind using phase-type distributions goes back to Erlang, but today’s interest in the topic was largely initiated by M.F. Neuts, see his book [660] (a historical important intermediate step is Jensen [505]). Other expositions of the basic theory of phase-type distributions can be found in [APQ], Lipsky [600], Rolski, Schmidli, Schmidt & Teugels [746] and Wolff [894]. All material of the present section is standard; the text is essentially identical to Section 2 of Asmussen [68]. In some of the literature and also in Section XII.3, the slightly larger class of distributions with a rational m.g.f. (or Laplace transform) is used which may seem less intuitive than phase-type distributions. See in particular the notes to Section 6. O’Cinneide [670] gave a necessary and sufficient criterion for a distribution B with a b = p(s)/q(s) to be phase-type: the density b(x) should be strictly rational m.g.f. B[s] positive for x > 0 and the root of q(s) with the smallest real part should be unique (not necessarily simple, cf. the Erlang case). No satisfying algorithm for finding a phase representation of a distribution B (which is known to be phase-type and for which the m.g.f. or the density is available) is, however, known. A related important unsolved problem deals with minimal representations: given a phase-type distribution, what is the smallest possible dimension of the phase space E?
2
Renewal theory
A summary of the renewal theory in general is given in A1 of the Appendix, but is in part repeated below. Let U1 , U2 , . . . be i.i.d. with common distribution B and define4 U(A) = =
E# {n = 0, 1, . . . : U1 + · · · + Un ∈ A} ∞ X E I(U1 + · · · + Un ∈ A). n=0
4 Here
the empty sum U1 + . . . + U0 is 0.
2. RENEWAL THEORY
261
We may think of the Ui as the lifetimes of items (say electrical bulbs) which are replaced upon failure, and U(A) is then the expected number of replacements (renewals) in A. For this reason, we refer to U as the renewal measure; if U is absolutely continuous on (0, ∞) w.r.t. Lebesgue measure, we denote the density by u(x) and refer to u as the renewal density. If B is exponential with rate β, the renewals form a Poisson process and we have u(x) = β. The explicit calculation of the renewal density (or the renewal measure) is often thought of as infeasible for other distributions, but nevertheless, the problem has an algorithmically tractable solution if B is phase-type: Theorem 2.1 Consider a renewal process with interarrivals which are phasetype with representation (α, T ). Then the renewal density exists and is given by u(x) = αe(T +tα)x t. (2.1) © (k) ª © ª be the governing phase process for Uk and define Jet by Proof. Let Jt © (k) ª together, piecing the Jt (1) (2) Jet = Jt , 0 ≤ t < U1 , Jet = Jt−U1 , U1 ≤ t < U1 + U2 , . . . . © ª (k) Then Jet is Markov and has two types of jumps, the jumps of the Jt and the (k) (k+1) jumps corresponding to a transition from one Jt to the next Jt . A jump of the last type from i to j occurs at rate ti αj , and the jumps of the first type are governed by T . Hence the intensity matrix is T + tα, and the distribution of Jex is αe(T +tα)x . The renewal density at x is now just the rate of jumps of the second type, which is ti in state i. Hence (2.1) follows by the law of total 2 probability.
The argument goes through without change if the renewal process is terminating, i.e. B is defective, and hence (2.1) remains valid for that case. However, the phase-type assumptions also yield the distribution of a further quantity of fundamental importance in later parts of this chapter, the lifetime of the renewal process. This is defined as U1 + · · · + Uκ−1 where κ is the first k with Uk = ∞, that is, as the time of the last renewal; since Uk = ∞ with probability 1 − kBk which is > 0 in the defective case, this is well-defined. Corollary 2.2 Consider a terminating renewal process with interarrivals which are defective phase-type with representation (α, T ), i.e. kαk < 1. Then the lifetime is zero-modified phase-type with representation (α, T + tα). © ª Proof. Just note that Jet is a governing phase process for the lifetime. 2 Returning to non-terminating renewal processes, define the excess life ξ(t) at time t as the time until the next renewal following t, see Fig. IX.5.
262
CHAPTER IX. MATRIX-ANALYTIC METHODS 6
ξ(t)
U2
U1
U3 U1
U2
-
U3
U4
Figure IX.5 Corollary 2.3 Consider a renewal process with interarrivals which are phasetype with representation (α, T ), and let µB = −αT −1 e be the mean of B. Then: (a) the excess life ξ(t) at time t is phase-type with representation (ν t , T ) where ν t = αe(T +tα)t ; (b) ξ(t) has a limiting distribution as t → ∞, which is phase-type with representation (ν, T ) where ν = −αT −1 /µB . Equivalently, the density is νeT x t = B(x)/µB . © ª Proof. Consider again the process Jet in the proof of Theorem 2.1. The time of the next renewal after t is the time of the next jump of the second type, hence ξ(t) is phase-type with representation (ν t , T ) where ν t is the distribution of Jet which is obviously given by the expression in (a). Hence in (b) it is immediate that ν exists and is the stationary limiting distribution of Jet , i.e. the unique positive solution of νe = 1,
ν(T + tα) = 0.
Here are two different arguments that this yields the asserted expression: (i) Just check that −αT −1 /µB satisfies (2.2): −αT −1 e = µB −αT −1 (T + tα) µB
= =
µB = 1, µB −α + αT −1 T eα µB −α + αeα −α + α = = 0. µB µB
(2.2)
2. RENEWAL THEORY
263
(ii) First check the asserted identity for the density: since T , T −1 and eT x commute, we get B(x) αeT x e αT −1 eT x T e = = = νeT x t. µB µB µB Next appeal to the standard fact from renewal theory that the limiting distribution of ξ(x) has density B(x)/µB , cf. Section A.1e. 2 Example 2.4 Consider a non-terminating renewal process with two phases. The formulas involve the matrix-exponential of the intensity matrix µ ¶ µ ¶ t11 + t1 α1 t12 + t1 α2 −q1 q1 Q = T + tα = = (say). t12 + t2 α1 t22 + t2 α2 q2 −q2 According to Example A3.6, we first compute the stationary distribution of Q, µ ¶ q2 q1 π = (π1 π2 ) = , q1 + q2 q1 + q2 and the non-zero eigenvalue λ = −q1 − q2 . The renewal density is then ¶ µ ¶µ π1 π2 t1 αeQt t = (α1 α2 ) t2 π1 π2 µ ¶µ ¶ π2 −π2 t1 + eλt (α1 α2 ) −π1 π1 t2 ¶ µ ¶ µ π2 (t1 − t2 ) t1 = (π1 π2 ) + eλt (α1 α2 ) π1 (t2 − t1 ) t2 = =
π1 t1 + π2 t2 + eλt (α1 π2 − α2 π1 ) (t1 − t2 ) 1 + eλt (α1 π2 − α2 π1 ) (t1 − t2 ) . µB 2
Example 2.5 Let B be Erlang(2). Then ³ Q =
−δ 0
δ −δ
´
³ +
0 δ
´
³ (1 0) =
−δ δ
δ −δ
´ .
Hence π = (1/2 1/2), λ = −2δ, and Example 2.4 yields the renewal density as u(t) =
¢ δ¡ 1 − e−2δt . 2 2
264
CHAPTER IX. MATRIX-ANALYTIC METHODS
Example 2.6 Let B be hyperexponential. Then Q =
³ −δ 1 0
0 −δ2
Hence
´
³ π =
³ +
³ −δ α δ1 ´ 1 2 (α1 α2 ) = δ2 α1 δ2
δ1 α 2 −δ2 α1
´ .
´ δ2 α1 δ1 α2 , δ1 α2 + δ2 α1 δ1 α2 + δ2 α1
λ = −δ1 α2 − δ2 α1 , and Example 2.4 yields the renewal density as u(t) =
δ1 δ2 (δ1 − δ2 )2 α1 α2 + e−(δ1 α2 +δ2 α1 )t . δ1 α2 + δ2 α1 δ1 α2 + δ2 α1 2
Notes and references Early expositions of renewal theory for phase-type distributions are Neuts [659] and Kao [521]. The present treatment, similar to that in [APQ], is somewhat more probabilistic.
3
The compound Poisson model
3a
Phase-type claims
Consider the compound Poisson (Cram´er-Lundberg) model in the notation of Chapter I, with β denoting the Poisson intensity, B the claim size distribution, τ (u) the time ¡ of ruin with initial ¢ reserve u, {St } the claim surplus process, G+ (·) = P Sτ (0) ∈ ·, τ (0) < ∞ the ladder height distribution and M = supt≥0 St . We assume that B is phase-type with representation (α, T ). Corollary 3.1 Assume that the claim size distribution B is phase-type with representation (α, T ). Then: (a) G+ is defective phase-type with representation (α+ , T ) where α+ is given by α+ = −βαT −1 , and M is zero-modified phase-type with representation (α+ , T + tα+ ). (b) ψ(u) = α+ e(T +tα+ )u e. Note in particular that ρ = kG+ k = α+ e. Proof. The result follows immediately by combining the Pollaczeck-Khinchine formula with general results on phase-type distributions: for (a), use the phasetype representation of B0 , cf. Corollary 2.3. For (b), represent the maximum M as the lifetime of a terminating renewal process and use Corollary 2.2.
3. THE COMPOUND POISSON MODEL
265
Since the result is quite fundamental, we shall, however, add a more selfcontained explanation of why the phase-type structure is preserved. The essence is contained in Fig. IX.6. Here we have taken the terminating Markov process underlying B with two states, marked by thin and thick lines on the figure. Then each claim (jump) corresponds to one (finite) sample path of the Markov process. The stars represent the ladder points Sτ+ (k) . Considering the first, we see that the ladder height Sτ+ is just the residual lifetime of the Markov process corresponding to the claim causing upcrossing of level 0, i.e. itself phase-type with the same phase generator T and the initial vector α+ being the distribution of the upcrossing Markov process at time −Sτ+ − . Next, the Markov processes representing ladder steps can be pieced together to one {mx }. Within ladder steps, the transitions are governed by T whereas termination of ladder steps may lead to some additional ones: a transition from i to j occurs if the ladder step terminates in state i, which occurs at rate ti , and if there is a subsequent ladder step starting in j which occurs w.p. α+j . Thus the total rate is tij +ti α+j , and rewriting in matrix form yields the phase generator of {mx } as T + tα+ . Now just observe that the initial vector of {mx } is α+ and that the lifelength is M .
Figure IX.6 This derivation is a complete proof except for the identification of α+ with −βαT −1 . This is in fact a simple consequence of the form of the excess distri2 bution B0 , see Corollary 2.3.
266
CHAPTER IX. MATRIX-ANALYTIC METHODS
Example 3.2 Assume that β = 3 and b(x) =
1 1 · 3e−3x + · 7e−7x . 2 2
Thus b is hyperexponential (a mixture of exponential distributions) with α = ( 12 12 ), T = (−3 − 7)diag so that µ ¶ ¡ ¢ −1/3 0 1/2 3/14 , α+ = −βαT −1 = −3 (1/2 1/2) = 0 −1/7 µ ¶ µ ¶µ ¶ à −3/2 9/14 ! −3 0 3 1 3 T + tα+ = + = . 0 −7 7 2 14 7/2 −11/2 This is the same matrix as is Example 1.6, so that as there à ! à 9/10 9/70 1/10 −u (T +tα+ )u −6u e = e +e 7/10 1/10 −7/10 Thus ψ(u) = α+ e(T +tα+ )u e =
−9/70
24 −u 1 e + e−6u . 35 35
9/10
! .
2
Notes and references Corollary 3.1 can be found in Neuts [660] (in the setting of M/G/1 queues, cf. the duality result given in Corollary III.3.6), but that such a simple and general solution existed does not appear to have been well known to the risk theory community before a rather late stage. The result carries over to B being matrix-exponential, see Section 6. In the next sections, we encounter similar expressions for the ruin probabilities in the renewal- and Markov-modulated models, but there the vector α+ is not explicit but needs to be calculated (typically by an iteration or a rootfinding). The parameters of Example 3.2 are taken from Gerber [398]; his derivation of ψ(u) is different. For further more or less explicit computations of ruin probabilities, see Shiu [800]. It is notable that the phase-type assumption does not seem to simplify the computation of finite horizon ruin probabilities substantially (but see Section 8). For an attempt, see Stanford & Stroi´ nski [817].
4
The renewal model
We consider the renewal model in the notation of Chapter VI, with A denoting the interarrival distribution and B the service time distribution. We assume
4. THE RENEWAL MODEL
267
ρ = µB /µA < 1 and that B is phase-type with representation (α, T ). We shall derive phase-type representations of the ruin probabilities ψ(u), ψ (s) (u) (recall that ψ(u) refers to the zero-delayed case and ψ (s) (u) to the stationary case). For the compound Poisson model, this was obtained in Section 3, and the argument for the renewal case starts in just the same way (cf. the discussion around Fig. IX.6 which does not use that A is exponential) by noting that the distribution G+ of the ascending ladder height Sτ+ is necessarily (defective) phase-type with representation (α+ , T ) for some vector α+ = (α+;j ). That is, if we define {mx } just as for the Poisson case (cf. Fig. IX.6): Proposition 4.1 In the zero-delayed case, (a) G+ is of phase-type with representation (α+ , T ), where α+ is the (defective) distribution of m0 ; (b) The maximum claim surplus M is the lifetime of {mx }; (c) {mx } is a (terminating) Markov process on E, with intensity matrix Q given by Q = T + tα+ . The key difference from the Poisson case is that it is more difficult to evaluate α+ . In fact, the form in which we derive α+ for the renewal model is as the unique solution of a fixed point problem α+ = ϕ(α+ ), which for numerical purposes can be solved by iteration. Nevertheless, the calculation of the first ladder height is simple in the stationary case: (s)
Proposition 4.2 The distribution G+ of the first ladder height of the claim © (s) ª surplus process St for the stationary case is phase-type with representation ¡ (s) ¢ α , T , where α(s) = −αT −1 /µA . Proof. Obviously, the Palm distribution of the claim size is just B. Hence by (s) Theorem III.5.5, G+ = ρB0 , where B0 is the stationary excess life distribution corresponding to B. But by Corollary 2.3, B0 is phase-type with representation (−αT −1 /µB , T ). 2 Proposition 4.3 α+ satisfies α+ = ϕ(α+ ), where Z ∞ b + tα+ ] = α ϕ(α+ ) = αA[T e(T +tα+ )y A(dy) .
(4.1)
0
Proof. We condition upon T1 = y and define {m∗x } from {St+y − Sy− } in the same way as {mx } is defined from {St }, cf. Fig. IX.7. Then {m∗x } is Markov with the same transition intensities as {mx }, but with initial distribution α rather than α+ . Also, obviously m0 = m∗y . Since the conditional distribution of m∗y given T1 = y is αeQy , it follows by integrating y out that the distribution 2 α+ of m0 is given by the final expression in (4.1).
268
CHAPTER IX. MATRIX-ANALYTIC METHODS
Figure IX.7 We have now almost collected all pieces of the main result of this section: Theorem 4.4 Consider the renewal model with interarrival distribution A and the claim size distribution B being of phase-type with representation (α, T ). Then ψ(u) = α+ e(T +tα+ )x e, ψ (s) (u) = α(s) e(T +tα+ )x e, (4.2) where α+ satisfies (4.1) and α(s) = −αT −1 /µA . Furthermore, α+ can be computed by iteration of (4.1), i.e. by ¡ (0) ¢ ¡ (1) ¢ (n) (0) (1) (2) α+ = lim α+ where α+ = 0, α+ = ϕ α+ , α+ = ϕ α+ , . . . n→∞
(4.3)
Proof. The first expression in (4.2) follows from Proposition 4.1 by noting that the distribution of m0 is α+ . The second follows in a similar way by noting that only the first ladder step has a different distribution in the stationary case, and that this is given by Proposition 4.2; thus, the maximum claim surplus for the stationary case has a similar representation as in Proposition 4.1(b), only with initial distribution α(s) for m0 . It remains to prove convergence of the iteration scheme (4.3). The term tβ in ϕ(β) represents feedback with rate vector t and feedback probability vector β. Hence ϕ(β) (defined on the domain of subprobability vectors β) is an increasing (1) (0) function of β. In particular, α+ ≥ 0 = α+ implies ¡ (1) ¢ ¡ (0) ¢ (2) (1) α+ = ϕ α+ ≥ ϕ α+ = α+
4. THE RENEWAL MODEL
269
© (n) ª (n) and (by induction) that α+ is an increasing sequence such that limn→∞ α+ (0) exists. Similarly, 0 = α+ ≤ α+ yields ¡ (0) ¢ ≤ ϕ (α+ ) = α+ = ϕ α+
(1)
α+
(n)
(n)
and by induction that α+ ≤ α+ for all n. Thus, limn→∞ α+ ≤ α+ . To prove the converse inequality, we use an argument similar to the proof of Proposition VII.2.4. Let Fn = {T1 + · · · + Tn+1 > τ+ } be the event that {m∗x } (n) has at most n arrivals in [T1 , τ+ ], and let α e+;i = P(m∗T1 = i; Fn ). Obviously, (n)
(n)
(n)
e + ↑ α+ , so to complete the proof it suffices to show that α e + ≤ α+ for all α n. For n = 0, both quantities are just 0. Assume the assertion shown for n − 1. Then each subexcursion of {St+T1 − ST1 − } can contain at most n − 1 arrivals (n arrivals are excluded because of the initial arrival at time T1 ). It follows that (n−1) e+ on Fn the feedback to {m∗x } after each ladder step cannot exceed α so that Z (n) e+ α
≤
Z ≤
∞
α 0
α 0
∞
(n−1)
)y
A(dy)
(n−1)
)y
¡ (n−1) ¢ (n) = α+ . A(dy) = ϕ α+
e+ e(T +tα
e(T +tα+
2 We next give an alternative algorithm, which links together the phase-type setting and the classical complex plane approach of the renewal model (see further the Notes). To this end, let F be the distribution of U1 − T1 . Then b Fb[r] = α(−rI − T )−1 t · A[−r]
(4.4)
whenever Ee<(r)U < ∞. However, (4.4) makes sense and provides an analytic continuation of Fb[·] as long as −r 6∈ sp(T ). Theorem 4.5 Let r be some complex number with <(r) > 0, −r 6∈ sp(T ). b b Then −r is an eigenvalue of Q = T + tα+ if and only if 1 = Fb[r] = A[−r] B[r], b b with B[r], F [r] being interpreted in the sense of the analytical continuation of the m.g.f. In that case, the corresponding right eigenvector may be taken as (−rI − T )−1 t. Proof. Suppose first Qh = −rh. Then eQx h = e−rx h and hence ¡ ¢ b b −rh = Qh = T + tαA[Q] h = T h + A[−r]tαh .
(4.5)
270
CHAPTER IX. MATRIX-ANALYTIC METHODS
b Since −r 6∈ sp(T ), this implies that αhA[−r] 6= 0, and hence we may assume b that h has been normalized such that αhA[−r] = 1. Then (4.5) yields h = −1 (−rI − T ) t. Thus by (4.4), the normalization is equivalent to Fb[r] = 1. Suppose next Fb[r] = 1. Since <(r) > 0 and G− is concentrated on (−∞, 0), b − [r]| < 1 , and hence by the Wiener-Hopf factorization identity (A.9) we have |G b + [r] = 1 which according to Theorem 1.5(c) means that α+ (−rI − we have G T )−1 t = 1. Hence with h = (−rI − T )−1 t we get Qh = (T + tα+ )h = T (−rI − T )−1 t + t = −r(−rI − T )−1 t = −rh . 2 Let d denote the number of phases. Corollary 4.6 Suppose µ < 0, that the equation Fb[r] = 1 has d distinct roots ρ1 , . . . , ρd in the domain <(r) > 0, and define hi = (−ρi I − T )−1 t, Q = CD −1 where C is the matrix with columns h1 , . . . , hd , D that with columns −ρ1 h1 , . . . , −ρd hd . Then G+ is phase-type with representation (α+ , T ) with α+ = α(Q − T )/αt. Further, letting ν i be the left eigenvector of Q corresponding to −ρi and normalized by ν i hi = 1, Q has diagonal form Q = −
d X i=1
ρi νi ⊗ hi = −
d X
ρi hi ν i .
(4.6)
i=1
Proof. Appealing to Theorem 4.5, the matrix Q in Theorem 2.1 has the d distinct eigenvalues −ρ1 , . . . , −ρd with corresponding eigenvectors h1 , . . . , hd . This immediately implies that Q has the form CD −1 and the last assertion on the diagonal form. Given T has been computed, we get 1 1 α(Q − T ) = αtα+ = α+ . αt αt 2 Notes and references Results like those of the present section have a long history, and the topic is classic both in risk theory and queueing theory (recall that we can identify ψ(u) with the tail P(W > u) of the GI/PH/1 waiting time W ; in turn, D W = M (d) in the notation of Chapter VI). In older literature, explicit expressions for the ruin/queueing probabilities are most often derived under the slightly more general b is rational (say with degree d of the polynomial in the denominator) assumption that B as discussed in Section 6. As in Corollary 4.6, the classical algorithm starts by looking b A[−γ] b for roots in the complex plane of the equation B[γ] = 1, <(γ) > 0. The roots are counted and located by Rouch´e’s theorem (a classical result from complex analysis
5. MARKOV-MODULATED INPUT
271
giving a criterion for two complex functions to have the same number of zeros within a defined region). This gives d roots γ1 , . . . , γd satisfying <(γi ) > 0, and the solution is then in transform terms , d Z ∞ d Y Y αu αW 1+α e ψ(u) du = Ee = (−γi ) (α − γi ) (4.7) 0
i=1
i=1
(see, e.g., Asmussen & O’Cinneide [94] for a short self-contained derivation). In risk theory, a pioneering paper in this direction is T¨ acklind [826], whereas the approach was introduced in queueing theory by Smith [814]; similar discussion appears in Kemperman [528] and much of the queueing literature like Cohen [249], see also Chapters XII and XIII. This complex plane approach has been met with substantial criticism for a number of reasons like being lacking probabilistic interpretation and not giving the waiting time distribution / ruin probability itself but only the transform. In queueing theory, an alternative approach (the matrix-geometric method) has been developed largely by M.F. Neuts and his students, starting around in 1975. For surveys, see Neuts [660], [661] and Latouche & Ramaswami [574]. Here phase-type assumptions are basic, but the models solved are basically Markov chains and Markov processes with countably many states (for example queue length processes). The solutions are based upon iterations schemes like in Theorem 4.4; the fixed point problems look like R = A0 + RA1 + R2 A2 + · · · , where R is an unknown matrix, and appears already in some early work by Wallace [870]. The distribution of W comes out from the approach but in a rather complicated form. The matrix-exponential form of the distribution was found by Sengupta [793] and the phase-type form by the first author [60]. The exposition here is based upon [60], which contains somewhat stronger results concerning the fixed point problem and the iteration scheme. Numerical examples appear in Asmussen & Rolski [97]. For further early explicit computations of ruin probabilities in the phase-type renewal case, see Dickson & Hipp [314, 315]; some recent extensions are discussed in Section XII.3. There is also much literature on the case where A is phase-type with a few phases.
5
Markov-modulated input
We consider a claim surplus process {St } in a Markovian environment in the notation of Chapter VII. That is, the background Markov process with p states is {Jt }, the intensity matrix is Λ and the stationary row vector is π. The arrival rate in background state i is λi and the distribution of an arrival claim is B¢i . ¡ We assume that each Bi is phase-type, with representation say α(i) , T (i) , E (i) . The number of elements of E (i) is denoted by qi .
272
CHAPTER IX. MATRIX-ANALYTIC METHODS
It turns out that subject to the phase-type assumption, the ruin probability can be found in matrix-exponential form just as for the renewal model, involving some parameters like the ones Q or α+ for the renewal model which need to be determined by similar algorithms. We start in Section 5a with an algorithm involving roots in a similar manner as Corollary 4.6. However, the analysis involves new features like an equivalence with first passage problems for Markovian fluids and the use of martingales (these ideas also apply to phase-type renewal models though we have not given the details). Section 5b then gives a representation along the lines of Theorem 4.4. The key unknown is the matrix K, for which the relevant fixed point problem and iteration scheme has already been studied in VII.2.
5a
Calculations via fluid models. Diagonalization
© ª Consider a process (It , Vt ) t≥0 such that {It } is a Markov process with a finite state space F and {Vt } has piecewiese linear paths, say with slope r(i) on intervals where It = i. The version of the process obtained by imposing reflection on the V component is denoted a Markovian fluid and is of considerable interest in telecommunications engineering as model for an ATM (Asynchronuous Transfer Mode) switch. The stationary distribution is obtained by finding the maximum © ª of the V -component of the version of (It , Vt ) obtained by time reversing the I component. This calculation in a special case gives also the ruin probabilities for the Markov-modulated risk process with phase-type claims. The connection between the two models is a fluid representation of the Markov-modulated risk process given in Fig. IX.8. (a)
6
♥ ◦ ♠ ♥ • • ♠ ♥ ◦ • • ♥ ♣ ◦ • ◦ ♣ • ◦
-
¦ ♥ ¦ ♥ ◦ ¦ ♣ ♥ • ◦ ¦ ♣ ◦ ◦ ♣ •
(b)
6 ♥ ♥ ♥
◦ ◦
♥
◦
♠
•
♠
•
♣
• •
♣
-
¦
•
♥
•
¦
◦
♣
◦
♣
◦ •
♣
Figure IX.8
¦
• ◦
¦
♥
◦ ◦
♥
5. MARKOV-MODULATED INPUT
273
On Fig. IX.8, p = q1 = q2 = 2. The two environmental states are denoted ◦, •, the phase space E (◦) for B◦ has states ¦, ♥, and the one E (•) for B• states (i) ♣, ♠. A claim in state i can then be represented by © ª an E -valued Markov process as on Fig. IX.8(a). The fluid model (It , Vt ) on Fig. IX.8(b) is then obtained by changing the vertical jumps to segments with slope 1. Thus F = {◦, ¦, ♥, •, ♣, ♠}. In the general formulation, F is the disjoint union of E and the E (i) , ª © F = E ∪ (i, α) : i ∈ E, α ∈ E (i) , r(i) = −1, i ∈ E, r(i, α) = 1. The intensity matrix for {It } is (taking p = 3 for simplicity) β1 α(1) 0 0 (2) Λ − (β ) 0 β α 0 i diag 2 (3) 0 0 β α 3 ΛI = (1) (1) 0 0 T 0 0 t (2) (2) 0 t 0 0 T 0 0 0 t(3) 0 0 T (3)
.
The reasons for using the fluid representation are twofold. First, the probability in the Markov-modulated model of upcrossing level u in state i of {Jt } and phase α ∈ E (i) is the same as the probability that the fluid model upcrosses level u in state (i, α) of {It }. Second, in the fluid model EesVt < ∞ for all s, t, whereas EesSt = ∞ for all t and all s ≥ s0 where s0 < ∞. This implies that in the fluid context, we have more martingales at our disposal. bi [s] = −α(i) (T (i) + sI)−1 t(i) . Let Σ Recall that in the phase-type case, B denote the matrix −β1 α(1) 0 0 (βi )diag − Λ 0 −β2 α(2) 0 (3) 0 0 −β α 3 ∆−1 , r ΛI = (1) 0 0 T (1) 0 0 t (2) (2) 0 t 0 0 T 0 0 0 t(3) 0 0 T (3) with the four blocks denoted by Σij , i, j = 1, 2, corresponding to the partitioning of Σ into components indexed by E, resp. E (1) + · · · + E (p) . Proposition 5.1 A complex number s satisfies ¯ ¯ ¯ bi [−s] − 1))diag + sI ¯¯ = 0 ¯Λ + (βi (B
(5.1)
274
CHAPTER IX. MATRIX-ANALYTIC METHODS
if and only if s is an eigenvalue of Σ. If s is such a number, consider theµvector ¶ a ¡ ¡ ¢ ¢ c bi [−s] − 1) satisfying Λ + βi (B a = −sa and the eigenvector b = of diag d ∆−1 r ΛI , where c, d correspond to the partitioning of b into components indexed by E, resp. E (1) + · · · + E (p) . Then (up to a constant) X c = a, d = (sI − Σ22 )−1 Σ21 a = ai (sI − T (i) )−1 t(i) . i∈E
Proof. Using the well-known determinant identity ¯ ¯ ¯ Σ11 Σ12 ¯ ¯ ¯ ¯ ¯ −1 ¯ ¯ ¯ ¯ ¯ ¯ ¯ Σ21 Σ22 ¯ = Σ22 · Σ11 − Σ12 Σ22 Σ21 , with Σii replaced by Σii − sI, ¯ ¯ ¯ ¯ (βi )diag − Λ − sI ¯ ¯ ¯ ¯ (1) 0 ¯ t ¯ ¯ 0 t(2) ¯ ¯ 0 0 then also
it follows that if
0 0 t(3)
−β1 α(1) 0 0 (1) T − sI 0 0
0 −β2 α(2) 0 0 T (2) − sI 0
0 0 −β1 α(1) 0 0 T (3) − sI
¯ ¯ ¯ ¯ ¯ ¯ ¯ ¯ = 0, ¯ ¯ ¯ ¯ ¯
¯ ¯ ¡ ¢ ¯ ¯ ¯(βi )diag − Λ − sI + βi α(i) (T (i) − sI)−1 t(i) diag ¯ = 0
which is the same as (5.1). For the assertions on the eigenvectors, assume that a is chosen as asserted which means ´ ³ −1 Σ11 − sI + Σ12 (sI − Σ22 ) Σ21 a = 0 , −1
and let d = (sI − Σ22 )
Σ21 c + Σ22 d = =
Σ21 a, c = a. Then −1
Σ21 a − (sI − Σ22 − sI) (sI − Σ22 ) Σ21 a − Σ21 a + sd = sd.
Σ21 a
Noting that Σ11 c + Σ12 d = sc by definition, it follows that ³ c ´ ³ Σ Σ12 ´³ c ´ 11 = s . Σ21 Σ22 d d 2
5. MARKOV-MODULATED INPUT
275
Theorem 5.2 Assume that Σ = ∆−1 r ΛI has q = q1 + · · · + qp distinct eigen³ c(ν) ´ values s1 , . . . , sq with <(sν ) < 0 and let b(ν) = be the right eigenvector d(ν) corresponding to sν , ν = 1, . . . , q. Then ¡ s1 u (1) ¢¡ ¢−1 ψi (u) = eT c . . . esq u c(q) d(1) . . . d(q) e. i e (ν) Proof. Writing ∆−1 = sν b(ν) as (ΛI − ∆r sν )b(ν) = 0, it follows by r ΛI b © −s V (ν) ª Proposition III.4.4 that e ν t bIt is a martingale. For u, v > 0, define © ª © ª ω(u, v) = inf t > 0 : Vt = u or Vt = −v , ω(u) = inf t > 0 : Vt = u , ¡ ¢ pi (u, v; j, α) = Pi Vω(u,v) = u, Iω(u,v) = (j, α) , ¡ ¢ pi (u, v; j) = Pi Vω(u,v) = −v, Iω(u,v) = j , ¡ ¢ pi (u; j, α) = Pi ω(u) < ∞, Iω(u,v) = (j, α) .
Optional stopping at time ω(u, v) yields X X (ν) (ν) (ν) ci = e−sν u pi (u, v; j, α)dj,α + esν v pi (u, v; j)cj . j,α
j
Letting v → ∞ and using <(sν ) < 0 yields X (ν) (ν) esν u ci = pi (u; j, α)dj,α . j,α
Solving for the pi (u; j, α) and noting that ψi (u) = follows.
P j,α
pi (u; j, α), the result 2
Example 5.3 Consider the Poisson model with exponential claims with rate δ. Here E has one state only. To determine ψ(u), we first look for the negative ³ β −β ´ eigenvalue s of Σ = which is s = −γ with γ = δ − β. We can take δ −δ a = c = 1 and get d = (s + δ)−1 δ = δ/β = 1/ρ. Thus ψ(u) = esu /d = ρe−γu as should be. 2 Example 5.4 Assume that E has two states and that B1 , B2 are both exponential with rates δ1 , δ2 . Then we get ψi (u) as the sum of two exponential terms where the rates s1 , s2 are the negative eigenvalues of λ1 + β1 −λ1 −β1 0 −λ2 λ2 + β 2 0 −β2 . Σ = δ1 0 −δ1 0 0 δ2 0 −δ2 2
276
5b
CHAPTER IX. MATRIX-ANALYTIC METHODS
Computations via K
Recall the definition of the matrix K from VII.2. In terms of K, we get the following phase-type representation for the ladder heights (see the Appendix for the definition of the Kronecker product ⊗ and the Kronecker sum ⊕): ¡ ¢ (i) Proposition 5.5 G+ (i, j; ·) is phase-type with representation E (j) , θ j· , T (j) where (i) (j) −1 (j) ) (ej ⊗ I). θ j· = βj (eT i ⊗ α )(−K ⊕ T Proof. We must show that ¡ ¢ (j) (i) G+ i, j; (y, ∞) = θ j· eT y e.
(5.2)
However, according to VII.(2.2) the l.h.s. is Z
0
R(i, j; dx)B j (y − x)
βj −∞
=
Z
0
βj −∞ Z ∞
−Kx eT ej · α(j) eT i e
(j)
(j)
(y−x)
e dx
(j)
=
Kx ej · α(j) eT x dx eT y e eT ie 0 Z ∞ (j) (j) T (j) βj (ei ⊗ α ) eKx ⊗ eT x dx (ej ⊗ I)eT y e Z0 ∞ (j) (j) (j) T eKx⊕T x dx (ej ⊗ I)eT y e βj (ei ⊗ α )
=
θ j· eT
= =
βj
0
(i)
(j)
y
e. 2
Theorem 5.6 For i ∈ E, the Pi¢-distribution of M is phase-type with represen¡ tation E (1) + · · · + E (p) , θ (i) , U where
ujα,kγ =
(j) (j) t(j) αγ + tα θjγ
j=k
t(j) θ(j) α kγ
j 6= k
.
In particular, ψi (u) = Pi (M > u) = θ (i) eU u e.
(5.3)
6. MATRIX-EXPONENTIAL DISTRIBUTIONS
277
Proof. We decompose M in the familiar way as sum of ladder steps. Associated with each ladder step is a phase process, with phase space E (j) whenever the corresponding arrival occurs in environmental state j (the ladder step is of type j). Piecing together P these phase processes yields a terminating Markov process with state space i∈E E (i) , intensity matrix U , say, and lifelength M , and it just remains to check that U has the asserted form. Starting from J0 = i, the initial value of (i, α) is obviously chosen according to θ (i) . For a transition from (j, α) to (k, γ) to occur when j 6= k, the current ladder step of type j must (j) terminate, which occurs at rate tα , and a new ladder step of type k must start (j) in phase γ, which occurs w.p. θkγ . This yields the asserted form of ujα,kγ . For j = k, we have the additional possibility of a phase change from α to γ within (j) the ladder step, which occurs at rate tαγ . 2 Notes and references Section 5a is based upon Asmussen [63] and Section 5b upon Asmussen [59]. Numerical illustrations are given in Asmussen & Rolski [97]. The connection to fluid models is further exploited in a series of papers by Ahn & Ramaswami, e.g. [9, 10]. They also involve the connection to quasi birth-death processes, defined as birth-death processes in a Markovian environment and with some modification at the boundary 0. See also Badescu et al. [116]. First passage times for Markov additive processes with positive jumps of phase type are discussed in Breuer [201].
6
Matrix-exponential distributions
When deriving explicit or algorithmically tractable expressions for the ruin probability, we have so far concentrated on a claim size distribution B of phase-type. However, in many cases where such expressions are available there are classical results from the pre-phase-type-era which give alternative solutions under the slightly more general assumption that B has a Laplace-Stieltjes transform (or, equivalently, a m.g.f.) which is rational, i.e. the ratio between two polynomials (for the form of the density, see Example I.2.5). An alternative characterization is that such a distribution is matrix-exponential, i.e. that the density b(x) can be written as αeT x t for some row vector α, some square matrix T and some column vector t (the triple (α, T , t) is the representation of the matrix-exponential distribution/density): 6.1 Let b(x) be an integrable function on [0, ∞) and b∗ [θ] = RProposition ∞ −θx e b(x) dx its Laplace transform. Then b∗ [θ] is rational if and only if b(x) 0 is matrix-exponential. Furthermore, if b∗ [θ] =
b1 + b2 θ + b3 θ2 + ... + bn θn−1 , θn + a1 θn−1 + ... + an−1 θ + an
(6.1)
278
CHAPTER IX. MATRIX-ANALYTIC METHODS
then a matrix-exponential representation is given by b(x) = αeT x t where 0 B B T =B B @
α = (b1 b2 . . . bn−1 bn ) , 0 0 .. 0 −an
1 0 .. 0 −an−1
0 1 .. 0 −an−2
0 0 .. 0 −an−3
t = (0 0 . . . 0 1)T , 0 0 .. 0 −an−4
... ... ... ... ...
0 0 .. 0 −a2
0 0 .. 1 −a1
(6.2) 1 C C C. C A
(6.3)
Proof. If b(x) = αeT x t, then b∗ [θ] = α(θI − T )−1 t which is rational since each element of (θI − T )−1 is so. Thus, matrix-exponentiality implies a rational transform. The converse follows from the last statement of the theorem. For a proof, see Asmussen & Bladt [74] (the representation (6.2), (6.3) was suggested by Colm O’Cinneide, personal communication). 2 Remark 6.2 A remarkable feature of Proposition 6.1 is that it gives an explicit Laplace transform inversion which may appear more appealing than the first attempt to invert b∗ [θ] one would do, namely to asssume the roots Pn δ1 , . . . , δn of the denominator to be distinct and expand the r.h.s. of (6.1) as i=1 ci /(θ + δi ), Pn giving b(x) = i=1 ci e−δi x /δi . 2 Example 6.3 A set of necessary and sufficient conditions for a distribution to be phase-type are given in O’Cinneide [670]. One of his elementary criteria, b(x) > 0 for x > 0, shows that the distribution B with density b(x) = c(1 − cos(2π x))e−x , where c = 1 + 1/4π 2 , cannot be phase-type. Writing b(x) = c(−e(2πi−1)x /2 − e(−2πi−1)x /2 + e−x ), it follows that a matrix-exponential representation (β, S, s) is given by 2π i − 1 0 0 −c/2 0 −2π i − 1 0 , s = −c/2 . (6.4) β = (1 1 1) , S = 0 0 −1 c This representation is complex, but as follows from Proposition 6.1, we can always obtain a real one (α, T , t). Namely, since b∗ [θ] =
θ3
+
3θ2
1 + 4π 2 , + (3 + 4π 2 )θ + 1 + 4π 2
it follows by (6.2), (6.3) that we can take 0 0 α = (1 + 4π 2 0 0), T = −1 − 4π 2
1 0 −3 − 4π 2
0 0 1 , t = 0 . −3 1 2
6. MATRIX-EXPONENTIAL DISTRIBUTIONS
279
Example 6.4 This example shows why it is sometimes useful to work with matrix-exponential distributions instead of phase-type distributions: for dimensionality reasons. Consider the distribution with density b(x) =
¡ ¢ 15 e−x (2e−2x − 1)2 + δ . 7 + 15δ
Then it is known from O’Cinneide [670] that b is phase-type when δ > 0, and that the minimal number of phases in a phase-type representation increases to ∞ as δ ↓ 0, leading to matrix calculus in high dimensions when δ is small. But since b∗ [θ] =
(7 +
15δ)θ3
15(1 + δ)θ2 + 120δθ + 225δ + 105 , + (135δ + 63)θ2 + (161 + 345δ)θ + 225δ + 105
Proposition 6.1 shows that a matrix-exponential representation can always be obtained in dimension only 3 independent of δ. 2 As for the role of matrix-exponential distributions in ruin probability calculations, we shall only consider the compound Poisson model with arrival rate β and a matrix-exponential claim size distribution B, and present two algorithms for calculating ψ(u) in that setting. For the first, we take as starting point a representation of b∗ [θ] as p(θ)/q(θ) where p, q are polynomials without common roots. Then (cf. Corollary IV.3.4) the Laplace transform of the ruin probability is Z ∞ β − βp(θ)/q(θ) − ρθ b ¢. ψ[−θ] = e−θu ψ(u) du = ¡ (6.5) θ β − θ − βp(θ)/q(θ) 0 b Thus, we have represented ψ[−θ] as a ratio of polynomials (note that θ must necessarily be a root of the numerator and cancels), and can use this to invert by the method of Proposition 6.1 to get ψ(u) = βeSu s. For the second algorithm, we use a representation (α, T , t) of b(x). We recall (see Section 3; recall that t = −T e) that if B is phase-type and (α, T , t) a phase-type representation with α the initial vector, T the phase generator and t = −T e, then ψ(u) = −α+ e(T +tα+ )u T −1 t where α+ = −βαT −1 .
(6.6)
The remarkable fact is that, despite that the proof of (6.6) in Section 3 seems to use the probabilistic interpretation of phase-type distribution in an essential way, then: Proposition 6.5 (6.6) holds true also in the matrix-exponential case.
280
CHAPTER IX. MATRIX-ANALYTIC METHODS
Proof. Write −1 −1 b∗ = α(θI − T )−1 t, b∗+ = α+ (θI − T )−1 t, b∗∗ T t. + = α+ (θI − T )
Then in Laplace transform formulation, the assertion is equivalent to −α+ (θI − T − tα+ )−1 T −1 t =
β − βb∗ − ρθ , θ(β − θ − βb∗ )
(6.7)
cf. (6.5), (6.6). Presumably, this can be verified by analytic continuation from the phase-type domain to the matrix-exponential domain, but we shall give an algebraic proof. From the general matrix identity ([789, p. 519]) (A + U BV )−1 = A−1 − A−1 U B(B + BV A−1 U B)−1 BV A−1 , with A = θI − T , U = −t, B = 1 and V = α+ , we get (θI − T − tα+ )−1 = =
¡ ¢−1 (θI − T )−1 + (θI − T )−1 t 1 − α+ (θI − T )−1 t α+ (θI − T )−1 1 (θI − T )−1 + (θI − T )−1 tα+ (θI − T )−1 1 − b∗+
so that −α+ (θI − T − tα+ )−1 T −1 t =
−b∗∗ + −
b∗+ b∗∗ b∗∗ + = ∗+ . ∗ 1 − b+ b+ − 1
Now, since (θI − T )−1 T −1
=
(θI − T )−1 T −2
=
¢ 1 ¡ −1 T + (θI − T )−1 , θ 1 −2 1 1 T + 2 T −1 + 2 (θI − T )−1 θ θ θ
and Z 1
0
Z µB
∞
= = 0
∞
b(x) dx = −αT −1 t, xb(x) dx = αT −2 t,
7. RESERVE-DEPENDENT PREMIUMS
281
we get b∗+
= =
b∗∗ +
= = =
−βαT −1 (θI − T )−1 t = −βα(θI − T )−1 T −1 t ¢ β ¡ β − α T −1 + (θI − T )−1 t = (1 − b∗ ), θ θ −βαT −1 (θI − T )−1 T −1 t = −βα(θI − T )−1 T −2 t µ ¶ 1 1 −1 1 −2 −1 −βα T + 2 T + 2 (θI − T ) t θ θ θ ρ β β − + 2 − 2 b∗ . θ θ θ
∗ From this it is straightforward to check that b∗∗ + /(b+ − 1) is the same as the r.h.s. of (6.7). 2
Notes and references As noted in the references to Section 4, some key early references using distributions with a rational transform for applied probability calculations are T¨ acklind [826] (ruin probabilities) and Smith [814] (queueing theory). A key tool is identifying poles and zeros of transforms via Wiener-Hopf factorization. Much of the flavor of this classical approach and many examples are in Cohen [249]; see also Dufresne [332] and Kuznetsov [563] for a recent discussion. For expositions on the general theory of matrix-exponential distributions, see Asmussen & Bladt [74], Lipsky [600] and Asmussen & O’Cinneide [94]; a key early paper is Cox [264] (from where the distribution in Example 6.3 is taken). The proof of Proposition 6.5 is similar to arguments used in [74] for formulas in renewal theory. Some relevant more recent references on matrix-exponential distributions are Bean, Fackrell & Taylor [150], Bladt & Neuts [173] and Fackrell [360].
7
Reserve-dependent premiums
We consider the model of Chapter VIII with Poisson arrivals at rate β, premium rate p(r) at level r of the reserve {Rt } and claim size distribution B which we assume to be of phase-type with representation (E, α, T ). In Corollary VIII.1.9, the ruin probability ψ(u) was found in explicit form for the case of B being exponential (for some remarkable explicit formulas due to Paulsen & Gjessing [687], see the Notes to VIII.1, but the argument of [687] does not apply in any reasonable generality). We present here first a computational approach for the general phase-type case (Section 7a) and next (Section 7b) a set of formulas covering the case of a two-step premium rule, cf. VIII.1a.
282
7a
CHAPTER IX. MATRIX-ANALYTIC METHODS
Computing ψ(u) via differential equations
The representation we use is essentially the same as the one used in Sections 3 and 4, to piece together the phases at downcrossing times of {Rt } (upcrossing times of {St }) to a Markov process {mx } with state space E. See Fig. IX.9, which is self-explanatory given Fig. IX.6.
Figure IX.9 The difference from the case p(r) ≡ p is that {mx }, though still Markov, is no longer time-homogeneous. Let P (t1 , t2 ) be the matrix with ijth element P ( mt2 = j | mt1 = i), 0 ≤ t1 ≤ t2 ≤ u. Define further νi (u) as the probability that the risk process starting from P R0 = u downcrosses level uPfor the first time in phase i. Note that in general i∈E νi (u) < 1. In fact, i∈E νi (u) is the ruin probability for a risk process with initial reserve 0 and premium function p(u + ·). Also, in contrast to Section 3, the definition of {mx } depends on the initial reserve u = R0 . ¡ ¢ Since ν(u) = νi (u) i∈E is the (defective) initial probability vector for {mx }, we obtain ψ(u) = P(mu ∈ E) = ν(u)P (0, u)e = λ(u)e
(7.1)
where λ(t) = ν(u)P (0, t) is the vector of state probabilities for mt , i.e. λi (t) = P(mt = i). Given the ν(t) have been computed, the λ(t) and hence ψ(u) is available by solving differential equations: ¡ ¢ Proposition 7.1 λ(0) = ν(u) and λ0 (t) = λ(t) T + tν(u − t) , 0 ≤ t ≤ u.
7. RESERVE-DEPENDENT PREMIUMS
283
Proof. The first statement is clear by definition. By general results on timeinhomogeneous Markov processes, ½Z t2 ¾ P (t1 , t2 ) = exp Q(v) dv (7.2) t1
where
¤¯¯ d£ P (t, t + s) − I ¯ . (7.3) ds s=0 However, the interpretation of Q(t) as the intensity matrix of {mx } at time t shows that Q(t) is made up of two terms: obviously, {mx } has jumps of two types, those corresponding to state changes in the underlying phase process and those corresponding to the present jump of {Rt } being terminated at level u − t and being followed by a downcrossing. The intensity of a jump from i to j is tij for jumps of the first type and ti νj (u − t) for the second. Hence Q(t) = T + tν(u − t), ¡ ¢ λ0 (t) = λ(t)Q(t) = λ(t) T + tν(u − t) . 2 Q(t) =
Thus, from a computational point of view the remaining problem is to evaluate the ν(t), 0 ≤ t ≤ u. Proposition 7.2 For i ∈ E, −νi0 (u)p(u) = βαi + νi (u)
nX
o X νj (u)tj p(u) − β + νj (u)tji p(u) .
j∈E
(7.4)
j∈E
Proof. Consider the event A that there are no arrivals in the interval [0, dt], the probability of which is 1 − βdt. Given Ac , the probability that level u is downcrossed for the first time in phase i is αi . Given A, the probability that ¡ ¢ level u + p(u)dt is downcrossed for the first time in phase j is νj u + p(u)dt . Given this occurs, two things can happen: either the current jump continues from u + p(u)dt to u, or it stops between level u + p(u)dt and u. In the first case, the probability of downcrossing level u in phase i is ¡ ¢ δji 1 + p(u)dt · tii + (1 − δji )p(u)dt · tji = δji + p(u)tji dt , whereas in the second case the probability is p(u)dt · tj νi (u). Thus, given A, the probability of downcrossing level u in phase i for the first time is X ¡ ¢£ ¤ νj u + p(u)dt δji + p(u)dt · tji + p(u)dt · tj νi (u) j∈E
=
νi (u) + νi0 (u)p(u) dt + p(u) dt
X© j∈E
ª tji + tj νi (u) .
284
CHAPTER IX. MATRIX-ANALYTIC METHODS
Collecting terms, we get νi (u) = αi dt + (1 − βdt)νi (u) + νi0 (u)p(u) dt + p(u) dt
X©
ª tji + tj νi (u) .
j∈E
Subtracting νi (u) on both sides and dividing by dt yields the asserted differential equation. 2 When solving the differential equation in Proposition 7.2, we face the difficulty that no boundary conditions is immediately available. To deal with this, consider a modification of the original process {Rt } by linearizing the process with some rate ρ, say, after a certain level v, say. Let pv (t), Rtv , Pv etc. refer to the modified process. Then ½ p(r) r < v v p (r) = , ρ r≥v and (no matter how ρ is chosen) we have: Lemma 7.3 For any fixed u ≥ 0, νi (u) = lim νiv (u). v→∞
Proof. Let A be the event that the process downcrosses level u in phase i given that it starts at u and let Bv be the event © ª Bv = σ < ∞, sup Rt > v t≤σ
where σ denotes the time of downcrossing level u. Then P(Bv ) is the tail of a (defective) random variable so that P(Bv ) → 0 as v → ∞, and similarly Pv (Bv ) → 0. Since the processes Rt and Rtv coincide under level Bv , then P(A ∩ Bvc ) = v P (A ∩ Bvc ). Now since both P(A ∩ Bv ) → 0 and Pv (A ∩ Bv ) → 0 as v → ∞ we have P(A) − Pv (A)
= = →
P(A ∩ Bv ) + P(A ∩ Bvc ) − Pv (A ∩ Bv ) − Pv (A ∩ Bvc ) P(A ∩ Bv ) − Pv (A ∩ Bv ) 0
as v → ∞.
2
From Section 3, we have β p(r) ≡ ρ ⇒ νi (u) ≡ − αT ei , ρ
(7.5)
7. RESERVE-DEPENDENT PREMIUMS
285
which implies that νiv (v) is given by the r.h.s. of (7.5). Thus, we can first for a given v solve (7.4) backwards for {νiv (t)}v≥t≥0 , starting from ν v (v) = −βπT −1 /ρ. This yields νiv (u) for any values of u and v such that u ≤ v. Next consider a sequence of solutions obtained from a sequence of initial values {νiv (u)}v where, say, v = u, 2u, 3u etc. Thus we obtain a convergent sequence of solutions that converges to {νi (t)}u≥t≥0 . Notes and references The exposition is based upon Asmussen & Bladt [75] which also contains numerical illustrations. The algorithm based upon the numerical solution of a Volterra integral equation (Remark VIII.1.10, numerically implemented in Schock Petersen [695]) and the present one based upon differential equations require both discretization along a discrete grid 0, 1/n, 2/n, . . .. However, typically the complexity in n is at best O(n2 ) for integral equations but O(n) for differential equations. The actual precision depends on the particular numerical scheme being employed. The trapezoidal rule used in [695] gives a precision of O(n−3 ), while the fourth-order Runge-Kutta method implemented in [75] gives O(n−5 ).
7b
Two-step premium rules
We now assume the premium function to be constant in two levels as in VIII.1a, ½ p1 r ≤ v p(r) = (7.6) p2 r > v. We may think of process Rt as pieced together of two standard risk processes Rt1 and Rt2 with constant premiums p1 , p2 , such that Rt coincide with Rt1 under (i)
(i)
level v and with Rt2 above level v. Let ψ i (u) = α+ e(T +tα+ )u e denote the ruin (i) probability for Rti where αi+ = α+ = −βαT −1 /pi , cf. Corollary 3.1. We recall (i) from Proposition VIII.1.12 that ¡ in addition ¢ to the ψ (·), the evaluation of ψ(u) (1) (1) requires φv (u) = 1 − ψ (u)/ 1 − ψ (v) , 0 ≤ u ≤ v, which is available since the ψ (i) (·) are so, as well π(u), the probability of ruin between σ and the next upcrossing of v, where σ = inf {t ≥ 0 : Rt ≤ v}. (2)
(2)
To evaluate π(u), let ν(u) = α+ e(T +tα+ )(u−v) , assuming u ≥ v for the moment. Then ν(u) is the initial distribution of the undershoot when downcrossing level v given that the process starts at u, i.e. for u ≥ v the distribution of v − Rσ (defined for σ < ∞ only) is defective phase-type with representation (ν(u), T ). Recall that φv (w) is the probability of upcrossing level v before ruin given the process starts at w ≤ v. Therefore Z v ¡ ¢ ν(u)eT x t 1 − φv (v − x) dx + ν(u)eT v e (7.7) π(u) = 0
286
CHAPTER IX. MATRIX-ANALYTIC METHODS
(the integral is the contribution from {Rσ ≥ 0} and the last term the contribution from {Rσ < 0}). The integral in (7.7) equals Z v Z v 1 − ψ (1) (v − x) ν(u)eT x t dx − ν(u)eT x t dx 1 − ψ (1) (v) 0 0 ½ ¾ Z v 1 Tv Tx (1) = 1 − ν(u)eT v e − 1 − ν(u)e e − ν(u)e tψ (v − x) dx 1 − ψ (1) (v) 0 from which we see that Z v ¡ ¢ 1 1 1 − ν(u)eT v e . π(u) = 1+ ν(u)eT x tψ (1) (v−x) dx− 1 − ψ (1) (v) 0 1 − ψ (1) (v) (7.8) The integral in (7.8) equals Z v (2) (2) ν(u)eT x tα+ e(T +tα+ )(v−x) e dx 0
which, using Kronecker calculus (see A.4), can be written as `
(2)
ν(u) ⊗ α+ e(T +tα+ (2)
)v ´`
(2) ¯ (2) ´−1 ˘ {T ⊕(−T −tα+ )}v T ⊕ (−T − tα+ ) e − I (t ⊗ e) .
Thus, all quantities involved in the computation of ψ(u) have been found in matrix form. © ª Example 7.4 Let Rt1 be as in Example 3.2. I.e., B is hyperexponential corresponding to ¶ µ µ ¶ 1 1 3 −3 0 . α=( ), T = , t= 7 0 −7 2 2 5 The arrival rate is β = 3. Since µB = 5/21, p2 ≤ 3 · 21 = 57 yields ψ(u) = 1, so 3 we consider the non-trivial case example p2 = 4 and p1 = 1. From Example 3.2,
24 −u 1 35 − 24e−u − e−6u e + e−6u ⇒ φv (u) = . 35 35 35 − 24e−v − e−6v √ √ (2) Let λ1 = −3 + 2 2 and λ2 = −3 − 2 2 be the eigenvalues of T + tα+ . Then one gets √ ³ √2 + 1 1 − 2 λ2 (u−v) 1 λ1 (u−v) 1 λ2 (u−v) ´ λ1 (u−v) ν(u) = e + e e + e , 3 3 7 7 ³ 10 1 √ ´ ³ 10 1 √ ´ − + ψ (2) (u − v) = 2 eλ2 (u−v) + 2 eλ1 (u−v) , 21 3 21 3 20 . ψ (2) (0) = 21 ψ (1) (u) =
8. ERLANGIZATION FOR THE FINITE HORIZON CASE
287
From (7.7) we see that we can write π(u) = ν(u)V 2 where V 2 depends only on v, and one gets 12e5v − 2 35e6v − 24e5v − 1 V2 = . 5v 4e + 6 35e6v − 24e5v − 1 Thus, π(u) = p12 (u)/p11 (u) where p11 (u) = p12 (u) =
35e6v − 24e5v − 1, √ ³ 32 √ ´ λ (u−v) 5v ³ 2 2 4 ´ λ2 (u−v) 2 −4 2 e e + + e 7 3 21√ ³ 32 ³4 √ ´ 2 2 ´ λ1 (u−v) + + 4 2 eλ1 (u−v) e5v + − e . 7 21 3
In particular, π(v)
=
ψ(v)
=
192e5v + 8 , 21(35e6v − 24e5v − 1) 192e5v + 8 . 6v 35e + 168e5v + 7
Thus all terms involved in the formulae for the ruin probability have been ex2 plicitly derived. Notes and references The analysis and the example are from Asmussen & Bladt [75].
8
Erlangization for the finite horizon case
We consider the Cram´er-Lundberg model with parameters β, B and recall from Corollary V.3.5 that an explicit formula for the Laplace transform w.r.t. u of E[e−δτ (u) ; τ (u) < ∞] can be found in terms of the root −ρδ < 0 of ¡ ¢ b −1 = δ. κ(r) = β B[r]
(8.1)
Thus the finite horizon ruin probability ψ(u, T ) can in principle be computed exactly via a double Laplace transform inversion. Now transform inversion is never entirely straightforward and even less so when it is higher-dimensional. We present in this section a numerical scheme that basically only requires a
288
CHAPTER IX. MATRIX-ANALYTIC METHODS
rootfinding and the computation of a matrix-exponential under the assumption that the claim size distribution is phase-type (E, α, T ). The basic idea is to replace the deterministic time horizon T by a r.v. Hk that has an Erlang distribution with k stages and mean T , that is, with density δ k tk−1 −δt e where δ = δk = k/T . (k − 1)! That is, we compute Z
∞
ψ(u, t)
ψk (u) = Eψ(u, Hk ) = 0
δ k tk−1 −δt e dt . (k − 1)!
(8.2)
Since the s