Euler scheme for SDEs with non-lipschitz diffusion coefficient: strong convergence

Size: px
Start display at page:

Download "Euler scheme for SDEs with non-lipschitz diffusion coefficient: strong convergence"

Transcription

1 Author manuscript, published in "SAIM: Probability and Statistics 12 (28) 15" INSTITUT NATIONAL D RCHRCH N INFORMATIQU T N AUTOMATIQU uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence Abdel Berkaoui Mireille Bossy Awa Diop No 5637 version 2 version initiale Juillet 25 version révisée Janvier 26 Thème NUM apport de recherche N inria-176, version 2-1 Jan 26

2 inria-176, version 2-1 Jan 26

3 Unité de recherche INRIA Sophia Antipolis uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence Abdel Berkaoui, Mireille Bossy, Awa Diop inria-176, version 2-1 Jan 26 Thème NUM Systèmes numériques Projets Oméga Rapport de recherche no 5637 version 2 version initiale Juillet 25 version révisée Janvier pages Abstract: We consider one-dimensional stochastic differential equations in the particular case of diffusion coefficient functions of the form x α, α [1/2, 1). In that case, we study the rate of convergence of a symmetrized version of the uler scheme. This symmetrized version is easy to simulate on a computer. We prove its strong convergence and obtain the same rate of convergence as when the coefficients are Lipschitz. uler scheme, strong error, CIR process, Hull-White process, SABR pro- Key-words: cesses. Dept of Statistics, University of Warwick, Gibbet Hill road, Coventry CV4 7AL UK INRIA, OMGA Modification du Lemme 3.3 et preuve du Théoreme 2.2

4 Schéma d uler pour des DS à coefficients de diffusion non lipschitziens : convergence forte Résumé : On s intéresse à la discrétisation d DS unidimensionnelles, dans le cas particulier d un coefficient de diffusion de la forme x α, α [1/2, 1). Dans ce cas, on étudie la vitesse de convergence d un schéma d uler symétrisé. Le schéma reste simple à simuler sur un ordinateur. On démontre la convergence forte du schéma : on obtient la même vitesse de convergence que dans le cas de coefficients lipschitziens. Mots-clés : Schéma d uler, erreur forte, processus de CIR, processus d Hull-White, processus SABR. inria-176, version 2-1 Jan 26

