• Aucun résultat trouvé

Markovian Projection of Stochastic Processes

N/A
N/A
Protected

Academic year: 2021

Partager "Markovian Projection of Stochastic Processes"

Copied!
190
0
0

Texte intégral

Loading

Figure

Figure 5.1: d=2 : Monte Carlo estimator ˆ C(T, K) vs analytical approxima- approxima-tion (red) for 20-days call opapproxima-tion prices.
Table 5.1: d=2: Monte Carlo estimator ˆ C(T, K) vs analytical approxima- approxima-tion (red) for 20-days call opapproxima-tion prices (LI 10% (T, K), UI 10% (T, K)) is the
Figure 5.2: Dimension 30 : Monte Carlo estimator ˆ C(T, K) vs analytical ap- ap-proximation (red) for 20-days call option prices (LI 10% (T, K), UI 10% (T, K))
Table 5.2: Dimension 2 : Assessment of the accuracy of the Laplace ap- ap-proximation of the asymptotic l(K).
+2

Références

Documents relatifs

The work of Ford, Kac and Mazur [1] suggests the existence of a quantum- mechanical analogue of the Ornstein-Uhlenbeck stochastic process [2]... If in addition

DAY, On the Asymptotic Relation Between Equilibrium Density and Exit Measure in the Exit Problem, Stochastics, Vol. DAY, Recent Progress on the Small Parameters Exit

In order to detail the probabilistic framework in the particular case of the example given in the introduction of this paper, let us consider a component which can be in two

The main result of Section 2 is Theorem 2.3 in which it is shown that the symbolic power algebra of monomial ideal I of codimension 2 which is generically a complete intersection

In the reliability theory, the availability of a component, characterized by non constant failure and repair rates, is obtained, at a given time, thanks to the computation of

The aim of this paper is to prove the exponential ergodicity towards the unique invariant probability measure for some solutions of stochastic differential equations with finite

Like in the Brownian case, numerical results show that both recursive marginal quantization methods (with optimal and uniform dispatching) lead to the same price estimates (up to 10

To see how hierarchical and mobile systems may be modelled in this algebra, using the combined sequential and parallel operations, consider a set of automata S and let us denote the