Moments of the maximum of the Gaussian random walk
|
|
- Samuel Horn
- 5 years ago
- Views:
Transcription
1
2 Moments of the maximum of the Gaussian random walk A.J.E.M. Janssen (Philips Research) Johan S.H. van Leeuwaarden (Eurandom)
3 Model definition Consider the partial sums S n = X X n with X 1, X,... i.i.d., X i N( β, 1), β > 0 The Gaussian random walk is then defined as {S n : n 0} ; S 0 = 0 We are interested in the all-time maximum M β = max{s n : n 0} We consider the moments EM k β and the role of the drift β
4 Gaussian random walk with drift =
5 Motivation for studying EMβ k Queues in conventional heavy traffic Scaled version of the queue behaves approximately as M β G/G/1 queue: Kingman (196,1965) Queues in Halfin-Whitt scaling In the limit, the queue behaves exactly as M β G/M/N queue: Halfin-Whitt (1981) G/D/N queue: Jelenković-Mandelbaum-Momčilović (004) Call centers: Borst-Mandelbaum-Reiman (004) Equidistant sampling of Brownian motion Testing for drift: Chernoff (1965) Corrected diffusion approximations: Siegmund (1979,1985) Option pricing: Broadie-Glasserman-Kou (1997)
6 Queues and Halfin-Whitt scaling Example W λ,n+1 = (W λ,n + A λ,n s) + where A λ,n is Poisson distributed with mean λ < s. Let W λ = lim n W λ,n
7 Queues and Halfin-Whitt scaling Example W λ,n+1 = (W λ,n + A λ,n s) + where A λ,n is Poisson distributed with mean λ < s. Let W λ = lim n W λ,n Square-root staffing and gives s = λ + β λ 1 W = lim W λ λ λ W d = (W + N( β, 1)) + d = max{s n : n 0} =: M β
8 Outline 1. Exact expression for EM β. Exact expressions for all moments EM k β 3. Equidistant sampling of Brownian motion
9 "Despite the apparent simplicity of the problem, there does not seem to be an explicit expression even for EM β..., but it is possible to give quite sharp inequalities and asymptotic results for small β." (Sir John Kingman, 1965)
10 "Despite the apparent simplicity of the problem, there does not seem to be an explicit expression even for EM β..., but it is possible to give quite sharp inequalities and asymptotic results for small β." (Sir John Kingman, 1965) Kingman showed that for β 0 EM β = 1 β c + O(β) where c = 1 π n=1 1 n( n + n 1) 0.58
11 "Despite the apparent simplicity of the problem, there does not seem to be an explicit expression even for EM β..., but it is possible to give quite sharp inequalities and asymptotic results for small β." (Sir John Kingman, 1965) Kingman showed that for β 0 EM β = 1 β c + O(β) where c = 1 π n=1 1 n( n + n 1) = ζ(1 ) π
12 Riemann zeta function The Riemann zeta function ζ is defined as ζ(s) = n s, Re s > 1 n=1 This definition is extended by analytic continuation to the entire complex plane except s = 1, where ζ has a simple pole. Calculation of ζ is routine.
13 Theorem For 0 < β < π we have EM β = 1 β + ζ(1 ) π β + β π r=0 ζ( 1 r) r!(r + 1)(r + ) ( β ) r
14 Proof For M β = max{s n : n 0} we have from Spitzer s identity J 1 (β) := EM β = n=1 1 n ES+ n From S n N( βn, n) we get J 1 (β) = n=1 1 n π β n ( nx βn)e x / dx Upon changing variables according to y = x/ n...
15 Proof (cont d)... we can write J 1 (β) as J 1 (β) = n=1 n 1/ π β (y β)e 1 ny dy Differentiating twice w.r.t. β yields J () 1 (β) = n=1 n 1/ π e 1 nβ using d [ ] f(y, β)dy dβ β = f(β, β) + β f (y, β)dy β Idea of Chang-Peres (1997) in their analysis of P(M β = 0)
16 Lerch s transcendent Lerch s transcendent Φ is defined as the analytic continuation of the series Φ(z, s, v) = (v + n) s z n Note that ζ(s) = Φ(1, s, 1). Lemma For ln z < π, s 1,, 3,..., and v 0, 1,,... we have n=0 Φ(z, s, v) = Γ(1 s) (ln 1/z) s 1 + z v z v r=0 (ln z)r ζ(s r, v) r! with ζ(s, v) := Φ(1, s, v) the Hurwitz zeta function. Proof Bateman 1.11(8)
17 Proof (cont d) J () 1 (β) = n=1 n 1/ π e 1 nβ = 1 π e 1 β Φ(z = e 1 β, s = 1, v = 1) Using Bateman s result we get for 0 < β < π J () 1 (β) Γ(3 ) π 3/ 1 β 3 = 1 π r=0 ζ( r 1 )( 1 β ) r The rhs is a well-behaved function of β. Integrating twice yields J 1 (β) 1 β = L 0 + L 1 β + 1 π r=0 where L 1 and L 0 are integration constants r! ζ( r 1 )( 1 )r β r+ r!(r + 1)(r + )
18 Proof (cont d) These can be found using Euler-Maclaurin summation, among other things. L 0 = ζ(1/) π, L 1 = 1 4 This in total gives EM β = 1 β + ζ(1 ) π β + β π r=0 ζ( 1 r) r!(r + 1)(r + ) ( β ) r
19 Cumulants The k-th cumulant of a random variable A is defined as the k-th derivative of log Ee sa evaluated at s = 0.
20 Cumulants The k-th cumulant of a random variable A is defined as the k-th derivative of log Ee sa evaluated at s = 0. Spitzer s identity leads to { E(e sm β ) = exp n=1 1 n E(esS+ n }, 1) Re s 0 Thus log E(e sm β ) = n=1 1 n 0 (sx + 1 s x +...)f S + n (x)dx with f S + n the density function of S n +, and d k (ds) log k E(esM β 1 ) = s=0 n E((S+ n ) k ) =: J k (β), k = 1,,... n=1
21 Recall J 1 (β) = EM β ; J (β) = VarM β ; J 3 (β) = E(M β EM β ) 3 and all moments of M β follow from the cumulants and vice versa. Using S n N( βn, n), it follows that J k (β) = n=1 1 n π β n ( nx βn) k e x / dx It obviously holds that J 0 (β) = n=1 1 n P(S n > 0) From Spitzer s identity we then know that J 0 (β) = ln P(M β = 0)
22 Theorem Assume 0 < β < π. There holds J 0 (β) = ln β ln ζ(1) β 1 π π and for k = 1,,... J k (β) = (k 1)! k β k + + ( 1)k+1 k! π r=0 k j=0 r=1 ( ) k ( 1)j Γ( k j+1 j π ζ( r + 1 )( 1 )r β r+1 ) ζ( k r + 1 )( 1 )r β r+k+1 r!(r + 1) (r + k + 1) r!(r + 1) ζ( 1k 1 k j 1 j + 1) β j Result of Chang-Peres (1997)
23 Proof 1. Use Spitzer s identity and normality of S n to obtain J k (β) = n k 1/ (y β) k e 1 ny dy π n=1 β. Differentiate k + 1 times under the integral sign J (k+1) k (β) = ( 1) k+1 k! n=1 n k 1/ π e 1 nβ 3. Rewrite the expression in terms of Lerch s transcendent 4. Apply Bateman s result 5. Integrate k + 1 times and find the k + 1 integration constants using Euler-Maclaurin summation
24 Equidistant sampling of Brownian motion Let {B t : t 0} be a BM with B 0 = 0, drift β and variance 1, so that B t = βt + W t, where {W t : t 0} is a Wiener process. Let M = max{b t : t 0} It is well known that P( M x) = e βx and so the k-th cumulant of M equals (k 1)! k β k
25 The GRW results from (equidistantly) sampling this BM, and by increasing the sampling frequency the GRW will converge to the BM.
26 4 3 Equidistant sampling of BM (drift= 0.1, variance=1)
27 4 3 Equidistant sampling of BM (drift= 0.1, variance=1). Steps of size:
28 4 3 Equidistant sampling of BM (drift= 0.1, variance=1). Steps of size:
29 4 3 Equidistant sampling of BM (drift= 0.1, variance=1). Steps of size:
30 4 3 Equidistant sampling of BM (drift= 0.1, variance=1). Steps of size:
31 Redefine the GRW as {S n (β, ν) : n = 0, 1,...}, where with Let S n (β, ν) = 0, S n (β, ν) = X ν, X ν,n X ν,1, X ν,,... i.i.d., X i N( β/ν, 1/ν) M ν,β = max{s n (β, ν) : n = 0, 1,...}. Earlier definition corresponds to ν = 1 with M 1,β =: M β. Since M ν,β d = ν 1/ M ν 1/ β, all characteristics of M ν,β can be expressed in those of M β.
32 Say we sample the BM at points 0, 1 ν, ν, 3 ν,... with ν some positive integer. From our results on EM β we find that E M EM ν,β = ζ(1) + O(1/ν) πν Similar result obtained by Asmussen, Glynn and Pitman (1995).
33 Say we sample the BM at points 0, 1 ν, ν, 3 ν,... with ν some positive integer. From our results on EM β we find that E M EM ν,β = ζ(1) + O(1/ν) πν Similar result obtained by Asmussen, Glynn and Pitman (1995). However, we can easily obtain E M EM ν,β = ζ(1 ) πν + β 4ν + O(ν 3/ ) Moreover, our exact analysis of M β leads to asymptotic expressions up to any order, for all cumulants of the maximum. E.g. Var M VarM ν,β = 1 4ν ζ( 1) β π ν + 3/ O(ν )
34 Other, related and future work 1. Exact expressions for P(M = 0), EM β, VarM β (with A.J.E.M. Janssen). Exact expressions for all cumulants J k (β), bounds, analytic continuation for all values of β > 0 (not only for 0 < β < π) (with A.J.E.M. Janssen) 3. Discrete queue and Halfin-Whitt scaling (with A.J.E.M. Janssen and Bert Zwart) lim λ 1 λ W λ d = max{s n : n 0} = M β
CUMULANTS OF THE MAXIMUM OF THE GAUSSIAN RANDOM WALK
CUMULANTS OF THE MAXIMUM OF THE GAUSSIAN RANDOM WALK A.J.E.M. JANSSEN AND J.S.H. VAN LEEUWAARDEN Philips Research Eindhoven University of Technology Abstract. Let X, X 2,... be independent variables, each
More informationOn Lerch s transcendent. and the Gaussian random walk
On Lerch s transcendent and the Gaussian random walk A.J.E.M. Janssen a & J.S.H. van Leeuwaarden b a Digital Signal Processing Group Philips Research, WO- 5656 AA Eindhoven, The Netherlands e-mail: a.j.e.m.janssen@philips.com
More informationEQUIDISTANT SAMPLING FOR THE MAXIMUM OF A BROWNIAN MOTION WITH DRIFT ON A FINITE HORIZON
EQUIDISTAT SAMPLIG FOR THE MAXIMUM OF A BROWIA MOTIO WITH DRIFT O A FIITE HORIZO A.J.E.M. JASSE AD J.S.H. VA LEEUWAARDE Abstract. A Brownian motion observed at equidistant sampling points renders a random
More informationAsymptotics of the maximum of Brownian motion under Erlangian sampling
Asymptotics of the maximum of Brownian motion under Erlangian sampling paper in honor of N.G. de Bruin A.J.E.M. Janssen J.S.H. van Leeuwaarden October 30, 202 Abstract Consider the all-time maximum of
More informationBRAVO for QED Queues
1 BRAVO for QED Queues Yoni Nazarathy, The University of Queensland Joint work with Daryl J. Daley, The University of Melbourne, Johan van Leeuwaarden, EURANDOM, Eindhoven University of Technology. Applied
More informationBack to the roots of the M/D/s queue and the works of Erlang, Crommelin, and Pollaczek
Statistica Neerlandica xx, year, xx-xx special issue 0 year EURANDOM Back to the roots of the M/D/s queue and the works of Erlang, Crommelin, and Pollaczek A.J.E.M. Janssen Philips Research. Digital Signal
More informationBack to the roots of the M/D/s queue and the works of Erlang, Crommelin, and Pollaczek
Back to the roots of the M/D/s queue and the works of Erlang, Crommelin, and Pollaczek A.J.E.M. Janssen Philips Research. Digital Signal Processing Group HTC-36, 5656 AE Eindhoven, The Netherlands a.j.e.m.janssen@philips.com
More informationMATH4210 Financial Mathematics ( ) Tutorial 7
MATH40 Financial Mathematics (05-06) Tutorial 7 Review of some basic Probability: The triple (Ω, F, P) is called a probability space, where Ω denotes the sample space and F is the set of event (σ algebra
More informationLoad Balancing in Distributed Service System: A Survey
Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and
More informationMODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS
MODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS Jiheng Zhang Oct 26, 211 Model and Motivation Server Pool with multiple LPS servers LPS Server K Arrival Buffer. Model and Motivation Server Pool with
More informationIEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory. Fall 2009, Professor Whitt. Class Lecture Notes: Wednesday, September 9.
IEOR 8100: Topics in OR: Asymptotic Methods in Queueing Theory Fall 2009, Professor Whitt Class Lecture Notes: Wednesday, September 9. Heavy-Traffic Limits for the GI/G/1 Queue 1. The GI/G/1 Queue We will
More informationProving the central limit theorem
SOR3012: Stochastic Processes Proving the central limit theorem Gareth Tribello March 3, 2019 1 Purpose In the lectures and exercises we have learnt about the law of large numbers and the central limit
More informationBack to the roots of the M/D/s queue and the works of Erlang, Crommelin and Pollaczek
Statistica Neerlandica (2008) Vol. 62, nr. 3, pp. 299 33 doi:0./j.467-9574.2008.00395.x Back to the roots of the M/D/s queue and the works of Erlang, Crommelin and Pollaczek A. J. E. M. Janssen* Philips
More informationDynamic Control of Parallel-Server Systems
Dynamic Control of Parallel-Server Systems Jim Dai Georgia Institute of Technology Tolga Tezcan University of Illinois at Urbana-Champaign May 13, 2009 Jim Dai (Georgia Tech) Many-Server Asymptotic Optimality
More informationReduced-load equivalence for queues with Gaussian input
Reduced-load equivalence for queues with Gaussian input A. B. Dieker CWI P.O. Box 94079 1090 GB Amsterdam, the Netherlands and University of Twente Faculty of Mathematical Sciences P.O. Box 17 7500 AE
More informationA Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime
A Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime Mohammadreza Aghajani joint work with Kavita Ramanan Brown University APS Conference, Istanbul,
More information6.1 Moment Generating and Characteristic Functions
Chapter 6 Limit Theorems The power statistics can mostly be seen when there is a large collection of data points and we are interested in understanding the macro state of the system, e.g., the average,
More informationarxiv: v1 [math.pr] 5 Aug 2013
BRAVO for many-server QED systems with finite buffers Daryl J. Daley, Johan S.H. van Leeuwaarden, Yoni Nazarathy arxiv:38.933v [math.pr] 5 Aug 23 September 7, 28 Abstract This paper demonstrates the occurrence
More informationSampling Distributions and Asymptotics Part II
Sampling Distributions and Asymptotics Part II Insan TUNALI Econ 511 - Econometrics I Koç University 18 October 2018 I. Tunal (Koç University) Week 5 18 October 2018 1 / 29 Lecture Outline v Sampling Distributions
More informationGaussian expansions and bounds for the Poisson distribution applied to the Erlang B formula
October 8, 2007 Gaussian expansions and bounds for the Poisson distribution applied to the Erlang B formula A.J.E.M. Janssen J.S.H. van Leeuwaarden 2 B. Zwart 3 Abstract This paper presents new Gaussian
More informationLarge deviations for random walks under subexponentiality: the big-jump domain
Large deviations under subexponentiality p. Large deviations for random walks under subexponentiality: the big-jump domain Ton Dieker, IBM Watson Research Center joint work with D. Denisov (Heriot-Watt,
More informationAsymptotic Coupling of an SPDE, with Applications to Many-Server Queues
Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues Mohammadreza Aghajani joint work with Kavita Ramanan Brown University March 2014 Mohammadreza Aghajanijoint work Asymptotic with
More informationSome 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 informationOverflow Networks: Approximations and Implications to Call-Center Outsourcing
Overflow Networks: Approximations and Implications to Call-Center Outsourcing Itai Gurvich (Northwestern University) Joint work with Ohad Perry (CWI) Call Centers with Overflow λ 1 λ 2 Source of complexity:
More informationFunctional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals
Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Noèlia Viles Cuadros BCAM- Basque Center of Applied Mathematics with Prof. Enrico
More informationThe Moment Method; Convex Duality; and Large/Medium/Small Deviations
Stat 928: Statistical Learning Theory Lecture: 5 The Moment Method; Convex Duality; and Large/Medium/Small Deviations Instructor: Sham Kakade The Exponential Inequality and Convex Duality The exponential
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More information1 Review of Probability
1 Review of Probability Random variables are denoted by X, Y, Z, etc. The cumulative distribution function (c.d.f.) of a random variable X is denoted by F (x) = P (X x), < x
More informationConvergence of price and sensitivities in Carr s randomization approximation globally and near barrier
Convergence of price and sensitivities in Carr s randomization approximation globally and near barrier Sergei Levendorskĭi University of Leicester Toronto, June 23, 2010 Levendorskĭi () Convergence of
More informationA class of trees and its Wiener index.
A class of trees and its Wiener index. Stephan G. Wagner Department of Mathematics Graz University of Technology Steyrergasse 3, A-81 Graz, Austria wagner@finanz.math.tu-graz.ac.at Abstract In this paper,
More informationMath 259: Introduction to Analytic Number Theory More about the Gamma function
Math 59: Introduction to Analytic Number Theory More about the Gamma function We collect some more facts about Γs as a function of a complex variable that will figure in our treatment of ζs and Ls, χ.
More informationDesigning load balancing and admission control policies: lessons from NDS regime
Designing load balancing and admission control policies: lessons from NDS regime VARUN GUPTA University of Chicago Based on works with : Neil Walton, Jiheng Zhang ρ K θ is a useful regime to study the
More information1 of 7 7/16/2009 6:12 AM Virtual Laboratories > 7. Point Estimation > 1 2 3 4 5 6 1. Estimators The Basic Statistical Model As usual, our starting point is a random experiment with an underlying sample
More informationMarkovian N-Server Queues (Birth & Death Models)
Markovian -Server Queues (Birth & Death Moels) - Busy Perio Arrivals Poisson (λ) ; Services exp(µ) (E(S) = /µ) Servers statistically ientical, serving FCFS. Offere loa R = λ E(S) = λ/µ Erlangs Q(t) = number
More informationOne important issue in the study of queueing systems is to characterize departure processes. Study on departure processes was rst initiated by Burke (
The Departure Process of the GI/G/ Queue and Its MacLaurin Series Jian-Qiang Hu Department of Manufacturing Engineering Boston University 5 St. Mary's Street Brookline, MA 2446 Email: hqiang@bu.edu June
More informationAnnealed Brownian motion in a heavy tailed Poissonian potential
Annealed Brownian motion in a heavy tailed Poissonian potential Ryoki Fukushima Tokyo Institute of Technology Workshop on Random Polymer Models and Related Problems, National University of Singapore, May
More information2 light traffic derivatives for the GI/G/ queue. We shall see that our proof of analyticity is mainly based on some recursive formulas very similar to
Analyticity of Single-Server Queues in Light Traffic Jian-Qiang Hu Manufacturing Engineering Department Boston University Cummington Street Boston, MA 0225 September 993; Revised May 99 Abstract Recently,
More informationBernoulli Polynomials
Chapter 4 Bernoulli Polynomials 4. Bernoulli Numbers The generating function for the Bernoulli numbers is x e x = n= B n n! xn. (4.) That is, we are to expand the left-hand side of this equation in powers
More informationMonte Carlo Integration I [RC] Chapter 3
Aula 3. Monte Carlo Integration I 0 Monte Carlo Integration I [RC] Chapter 3 Anatoli Iambartsev IME-USP Aula 3. Monte Carlo Integration I 1 There is no exact definition of the Monte Carlo methods. In the
More informationarxiv: v2 [math.pr] 8 Feb 2016
Noname manuscript No will be inserted by the editor Bounds on Tail Probabilities in Exponential families Peter Harremoës arxiv:600579v [mathpr] 8 Feb 06 Received: date / Accepted: date Abstract In this
More information10. Joint Moments and Joint Characteristic Functions
10. Joint Moments and Joint Characteristic Functions Following section 6, in this section we shall introduce various parameters to compactly represent the inormation contained in the joint p.d. o two r.vs.
More informationWe introduce methods that are useful in:
Instructor: Shengyu Zhang Content Derived Distributions Covariance and Correlation Conditional Expectation and Variance Revisited Transforms Sum of a Random Number of Independent Random Variables more
More informationMOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS
MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-2804 Research Reports on Mathematical and Computing Sciences Long-tailed degree distribution of a random geometric graph constructed by the Boolean model with spherical grains Naoto Miyoshi,
More informationBessel s Equation. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Fall Department of Mathematics
Bessel s Equation MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Background Bessel s equation of order ν has the form where ν is a constant. x 2 y + xy
More informationMath 229: Introduction to Analytic Number Theory Čebyšev (and von Mangoldt and Stirling)
ath 9: Introduction to Analytic Number Theory Čebyšev (and von angoldt and Stirling) Before investigating ζ(s) and L(s, χ) as functions of a complex variable, we give another elementary approach to estimating
More information1 Introduction. 2 Diffusion equation and central limit theorem. The content of these notes is also covered by chapter 3 section B of [1].
1 Introduction The content of these notes is also covered by chapter 3 section B of [1]. Diffusion equation and central limit theorem Consider a sequence {ξ i } i=1 i.i.d. ξ i = d ξ with ξ : Ω { Dx, 0,
More information18.175: Lecture 17 Poisson random variables
18.175: Lecture 17 Poisson random variables Scott Sheffield MIT 1 Outline More on random walks and local CLT Poisson random variable convergence Extend CLT idea to stable random variables 2 Outline More
More informationx s 1 e x dx, for σ > 1. If we replace x by nx in the integral then we obtain x s 1 e nx dx. x s 1
Recall 9. The Riemann Zeta function II Γ(s) = x s e x dx, for σ >. If we replace x by nx in the integral then we obtain Now sum over n to get n s Γ(s) = x s e nx dx. x s ζ(s)γ(s) = e x dx. Note that as
More informationMath 576: Quantitative Risk Management
Math 576: Quantitative Risk Management Haijun Li lih@math.wsu.edu Department of Mathematics Washington State University Week 11 Haijun Li Math 576: Quantitative Risk Management Week 11 1 / 21 Outline 1
More informationTHE VARIANCE CONSTANT FOR THE ACTUAL WAITING TIME OF THE PH/PH/1 QUEUE. By Mogens Bladt National University of Mexico
The Annals of Applied Probability 1996, Vol. 6, No. 3, 766 777 THE VARIANCE CONSTANT FOR THE ACTUAL WAITING TIME OF THE PH/PH/1 QUEUE By Mogens Bladt National University of Mexico In this paper we consider
More informationDesigning a Telephone Call Center with Impatient Customers
Designing a Telephone Call Center with Impatient Customers with Ofer Garnett Marty Reiman Sergey Zeltyn Appendix: Strong Approximations of M/M/ + Source: ErlangA QEDandSTROG FIAL.tex M/M/ + M System Poisson
More informationPrimes, queues and random matrices
Primes, queues and random matrices Peter Forrester, M&S, University of Melbourne Outline Counting primes Counting Riemann zeros Random matrices and their predictive powers Queues 1 / 25 INI Programme RMA
More informationSampling Distributions
Sampling Distributions In statistics, a random sample is a collection of independent and identically distributed (iid) random variables, and a sampling distribution is the distribution of a function of
More informationShort-time expansions for close-to-the-money options under a Lévy jump model with stochastic volatility
Short-time expansions for close-to-the-money options under a Lévy jump model with stochastic volatility José Enrique Figueroa-López 1 1 Department of Statistics Purdue University Statistics, Jump Processes,
More informationAnalysis of an M/G/1 queue with customer impatience and an adaptive arrival process
Analysis of an M/G/1 queue with customer impatience and an adaptive arrival process O.J. Boxma 1, O. Kella 2, D. Perry 3, and B.J. Prabhu 1,4 1 EURANDOM and Department of Mathematics & Computer Science,
More informationCS145: Probability & Computing
CS45: Probability & Computing Lecture 5: Concentration Inequalities, Law of Large Numbers, Central Limit Theorem Instructor: Eli Upfal Brown University Computer Science Figure credits: Bertsekas & Tsitsiklis,
More informationLecture 22: Variance and Covariance
EE5110 : Probability Foundations for Electrical Engineers July-November 2015 Lecture 22: Variance and Covariance Lecturer: Dr. Krishna Jagannathan Scribes: R.Ravi Kiran In this lecture we will introduce
More informationStat 366 A1 (Fall 2006) Midterm Solutions (October 23) page 1
Stat 366 A1 Fall 6) Midterm Solutions October 3) page 1 1. The opening prices per share Y 1 and Y measured in dollars) of two similar stocks are independent random variables, each with a density function
More informationMATH 312 Section 4.3: Homogeneous Linear Equations with Constant Coefficients
MATH 312 Section 4.3: Homogeneous Linear Equations with Constant Coefficients Prof. Jonathan Duncan Walla Walla College Spring Quarter, 2007 Outline 1 Getting Started 2 Second Order Equations Two Real
More informationStein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions
Stein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions Jim Dai Joint work with Anton Braverman and Jiekun Feng Cornell University Workshop on Congestion Games Institute
More informationA Diffusion Approximation for the G/GI/n/m Queue
OPERATIONS RESEARCH Vol. 52, No. 6, November December 2004, pp. 922 941 issn 0030-364X eissn 1526-5463 04 5206 0922 informs doi 10.1287/opre.1040.0136 2004 INFORMS A Diffusion Approximation for the G/GI/n/m
More informationStochastic Calculus and Black-Scholes Theory MTH772P Exercises Sheet 1
Stochastic Calculus and Black-Scholes Theory MTH772P Exercises Sheet. For ξ, ξ 2, i.i.d. with P(ξ i = ± = /2 define the discrete-time random walk W =, W n = ξ +... + ξ n. (i Formulate and prove the property
More informationProbability Background
Probability Background Namrata Vaswani, Iowa State University August 24, 2015 Probability recap 1: EE 322 notes Quick test of concepts: Given random variables X 1, X 2,... X n. Compute the PDF of the second
More informationKolmogorov Equations and Markov Processes
Kolmogorov Equations and Markov Processes May 3, 013 1 Transition measures and functions Consider a stochastic process {X(t)} t 0 whose state space is a product of intervals contained in R n. We define
More informationGeneralization theory
Generalization theory Daniel Hsu Columbia TRIPODS Bootcamp 1 Motivation 2 Support vector machines X = R d, Y = { 1, +1}. Return solution ŵ R d to following optimization problem: λ min w R d 2 w 2 2 + 1
More informationδ -method and M-estimation
Econ 2110, fall 2016, Part IVb Asymptotic Theory: δ -method and M-estimation Maximilian Kasy Department of Economics, Harvard University 1 / 40 Example Suppose we estimate the average effect of class size
More informationNew Perspectives on the Erlang-A Queue
New Perspectives on the Erlang-A Queue arxiv:1712.8445v1 [math.pr] 22 Dec 217 Andrew Daw School of Operations Research and Information Engineering Cornell University 257 Rhodes Hall, Ithaca, NY 14853 amd399@cornell.edu
More information1. Stochastic Processes and filtrations
1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S
More informationPoisson random measure: motivation
: motivation The Lévy measure provides the expected number of jumps by time unit, i.e. in a time interval of the form: [t, t + 1], and of a certain size Example: ν([1, )) is the expected number of jumps
More information( 1 k "information" I(X;Y) given by Y about X)
SUMMARY OF SHANNON DISTORTION-RATE THEORY Consider a stationary source X with f (x) as its th-order pdf. Recall the following OPTA function definitions: δ(,r) = least dist'n of -dim'l fixed-rate VQ's w.
More informationAnnealed Brownian motion in a heavy tailed Poissonian potential
Annealed Brownian motion in a heavy tailed Poissonian potential Ryoki Fukushima Research Institute of Mathematical Sciences Stochastic Analysis and Applications, Okayama University, September 26, 2012
More informationErlang-C = M/M/N. agents. queue ACD. arrivals. busy ACD. queue. abandonment BACK FRONT. lost calls. arrivals. lost calls
Erlang-C = M/M/N agents arrivals ACD queue Erlang-A lost calls FRONT BACK arrivals busy ACD queue abandonment lost calls Erlang-C = M/M/N agents arrivals ACD queue Rough Performance Analysis
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationProperties of the Autocorrelation Function
Properties of the Autocorrelation Function I The autocorrelation function of a (real-valued) random process satisfies the following properties: 1. R X (t, t) 0 2. R X (t, u) =R X (u, t) (symmetry) 3. R
More informationLecture 1 Measure concentration
CSE 29: Learning Theory Fall 2006 Lecture Measure concentration Lecturer: Sanjoy Dasgupta Scribe: Nakul Verma, Aaron Arvey, and Paul Ruvolo. Concentration of measure: examples We start with some examples
More informationEcon 504, Lecture 1: Transversality and Stochastic Lagrange Multipliers
ECO 504 Spring 2009 Chris Sims Econ 504, Lecture 1: Transversality and Stochastic Lagrange Multipliers Christopher A. Sims Princeton University sims@princeton.edu February 4, 2009 0 Example: LQPY The ordinary
More informationThe G/GI/N Queue in the Halfin-Whitt Regime I: Infinite Server Queue System Equations
The G/GI/ Queue in the Halfin-Whitt Regime I: Infinite Server Queue System Equations J. E Reed School of Industrial and Systems Engineering Georgia Institute of Technology October 17, 27 Abstract In this
More informationHEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES
HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES by Peter W. Glynn Department of Operations Research Stanford University Stanford, CA 94305-4022 and Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636
More informationLecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages
Lecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages ELEC206 Probability and Random Processes, Fall 2014 Gil-Jin Jang gjang@knu.ac.kr School of EE, KNU page 1 / 15 Chapter 7. Sums of Random
More informationStochastic Volatility and Correction to the Heat Equation
Stochastic Volatility and Correction to the Heat Equation Jean-Pierre Fouque, George Papanicolaou and Ronnie Sircar Abstract. From a probabilist s point of view the Twentieth Century has been a century
More informationCritically Loaded Time-Varying Multi-Server Queues: Computational Challenges and Approximations
Critically Loaded Time-Varying Multi-Server Queues: Computational Challenges and Approximations Young Myoung Ko Sabre Holdings, 315 Sabre Drive, Southlake, Texas 7692, USA, YoungMyoung.Ko@sabre.com Natarajan
More informationSummary of Shannon Rate-Distortion Theory
Summary of Shannon Rate-Distortion Theory Consider a stationary source X with kth-order probability density function denoted f k (x). Consider VQ with fixed-rate coding. Recall the following OPTA function
More informationLecture 5: Moment generating functions
Lecture 5: Moment generating functions Definition 2.3.6. The moment generating function (mgf) of a random variable X is { x e tx f M X (t) = E(e tx X (x) if X has a pmf ) = etx f X (x)dx if X has a pdf
More informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More informationBeyond the color of the noise: what is memory in random phenomena?
Beyond the color of the noise: what is memory in random phenomena? Gennady Samorodnitsky Cornell University September 19, 2014 Randomness means lack of pattern or predictability in events according to
More informationIntroduction to Rare Event Simulation
Introduction to Rare Event Simulation Brown University: Summer School on Rare Event Simulation Jose Blanchet Columbia University. Department of Statistics, Department of IEOR. Blanchet (Columbia) 1 / 31
More informationDirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions:
Dirichlet s Theorem Martin Orr August 1, 009 1 Introduction The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions: Theorem 1.1. If m, a N are coprime, then there
More informationProbability Theory Overview and Analysis of Randomized Algorithms
Probability Theory Overview and Analysis of Randomized Algorithms Analysis of Algorithms Prepared by John Reif, Ph.D. Probability Theory Topics a) Random Variables: Binomial and Geometric b) Useful Probabilistic
More informationSYSM 6303: Quantitative Introduction to Risk and Uncertainty in Business Lecture 4: Fitting Data to Distributions
SYSM 6303: Quantitative Introduction to Risk and Uncertainty in Business Lecture 4: Fitting Data to Distributions M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas Email: M.Vidyasagar@utdallas.edu
More informationTwelfth Problem Assignment
EECS 401 Not Graded PROBLEM 1 Let X 1, X 2,... be a sequence of independent random variables that are uniformly distributed between 0 and 1. Consider a sequence defined by (a) Y n = max(x 1, X 2,..., X
More informationarxiv: v2 [math.pr] 22 Apr 2014 Dept. of Mathematics & Computer Science Mathematical Institute
Tail asymptotics for a random sign Lindley recursion May 29, 218 arxiv:88.3495v2 [math.pr] 22 Apr 214 Maria Vlasiou Zbigniew Palmowski Dept. of Mathematics & Computer Science Mathematical Institute Eindhoven
More informationBlind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers Mor Armony Amy R. Ward 2 October 6, 2 Abstract In a call center, arriving customers must be routed to available
More informationCritical percolation on networks with given degrees. Souvik Dhara
Critical percolation on networks with given degrees Souvik Dhara Microsoft Research and MIT Mathematics Montréal Summer Workshop: Challenges in Probability and Mathematical Physics June 9, 2018 1 Remco
More informationPoisson Approximation for Two Scan Statistics with Rates of Convergence
Poisson Approximation for Two Scan Statistics with Rates of Convergence Xiao Fang (Joint work with David Siegmund) National University of Singapore May 28, 2015 Outline The first scan statistic The second
More informationStochastic Integration and Stochastic Differential Equations: a gentle introduction
Stochastic Integration and Stochastic Differential Equations: a gentle introduction Oleg Makhnin New Mexico Tech Dept. of Mathematics October 26, 27 Intro: why Stochastic? Brownian Motion/ Wiener process
More informationEstimating the efficient price from the order flow : a Brownian Cox process approach
Estimating the efficient price from the order flow : a Brownian Cox process approach - Sylvain DELARE Université Paris Diderot, LPMA) - Christian ROBER Université Lyon 1, Laboratoire SAF) - Mathieu ROSENBAUM
More informationGaussian, Markov and stationary processes
Gaussian, Markov and stationary processes Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ November
More informationECE302 Spring 2015 HW10 Solutions May 3,
ECE32 Spring 25 HW Solutions May 3, 25 Solutions to HW Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in italics where
More information