5 uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence 3 1 Introduction The aim of this article is to present an original technique for the strong convergence rate analysis of discretization schemes applied to SD s with non Lipschitz diffusion coefficients. To treat the non Lipschitz property of the coefficient, we use a stochastic time change inspired from Berkaoui [2. We restrict ourselves to one dimensional SD s, with diffusion coefficients of the form σ(x) = x α, α [1/2, 1) and we analyze the strong rate of convergence of the symmetrized uler scheme. More precisely, we consider (X t ) t, the R-valued process solution to the following onedimensional Itô stochastic differential equation inria-176, version 2-1 Jan 26 X t = x + b(x s )ds + σ X s α dw s, where x and σ > are given constants and (W t ) t is a one-dimensional Brownian motion defined on a given probability space (Ω, F, P). We denote by (F t ) t the Brownian filtration. To ensure the existence of such process, we state the following hypotheses: (H) α [1/2, 1) and there exists a positive constant K such that b() >, and b(x) b(y) K x y, x R, y R. Under hypotheses (H), strong existence and uniqueness holds for the previous equation (see e.g. [1). Moreover, as b(x) Kx, using comparison results one can show that (X t ) t is valued in [, + ). Then (X t ) t is the unique strong solution to X t = x + b(x s )ds + σ X α s dw s. (1.1) Simulation schemes for (1.1) are motivated by applications in Finance where equations like (1.1) models the dynamics of the short term interest rate: we refer to the Cox, Ingersoll and Ross model [5, the Hull and White model [9 or the SABR models [8. The solution processes are positive. This is one of the reasons to introduce these models in practice. By using the classical uler scheme, one cannot define a positive approximation process. We study a symmetrized uler scheme for (1.1), which preserves the sign of the solution and which can be simulated easily. The symmetrized uler scheme, introduce to treat reflected stochastic differential equations, leads to a weak convergence rate of order one for Lipschitz coefficients (see [4). For quation (1.1), the convergence in the weak sense of the present scheme has already been studied by Bossy and Diop in [3, In this present work, we aim to study the L p -convergence rate, which required original arguments to face the fact that the diffusion coefficient is not globally Lipschitz. In section 2, we describe the time discretization scheme for (X t ) t T. In this particular case, symmetrized uler scheme means that we take the absolute value of the classical uler RR no 5637

6 4 Berkaoui, Bossy & Diop inria-176, version 2-1 Jan 26 scheme. In section 3, we prove the convergence. When the coefficients are globally Lipschitz, results on the convergence in L p (Ω)-norm for the uler scheme are well known. A classical technique to obtain the convergence rate consists in applying the Itô formula to the function x 2p and the error approximation process t = X t X t and using the Lipschitz property of the coefficients (see [7). Here, we replace the Itô formula by the Itô Tanaka formula, in order to deal with the absolute value of the classical uler scheme. When 1/2 < α < 1, we obtain the usual rate of convergence in O( t). We prove the same when α = 1/2 on stronger hypothesis on the drift coefficient. Let us mention two close works. First, Deelstra and Delbaen in [6 give a strong rate of convergence using Yamada s method for a quite similar scheme. Second, Alfonsi in [1 analyses the (strong and weak) rate of convergence of some implicit schemes (with analytical solution) in the special case of the CIR process and compare them numerically with the Deelstra and Delbaen scheme s and the present one. 2 On the symmetrized uler scheme for (1.1) In all what follows, we assume hypotheses (H) even if this is no more explicitly mentioned. 2.1 The scheme and notations Let (X t ) t be given by (1.1). For a fixed time T >, we define a discretization scheme (X tk, k =,..., N) by { X = x >, X tk+1 = X tk + b(x tk ) t + σx α (2.1) t k (W tk+1 W tk ), k =,..., N 1, where N denotes the number of discretization times t k = k t and t > is a constant time step such that N t = T. In the following, we use the time continuous version (X t ) t T : X t = X η(t) + (t η(t))b(x η(t) ) + σx α η(t)(w t W η(t) ), (2.2) where η(s) = sup k {1,...,N} {t k ; t k s}. The process (X t ) t T takes positive values. Using Tanaka s formula, we can easily show, by induction on each subinterval [t k, t k+1 ), for k = to N 1, that (X) is a continuous semimartingale with a continuous local time (L t (X), t T ) at point. Indeed, for any t [, T, if we set then, X t = Z t and Z t = X η(t) + b(x η(t) )(t η(t)) + σx α η(t)(w t W η(t) ), (2.3) X t = x + sgn(z s )b(x η(s) )ds + σ sgn(z s )X α η(s)dw s + L t (X), (2.4) INRIA

7 uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence 5 where sgn(x) := 1 2 ll (x ). The following lemma ensures the existence of all positives moments of (X) and (X) as well as some negative moments of (X): Lemma 2.1 For any x >, for any p 1, there exists a positive constant C, depending on p, but also on the parameters b(), K, σ, α and T, such that ( ) ( ) sup X 2p t t [,T + sup X 2p t t [,T C(1 + x 2p ). (2.5) inria-176, version 2-1 Jan 26 When 1/2 < α < 1, for any p >, ( 1 sup t [,T X p t ) C(1 + x p ). (2.6) When α = 1 2b() 2, for any p such that 1 < p < σ 1 2 ( ) 1 X p C t x p. (2.7) The proof can be found in [ Strong convergence Theorem 2.2 Consider (X t ) t T, the solution of (1.1) and (X t ) t T, the corresponding symmetrized uler scheme given by (2.1). Let t satisfying t 1/(2K). i) For all 1/2 < α < 1, for all p 1, there exists a positive constant C(T, p) depending on α, σ, b, T and x, increasing in T and p, such that [ 1/2p sup X t X t 2p C(T, p) t. (2.8) t T ii) When α = 1/2, the estimate (2.8) holds if we assume also that σ 2 8 with K(p) = K(4p 1) (4σα(2p 1)) 2. ( ) 2 2b() σ 2 1 > K(4p), (2.9) We emphasize the difference between the situation 1/2 < α < 1 and α = 1/2. Let τ = inf{t ; X t = }. When 1/2 < α < 1 and x >, Feller s test on process (X) shows that RR no 5637

8 6 Berkaoui, Bossy & Diop it is enough to suppose b() > as in (H) to ensure that P(τ = ) = 1. When α = 1/2, (X) satisfies the equation X t = x + b(x s )ds + σ Xs dw s, t T. (2.1) inria-176, version 2-1 Jan 26 When b(x) is of the form a bx, with a >, (X) is the classical CIR process. When b(x) = a >, (X) is the square of a Bessel process. When x >, one can show that P(τ = ) = 1 for any drift b(x) satisfying (H) and b() σ 2 /2, using the classical comparison lemma and Feller s test. In addition, if b() σ 2 /2, we are able to control the exponential inverse moment of the CIR like process (X) (see Lemma 3.1 below). The constraint (2.9) on b() and σ is stronger than b() σ 2 /2 due to the particular use of Lemma 3.1. in the proof of Theorem Proof In all the sequel, C denotes a positive constant depending on p or on the parameters b, σ, α and x of the model but not on t. We also use the following notation ( O exp ( t) = exp C ) t β, for some β >. 3.1 Preliminaries In this subsection, we gather a few results on exponential moments of (X) and on the behavior of the approximation processes (X) and (Z) visiting zero. Those results are crucial in the proof of convergence. Lemma 3.1 Let (X t ) t T be the solution of (1.1) with 1/2 < α < 1. For all µ, there exists a positive constant C(T, µ), increasing in µ and T, depending also on b σ, α and x such that ( ) T ds exp µ X 2(1 α) s ( ) When α = 1/2, Inequality (3.1) holds if µ ν2 σ 2 8 and ν = 2b() σ 1 2 C(T, µ). (3.1). The proof can be found in [3. Lemma 3.2 Let (X t ) t T be the approximation process defined by (2.2) and (Z t ) t T given by (2.3). Let t 1/(2K). i) If 1/2 < α < 1, then sup P ( Z t ) O exp ( t). t [,T INRIA

9 uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence 7 ii) If α = 1/2 and t 1/(2K) x, sup P ( Z t ) C t [,T ( t x ) b() σ 2. inria-176, version 2-1 Jan 26 Proof. Under (H), for any x, b(x) b() Kx. Thus, using (2.3), P ( Z t ) ( ) P X η(t) + (b() KX η(t) )(t η(t)) + σx α η(t)(w t W η(t) ) ( = P W t W η(t) X ) η(t)(1 K(t η(t))) b()(t η(t)), X η(t) > 1 2 [exp ( σx α η(t) (X η(t)(1 K(t η(t))) + b()(t η(t))) 2 2σ 2 (t η(t))x 2α η(t) ) ll {Xη(t) >} When 1/2 < α < 1, noting that (1 K t) 1 2, we have P ( Z t ) ( ) 1 2 exp X2(1 α) η(t) 8σ 2 exp b() t 2σ 2 X 2α 1 ll {Xη(t) >}. η(t) ( We distinguish the events X η(t) ) ( t and X η(t) > ) t and easily conclude that P ( Z t ) = O exp ( t). When α = 1/2, we deduce from the previous computation that P ( Z t / ( ) 1 X η(t) 2 exp X ) η(t) 8σ 2. t Lemma 3.5 in [3 ensures that, for any γ 1 ( sup exp X ) t k k N γσ 2 C t ( t x ) 2b() σ 2 (1 1 2γ ),. which ends the proof. 3.2 Proof of Theorem 2.2 We start with estimating the local error of the scheme (2.2): Lemma 3.3 For all p 1 and all 1/2 α < 1, there exists a positive constant C, depending on b(), σ, α, p, K and T but not on t such that { Xt } sup X η(t) 2p C t p. t [,T RR no 5637

10 8 Berkaoui, Bossy & Diop Proof. Indeed, sup X t X η(t) 2p t [,T Using (2.2), we have for t [t k, t k+1, sup k=...n 1 sup X t X tk 2p. t [t k,t k+1 X t X tk 2p b(x tk )(t t k ) + σx α t k (W t W tk ) 2 2p 1 t 2p b(x tk ) 2p + 2 2p 1 σ 2p X 2pα t k W t W tk 2p. 2p inria-176, version 2-1 Jan 26 But b(x tk ) 2p 2 2p 1 ( b() 2p + K 2p X tk 2p) and we easily conclude by using Lemma 2.1 that sup t [tk,t k+1 X t X tk 2p C 2 2p 1 t 2p + C2 2p 1 σ 2p C(p) t p. We define the process (γ(t)) t by γ(t) = ( X 1 α s ds + X 1 α η(s) sup t [t k,t k+1 ( W t W tk 4p ) 1/2 ) 2. (3.2) Note that γ(t) is well defined. Indeed, almost surely the process (X) is positive and under (H) (and the condition b() > σ 2 /2, when α = 1/2), the process (X) is almost surely strictly positive. Let τ λ be the stopping time defined by τ λ = inf{s [, T, γ(s) + s λ}, (3.3) with inf = T. We begin the convergence analysis, considering the strong error at the stopping time τ λ : Lemma 3.4 For all λ and all integer p 1, there exists a positive constant C(p) depending on b(), σ, α, p, K and T but not on t such that with K(p) = K(4p 1) (4σα(2p 1)) 2. X τλ X τλ 2p exp(k(p)λ)c(p) t p (3.4) INRIA

11 uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence 9 inria-176, version 2-1 Jan 26 Proof. The error process ( t ) t T defined by t := X t X t, satisfies t = ( b(xη(s) )sgn(z s ) b(x s ) ) ds + σ ( ) X α η(s)sgn(z s ) Xs α dw s + L t (X). For an arbitrary stopping time τ valued in [,T, we apply the Itô formula to 2p t, between and τ. As τ ( s) 2p 1 dl s(x) = τ ( X s) 2p 1 dl s(x), we obtain τ 2p 2p ( s ) 2p 1 ( b(x η(s) )sgn(z s ) b(x s ) ) ds ( ) + p(2p 1)σ 2 ( s ) 2p 2 X α 2 η(s)sgn(z s ) Xs α ds 2p ( s ) 2p 1 ( b(x η(s) ) b(x s ) ) ds ( ) + 2p(2p 1)σ 2 ( s ) 2p 2 X α 2 η(s) Xs α ds { } + 2 2p s 2p 1 b(x η(s) ) + 2p(2p 1)σ 2 ( s ) 2p 2 X 2α η(s) ll ds {Zs }. Thanks to Lemma 2.1, one can easily check that for any β, ( ) s β b(x η(s) ) + X 2α η(s) ll ds {Zs } C When 1/2 < α < 1, by Lemma 3.2, we conclude that τ 2p 2p ( s ) 2p 1 ( b(x η(s) ) b(x s ) ) ds ( + 2p(2p 1)σ 2 ( s ) 2p 2 X α η(s) Xs α sup t [,T sup t [,T P ( Z t ). (3.5) ) 2 ds + O exp ( t) (3.6) When α = 1/2, in the case of CIR-like processes, from Lemma 3.2 we only have P ( Z t ) C t b() 2σ 2. When we sum up the case α = 1/2 and 1/2 < α < 1, (3.6) becomes τ 2p 2p ( s ) 2p 1 ( b(x η(s) ) b(x s ) ) ds ( ) + 2p(2p 1)σ 2 ( s ) 2p 2 X α 2 η(s) Xs α ds + C t b() 2σ 2 p. (3.7) RR no 5637

12 1 Berkaoui, Bossy & Diop inria-176, version 2-1 Jan 26 In the case α = 1/2, the convergence rate seems to decrease form t p to t b() 2σ 2 p. This also occurs when one analyzes the weak convergence rate in [3. Indeed, for smooth enough test function f(x), one has that f(xt ) f(x T ) b() C t σ 2 1 instead of C t, and such behavior is confirmed by numerical experiments (see [1). Here, due to constraint (2.9), we are in the situation where b() 2σ p and the convergence 2 rate does not change when α = 1/2. The reason to impose this so strong constraint (2.9) will appear later, when we will try to apply Lemma 3.1 in the case α = 1/2, in the proof of Theorem 2.2. In view of (3.2), we have ( s ) 2p 2 (X α η(s) Xs α ) 2 ds As, for all 1/2 α 1, we deduce τ = ( s ) 2p 2 (X α η(s) Xs α ) 2 (Xs 1 α + X 1 α η(s) ) 2 dγ(s). x, y, (x α y α )(x 1 α + y 1 α ) 2α x y, (3.8) ( s ) 2p 2 (X α η(s) X α s ) 2 ds 4α 2 τ ( s ) 2(p 1) (X η(s) X s ) 2 dγ(s), from which (3.7) becomes τ 2p 2pK s 2p 1 Xη(s) X s ds + 2p(2p 1)σ 2 4α 2 ( s ) 2(p 1) (X η(s) X s ) 2 dγ(s) + C t p. We remark that for r = 1, 2, s 2p r Xη(s) X s r s 2p r ( s + X η(s) X s ) r 2 r 1 s 2p r ( s r + X η(s) X s r). By the Young Inequality we also have s 2p r X η(s) X s r 2p r 2p ( s) 2p + r 2p X η(s) X s 2p so that s 2p r X η(s) X s r 2p r r(1 + 2p )( s) 2p + r2 2p X η(s) X s 2p, (3.9) INRIA

13 uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence 11 and τ 2p K(p) ( s ) 2p d(s + γ(s)) + [ K (2p 1)(4ασ) 2 X η(s) X s 2p d(s + γ(s)) + C t p, with K(p) = K(4p 1) (4σα(2p 1)) 2. But, [ T X η(s) X s 2p d(s + γ(s)) X η(s) X s 2p (1 + 1 s X 2 2α )ds. inria-176, version 2-1 Jan 26 Using the local error estimate in Lemma 3.3, for any couple (a, b) such that 1/a + 1/b = 1, we have X η(s) X s 2p d(s + γ(s)) C t p + T C t p (1 + sup t [,T ( Xη(s) X s 2pb) ( ( 1 b ( ( 1 X a(2 2α) s )) 1 a 1 Xs a(2 2α) ) )) 1 a ds We apply Lemma 2.5 to upper-bound the negative moment of (X). By condition (2.9), as 1 > 2, we can choose a = 2, even if α = 1/2. Then 2b() σ 2 τ 2p K(p) ( s ) 2p d(s + γ(s)) + C t p. Now we choose τ = τ λ defined in (3.3). Noting that τ λ + γ(τ λ ) = λ, we apply the change of time u = s + γ(s) in the above integral: [ λ τλ 2p K(p) τu 2p du + C t p. By Gronwall Lemma, we conclude that τλ 2p C t p exp(k(p)λ). RR no 5637

14 12 Berkaoui, Bossy & Diop Proof of Theorem 2.2. We proceed as before to get for all t [, T, inria-176, version 2-1 Jan 26 t 2p 2p ( s ) 2p 1 (b(x η(s) )sgn(z s ) b(x s ))ds ( ) + p(2p 1)σ 2 ( s ) 2p 2 X α 2 η(s)sgn(z s ) Xs α ds + 2pσ ( s ) 2p 1 ( X α η(s)sgn(z s ) X α s ) dw s and by the Burkholder-Davis-Gundy Inequality, [ T sup t 2p C s 2p 1 b(x η(s) )sgn(z s ) b(x s ) ds s T [ T ( ) + C ( s ) 2p 2 X α 2 η(s)sgn(z s ) Xs α ds + C T ( s ) 4p 2 ( X α η(s)sgn(z s ) X α s ) 2 ds. Again we use (3.5) and Lemma 3.2, (together with the condition (2.9) when α = 1/2) to get [ T sup t 2p C s 2p 1 X η(s) X s ds s T [ T ( ) + C ( s ) 2p 2 X α 2 η(s) Xs α ds + C T ( s ) 4p 2 ( X α η(s) X α s ) 2 ds + C t p. Now, we use (3.8) and by definition of γ t in (3.2), it comes: [ T sup t 2p C ( s ) 2p 1 X η(s) X s ds s T [ T + C ( s ) 2p 2 (X η(s) X s ) 2 dγ(s) + C T ( s ) 4p 2 (X η(s) X s ) 2 dγ(s) + C t p. INRIA

15 uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence 13 inria-176, version 2-1 Jan 26 We use the upper bound (3.9) in each of the three terms above: [ T sup t 2p C ( s ) 2p d(γ(s) + s) s T [ T + C X η(s) X s 2p d(γ(s) + s) + C + C T T ( s ) 4p dγ(s) X η(s) X s 4p dγ(s) + C t p, [ T As previously, X η(s) X s 2p d(γ(s) + s) C t p and the same treatment on T X η(s) X s 4p dγ(s) leads to [ T sup s T t 2p C ( s ) 2p d(γ(s) + s) + C Again, we apply the change of time u = s + γ(s): [ γ(t )+T sup s T t 2p C ( τu ) 2p du + C Now, using Lemma 3.4, we have [ γ(t )+T + ( τu ) 2p du = ( ll {γ(t )+T u} ( τu ) 2p) du + We proceed similarly to bound T γ(t )+T [P (γ(t ) + T u) 1/2 [ ( τu ) 4p 1/2 du C t p [T exp (T K(2p)) + γ(t )+T + ( s ) 4p dγ(s) + C t p, ( τu ) 4p du + C t p. [P (γ(t ) u) 1/2 exp (uk(2p)) du. ( τu ) 4p du from above and finally we get sup s T + t 2p C t p [P (γ(t ) u) 1/2 exp (uk(4p)) du. RR no 5637

16 14 Berkaoui, Bossy & Diop To finish the proof, we have to show that u [P (γ(t ) u) 1/2 exp(uk(4p)) L 1 (R + ). By the Markov inequality, we observe that, for µ >, [P (γ(t ) u) 1/2 exp( µu) ( [exp (2µγ(T ))) 1/2. We choose µ > K(4p). Moreover, in view of the definition of γ(t ) and Lemma 3.1, we have ( ) T ds [exp (2µγ(T )) exp 2µ C(T, µ). X 2(1 α) s inria-176, version 2-1 Jan 26 Note that in the case α = 1/2, the constraint (2.9) allows us to choose µ σ2 8 as required in Lemma 3.1. References ( ) 2 2b() σ 1 2 [1 A. ALFONSI. On the discretization schemes for the CIR (and Bessel squared) processes. Preprint, 25. [2 A. BRKAOUI. On the discretization of the solution of one dimensional reflected stochastic differential equation. Preprint, 22. [3 M. BOSSY and A. DIOP. An efficient discretization scheme for one dimensional SDs with a diffusion coefficient function of the form x a, a in [1/2,1). Technical report, INRIA, Décembre 24. preprint RR [4 M. BOSSY,. GOBT, and D. TALAY. A symmetrized uler scheme for an efficient approximation of reflected diffusions. J. Appl. Probab., 41(3): , 24. [5 J. COX, J.. INGRSOLL, and S.A. ROSS. A theory of the term structure of the interest rates. conometrica, 53, [6 G. DLSTRA and F. DLBAN. Convergence of discretized stochastic (interest rate) processes with stochastic drift term. Appl. Stochastic Models Data Anal., 14(1):77 84, [7 O. FAUR. Simulation du Mouvement Brownien et des Diffusions. PhD thesis, cole Nationale des Ponts et Chaussées, [8 P.S. HAGAN, D. KUMAR, A.S. LSNIWSKI, and D.. WOODWARD. Managing smile risk. WILMOTT Magazine, September, 22. [9 J.C. HULL and A. WHIT. Pricing interest-rate derivative securities. Rev. Finan. Stud., 3: , 199. INRIA

17 uler scheme for SDs with non-lipschitz diffusion coefficient: strong convergence 15 [1 I. KARATZAS and S.. SHRV. Brownian Motion and Stochastic Calculus. Springer- Verlag, New York, inria-176, version 2-1 Jan 26 RR no 5637

18 inria-176, version 2-1 Jan 26 Unité de recherche INRIA Sophia Antipolis 24, route des Lucioles - BP Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université - ZAC des Vignes 4, rue Jacques Monod ORSAY Cedex (France) Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois - Campus scientifique 615, rue du Jardin Botanique - BP Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l urope Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau - Rocquencourt - BP Le Chesnay Cedex (France) Éditeur INRIA - Domaine de Voluceau - Rocquencourt, BP Le Chesnay Cedex (France) ISSN

Maximizing the Cohesion is NP-hard

Maximizing the Cohesion is NP-hard INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Maximizing the Cohesion is NP-hard arxiv:1109.1994v2 [cs.ni] 9 Oct 2011 Adrien Friggeri Eric Fleury N 774 version 2 initial version 8 September

More information

Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives

Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives Olympia

More information

Multiplication by an Integer Constant: Lower Bounds on the Code Length

Multiplication by an Integer Constant: Lower Bounds on the Code Length INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Multiplication by an Integer Constant: Lower Bounds on the Code Length Vincent Lefèvre N 4493 Juillet 2002 THÈME 2 ISSN 0249-6399 ISRN INRIA/RR--4493--FR+ENG

More information

Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model

Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model Jonathan Touboul To cite this version: Jonathan Touboul. Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire

More information

Bernstein s basis and real root isolation

Bernstein s basis and real root isolation INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Bernstein s basis and real root isolation Bernard Mourrain Fabrice Rouillier Marie-Françoise Roy N 5149 Mars 2004 THÈME 2 N 0249-6399 ISRN

More information

The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach

The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach Cyril Duron, Jean-Marie Proth To cite this version: Cyril Duron, Jean-Marie Proth. The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach.

More information

Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions

Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions Tomas Lang, Jean-Michel Muller To cite this version: Tomas Lang, Jean-Michel Muller Bound on Run of Zeros and

More information

Bounded Normal Approximation in Highly Reliable Markovian Systems

Bounded Normal Approximation in Highly Reliable Markovian Systems Bounded Normal Approximation in Highly Reliable Markovian Systems Bruno Tuffin To cite this version: Bruno Tuffin. Bounded Normal Approximation in Highly Reliable Markovian Systems. [Research Report] RR-3020,

More information

Quartic formulation of Coulomb 3D frictional contact

Quartic formulation of Coulomb 3D frictional contact INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Quartic formulation of Coulomb 3D frictional contact Olivier Bonnefon Gilles Daviet N 0400 January 10, 2011 Modeling, Optimization, and

More information

Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks

Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks Alonso Silva Patricio Reyes Mérouane Debbah N 6854 February 29 Thème

More information

Iterative Methods for Model Reduction by Domain Decomposition

Iterative Methods for Model Reduction by Domain Decomposition INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:0712.0691v1 [physics.class-ph] 5 Dec 2007 Iterative Methods for Model Reduction by Domain Decomposition Marcelo Buffoni Haysam Telib

More information

Boundary Control Problems for Shape Memory Alloys under State Constraints

Boundary Control Problems for Shape Memory Alloys under State Constraints INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Boundary Control Problems for Shape Memory Alloys under State Constraints Nikolaus Bubner, Jan Sokołowski and Jürgen Sprekels N 2994 Octobre

More information

On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells

On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells Hervé Guillard To cite this version: Hervé Guillard. On the behavior of upwind

More information

An algorithm for reporting maximal c-cliques

An algorithm for reporting maximal c-cliques An algorithm for reporting maximal c-cliques Frédéric Cazals, Chinmay Karande To cite this version: Frédéric Cazals, Chinmay Karande. An algorithm for reporting maximal c-cliques. [Research Report] RR-5642,

More information

Error Bounds on Complex Floating-Point Multiplication

Error Bounds on Complex Floating-Point Multiplication Error Bounds on Complex Floating-Point Multiplication Richard Brent, Colin Percival, Paul Zimmermann To cite this version: Richard Brent, Colin Percival, Paul Zimmermann. Error Bounds on Complex Floating-Point

More information

A CMA-ES for Mixed-Integer Nonlinear Optimization

A CMA-ES for Mixed-Integer Nonlinear Optimization A CMA-ES for Mixed-Integer Nonlinear Optimization Nikolaus Hansen To cite this version: Nikolaus Hansen. A CMA-ES for Mixed-Integer Nonlinear Optimization. [Research Report] RR-, INRIA.. HAL Id: inria-

More information

Henry law and gas phase disappearance

Henry law and gas phase disappearance INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:0904.1195v1 [physics.chem-ph] 7 Apr 2009 Henry law and gas phase disappearance Jérôme Jaffré Amel Sboui apport de recherche N 6891

More information

Stability and regulation of nonsmooth dynamical systems

Stability and regulation of nonsmooth dynamical systems Stability and regulation of nonsmooth dynamical systems Sophie Chareyron, Pierre-Brice Wieber To cite this version: Sophie Chareyron, Pierre-Brice Wieber. Stability and regulation of nonsmooth dynamical

More information

A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces

A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces Hachem Kadri Emmanuel Duflos Manuel Davy

More information

Throughput optimization for micro-factories subject to failures

Throughput optimization for micro-factories subject to failures Throughput optimization for micro-factories subject to failures Anne Benoit, Alexandru Dobrila, Jean-Marc Nicod, Laurent Philippe To cite this version: Anne Benoit, Alexandru Dobrila, Jean-Marc Nicod,

More information

arxiv: v12 [math.na] 19 Feb 2015

arxiv: v12 [math.na] 19 Feb 2015 On explicit numerical schemes for the CIR process arxiv:145.7v1 [math.na] 19 Feb 15 Nikolaos Halidias Department of Mathematics University of the Aegean Karlovassi 83 Samos, Greece email: nikoshalidias@hotmail.com

More information

Optimal Routing Policy in Two Deterministic Queues

Optimal Routing Policy in Two Deterministic Queues INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal Routing Policy in Two Deterministic Queues Bruno Gaujal Emmanuel Hyon N 3997 Septembre 2000 THÈME 1 ISSN 0249-6399 ISRN INRIA/RR--3997--FR+ENG

More information

A filtering method for the interval eigenvalue problem

A filtering method for the interval eigenvalue problem A filtering method for the interval eigenvalue problem Milan Hladik, David Daney, Elias P. Tsigaridas To cite this version: Milan Hladik, David Daney, Elias P. Tsigaridas. A filtering method for the interval

More information

Optimal Routing Policy in Two Deterministic Queues

Optimal Routing Policy in Two Deterministic Queues Optimal Routing Policy in Two Deterministic Queues Bruno Gaujal, Emmanuel Hyon To cite this version: Bruno Gaujal, Emmanuel Hyon. Optimal Routing Policy in Two Deterministic Queues. [Research Report] RR-37,

More information

Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models

Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models Florian Lemarié To cite this version: Florian Lemarié. Numerical

More information

Convergence at first and second order of some approximations of stochastic integrals

Convergence at first and second order of some approximations of stochastic integrals Convergence at first and second order of some approximations of stochastic integrals Bérard Bergery Blandine, Vallois Pierre IECN, Nancy-Université, CNRS, INRIA, Boulevard des Aiguillettes B.P. 239 F-5456

More information

A Note on Node Coloring in the SINR Model

A Note on Node Coloring in the SINR Model A Note on Node Coloring in the SINR Model Bilel Derbel, El-Ghazali Talbi To cite this version: Bilel Derbel, El-Ghazali Talbi. A Note on Node Coloring in the SINR Model. [Research Report] RR-7058, INRIA.

More information

Comparison of TCP Reno and TCP Vegas via Fluid Approximation

Comparison of TCP Reno and TCP Vegas via Fluid Approximation INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Comparison of TCP Reno and TCP Vegas via Fluid Approximation Thomas Bonald N 3563 Novembre 1998 THÈME 1 apport de recherche ISSN 0249-6399

More information

Squared Bessel Process with Delay

Squared Bessel Process with Delay Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 216 Squared Bessel Process with Delay Harry Randolph Hughes Southern Illinois University Carbondale, hrhughes@siu.edu

More information

Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances

Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances Manuel Yguel To cite this version: Manuel Yguel. Rigid Transformation Estimation in Point Registration

More information

Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions

Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions Nikolaus Hansen, Steffen Finck, Raymond Ros, Anne Auger To cite this version: Nikolaus Hansen, Steffen Finck, Raymond

More information

On a class of stochastic differential equations in a financial network model

On a class of stochastic differential equations in a financial network model 1 On a class of stochastic differential equations in a financial network model Tomoyuki Ichiba Department of Statistics & Applied Probability, Center for Financial Mathematics and Actuarial Research, University

More information

Bounds on eigenvalues and singular values of interval matrices

Bounds on eigenvalues and singular values of interval matrices Bounds on eigenvalues and singular values of interval matrices Milan Hladik, David Daney, Elias P. Tsigaridas To cite this version: Milan Hladik, David Daney, Elias P. Tsigaridas. Bounds on eigenvalues

More information

The Azéma-Yor Embedding in Non-Singular Diffusions

The Azéma-Yor Embedding in Non-Singular Diffusions Stochastic Process. Appl. Vol. 96, No. 2, 2001, 305-312 Research Report No. 406, 1999, Dept. Theoret. Statist. Aarhus The Azéma-Yor Embedding in Non-Singular Diffusions J. L. Pedersen and G. Peskir Let

More information

Stochastic Differential Equations.

Stochastic Differential Equations. Chapter 3 Stochastic Differential Equations. 3.1 Existence and Uniqueness. One of the ways of constructing a Diffusion process is to solve the stochastic differential equation dx(t) = σ(t, x(t)) dβ(t)

More information

Efficient polynomial L -approximations

Efficient polynomial L -approximations INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Efficient polynomial L -approximations Nicolas Brisebarre Sylvain Chevillard N???? December 2006 Thème SYM apport de recherche ISSN 0249-6399

More information

Geometry and Numerics of CMC Surfaces with Radial Metrics

Geometry and Numerics of CMC Surfaces with Radial Metrics INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Geometry and Numerics of CMC Surfaces with Radial Metrics Gabriel Dos Reis N 4763 Mars 2003 THÈME 2 ISSN 0249-6399 ISRN INRIA/RR--4763--FRENG

More information

On the martingales obtained by an extension due to Saisho, Tanemura and Yor of Pitman s theorem

On the martingales obtained by an extension due to Saisho, Tanemura and Yor of Pitman s theorem On the martingales obtained by an extension due to Saisho, Tanemura and Yor of Pitman s theorem Koichiro TAKAOKA Dept of Applied Physics, Tokyo Institute of Technology Abstract M Yor constructed a family

More information

A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511

A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511 Anne Canteaut

More information

Stability of Stochastic Differential Equations

Stability of Stochastic Differential Equations Lyapunov stability theory for ODEs s Stability of Stochastic Differential Equations Part 1: Introduction Department of Mathematics and Statistics University of Strathclyde Glasgow, G1 1XH December 2010

More information

ISSN ISRN INRIA/RR FR+ENG. apport de recherche

ISSN ISRN INRIA/RR FR+ENG. apport de recherche INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE 3914 Analytic Combinatorics of Chord Diagrams Philippe Flajolet, Marc Noy N3914 March 2000 THEME 2 ISSN 0249-6399 ISRN INRIA/RR--3914--FR+ENG

More information

Perturbed path following interior point algorithms 1. 8cmcsc8. RR n2745

Perturbed path following interior point algorithms 1. 8cmcsc8. RR n2745 Perturbed path following interior point algorithms 0 0 8cmcsc8 RR n2745 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Perturbed path following interior point algorithms J. Frédéric Bonnans,

More information

Online Distributed Traffic Grooming on Path Networks

Online Distributed Traffic Grooming on Path Networks INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Online Distributed Traffic Grooming on Path Networks Jean-Claude Bermond David Coudert Joseph Peters N 6833 February 2009 Thème COM apport

More information

Improving Goldschmidt Division, Square Root and Square Root Reciprocal

Improving Goldschmidt Division, Square Root and Square Root Reciprocal INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Improving Goldschmidt Division, Square Root and Square Root Reciprocal Milos Ercegovac, Laurent Imbert, David Matula, Jean-Michel Muller,

More information

1 Brownian Local Time

1 Brownian Local Time 1 Brownian Local Time We first begin by defining the space and variables for Brownian local time. Let W t be a standard 1-D Wiener process. We know that for the set, {t : W t = } P (µ{t : W t = } = ) =

More information

Space Time relaying versus Information Causality

Space Time relaying versus Information Causality Space Time relaying versus Information Causality Philippe Jacquet To cite this version: Philippe Jacquet. Space Time relaying versus Information Causality. [Research Report] RR-648, INRIA. 008, pp.15.

More information

Large Deviations for Perturbed Reflected Diffusion Processes

Large Deviations for Perturbed Reflected Diffusion Processes Large Deviations for Perturbed Reflected Diffusion Processes Lijun Bo & Tusheng Zhang First version: 31 January 28 Research Report No. 4, 28, Probability and Statistics Group School of Mathematics, The

More information

A new flexible Checkpoint/Restart model

A new flexible Checkpoint/Restart model A new flexible Checkpoint/Restart model Mohamed Slim Bouguerra, Denis Trystram, Thierry Gautier, Jean-Marc Vincent To cite this version: Mohamed Slim Bouguerra, Denis Trystram, Thierry Gautier, Jean-Marc

More information

Anti-sparse coding for approximate nearest neighbor search

Anti-sparse coding for approximate nearest neighbor search INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:1110.3767v2 [cs.cv] 25 Oct 2011 Anti-sparse coding for approximate nearest neighbor search Hervé Jégou Teddy Furon Jean-Jacques Fuchs

More information

On the Size of Some Trees Embedded in R d

On the Size of Some Trees Embedded in R d INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On the Size of Some Trees Embee in R Pero Machao Manhães e Castro Olivier Devillers inria-448335, version - 8 Jan N 779 Janvier apport e

More information

Regularity of the density for the stochastic heat equation

Regularity of the density for the stochastic heat equation Regularity of the density for the stochastic heat equation Carl Mueller 1 Department of Mathematics University of Rochester Rochester, NY 15627 USA email: cmlr@math.rochester.edu David Nualart 2 Department

More information

Some SDEs with distributional drift Part I : General calculus. Flandoli, Franco; Russo, Francesco; Wolf, Jochen

Some SDEs with distributional drift Part I : General calculus. Flandoli, Franco; Russo, Francesco; Wolf, Jochen Title Author(s) Some SDEs with distributional drift Part I : General calculus Flandoli, Franco; Russo, Francesco; Wolf, Jochen Citation Osaka Journal of Mathematics. 4() P.493-P.54 Issue Date 3-6 Text

More information

EULER MARUYAMA APPROXIMATION FOR SDES WITH JUMPS AND NON-LIPSCHITZ COEFFICIENTS

EULER MARUYAMA APPROXIMATION FOR SDES WITH JUMPS AND NON-LIPSCHITZ COEFFICIENTS Qiao, H. Osaka J. Math. 51 (14), 47 66 EULER MARUYAMA APPROXIMATION FOR SDES WITH JUMPS AND NON-LIPSCHITZ COEFFICIENTS HUIJIE QIAO (Received May 6, 11, revised May 1, 1) Abstract In this paper we show

More information

Filtrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition

Filtrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition Filtrations, Markov Processes and Martingales Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition David pplebaum Probability and Statistics Department,

More information

Analogy on Sequences : a Definition and an Algorithm

Analogy on Sequences : a Definition and an Algorithm INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Analogy on Sequences : a Definition and an Algorithm Laurent Miclet Arnaud Delhay N 4969 Octobre 2003 THÈME 3 apport de recherche ISSN 0249-6399

More information

EXISTENCE OF NEUTRAL STOCHASTIC FUNCTIONAL DIFFERENTIAL EQUATIONS WITH ABSTRACT VOLTERRA OPERATORS

EXISTENCE OF NEUTRAL STOCHASTIC FUNCTIONAL DIFFERENTIAL EQUATIONS WITH ABSTRACT VOLTERRA OPERATORS International Journal of Differential Equations and Applications Volume 7 No. 1 23, 11-17 EXISTENCE OF NEUTRAL STOCHASTIC FUNCTIONAL DIFFERENTIAL EQUATIONS WITH ABSTRACT VOLTERRA OPERATORS Zephyrinus C.

More information

for all f satisfying E[ f(x) ] <.

for all f satisfying E[ f(x) ] <. . Let (Ω, F, P ) be a probability space and D be a sub-σ-algebra of F. An (H, H)-valued random variable X is independent of D if and only if P ({X Γ} D) = P {X Γ}P (D) for all Γ H and D D. Prove that if

More information

Optimal control of state constrained integral equations

Optimal control of state constrained integral equations INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal control of state constrained integral equations J. Frédéric Bonnans Constanza de la Vega inria-473952, version 1-16 Apr 21 N 7257

More information

Sébastien Chaumont a a Institut Élie Cartan, Université Henri Poincaré Nancy I, B. P. 239, Vandoeuvre-lès-Nancy Cedex, France. 1.

Sébastien Chaumont a a Institut Élie Cartan, Université Henri Poincaré Nancy I, B. P. 239, Vandoeuvre-lès-Nancy Cedex, France. 1. A strong comparison result for viscosity solutions to Hamilton-Jacobi-Bellman equations with Dirichlet condition on a non-smooth boundary and application to parabolic problems Sébastien Chaumont a a Institut

More information

Realistic wireless network model with explicit capacity evaluation

Realistic wireless network model with explicit capacity evaluation Realistic wireless network model with explicit capacity evaluation Philippe Jacquet To cite this version: Philippe Jacquet. Realistic wireless network model with explicit capacity evaluation. [Research

More information

Sign methods for counting and computing real roots of algebraic systems

Sign methods for counting and computing real roots of algebraic systems INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Sign methods for counting and computing real roots of algebraic systems Ioannis Z. Emiris & Bernard Mourrain & Mihail N. Vrahatis N 3669

More information

Parallel bottleneck in the Quasineutrality solver embedded in GYSELA

Parallel bottleneck in the Quasineutrality solver embedded in GYSELA INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Parallel bottleneck in the Quasineutrality solver embedded in GYSELA G. Latu N. Crouseilles V. Grandgirard N 7595 Avril 2011 Domaine 1 apport

More information

Global Gene Regulation in Metabolic Networks

Global Gene Regulation in Metabolic Networks Global Gene Regulation in Metabolic Networks Diego Oyarzun, Madalena Chaves To cite this version: Diego Oyarzun, Madalena Chaves. Global Gene Regulation in Metabolic Networks. [Research Report] RR-7468,

More information

Lecture 4: Ito s Stochastic Calculus and SDE. Seung Yeal Ha Dept of Mathematical Sciences Seoul National University

Lecture 4: Ito s Stochastic Calculus and SDE. Seung Yeal Ha Dept of Mathematical Sciences Seoul National University Lecture 4: Ito s Stochastic Calculus and SDE Seung Yeal Ha Dept of Mathematical Sciences Seoul National University 1 Preliminaries What is Calculus? Integral, Differentiation. Differentiation 2 Integral

More information

A MODEL FOR THE LONG-TERM OPTIMAL CAPACITY LEVEL OF AN INVESTMENT PROJECT

A MODEL FOR THE LONG-TERM OPTIMAL CAPACITY LEVEL OF AN INVESTMENT PROJECT A MODEL FOR HE LONG-ERM OPIMAL CAPACIY LEVEL OF AN INVESMEN PROJEC ARNE LØKKA AND MIHAIL ZERVOS Abstract. We consider an investment project that produces a single commodity. he project s operation yields

More information

A note on the complexity of univariate root isolation

A note on the complexity of univariate root isolation A note on the complexity of univariate root isolation Ioannis Emiris, Elias P. Tsigaridas To cite this version: Ioannis Emiris, Elias P. Tsigaridas. A note on the complexity of univariate root isolation.

More information

!! # % & ( # % () + & ), % &. / # ) ! #! %& & && ( ) %& & +,,

!! # % & ( # % () + & ), % &. / # ) ! #! %& & && ( ) %& & +,, !! # % & ( # % () + & ), % &. / # )! #! %& & && ( ) %& & +,, 0. /! 0 1! 2 /. 3 0 /0 / 4 / / / 2 #5 4 6 1 7 #8 9 :: ; / 4 < / / 4 = 4 > 4 < 4?5 4 4 : / / 4 1 1 4 8. > / 4 / / / /5 5 ; > //. / : / ; 4 ;5

More information

On Semigroups of Matrices in the (max,+) Algebra

On Semigroups of Matrices in the (max,+) Algebra INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On Semigroups of Matrices in the (max,) Algebra Stéphane GAUBERT N 2172 Janvier 1994 PROGRAMME 5 Traitement du signal, automatique et productique

More information

New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm

New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm New analysis of the asymptotic behavior of the Lempel-Ziv compression algorithm Philippe Jacquet, Szpankowski Wojciech To cite this version: Philippe Jacquet, Szpankowski Wojciech. New analysis of the

More information

Albert N. Shiryaev Steklov Mathematical Institute. On sharp maximal inequalities for stochastic processes

Albert N. Shiryaev Steklov Mathematical Institute. On sharp maximal inequalities for stochastic processes Albert N. Shiryaev Steklov Mathematical Institute On sharp maximal inequalities for stochastic processes joint work with Yaroslav Lyulko, Higher School of Economics email: albertsh@mi.ras.ru 1 TOPIC I:

More information

Some Aspects of Universal Portfolio

Some Aspects of Universal Portfolio 1 Some Aspects of Universal Portfolio Tomoyuki Ichiba (UC Santa Barbara) joint work with Marcel Brod (ETH Zurich) Conference on Stochastic Asymptotics & Applications Sixth Western Conference on Mathematical

More information

(2m)-TH MEAN BEHAVIOR OF SOLUTIONS OF STOCHASTIC DIFFERENTIAL EQUATIONS UNDER PARAMETRIC PERTURBATIONS

(2m)-TH MEAN BEHAVIOR OF SOLUTIONS OF STOCHASTIC DIFFERENTIAL EQUATIONS UNDER PARAMETRIC PERTURBATIONS (2m)-TH MEAN BEHAVIOR OF SOLUTIONS OF STOCHASTIC DIFFERENTIAL EQUATIONS UNDER PARAMETRIC PERTURBATIONS Svetlana Janković and Miljana Jovanović Faculty of Science, Department of Mathematics, University

More information

A bundle-type algorithm for routing in telecommunication data networks

A bundle-type algorithm for routing in telecommunication data networks A bundle-type algorithm for routing in telecommunication data networks Claude Lemarechal, Adam Ouorou, Giorgios Petrou To cite this version: Claude Lemarechal, Adam Ouorou, Giorgios Petrou. A bundle-type

More information

Two-scale analysis for very rough thin layers. An explicit characterization of the polarization tensor

Two-scale analysis for very rough thin layers. An explicit characterization of the polarization tensor wo-scale analysis for very rough thin layers. An explicit characterization of the polarization tensor Ionel Sorin Ciuperca, Ronan Perrussel, Clair Poignard o cite this version: Ionel Sorin Ciuperca, Ronan

More information

Analysis and Low-order Modeling of the Three-dimensional Flow Past a Confined Square Cylinder

Analysis and Low-order Modeling of the Three-dimensional Flow Past a Confined Square Cylinder INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Analysis and Low-order ing of the Three-dimensional Flow Past a Confined Square Cylinder inria-19345, version - 6 Oct 6 Marcelo Buffoni

More information

Mean-square Stability Analysis of an Extended Euler-Maruyama Method for a System of Stochastic Differential Equations

Mean-square Stability Analysis of an Extended Euler-Maruyama Method for a System of Stochastic Differential Equations Mean-square Stability Analysis of an Extended Euler-Maruyama Method for a System of Stochastic Differential Equations Ram Sharan Adhikari Assistant Professor Of Mathematics Rogers State University Mathematical

More information

Blind Adaptive Channel Estimationin OFDM Systems

Blind Adaptive Channel Estimationin OFDM Systems Blind Adaptive Channel stimationin OFDM Systems Xenofon Doukopoulos, George Moustakides To cite this version: Xenofon Doukopoulos, George Moustakides Blind Adaptive Channel stimationin OFDM Systems [Research

More information

Delaunay triangulation of a random sample of a good sample has linear size

Delaunay triangulation of a random sample of a good sample has linear size Delaunay triangulation of a random sample of a good sample has linear size Olivier Devillers, Marc Glisse To cite this version: Olivier Devillers, Marc Glisse. Delaunay triangulation of a random sample

More information

Weak solutions of mean-field stochastic differential equations

Weak solutions of mean-field stochastic differential equations Weak solutions of mean-field stochastic differential equations Juan Li School of Mathematics and Statistics, Shandong University (Weihai), Weihai 26429, China. Email: juanli@sdu.edu.cn Based on joint works

More information

Complex Square Root with Operand Prescaling

Complex Square Root with Operand Prescaling Complex Square Root with Operand Prescaling Milos Ercegovac, Jean-Michel Muller To cite this version: Milos Ercegovac, Jean-Michel Muller. Complex Square Root with Operand Prescaling. [Research Report]

More information

Analysis of hybrid RD-Galerkin schemes for Navier-Stokes simulations

Analysis of hybrid RD-Galerkin schemes for Navier-Stokes simulations Analysis of hybrid RD-Galerkin schemes for Navier-Stokes simulations Jiří Dobeš, Mario Ricchiuto, Rémi Abgrall, Herman Deconinck To cite this version: Jiří Dobeš, Mario Ricchiuto, Rémi Abgrall, Herman

More information

Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing

Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing Agostino Martinelli N???? Mai 2012 Thèmes

More information

Optimization of a photobioreactor biomass production using natural light

Optimization of a photobioreactor biomass production using natural light INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:1009.2137v1 [math.oc] 11 Sep 2010 Optimization of a photobioreactor biomass production using natural light F. Grognard A.R. Akhmetzhanov

More information

Optimum CUSUM Tests for Detecting Changes in Continuous Time Processes

Optimum CUSUM Tests for Detecting Changes in Continuous Time Processes Optimum CUSUM Tests for Detecting Changes in Continuous Time Processes George V. Moustakides INRIA, Rennes, France Outline The change detection problem Overview of existing results Lorden s criterion and

More information

THE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON

THE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON GEORGIAN MATHEMATICAL JOURNAL: Vol. 3, No. 2, 1996, 153-176 THE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON M. SHASHIASHVILI Abstract. The Skorokhod oblique reflection problem is studied

More information

On the submartingale / supermartingale property of diffusions in natural scale

On the submartingale / supermartingale property of diffusions in natural scale On the submartingale / supermartingale property of diffusions in natural scale Alexander Gushchin Mikhail Urusov Mihail Zervos November 13, 214 Abstract Kotani 5 has characterised the martingale property

More information

A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations

A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations Stéphane Lanteri, Liang Li, Ronan Perrussel To cite this version: Stéphane Lanteri, Liang Li, Ronan Perrussel. A hybridizable

More information

On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane

On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane arxiv:1004.1733v1 [math.pr] 10 Apr 2010

More information

apport de recherche N 2589 Boubakar GAMATIE Juillet 1995 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE PROGRAMME 2 ISSN

apport de recherche N 2589 Boubakar GAMATIE Juillet 1995 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE PROGRAMME 2 ISSN INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A THEORY OF SEQUENTIAL FUNCTIONS Boubakar GAMATIE N 2589 Juillet 1995 PROGRAMME 2 apport de recherche ISSN 0249-6399 A THEORY OF SEQUENTIAL

More information

Incremental displacement-correction schemes for the explicit coupling of a thin structure with an incompressible fluid

Incremental displacement-correction schemes for the explicit coupling of a thin structure with an incompressible fluid Incremental displacement-correction scemes for te explicit coupling of a tin structure wit an incompressible fluid Miguel Angel Fernández To cite tis version: Miguel Angel Fernández. Incremental displacement-correction

More information

The Pedestrian s Guide to Local Time

The Pedestrian s Guide to Local Time The Pedestrian s Guide to Local Time Tomas Björk, Department of Finance, Stockholm School of Economics, Box 651, SE-113 83 Stockholm, SWEDEN tomas.bjork@hhs.se November 19, 213 Preliminary version Comments

More information

Time- and Space-Efficient Evaluation of Some Hypergeometric Constants

Time- and Space-Efficient Evaluation of Some Hypergeometric Constants INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Time- and Space-Efficient Evaluation of Some Hypergeometric Constants Howard Cheng Guillaume Hanrot Emmanuel Thomé Eugene Zima Paul Zimmermann

More information

Counting eigenvalues in domains of the complex field

Counting eigenvalues in domains of the complex field Counting eigenvalues in domains of the complex field Emmanuel Kamgnia, Bernard Philippe To cite this version: Emmanuel Kamgnia, Bernard Philippe. Counting eigenvalues in domains of the complex field. INRIA.

More information

WEAK VERSIONS OF STOCHASTIC ADAMS-BASHFORTH AND SEMI-IMPLICIT LEAPFROG SCHEMES FOR SDES. 1. Introduction

WEAK VERSIONS OF STOCHASTIC ADAMS-BASHFORTH AND SEMI-IMPLICIT LEAPFROG SCHEMES FOR SDES. 1. Introduction WEAK VERSIONS OF STOCHASTIC ADAMS-BASHFORTH AND SEMI-IMPLICIT LEAPFROG SCHEMES FOR SDES BRIAN D. EWALD 1 Abstract. We consider the weak analogues of certain strong stochastic numerical schemes considered

More information

Change detection problems in branching processes

Change detection problems in branching processes Change detection problems in branching processes Outline of Ph.D. thesis by Tamás T. Szabó Thesis advisor: Professor Gyula Pap Doctoral School of Mathematics and Computer Science Bolyai Institute, University

More information

Estimates for the density of functionals of SDE s with irregular drift

Estimates for the density of functionals of SDE s with irregular drift Estimates for the density of functionals of SDE s with irregular drift Arturo KOHATSU-HIGA a, Azmi MAKHLOUF a, a Ritsumeikan University and Japan Science and Technology Agency, Japan Abstract We obtain

More information

Online data processing: comparison of Bayesian regularized particle filters

Online data processing: comparison of Bayesian regularized particle filters Online data processing: comparison of Bayesian regularized particle filters Roberto Casarin, Jean-Michel Marin To cite this version: Roberto Casarin, Jean-Michel Marin. Online data processing: comparison

More information

Stochastic integral. Introduction. Ito integral. References. Appendices Stochastic Calculus I. Geneviève Gauthier.

Stochastic integral. Introduction. Ito integral. References. Appendices Stochastic Calculus I. Geneviève Gauthier. Ito 8-646-8 Calculus I Geneviève Gauthier HEC Montréal Riemann Ito The Ito The theories of stochastic and stochastic di erential equations have initially been developed by Kiyosi Ito around 194 (one of

More information

Man Kyu Im*, Un Cig Ji **, and Jae Hee Kim ***

Man Kyu Im*, Un Cig Ji **, and Jae Hee Kim *** JOURNAL OF THE CHUNGCHEONG MATHEMATICAL SOCIETY Volume 19, No. 4, December 26 GIRSANOV THEOREM FOR GAUSSIAN PROCESS WITH INDEPENDENT INCREMENTS Man Kyu Im*, Un Cig Ji **, and Jae Hee Kim *** Abstract.

More information

e - c o m p a n i o n

e - c o m p a n i o n OPERATIONS RESEARCH http://dx.doi.org/1.1287/opre.111.13ec e - c o m p a n i o n ONLY AVAILABLE IN ELECTRONIC FORM 212 INFORMS Electronic Companion A Diffusion Regime with Nondegenerate Slowdown by Rami

More information