
Basic Stochastic Processes
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
More details
Other editions
Additional editions


Persons
Content
- Intro
- Table of Contents
- Title
- Copyright
- Introduction
- 1: Basic Probabilistic Tools for Stochastic Modeling
- 1.1. Probability space and random variables
- 1.2. Expectation and independence
- 1.3. Main distribution probabilities
- 1.4. The normal power (NP) approximation
- 1.5. Conditioning
- 1.6. Stochastic processes
- 1.7. Martingales
- 2: Homogeneous and Non-homogeneous Renewal Models
- 2.1. Introduction
- 2.2. Continuous time non-homogeneous convolutions
- 2.3. Homogeneous and non-homogeneous renewal processes
- 2.4. Counting processes and renewal functions
- 2.5. Asymptotical results in the homogeneous case
- 2.6. Recurrence times in the homogeneous case
- 2.7. Particular case: the Poisson process
- 2.8. Homogeneous alternating renewal processes
- 2.9. Solution of non-homogeneous discrete time evolution equation
- 3: Markov Chains
- 3.1. Definitions
- 3.2. Homogeneous case
- 3.3. Non-homogeneous Markov chains
- 3.4. Markov reward processes
- 3.5. Discrete time Markov reward processes (DTMRWPs)
- 3.6. General algorithms for the DTMRWP
- 4: Homogeneous and Non-homogeneous Semi-Markov Models
- 4.1. Continuous time semi-Markov processes
- 4.2. The embedded Markov chain
- 4.3. The counting processes and the associated semi-Markov process
- 4.4. Initial backward recurrence times
- 4.5. Particular cases of MRP
- 4.6. Examples
- 4.7. Discrete time homogeneous and non-homogeneous semi-Markov processes
- 4.8. Semi-Markov backward processes in discrete time
- 4.9. Discrete time reward processes
- 4.10. Markov renewal functions in the homogeneous case
- 4.11. Markov renewal equations for the non-homogeneous case
- 5: Stochastic Calculus
- 5.1. Brownian motion
- 5.2. General definition of the stochastic integral
- 5.3. Itô's formula
- 5.4. Stochastic integral with standard Brownian motion as an integrator process
- 5.5. Stochastic differentiation
- 5.6. Stochastic differential equations
- 5.7. Multidimensional diffusion processes
- 5.8. Relation between the resolution of PDE and SDE problems. The Feynman-Kac formula [PLA 06]
- 5.9. Application to option theory
- 6: Lévy Processes
- 6.1. Notion of characteristic functions
- 6.2. Lévy processes
- 6.3. Lévy-Khintchine formula
- 6.4. Subordinators
- 6.5. Poisson measure for jumps
- 6.6. Markov and martingale properties of Lévy processes
- 6.7. Examples of Lévy processes
- 6.8. Variance gamma (VG) process
- 6.9. Hyperbolic Lévy processes
- 6.10. The Esscher transformation
- 6.11. The Brownian-Poisson model with jumps
- 6.12. Complete and incomplete markets
- 6.13. Conclusion
- 7: Actuarial Evaluation, VaR and Stochastic Interest Rate Models
- 7.1. VaR technique
- 7.2. Conditional VaR value
- 7.3. Solvency II
- 7.4. Fair value
- 7.5. Dynamic stochastic time continuous time model for instantaneous interest rate
- 7.6. Zero-coupon pricing under the assumption of no arbitrage
- 7.7. Market evaluation of financial flows
- Bibliography
- Index
- End User License Agreement
1
Basic Probabilistic Tools for Stochastic Modeling
In this chapter, the readers will find a brief summary of the basic probability tools intensively used in this book. A more detailed version including proofs can be found in [JAN 06].
1.1. Probability space and random variables
Given a sample space O, the set of all possible events will be denoted by , which is assumed to have the structure of a s -field or a s -algebra. P will represent a probability measure.
DEFINITION 1.1.- A random variable (r.v.) with values in a topological space (E,?) is an application X from O to E such that:
[1.1]where X-1(B) is called the inverse image of the set B defined by:
[1.2]Particular cases:
a) If (E,?) = ( , ß), X is called a real random variable.
b) If (E, ?) = , where is the extended real line defined by and is the extended Borel s -field of , that is the minimal s -field containing all the elements of ß and the extended intervals:
[1.3]X is called a real extended value random variable.
c) If E = (n>1) with the product s -field ß(n) of ß, X is called an n-dimensional real random variable.
d) If E = (n>1) with the product s -field ß(n) of ß, X is called a real extended n-dimensional real random variable.
A random variable X is called discrete or continuous accordingly as X takes at most a denumerable or a non-denumerable infinite set of values.
DEFINITION 1.2.- The distribution function of the r.v. X, represented by FX, is the function from [0,1] defined by:
[1.4]Briefly, we write:
[1.5]This last definition can be extended to the multi-dimensional case with a r.v. X being an n-dimensional real vector: X = (X1,., Xn), a measurable application from (O, , P) to .
DEFINITION 1.3.- The distribution function of the r.v. X = (X1,., Xn) , represented by FX, is the function from to [0,1] defined by:
[1.6]Briefly, we write:
[1.7]Each component Xi (i = 1,.,n) is itself a one-dimensional real r.v. whose d.f., called the marginal d.f., is given by:
[1.8]The concept of random variable is stable under a lot of mathematical operations; so any Borel function of a r.v. X is also a r.v.
Moreover, if X and Y are two r.v., so are:
[1.9]provided, in the last case, that Y does not vanish.
Concerning the convergence properties, we must mention the property that, if (Xn, n = 1) is a convergent sequence of r.v. - that is, for all ??O, the sequence (Xn (?)) converges to X (?) - then the limit X is also a r.v. on O. This convergence, which may be called the sure convergence, can be weakened to give the concept of almost sure (a.s.) convergence of the given sequence.
DEFINITION 1.4.- The sequence (Xn (?)) converges a.s. to X (?) if:
[1.10]This last notion means that the possible set where the given sequence does not converge is a null set, that is, a set N belonging to such that:
[1.11]In general, let us remark that, given a null set, it is not true that every subset of it belongs to but of course if it belongs to , it is clearly a null set. To avoid unnecessary complications, we will assume from here onward that any considered probability space is complete, i.e. all the subsets of a null set also belong to and thus their probability is zero.
1.2. Expectation and independence
Using the concept of integral, it is possible to define the expectation of a random variable X represented by:
[1.12]provided that this integral exists. The computation of the integral:
[1.13]can be done using the induced measure µ on ( , ß), defined by [1.4] and then using the distribution function F of X.
Indeed, we can write:
[1.14]and if FX is the d.f. of X, it can be shown that:
[1.15]The last integral is a Lebesgue-Stieltjes integral.
Moreover, if FX is absolutely continuous with fX as density, we obtain:
[1.16]If g is a Borel function, then we also have (see, e.g. [CHU 00] and [LOÈ 63]):
[1.17]and with a density for X:
[1.18]It is clear that the expectation is a linear operator on integrable functions.
DEFINITION 1.5.- Let a be a real number and r be a positive real number, then the expectation:
[1.19]is called the absolute moment of X, of order r, centered on a.
The moments are said to be centered moments of order r if a=E(X). In particular, for r = 2, we get the variance of X represented by s2 (var(X)) :
[1.20]REMARK 1.1.- From the linearity of the expectation, it is easy to prove that:
[1.21]and so:
[1.22]and, more generally, it can be proved that the variance is the smallest moment of order 2, whatever the number a is.
The set of all real r.v. such that the moment of order r exists is represented by Lr.
The last fundamental concept that we will now introduce in this section is stochastic independence, or more simply independence.
DEFINITION 1.6.- The events A1,., An, (n > 1) are stochastically independent or independent iff:
[1.23]For n = 2, relation [1.23] reduces to:
[1.24]Let us remark that piecewise independence of the events A1,., An, (n > 1) does not necessarily imply the independence of these sets and, thus, not the stochastic independence of these n events.
From relation [1.23], we find that:
[1.25]If the functions FX, FX1,., FX n are the distribution functions of the r.v. X = (X1,., Xn), X1,., Xn, we can write the preceding relation as follows:
[1.26]It can be shown that this last condition is also sufficient for the independence of X = (X1,., Xn), X1,., Xn. If these d.f. have densities fX, fX1,., fXn, relation [1.24]is equivalent to:
[1.27]In case of the integrability of the n real r.v X1,X2,.,Xn,, a direct consequence of relation [1.26] is that we have a very important property for the expectation of the product of n independent r.v.:
[1.28]The notion of independence gives the possibility of proving the result called the strong law of large numbers, which states that if (Xn, n = 1) is a sequence of integrable independent and identically distributed r.v., then:
[1.29]The next section will present the most useful distribution functions for stochastic modeling.
DEFINITION 1.7 (SKEWNESS AND KURTOSIS COEFFICIENTS).-
a) The skewness coefficient of Fisher is defined as follows:
From the odd value of this exponent, it follows that:
-?1>0 gives a left dissymmetry giving a maximum of the density function situated to the left and a distribution with a right heavy queue, ?1 = 0 gives symmetric distribution with respect to the mean;
-?1<0 gives a right dissymmetry giving a maximum of the density function situated to the right and a distribution with a left heavy queue.
b) The kurtosis coefficient also due to Fisher is defined as follows:
Its interpretation refers to the normal distribution for which its value is 3. Also some authors refer to the excess of kurtosis given by ?1-3 of course null in the normal case.
For ?2<3, distributions are called leptokurtic, being more plated around the mean than in the normal case and with heavy queues.
For ?2>3, distributions are less plated around the mean than in the normal case and with heavy...
System requirements
File format: ePUB
Copy protection: Adobe-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Install the free reader Adobe Digital Editions prior to download (see eBook Help).
- Tablet/smartphone (Android; iOS): Install the free app Adobe Digital Editions or the app PocketBook before downloading (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (not Kindle).
The file format ePub works well for novels and non-fiction books – i.e., „flowing” text without complex layout. On an e-reader or smartphone, line and page breaks automatically adjust to fit the small displays.
This eBook uses Adobe-DRM, a „hard” copy protection. If the necessary requirements are not met, unfortunately you will not be able to open the eBook. You will therefore need to prepare your reading hardware before downloading.
Please note: We strongly recommend that you authorise using your personal Adobe ID after installation of any reading software.
For more information, see our ebook Help page.