Corrections to the Second Edition of Modeling and Analysis of Stochastic Systems
|
|
- Gerald Long
- 6 years ago
- Views:
Transcription
1 Corrections to the Second Edition of Modeling and Analysis of Stochastic Systems Vidyadhar Kulkarni November, 200 Send additional corrections to the author at his address Chapter 2. Page, Equation (2.5): insert, after ). 2. Page 5, line 5 from below: the entry P 0, should be 2p d ( p d ), and P 0,2 should be ( p d ) Page 6, line 5: replace X n by Z n. 4. Page 6, line 7: replace Z n by Z k. 5. Page 25, line 0: replace exiting by existing. 6. Page 30, line 3 from below: replace serves by serve. 7. Page 38, line 3 from below: replace D = XAX by A = XDX. 8. Page 39, line 2 from below: replace x i by x i. 9. Page 46, line 6 of Exercise 2.20: replace i by k. Chapter 3. Page 56, line 7 from below: replace between between by between. 2. Page 62, line 2 of Example 3.7: replace form by from. 3. Page 68, line 2: replace v by v i. 4. Page 75, line 4 and 5: replace φ () by φ i (). 5. Page 70, Line 5 from below: insert is before tossed. 6. Page 74, line 5: replace by E(z T X 0 = i, X = 0) =. E(z T X 0 = i, X = 0) = z. 7. page 75, Equation 3.3: replace φ (k) by φ (k) (). 8. Page 90, line 2 of Definition 4.4: insert if after closed.
2 Chapter 4. Page 9, Figures 4.: The label on the arc (,2) should be α and on the arc (2,) should be β. 2. Page 9, Figures 4.2: The label on the arc (2,2) should be β. 3. Page 9, line 2 from below: replace C = {} by C = {0}. 4. Page 92, line 8 from below: replace the second n by m. 5. Page 92, Figure 4.3: the labels on the nodes should be 0,,2,i, i, i +, N and N. 6. Page 93, Example 4.8: Replace by P P = [ 0 0 ] [ 0 0 ] 7. Page 94, line 9: replace (n+)(n+2) by n(n+). 8. Page 94, line 3: replace (n+)(n+2) by n(n+). 9. Page 94, replace line 5 by 0. Page 94: replace lines 7, 8, 9 by n(n + ) = n n + m 0 = = = np( T 0 = n X 0 = 0) n=0 n= n=0 n n(n + ) n + =.. Page 97, Theorem 4.7 (ii): replace null transient by null recurrent. 2. Page 98, line 2 from below: replace finite by a communicating class. 3. Page 99, line : Replace The by Then. 4. Page 99, line 2: delete visits. 5. Page 02, line 5 from below: replace = by. 6. Page 03, Equations 4.6 and 4.7: replace ν(i) by d(i). 7. Page 03, line 3 from below: replace y i (r + ) by y (r+) i. 8. Page 04, line 3: replace by =. 9. Page 04, line 5: replace y (r+) i by y (n+) i. 20. Page 04, line 4 from below: insert positive before recurrent. 2. Page 05, line 4 of Theorem 4.2: replace > by < 2
3 22. Page 07, Equation 4.23: replace n = in the sum by n = Page 07, last line: replace n 0 by k Page 09, line 3: replace P( T j = m) by P( T j = m X 0 = j). 25. Page 09, line 4: replace ũ j (m) by u m. 26. Page 0, line 7: replace ν n by nu n. 27. Page 3, line 5: insert (by using the bounded convergence theorem) after get. 28. Page 4, Equation 4.3: replace p (nd+r) jj by p (nd+r) ij. 29. Page 4, Equation 4.32: replace M i j(n + ) by M (n+) ij. 30. Page 6: last line: replace two by three. 3. Page 7, line 5 from below: insert is after This. 32. Page 8: line 5: replace analytical examples by analytical solutions. 33. Page 8, line 4 in Example 4.2: replace positive recurrent by irreducible. 34. Page 9, the line above Example 4.22: replace is by has. 35. Page 9, line 6 in Example 4.22: replace recurrent by irreducible. 36. Page 20, line 4: replace positive recurrent by irreducible. 37. Page 22, line 0: insert unique before solution. 38. Page 22, line : replace an by and. 39. Page 23, line 2 of Theorem 4.22: insert non-negative after smallest. 40. Page 24, line 8 from below: replace α i (r) by u i (r). 4. Page 24, line 6 from below: replace m=n+ u m α i (r) ɛ/2 by u i (r) u m ɛ/2 m=n+ 42. Page 24, last line: replace the help of several examples by an example. 43. Page 27, last line: replace d( p u ) by dα( p u ). 44. Page 28, line 4: replace d( p u ) by dα( p u ). 45. Page 24, line 9: replace decision making by decisions. 46. Page 29, line 4 from below: replace π 2 by π B. 47. page 29, line 6 from below: replace DMTC by DTMC. 48. Page 34, line 4 of exercise 4.4: replace p o by p Page 40, line 6: replace east by least. 3
4 50. Page 4, line 2: insert ) after X n+. 5. Page 42, line 8 from below: insert recurrent after positive. Chapter 5. Page 47, line 8 from below: insert, after e λx. 2. Page 50, line 4: replace random t by random T. 3. Page 5, line 7 from below: replace exp by exp. 4. Page 52, line 2 of Theorem 5.5: replace Erl by Erl. Page 53, line 2 from above, and line 3 from below: replace X + 2 by X Page 52, line 4 from below: replace n! by (n )!. 6. page 54, line 2 of Theorem 5.7: replace G by G. 7. Page 57, line 3 from below: delete a. 8. Page 58, line 5 of Theorem 5.: replace k n in the superscript by k n. 9. Page 60: replace h i in the second sum by h i. 0. Page 63, lines 2,3 and 4 of the proof of Theorem 5.4: replace (t i + dt i ) by (t i, t i + dt i ).. Page 63, Page 63, line 5 of the proof of Theorem 5.4: replace (t i t i + dt i ) by (t i t i, t i t i + dt i ). 2. Page 67: figure 5.5: The label on the y-axis on the bottom graph should be N(t) = N (t) + N 2 (t). 3. Page 67, line from below: replace call by class. 4. Page 68, line 0: replace Z n by Z. 5. Page 68, line 6: replace in the by in this. 6. Page 69, line 8 from below: replace R n = i by R n = k. 7. Page 69, line 9 from below: replace iid be by iid. 8. Page 72, line 4 from below: insert has after 0}. 9. Page 73, line 3: replace G ) by G( ). 20. Page 77, Theorem 5.2: Replace on the right hand side by Λ n n! Λ n (n )! 2. Page 77, last line: replace call by called 22. Page 79, line 4: replace (sz in the middle term by s(z. 23. Page 82, line 3: replace lifetime by lifetimes. 24. Page 84, lines 6 and 7: replace minute by hour (two instances). 25. Page 84, line 9: insert a after is. 4
5 26. Page 87, line 9 from below: replace by. Chapter 6. Page 205: line 3 of Theorem 6.4: replace respect t by respect to t. 2. Page 209, line 5 from below: replace had by hand. 3. Page 20, line 3 in Theorem 6.7: replace M by N. 4. Page 20, line 2 from below: replace m by N. 5. Page 2, line 4 of Example 6.8: replace the (0,0)th entry of X by µ λ+µ. 6. Page 24, line 2 above Equation 6.27: delete. before Now. 7. Page 26, last line: replace computed by Equation 6.28 by defined in Theorem Page 227, line 2: remove all four large parentheses. 9. Page 230, line 4 from below: replace t 0 by t Y. 0. Page 230, line 2 from below: replace t 0 by t Y.. Page 230, line 0 from below: replace n 0 by n. 2. Page 233, line : replace p i = /(i + 2) by p i = (i + )/(i + 2). 3. Page 237, last line: replace n by t. 4. Page 242, line 5: insert death parameters before µ i. 5. Page 244, line 2: replace p i,n+ by p,n+. 6. Page 256, line 2: replace DTMC by CTMC. Chapter 7. Page 279, line 7 from below: replace sections by section. 2. Page 280, line 8 from below: replace 7.3 by Page 282, line 8: insert are after there. 4. Page 282, line 2 from below: replace i + by i and i + 2 by i Page 283, line 3: replace Once by One. 6. Page 284, line 6 from below: replace j by j. 7. Page 285, line 3 from below: replace p kj by b kj. 8. Page 286, line 5: replace 23 on page 6.25 by 6.25 on page Page 286, line 6 from below: delete we have,. 0. Page 288, line 2 from below: replace for a by for an.. Page 290, line : replace for an by for a. 2. Page 290, line 4: replace Little Law by Little s Law. 5
6 3. Page 29, line 7: replace Sn t<d n by {Sn t<d n}. 4. Page 296, line 5 from below: replace nµ by nµ,. 5. Page 297, line 9 in Section 7.3.5: replace (N n) by min(n n, s). 6. Page 297, line in Section 7.3.5: replace min(n, s) by n. 7. Page 30, line 0: insert given after is. 8. Page 303, Figure 7.4: the return arc label should be α. 9. page 303, line below Figure 7.4: insert ( before λ. 20. Page 309, lines 2 and 4 above Example 7.: replace G(K) by G N (K). 2. Page 3, Figure 7.7: the label on the arc from CPU tp Printer should be α and that on the arc from CPU to the Disc Drive should be α. 22. Page 35, line 7: insert a after in. 23. Page 36, line 5 from below: replace the n by the nth. 24. Page 39: line of Example 7.5: replace service by inter-arrival. 25. Page 32, Figure 7.8: The caption in the lower box should read Single Server No Waiting Space 26. Page 325, line 3 of Exercise 7.: replace essentially by an. 27. Page 328, line 3 of exercise 7.3: replace little s law by Little s Law. 28. Page 33, line 3 of exercise 7.29: insert is after server. 29. Page 33, Figure 7.9: the label on the horizontal arrow out of the last node should be p. 30. Page 332, Figure 7.9: the labels on the horizontal arrows should be p, p 2, p N, and p N. 3. Page 333, part 2 of exercise 7.4: replace j K by i N. 32. Page 336, line of Exercise 7.55: replace 7.2 by Page 336, line 2 of Exercise 7.56: replace 7.2 by 7.3. Chapter 8. Page 342, line 6: delete 0,. 2. Page 342, line 2: replace k n by k Page 342, line from below : replace the first k n by k Page 342, line 5 from below: replace S kn+ t n + X by S kn+ X t n. 5. Page 343, line : replace G(0 ) = by G(0 ) = Page 344, line 3 from below: replace which by whose probability is. 7. Page 347, line 6 from below: replace infty by infinity. 6
7 8. Page 348, equation 8.2: replace = x) by x) =. 9. Page 352, line 2 from below: replace Sn S n by S n Sn. 0. Page 355, line 2: replace p k by p r.. Page 355, line 2: replace G k by G r. 2. Page 370, line 7: insert in before the. 3. Page 370, line 9 from below: replace G by F. 4. Page 373, Figure 8.7: replace the label Z(t) by X(t) on the vertical axis. 5. Page 375, the lower part of Figure 8.8: replace the label Z(t) by X(t) on the vertical axis. 6. Page 377, last line: insert +P(U > t) before the, 7. Page 378, line 3: insert + lim t P(U > t) before the. 8. Page 378, line 5 from below: replace chapter by section. 9. Page 378, line 6 from below: insert = G ii ( ) after p ii. 20. Page 380, line 4 from below: replace S by Y. 2. Page 395, Figure 8.0: replace Z(t) by X(t) as the label for the vertical axis. 22. Page 400: replace Compute by Derive in the first line of Exercises 8.26, 8.27, 8.28 and Page 40, Exercise 8.39: replace An by A in parts 2 and Page 40, last line replace E(min(U + D, t) by E(min(U + D, t)). 25. Page 404, line 2 of Exercise 8.5: replace φ k (s) by µ/(s + µ). Chapter 9. Page 43, last line: replace min by sup. 2. Page 48, line 4: replace by =. 3. Page 424, line 2 from below: replace implicity by implicitly. 4. Page 425, lines 5 and 6 in Theorem 9.5: replace j S by j I. 5. Page 426, Equation 9.35: replace X(t) = k by Z(t) = k. 6. Page 427, line 3: replace τ rr by τ r. 7. Page 427, line from below: replace P(X(t) = j) by P(X(t) = j X(0) = i). 8. Page 428, lines 7 and 8: On each line insert to after S n+. 9. Page 430, line 7: replace s by u. 0. Page 430, line 5: replace α k by α kj.. Page 432, line 3: replace the right hand side by e 2µx, 2. Page 432, line 4: replace Ã(λ) by Ã(µ). 3. Page 433, line 8: insert death parameters before µ. 7
8 4. Page 433, Theorem 9.20: replace process by death. 5. Page 435, line 4 from below: insert be after Z(t). 6. Page 436, lines 4 and 5: replace Z(t)=j by {Z(t)=j}. 7. Page 44, line 3: replace (, 2) by (i =, 2). Chapter 0. Page 446, line 4: delete part of. 2. Page 446, line 5 from below: insert finite dimensional after the. 3. Page 447, lines 9 and : replace ] by ] T. 4. Page 447, line 5: insert = before Page 453, lines 0 and : replace a) by 0). 6. Page 462: the four lines above Theorem 0.7 should not be in italic. 7. Page 465, line : replace B(u) by X(u). 8. Page 466, line 6: the short should be longer. 9. page 467, line 3: the long should be shorter. 0. Page 47, line :6: replace is the by is.. Page 472, line 3 of Definition 0.9: replace X(u) by B(u). 2. Page 473, line 3: replace X(u) by B(u). 3. Page 483, line 7: delete and after American. 4. Page 483: line below Equation 0.69: replace Theorem 0.27 by Theorem Page 485, line : replace b(t) by b(t). Appendices. Page 49, last line: replace P (φ) = by P (φ) = Page 494, line 6 from below: replace function by functions. 3. Page 497, line 4 from below: delete for. 4. Page 499, line : replace differential by continuous. 5. Page 50, line 6 from below: replace by µ = [ µ µ2 ] µ = [µ µ2] 6. Page 50, line 3 from below: replace (a µ2) by (a µ2). 7. Page 503, line 6: replace in by are given in. 8. Page 505, line 6: replace in by are given in. 9. Page 53, line 6 from below: insert. after k 0. 8
Brownian Motion. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011
Brownian Motion Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Brownian Motion STAT 870 Summer 2011 1 / 33 Purposes of Today s Lecture Describe
More informationIEOR 3106: Introduction to Operations Research: Stochastic Models SOLUTIONS to Final Exam, Sunday, December 16, 2012
IEOR 306: Introduction to Operations Research: Stochastic Models SOLUTIONS to Final Exam, Sunday, December 6, 202 Four problems, each with multiple parts. Maximum score 00 (+3 bonus) = 3. You need to show
More informationDrunken Birds, Brownian Motion, and Other Random Fun
Drunken Birds, Brownian Motion, and Other Random Fun Michael Perlmutter Department of Mathematics Purdue University 1 M. Perlmutter(Purdue) Brownian Motion and Martingales Outline Review of Basic Probability
More informationContinuous time Markov chains (week 9) Solution
Continuous time Markov chains (week 9) Solution 1 Determining the number of channels to provide service in cellular communications. A Departure process. Defining T k as the random time until the next departure
More information6. Martingales. = Zn. Think of Z n+1 as being a gambler s earnings after n+1 games. If the game if fair, then E [ Z n+1 Z n
6. Martingales For casino gamblers, a martingale is a betting strategy where (at even odds) the stake doubled each time the player loses. Players follow this strategy because, since they will eventually
More informationMartingale representation theorem
Martingale representation theorem Ω = C[, T ], F T = smallest σ-field with respect to which B s are all measurable, s T, P the Wiener measure, B t = Brownian motion M t square integrable martingale with
More informationParametric Inference and Dynamic State Recovery from Option Panels. Torben G. Andersen
Parametric Inference and Dynamic State Recovery from Option Panels Torben G. Andersen Joint work with Nicola Fusari and Viktor Todorov The Third International Conference High-Frequency Data Analysis in
More informationM5MF6. Advanced Methods in Derivatives Pricing
Course: Setter: M5MF6 Dr Antoine Jacquier MSc EXAMINATIONS IN MATHEMATICS AND FINANCE DEPARTMENT OF MATHEMATICS April 2016 M5MF6 Advanced Methods in Derivatives Pricing Setter s signature...........................................
More informationHomework Assignments
Homework Assignments Week 1 (p. 57) #4.1, 4., 4.3 Week (pp 58 6) #4.5, 4.6, 4.8(a), 4.13, 4.0, 4.6(b), 4.8, 4.31, 4.34 Week 3 (pp 15 19) #1.9, 1.1, 1.13, 1.15, 1.18 (pp 9 31) #.,.6,.9 Week 4 (pp 36 37)
More informationMultiple State Models
Multiple State Models Lecture: Weeks 6-7 Lecture: Weeks 6-7 (STT 456) Multiple State Models Spring 2015 - Valdez 1 / 42 Chapter summary Chapter summary Multiple state models (also called transition models)
More informationThe Normal Distribution
The Normal Distribution The normal distribution plays a central role in probability theory and in statistics. It is often used as a model for the distribution of continuous random variables. Like all models,
More informationChapter 3: Black-Scholes Equation and Its Numerical Evaluation
Chapter 3: Black-Scholes Equation and Its Numerical Evaluation 3.1 Itô Integral 3.1.1 Convergence in the Mean and Stieltjes Integral Definition 3.1 (Convergence in the Mean) A sequence {X n } n ln of random
More informationTutorial 11: Limit Theorems. Baoxiang Wang & Yihan Zhang bxwang, April 10, 2017
Tutorial 11: Limit Theorems Baoxiang Wang & Yihan Zhang bxwang, yhzhang@cse.cuhk.edu.hk April 10, 2017 1 Outline The Central Limit Theorem (CLT) Normal Approximation Based on CLT De Moivre-Laplace Approximation
More informationStochastic calculus Introduction I. Stochastic Finance. C. Azizieh VUB 1/91. C. Azizieh VUB Stochastic Finance
Stochastic Finance C. Azizieh VUB C. Azizieh VUB Stochastic Finance 1/91 Agenda of the course Stochastic calculus : introduction Black-Scholes model Interest rates models C. Azizieh VUB Stochastic Finance
More informationOptimal Stopping for American Type Options
Optimal Stopping for Department of Mathematics Stockholm University Sweden E-mail: silvestrov@math.su.se ISI 2011, Dublin, 21-26 August 2011 Outline of communication Multivariate Modulated Markov price
More informationcontinuous rv Note for a legitimate pdf, we have f (x) 0 and f (x)dx = 1. For a continuous rv, P(X = c) = c f (x)dx = 0, hence
continuous rv Let X be a continuous rv. Then a probability distribution or probability density function (pdf) of X is a function f(x) such that for any two numbers a and b with a b, P(a X b) = b a f (x)dx.
More informationStatistical Tables Compiled by Alan J. Terry
Statistical Tables Compiled by Alan J. Terry School of Science and Sport University of the West of Scotland Paisley, Scotland Contents Table 1: Cumulative binomial probabilities Page 1 Table 2: Cumulative
More informationHints on Some of the Exercises
Hints on Some of the Exercises of the book R. Seydel: Tools for Computational Finance. Springer, 00/004/006/009/01. Preparatory Remarks: Some of the hints suggest ideas that may simplify solving the exercises
More informationCarnets d ordres pilotés par des processus de Hawkes
Carnets d ordres pilotés par des processus de Hawkes workshop sur les Mathématiques des marchés financiers en haute fréquence Frédéric Abergel Chaire de finance quantitative fiquant.mas.ecp.fr/limit-order-books
More informationValuation of performance-dependent options in a Black- Scholes framework
Valuation of performance-dependent options in a Black- Scholes framework Thomas Gerstner, Markus Holtz Institut für Numerische Simulation, Universität Bonn, Germany Ralf Korn Fachbereich Mathematik, TU
More informationBivariate Birnbaum-Saunders Distribution
Department of Mathematics & Statistics Indian Institute of Technology Kanpur January 2nd. 2013 Outline 1 Collaborators 2 3 Birnbaum-Saunders Distribution: Introduction & Properties 4 5 Outline 1 Collaborators
More informationParametric Inference and Dynamic State Recovery from Option Panels. Nicola Fusari
Parametric Inference and Dynamic State Recovery from Option Panels Nicola Fusari Joint work with Torben G. Andersen and Viktor Todorov July 2012 Motivation Under realistic assumptions derivatives are nonredundant
More informationMath489/889 Stochastic Processes and Advanced Mathematical Finance Homework 5
Math489/889 Stochastic Processes and Advanced Mathematical Finance Homework 5 Steve Dunbar Due Fri, October 9, 7. Calculate the m.g.f. of the random variable with uniform distribution on [, ] and then
More information6.231 DYNAMIC PROGRAMMING LECTURE 3 LECTURE OUTLINE
6.21 DYNAMIC PROGRAMMING LECTURE LECTURE OUTLINE Deterministic finite-state DP problems Backward shortest path algorithm Forward shortest path algorithm Shortest path examples Alternative shortest path
More informationEquity Linked Pension Schemes with Guarantees
Equity Linked Pension Schemes with Guarantees J. Aase Nielsen 1, Klaus Sandmann 2 and Erik Schlögl 3 Abstract: This paper analyses the relationship between the level of a return guarantee in an equity
More informationAsset Price Dynamics and Related Topics
Asset Price Dynamics and Related Topics 1 Introduction These notes are intended for students taking a course in Financial Engineering or Advanced Engineering Economy, as a supplement to lectures. 1 They
More informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 224 Fall 207 Homework 5 Drew Armstrong Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Section 3., Exercises 3, 0. Section 3.3, Exercises 2, 3, 0,.
More informationTesting for non-correlation between price and volatility jumps and ramifications
Testing for non-correlation between price and volatility jumps and ramifications Claudia Klüppelberg Technische Universität München cklu@ma.tum.de www-m4.ma.tum.de Joint work with Jean Jacod, Gernot Müller,
More informationOrder driven markets : from empirical properties to optimal trading
Order driven markets : from empirical properties to optimal trading Frédéric Abergel Latin American School and Workshop on Data Analysis and Mathematical Modelling of Social Sciences 9 november 2016 F.
More informationPath-properties of the tree-valued Fleming-Viot process
Path-properties of the tree-valued Fleming-Viot process Peter Pfaffelhuber Joint work with Andrej Depperschmidt and Andreas Greven Luminy, 492012 The Moran model time t As every population model, the Moran
More informationIndifference fee rate 1
Indifference fee rate 1 for variable annuities Ricardo ROMO ROMERO Etienne CHEVALIER and Thomas LIM Université d Évry Val d Essonne, Laboratoire de Mathématiques et Modélisation d Evry Second Young researchers
More informationUnit 5: Sampling Distributions of Statistics
Unit 5: Sampling Distributions of Statistics Statistics 571: Statistical Methods Ramón V. León 6/12/2004 Unit 5 - Stat 571 - Ramon V. Leon 1 Definitions and Key Concepts A sample statistic used to estimate
More informationUnit 5: Sampling Distributions of Statistics
Unit 5: Sampling Distributions of Statistics Statistics 571: Statistical Methods Ramón V. León 6/12/2004 Unit 5 - Stat 571 - Ramon V. Leon 1 Definitions and Key Concepts A sample statistic used to estimate
More informationChapter 4 - Insurance Benefits
Chapter 4 - Insurance Benefits Section 4.4 - Valuation of Life Insurance Benefits (Subsection 4.4.1) Assume a life insurance policy pays $1 immediately upon the death of a policy holder who takes out the
More informationSPDE and portfolio choice (joint work with M. Musiela) Princeton University. Thaleia Zariphopoulou The University of Texas at Austin
SPDE and portfolio choice (joint work with M. Musiela) Princeton University November 2007 Thaleia Zariphopoulou The University of Texas at Austin 1 Performance measurement of investment strategies 2 Market
More informationLecture 23: April 10
CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 23: April 10 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationBEHAVIOUR OF PASSAGE TIME FOR A QUEUEING NETWORK MODEL WITH FEEDBACK: A SIMULATION STUDY
IJMMS 24:24, 1267 1278 PII. S1611712426287 http://ijmms.hindawi.com Hindawi Publishing Corp. BEHAVIOUR OF PASSAGE TIME FOR A QUEUEING NETWORK MODEL WITH FEEDBACK: A SIMULATION STUDY BIDYUT K. MEDYA Received
More informationContinous time models and realized variance: Simulations
Continous time models and realized variance: Simulations Asger Lunde Professor Department of Economics and Business Aarhus University September 26, 2016 Continuous-time Stochastic Process: SDEs Building
More informationLimit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies
Limit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies George Tauchen Duke University Viktor Todorov Northwestern University 2013 Motivation
More informationSTOCHASTIC CALCULUS AND BLACK-SCHOLES MODEL
STOCHASTIC CALCULUS AND BLACK-SCHOLES MODEL YOUNGGEUN YOO Abstract. Ito s lemma is often used in Ito calculus to find the differentials of a stochastic process that depends on time. This paper will introduce
More informationCentral limit theorems
Chapter 6 Central limit theorems 6.1 Overview Recall that a random variable Z is said to have a standard normal distribution, denoted by N(0, 1), if it has a continuous distribution with density φ(z) =
More informationA Model of Financial Intermediation
A Model of Financial Intermediation Jesús Fernández-Villaverde University of Pennsylvania December 25, 2012 Jesús Fernández-Villaverde (PENN) A Model of Financial Intermediation December 25, 2012 1 / 43
More informationMore Advanced Single Machine Models. University at Buffalo IE661 Scheduling Theory 1
More Advanced Single Machine Models University at Buffalo IE661 Scheduling Theory 1 Total Earliness And Tardiness Non-regular performance measures Ej + Tj Early jobs (Set j 1 ) and Late jobs (Set j 2 )
More informationFinancial Mathematics and Supercomputing
GPU acceleration in early-exercise option valuation Álvaro Leitao and Cornelis W. Oosterlee Financial Mathematics and Supercomputing A Coruña - September 26, 2018 Á. Leitao & Kees Oosterlee SGBM on GPU
More informationSTAT/MATH 395 PROBABILITY II
STAT/MATH 395 PROBABILITY II Distribution of Random Samples & Limit Theorems Néhémy Lim University of Washington Winter 2017 Outline Distribution of i.i.d. Samples Convergence of random variables The Laws
More informationChapter 7: Portfolio Theory
Chapter 7: Portfolio Theory 1. Introduction 2. Portfolio Basics 3. The Feasible Set 4. Portfolio Selection Rules 5. The Efficient Frontier 6. Indifference Curves 7. The Two-Asset Portfolio 8. Unrestriceted
More information1 IEOR 4701: Notes on Brownian Motion
Copyright c 26 by Karl Sigman IEOR 47: Notes on Brownian Motion We present an introduction to Brownian motion, an important continuous-time stochastic process that serves as a continuous-time analog to
More informationConformal Invariance of the Exploration Path in 2D Critical Bond Percolation in the Square Lattice
Conformal Invariance of the Exploration Path in 2D Critical Bond Percolation in the Square Lattice Chinese University of Hong Kong, STAT December 12, 2012 (Joint work with Jonathan TSAI (HKU) and Wang
More informationProbability. An intro for calculus students P= Figure 1: A normal integral
Probability An intro for calculus students.8.6.4.2 P=.87 2 3 4 Figure : A normal integral Suppose we flip a coin 2 times; what is the probability that we get more than 2 heads? Suppose we roll a six-sided
More informationOptimal Securitization via Impulse Control
Optimal Securitization via Impulse Control Rüdiger Frey (joint work with Roland C. Seydel) Mathematisches Institut Universität Leipzig and MPI MIS Leipzig Bachelier Finance Society, June 21 (1) Optimal
More informationMSc Financial Engineering CHRISTMAS ASSIGNMENT: MERTON S JUMP-DIFFUSION MODEL. To be handed in by monday January 28, 2013
MSc Financial Engineering 2012-13 CHRISTMAS ASSIGNMENT: MERTON S JUMP-DIFFUSION MODEL To be handed in by monday January 28, 2013 Department EMS, Birkbeck Introduction The assignment consists of Reading
More informationUniversity of Groningen. Inventory Control for Multi-location Rental Systems van der Heide, Gerlach
University of Groningen Inventory Control for Multi-location Rental Systems van der Heide, Gerlach IMPORTANT NOTE: You are advised to consult the publisher's version publisher's PDF) if you wish to cite
More informationAn Introduction to Stochastic Calculus
An Introduction to Stochastic Calculus Haijun Li lih@math.wsu.edu Department of Mathematics Washington State University Week 2-3 Haijun Li An Introduction to Stochastic Calculus Week 2-3 1 / 24 Outline
More informationEFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS
Commun. Korean Math. Soc. 23 (2008), No. 2, pp. 285 294 EFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS Kyoung-Sook Moon Reprinted from the Communications of the Korean Mathematical Society
More informationMS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 17
MS&E 32 Spring 2-3 Stochastic Systems June, 203 Prof. Peter W. Glynn Page of 7 Section 0: Martingales Contents 0. Martingales in Discrete Time............................... 0.2 Optional Sampling for Discrete-Time
More informationRandom variables. Contents
Random variables Contents 1 Random Variable 2 1.1 Discrete Random Variable............................ 3 1.2 Continuous Random Variable........................... 5 1.3 Measures of Location...............................
More informationConvergence. Any submartingale or supermartingale (Y, F) converges almost surely if it satisfies E Y n <. STAT2004 Martingale Convergence
Convergence Martingale convergence theorem Let (Y, F) be a submartingale and suppose that for all n there exist a real value M such that E(Y + n ) M. Then there exist a random variable Y such that Y n
More informationOutline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.
Outline Coordinate Minimization Daniel P. Robinson Department of Applied Mathematics and Statistics Johns Hopkins University November 27, 208 Introduction 2 Algorithms Cyclic order with exact minimization
More informationLecture Notes for Chapter 6. 1 Prototype model: a one-step binomial tree
Lecture Notes for Chapter 6 This is the chapter that brings together the mathematical tools (Brownian motion, Itô calculus) and the financial justifications (no-arbitrage pricing) to produce the derivative
More informationX(t) = B(t), t 0,
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2007, Professor Whitt, Final Exam Chapters 4-7 and 10 in Ross, Wednesday, May 9, 1:10pm-4:00pm Open Book: but only the Ross textbook,
More informationLesson Plan for Simulation with Spreadsheets (8/31/11 & 9/7/11)
Jeremy Tejada ISE 441 - Introduction to Simulation Learning Outcomes: Lesson Plan for Simulation with Spreadsheets (8/31/11 & 9/7/11) 1. Students will be able to list and define the different components
More information4-1. Chapter 4. Commonly Used Distributions by The McGraw-Hill Companies, Inc. All rights reserved.
4-1 Chapter 4 Commonly Used Distributions 2014 by The Companies, Inc. All rights reserved. Section 4.1: The Bernoulli Distribution 4-2 We use the Bernoulli distribution when we have an experiment which
More informationFunctional vs Banach space stochastic calculus & strong-viscosity solutions to semilinear parabolic path-dependent PDEs.
Functional vs Banach space stochastic calculus & strong-viscosity solutions to semilinear parabolic path-dependent PDEs Andrea Cosso LPMA, Université Paris Diderot joint work with Francesco Russo ENSTA,
More informationPROBABILITY DISTRIBUTIONS
CHAPTER 3 PROBABILITY DISTRIBUTIONS Page Contents 3.1 Introduction to Probability Distributions 51 3.2 The Normal Distribution 56 3.3 The Binomial Distribution 60 3.4 The Poisson Distribution 64 Exercise
More informationMath 489/Math 889 Stochastic Processes and Advanced Mathematical Finance Dunbar, Fall 2007
Steven R. Dunbar Department of Mathematics 203 Avery Hall University of Nebraska-Lincoln Lincoln, NE 68588-0130 http://www.math.unl.edu Voice: 402-472-3731 Fax: 402-472-8466 Math 489/Math 889 Stochastic
More informationSection 8.2: Monte Carlo Estimation
Section 8.2: Monte Carlo Estimation Discrete-Event Simulation: A First Course c 2006 Pearson Ed., Inc. 0-13-142917-5 Discrete-Event Simulation: A First Course Section 8.2: Monte Carlo Estimation 1/ 19
More informationLinear-Rational Term-Structure Models
Linear-Rational Term-Structure Models Anders Trolle (joint with Damir Filipović and Martin Larsson) Ecole Polytechnique Fédérale de Lausanne Swiss Finance Institute AMaMeF and Swissquote Conference, September
More informationMATH3075/3975 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS
MATH307/37 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS School of Mathematics and Statistics Semester, 04 Tutorial problems should be used to test your mathematical skills and understanding of the lecture material.
More informationOptimal Control of Batch Service Queues with Finite Service Capacity and General Holding Costs
Queueing Colloquium, CWI, Amsterdam, February 24, 1999 Optimal Control of Batch Service Queues with Finite Service Capacity and General Holding Costs Samuli Aalto EURANDOM Eindhoven 24-2-99 cwi.ppt 1 Background
More informationOptimal Stopping Rules of Discrete-Time Callable Financial Commodities with Two Stopping Boundaries
The Ninth International Symposium on Operations Research Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 215 224 Optimal Stopping Rules of Discrete-Time
More informationMulti-Asset Options. A Numerical Study VILHELM NIKLASSON FRIDA TIVEDAL. Master s thesis in Engineering Mathematics and Computational Science
Multi-Asset Options A Numerical Study Master s thesis in Engineering Mathematics and Computational Science VILHELM NIKLASSON FRIDA TIVEDAL Department of Mathematical Sciences Chalmers University of Technology
More informationAsymptotic results discrete time martingales and stochastic algorithms
Asymptotic results discrete time martingales and stochastic algorithms Bernard Bercu Bordeaux University, France IFCAM Summer School Bangalore, India, July 2015 Bernard Bercu Asymptotic results for discrete
More informationOptimally Thresholded Realized Power Variations for Lévy Jump Diffusion Models
Optimally Thresholded Realized Power Variations for Lévy Jump Diffusion Models José E. Figueroa-López 1 1 Department of Statistics Purdue University University of Missouri-Kansas City Department of Mathematics
More informationOptimal Stopping. Nick Hay (presentation follows Thomas Ferguson s Optimal Stopping and Applications) November 6, 2008
(presentation follows Thomas Ferguson s and Applications) November 6, 2008 1 / 35 Contents: Introduction Problems Markov Models Monotone Stopping Problems Summary 2 / 35 The Secretary problem You have
More informationM.I.T Fall Practice Problems
M.I.T. 15.450-Fall 2010 Sloan School of Management Professor Leonid Kogan Practice Problems 1. Consider a 3-period model with t = 0, 1, 2, 3. There are a stock and a risk-free asset. The initial stock
More informationNote on Oblivious equilibrium
Note on Oblivious equilibrium November 29, 2016 1 Introduction Ericson and Pakes(1995) introduced a framework for dynamic oligopoly equilibrium with entry and exit, which can be used for policy analysis.
More informationOptimal trading strategies under arbitrage
Optimal trading strategies under arbitrage Johannes Ruf Columbia University, Department of Statistics The Third Western Conference in Mathematical Finance November 14, 2009 How should an investor trade
More informationINDIAN INSTITUTE OF SCIENCE STOCHASTIC HYDROLOGY. Lecture -5 Course Instructor : Prof. P. P. MUJUMDAR Department of Civil Engg., IISc.
INDIAN INSTITUTE OF SCIENCE STOCHASTIC HYDROLOGY Lecture -5 Course Instructor : Prof. P. P. MUJUMDAR Department of Civil Engg., IISc. Summary of the previous lecture Moments of a distribubon Measures of
More informationConvergence Analysis of Monte Carlo Calibration of Financial Market Models
Analysis of Monte Carlo Calibration of Financial Market Models Christoph Käbe Universität Trier Workshop on PDE Constrained Optimization of Certain and Uncertain Processes June 03, 2009 Monte Carlo Calibration
More informationPortfolio Management and Optimal Execution via Convex Optimization
Portfolio Management and Optimal Execution via Convex Optimization Enzo Busseti Stanford University April 9th, 2018 Problems portfolio management choose trades with optimization minimize risk, maximize
More informationOptimizing Portfolios
Optimizing Portfolios An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan 2010 Introduction Investors may wish to adjust the allocation of financial resources including a mixture
More information- 1 - **** d(lns) = (µ (1/2)σ 2 )dt + σdw t
- 1 - **** These answers indicate the solutions to the 2014 exam questions. Obviously you should plot graphs where I have simply described the key features. It is important when plotting graphs to label
More informationThe stochastic calculus
Gdansk A schedule of the lecture Stochastic differential equations Ito calculus, Ito process Ornstein - Uhlenbeck (OU) process Heston model Stopping time for OU process Stochastic differential equations
More information1 Dynamic programming
1 Dynamic programming A country has just discovered a natural resource which yields an income per period R measured in terms of traded goods. The cost of exploitation is negligible. The government wants
More informationThe ruin probabilities of a multidimensional perturbed risk model
MATHEMATICAL COMMUNICATIONS 231 Math. Commun. 18(2013, 231 239 The ruin probabilities of a multidimensional perturbed risk model Tatjana Slijepčević-Manger 1, 1 Faculty of Civil Engineering, University
More informationChapter 4: Asymptotic Properties of MLE (Part 3)
Chapter 4: Asymptotic Properties of MLE (Part 3) Daniel O. Scharfstein 09/30/13 1 / 1 Breakdown of Assumptions Non-Existence of the MLE Multiple Solutions to Maximization Problem Multiple Solutions to
More informationMartingales. by D. Cox December 2, 2009
Martingales by D. Cox December 2, 2009 1 Stochastic Processes. Definition 1.1 Let T be an arbitrary index set. A stochastic process indexed by T is a family of random variables (X t : t T) defined on a
More informationLecture 7: Bayesian approach to MAB - Gittins index
Advanced Topics in Machine Learning and Algorithmic Game Theory Lecture 7: Bayesian approach to MAB - Gittins index Lecturer: Yishay Mansour Scribe: Mariano Schain 7.1 Introduction In the Bayesian approach
More informationNormal Distribution. Definition A continuous rv X is said to have a normal distribution with. the pdf of X is
Normal Distribution Normal Distribution Definition A continuous rv X is said to have a normal distribution with parameter µ and σ (µ and σ 2 ), where < µ < and σ > 0, if the pdf of X is f (x; µ, σ) = 1
More informationThe Eurozone Debt Crisis: A New-Keynesian DSGE model with default risk
The Eurozone Debt Crisis: A New-Keynesian DSGE model with default risk Daniel Cohen 1,2 Mathilde Viennot 1 Sébastien Villemot 3 1 Paris School of Economics 2 CEPR 3 OFCE Sciences Po PANORisk workshop 7
More informationX i = 124 MARTINGALES
124 MARTINGALES 5.4. Optimal Sampling Theorem (OST). First I stated it a little vaguely: Theorem 5.12. Suppose that (1) T is a stopping time (2) M n is a martingale wrt the filtration F n (3) certain other
More informationHouse-Hunting Without Second Moments
House-Hunting Without Second Moments Thomas S. Ferguson, University of California, Los Angeles Michael J. Klass, University of California, Berkeley Abstract: In the house-hunting problem, i.i.d. random
More informationCommonly Used Distributions
Chapter 4: Commonly Used Distributions 1 Introduction Statistical inference involves drawing a sample from a population and analyzing the sample data to learn about the population. We often have some knowledge
More informationRohini Kumar. Statistics and Applied Probability, UCSB (Joint work with J. Feng and J.-P. Fouque)
Small time asymptotics for fast mean-reverting stochastic volatility models Statistics and Applied Probability, UCSB (Joint work with J. Feng and J.-P. Fouque) March 11, 2011 Frontier Probability Days,
More informationVersion A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise.
Math 224 Q Exam 3A Fall 217 Tues Dec 12 Version A Problem 1. Let X be the continuous random variable defined by the following pdf: { 1 x/2 when x 2, f(x) otherwise. (a) Compute the mean µ E[X]. E[X] x
More informationDynamic Admission and Service Rate Control of a Queue
Dynamic Admission and Service Rate Control of a Queue Kranthi Mitra Adusumilli and John J. Hasenbein 1 Graduate Program in Operations Research and Industrial Engineering Department of Mechanical Engineering
More informationPricing Early-exercise options
Pricing Early-exercise options GPU Acceleration of SGBM method Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee Lausanne - December 4, 2016
More informationInterest Rate Curves Calibration with Monte-Carlo Simulatio
Interest Rate Curves Calibration with Monte-Carlo Simulation 24 june 2008 Participants A. Baena (UCM) Y. Borhani (Univ. of Oxford) E. Leoncini (Univ. of Florence) R. Minguez (UCM) J.M. Nkhaso (UCM) A.
More informationDRAFT. 1 exercise in state (S, t), π(s, t) = 0 do not exercise in state (S, t) Review of the Risk Neutral Stock Dynamics
Chapter 12 American Put Option Recall that the American option has strike K and maturity T and gives the holder the right to exercise at any time in [0, T ]. The American option is not straightforward
More informationNumerical schemes for SDEs
Lecture 5 Numerical schemes for SDEs Lecture Notes by Jan Palczewski Computational Finance p. 1 A Stochastic Differential Equation (SDE) is an object of the following type dx t = a(t,x t )dt + b(t,x t
More information