Schweitzer Fachinformationen
Wenn es um professionelles Wissen geht, ist Schweitzer Fachinformationen wegweisend. Kunden aus Recht und Beratung sowie Unternehmen, öffentliche Verwaltungen und Bibliotheken erhalten komplette Lösungen zum Beschaffen, Verwalten und Nutzen von digitalen und gedruckten Medien.
Preface ix
Introduction xi
Chapter 1 Elementary Probabilities and an Introduction to Stochastic Processes 1
1.1 Measures and s-algebras 1
1.2 Probability elements 5
1.3. Stochastic processes 16
1.4. Exercises 19
Chapter 2 Conditional Expectation 21
2.1 Conditional probability with respect to an event 21
2.2. Conditional expectation 24
2.3. Geometric interpretation 37
2.4. Conditional expectation and independence 38
2.5. Exercises 41
Chapter 3 Random Walks 45
3.1 Trajectories of the random walk 45
3.2. Asymptotic behavior 52
3.3. The Gambler's ruin 58
3.4. Exercises 60
Chapter 4 Martingales 63
4.1 Definition 63
4.2. Martingale transform 66
4.3 The Doob decomposition 67
4.4 Stopping time 69
4.5 Stopped martingales 71
4.6. Exercises 75
Chapter 5 Financial Markets 81
5.1. Financial assets 82
5.2. Investment strategies 82
5.3. Arbitrage 84
5.4. The Cox, Ross and Rubinstein model 86
5.5. Exercises 88
5.6. Practical work 90
Chapter 6 European Options 95
6.1 Definition 95
6.2. Complete markets 96
6.3. Valuation and hedging 97
6.4. Cox, Ross and Rubinstein model 98
6.5. Exercises 104
6.6. Practical work: Simulating the value of a call option 106
Chapter 7 American Options 107
7.1 Definition 107
7.2 Optimal stopping 109
7.4. The Cox, Ross and Rubinstein model 115
7.5. Exercises 116
7.6. Practical work 117
Chapter 8 Solutions to Exercises and Practical Work 119
8.1. Solutions to exercises in Chapter1 119
8.2. Solutions to exercises in Chapter2 127
8.3 Solutions to exercises in Chapter3 143
8.4. Solutions to exercises in Chapter4 151
8.5. Solutions to exercises in Chapter5 170
8.6.Solutions to the practical exercises in Chapter5 175
8.7. Solutions to exercises in Chapter6 189
8.8. Solution to the practical exercise in Chapter6 (section6.6) 193
8.9. Solution to exercises in Chapter7 195
8.10. Solution to the practical exercise in Chapter7 (section7.6) 200
References 205
Index 207
This chapter reviews the basic concepts related to probability and random variables which will be useful for the rest of this text. For a more detailed explanation as well as demonstrations, the readers may refer to [BAR 07, DAC 82, FOA 03, OUV 08, OUV 09] in French and [BIL 12, CHU 01, DUR 10, KAL 02, SHI 00] in English. The readers who are already familiar with these concepts may proceed straight to section 1.3, which introduces the concept of stochastic processes.
This chapter begins with a brief summary of the concepts of a s-algebra in section 1.1. These concepts will help in understanding the construction of the properties of conditional expectation in Chapter 2. We then study the chief definitions and properties of random variables and their distribution in section 1.2. There is an emphasis on discrete random variables as this entire book essentially studies discrete cases. Section 1.3 defines a stochastic process, which is the main subject studied in this book. Finally, there are exercises in handling these different concepts in section 1.4. The solutions are given in Chapter 8.
Throughout the rest of the text, O is a non-empty set and (O) denotes the set of the subsets of O :
The set O is called the universe or the fundamental set. In practice, the set O contains all the possible outcomes of a random experiment.
Let us start by reviewing the concept of a s-algebra.
DEFINITION 1.1.- A subset of (O) is a s-algebra over O if
Elements of a s-algebra are called events.
EXAMPLE 1.1.- The set = {Ø, O} is a s-algebra and is also the smallest s-algebra over O; it is called the trivial s-algebra. Indeed, is in fact a s-algebra since O ? and by creating unions of Ø and O we always obtain Ø ? or O ? . Further, for any other s-algebra , we clearly have ? .
EXAMPLE 1.2.- The set (O) is the largest s-algebra over O; it is called the largest s-algebra. Indeed, by construction, (O) contains all the subsets of O, and thus it contains in particular O and it is stable by complementarity and under countable unions. In addition, any other s-algebra over O is clearly included in (O).
DEFINITION 1.2.- Let O be a non-empty set and be a s-algebra over O. The couple (O, ) is called a probabilizable space.
Among the elementary properties of s-algebra, we can cite stability through any intersection (countable or not).
PROPOSITION 1.1.- Any intersection of s-algebras over a set O is a s-algebra over O.
PROOF.- Let (i)i?I be any family of s-algebra indexed by a non-empty set I. Thus,
It is generally difficult to make explicit all the events in a s-algebra. We often describe it using generating events.
DEFINITION 1.3.- Let e be a subset of (O). The s-algebra s(e) generated by e is the intersection of all s-algebras containing e. It is the smallest s-algebra containing e. e is called the generating system of the s-algebra s(e).
It can be seen that s(e) is indeed a s-algebra, being an intersection of s-algebras.
EXAMPLE 1.3.- If A ? O, then, s(A) = {Ø, O, A, Ac} is the smallest s-algebra O containing A.
EXAMPLE 1.4.- If O is a topological space, the s-algebra generated by the open sets of O is called the Borel s-algebra of O. A Borel set is a set belonging to the Borel s-algebra. On R, (R) generally denotes the s-algebra of Borel sets. It must be recalled that this is also the s-algebra generated by the intervals, or by the intervals of the form ] - 8, x], x ? R. Thus, there is no unicity of the generating system.
We will now recall the concept of the product s-algebra.
DEFINITION 1.4.- Let (Ei, i)i?N be a sequence of measurable spaces.
is denoted by 0 ? ... ? n, and it is called the product s-algebra over We have, in particular,
In the specific case where E0 = ... = En = E and 0 = ... = n = , we also write
Finally, let us review the concepts of measurability and measure.
DEFINITION 1.5.- Let O be non-empty set and be a s-algebra on O.
DEFINITION 1.6.- Let (O, ) and (E, e ) be two probabilizable spaces. A mapping X, defined over O taking values in E, is said to be (, e)-measurable, or just measurable, if there is no ambiguity regarding the reference s-algebras, if
In practice, when E ? R, we set e = (E) the set of Borel subsets of E, that is, the set of subsets of E. We can simply say that X is -measurable. When, in addition, we manipulate a single s-algebra over O, it can be simply said that X is measurable. If we work with several s-algebras over O, the concerned s-algebra must always be specified: X is -measurable.
EXAMPLE 1.5.- If (O, ) is a measurable space and A ? , then the indicator function
is -measurable. Indeed, for any Borel set B in R, we have
Thus, in all cases, we do have
EXAMPLE 1.6.- The composition of two measurable functions is measurable. Indeed, if (O, ), (E, e) and (G, ) are three probabilizable spaces, f : O ? E and g : E ? G are two (, e) and (e, )-measurable mappings, respectively, then for any B ? , g-1(B) ? e and consequently,
Thus, the composition g ° f is indeed measurable on (O, ) in (G, ).
Dateiformat: ePUBKopierschutz: Adobe-DRM (Digital Rights Management)
Systemvoraussetzungen:
Das Dateiformat ePUB ist sehr gut für Romane und Sachbücher geeignet – also für „fließenden” Text ohne komplexes Layout. Bei E-Readern oder Smartphones passt sich der Zeilen- und Seitenumbruch automatisch den kleinen Displays an. Mit Adobe-DRM wird hier ein „harter” Kopierschutz verwendet. Wenn die notwendigen Voraussetzungen nicht vorliegen, können Sie das E-Book leider nicht öffnen. Daher müssen Sie bereits vor dem Download Ihre Lese-Hardware vorbereiten.Bitte beachten Sie: Wir empfehlen Ihnen unbedingt nach Installation der Lese-Software diese mit Ihrer persönlichen Adobe-ID zu autorisieren!
Weitere Informationen finden Sie in unserer E-Book Hilfe.