Variance Parameter Estimation Methods with Data Re-use

Size: px
Start display at page:

Download "Variance Parameter Estimation Methods with Data Re-use"

Transcription

1 Variance Parameter Estimation Methods with Data Re-use Christos Alexopoulos, David Goldsman, Melike Meterelliyoz Claudia Antonini James R. Wilson Georgia Institute of Technology, Atlanta, GA, USA Universidad Simón Bolívar, Sartenejas, 1080, Venezuela North Carolina State University, Raleigh, NC, USA October 12, 2008

2 Outline 1 Introduction 2 Background Basics and Assumptions Standardized Time Series Estimators Estimators Based on Batches Estimators Based on Overlapping Batches 3 Estimators with Data Re-use Folded Estimators Folded Overlapping Area Estimators Reflected Estimators 4 Conclusions and Future Work

3 Introduction Introduction Objective Computation of point and confidence interval (CI) estimators for the mean of a stationary discrete time process {X j : j 1}. The point estimate for the mean µ is the sample mean X n. To evaluate the performance of Xn, we need an estimate of its variance Var( X n ). For i.i.d. simulation output, S 2 (n)/n is the obvious estimator. For correlated data, S 2 (n)/n can be severely biased. Valid CIs are obtained based on estimators of σ 2 n = nvar( X n ) or σ 2 = lim n σ 2 n.

4 Introduction Literature Review 1 Techniques for estimating σ 2 Nonoverlapping Batch Means (NBM). Overlapping Batch Means (OBM) [Song and Schmeiser, 1993]. Standardized Time Series (STS) [Schruben, 1983]. 2 Related STS Methods Area estimators. Cramér von Mises (CvM) estimators. Permuted STS estimators [Calvin and Nakayama, 2006].

5 Introduction Motivation Re-use of data: Obtain different sample paths from the same data. Different estimators of σ 2 from each sample path. Linear combination of estimators: Smaller variance. Same effort, more information.

6 Background Basics and Assumptions Assumptions A A.1 The process {X i : i 1} is stationary. A.2 The process {X i : i = 1, 2,...} satisfies the following functional central limit theorem. For each positive integer n, let Y n (t) nt ( X nt µ) σ for t [0, 1], (1) n where is the greatest integer function. Then there exist constants σ > 0 and µ such that Y n ( ) W( ), where W( ) is a standard Brownian motion process on [0,1] and denotes convergence in distribution. A.3 k=1 k2 R k <, where R k = Cov(X 1, X 1+k ), and σ 2 j= R j (0, ).

7 Background Basics and Assumptions Assumptions F F.1 The [ function f( ) is normalized so that 1 ] Var f(t)b(t) dt = 1, where B( ) is a standard 0 Brownian bridge process on [0, 1]. F.2 d2 dt 2 f(t) is continuous at every t [0, 1]. F.3 f(t) = f(1 t) for every t [0, 1].

8 Background Basics and Assumptions Definitions γ 1 2 l=1 lr l. For t [0, 1]: F (t) t 0 f(s) ds and F F (1). F (t) t 0 F (s) ds and F F (1). Useful Weight Functions For t [0, 1]: f 0 (t) 12. f 2 (t) 840(3t 2 3t + 1/2).

9 Background Standardized Time Series Estimators Standardized Time Series T n (t) nt ( X n X nt ) σ, for t [0, 1]. n Under Assumptions A, [ n( Xn µ), σt n ( ) ] [σw(1), σb( )].

10 Background Standardized Time Series Estimators Weighted Area Estimator and Limiting Functional A(f; n) [ 1 n n j=1 f ( j ( j ) n) ] 2 [ 1 2 σtn n A(f) f(t)σb(t) dt]. 0 A(f) D = σ 2 χ 2 1. Under Assumptions A and F, E[A(f; n)] = σ 2 [(F F ) 2 + F 2 ]γ 1 2n + o(1/n). If {A 2 (f; n) : n = 1, 2,...} is uniformly integrable, then lim Var[A(f; n)] = Var[A(f)] = n 2σ4.

11 Background Estimators Based on Batches Nonoverlapping Batches Form b nonoverlapping batches each consisting of m observations (assuming n = bm). Batch i consists of observations {X (i 1)m+j : j = 1,..., m}. Standardized Time Series from Batch i T i,m (t) mt ( X i,m X i, mt ) σ, m for t [0, 1] and i = 1,..., b, where X i,j 1 j j X (i 1)m+l, for j = 1,..., m. l=1

12 Background Estimators Based on Batches Batched Area Estimator A(f; b, m) 1 bm 2 b m f ( j ) m σti,m ( j m ) i=1 j=1 2, A(f; b, m) σ 2 χ 2 b /b. Under Assumptions A and F, E[A(f; b, m)] = σ 2 [(F F ) 2 + F 2 ]γ 1 2m + o(1/m). (2) If {A 2 (f; b, m) : m = 1, 2,...} is uniformly integrable, then lim bvar[a(f; b, m)] = Var[A(f)] = m 2σ4.

13 Background Estimators Based on Batches Nonoverlapping Batch Means Estimator N (b, m) m b 1 N (b, m) σ 2 χ 2 b 1 /(b 1). b ( X i,m X n ) 2. i=1 E[N (b, m)] = σ 2 (b+1)γ 1 bm + o(1/m). lim (b 1)Var[N (b, m)] = m 2σ4.

14 Background Estimators Based on Overlapping Batches Overlapping Batches Form n m + 1 overlapping batches each consisting of m observations. Batch i consists of observations {X i+j : j = 0,..., m 1}. Define b n/m.

15 Background Estimators Based on Overlapping Batches Overlapping Area Estimators A o (f; b, m) 1 m 2 (n m + 1) n m+1 i=1 m j=1 where, for t [0, 1] and j = 1, 2,..., n m + 1, f ( j ) ( m σt o j i,m m ) 2, T o i,m(t) mt ( X o i,m X o i, mt ) σ m and j 1 Xo i,j 1 X i+l. j l=0 Under Assumptions A and F, for t [0, 1] and s [0, b 1], A o (f; b, m) A o (f; b) 1 b 1 b 1 0 [ σ 1 0 f(u)b W,s (u) du] 2 ds, where B W,s (t) t[w(s + 1) W(s)] [W(s + t) W(s)].

16 Background Estimators Based on Overlapping Batches Overlapping Area Estimators If Assumptions A and F hold, then E[A o (f; b, m)] = σ 2 [(F F ) 2 + F 2 ]γ 1 2m + o(1/m). (3) If {[A o (f; b, m)] 2 : m = 1, 2,...} is uniformly integrable, Var[A o (f; b, m)] Var[A o (f; b)] m = 4σ4 (b 1) 2 for fixed b, where, for y [0, 1], 1 0 (b 1 y)p 2 (y) dy, (4) p(y) F (1)[F (1 y) F (1 y) y F (1)] + F (y) F (1) 1 y 0 f(u) F (y + u) du.

17 Background Estimators Based on Overlapping Batches Overlapping Batch Means Estimator O(b, m) Under Assumptions A, n m+1 nm ( (n m + 1)(n m) X i,m o X n ) 2. i=1 E[O(b, m)] = σ 2 (b2 + 1)γ 1 mb(b 1) + o(1/m). lim m Var[O(b, m)] = (4b3 11b 2 + 4b + 6)σ 4 3(b 1) 4 4σ4 3b.

18 Estimators with Data Re-use Outline 1 Introduction 2 Background Basics and Assumptions Standardized Time Series Estimators Estimators Based on Batches Estimators Based on Overlapping Batches 3 Estimators with Data Re-use Folded Estimators Folded Overlapping Area Estimators Reflected Estimators 4 Conclusions and Future Work

19 Estimators with Data Re-use Folded Estimators Folding Operation Brownian bridge Reflected portion Take a Brownian Bridge. Reflect the second half portion through the first half. Take the difference between the two portions. Stretch it over the [0,1] interval.

20 Estimators with Data Re-use Folded Estimators Batched Folded Area Estimator A (k) (f; b, m) 1 bm 2 b m f ( j ( j ) m) σt(k),i,m m i=1 j=1 where, for t [0, 1], k = 1, 2,... and i = 1,..., b, T (k),i,m (t) T (k 1),i,m ( t 2 ) T (k 1),i,m(1 t 2 ), Theorem Under Assumptions A and F, A (k) (f; b, m) σ 2 χ 2 b /b. If m is even, E[A (1) (f; b, m)] = σ 2 F 2 γ 1 m + o(1/m). (5) 2,

21 Estimators with Data Re-use Folded Estimators Batched Folded Area Estimator If {A 2 (k)(f; b, m) : m = 1, 2,...} is uniformly integrable, then lim Var[A (k)(f; b, m)] = 2σ4 m b. For weight functions under consideration, Cov[A (0) (f; b, m), A (k) (f; b, m)] = 0. Linear combination estimator Ā (0,1) (f; b, m) A (0)(f; b, m) + A (1) (f; b, m). 2 lim m Var[Ā(0,1)(f; b, m)] = σ4 b.

22 Estimators with Data Re-use Folded Estimators Approximate Asymptotic Bias and Variance for Different Estimators Area (m/γ 1 )Bias (b/σ 4 )Var A(f; b, m) Eq. (2) 2 A(f 0 ; b, m) 3 2 A(f 2 ; b, m) o(1) 2 A (1) (f; b, m) Eq. (5) 2 A (1) (f 0 ; b, m) 3 2 A (1) (f 2 ; b, m) o(1) 2 Ā (0,1) (f 0 ; b, m) 3 1 Ā (0,1) (f 2 ; b, m) o(1) 1 N (b, m) 1 2 O(b, m)

23 Estimators with Data Re-use Folded Estimators Examples 1 First-order autoregressive (AR(1)) process: X i = φx i 1 + ɛ i for i = 1, 2,..., where 1 < φ < 1, X 0 is a standard normal random variable, and the ɛ i s are i.i.d. N(0, 1 φ 2 ) random variables that are independent of X 0. R k = φ k for all k = 0, ±1, ±2,... σ 2 = (1 + φ)/(1 φ) and γ = 2φ/(1 φ) 2. Consider φ = 0.9, hence σ 2 = We run 10,000 replications using b = 32.

24 Estimators with Data Re-use Folded Estimators Expected Values of Folded Estimators Based on the AR(1) Process Expected Values Level 0 f0 Level 0 f2 Level 1 f0 Level 1 f2 NBM m: batch size

25 Estimators with Data Re-use Folded Estimators Estimated Standard Deviations of Variance Estimators for the AR(1) Process for b = 32 Level-0 Estimators m A (0) (f 0 ; b, m) A (0) (f 2 ; b, m) Level-1 Folded Estimators m A (1) (f 0 ; b, m) A (1) (f 2 ; b, m) Linearly Combined Estimators m Ā (0,1) (f 0 ; b, m) Ā (0,1) (f 2 ; b, m)

26 Estimators with Data Re-use Folded Overlapping Area Estimators Folded Overlapping Area (FOA) Estimators Idea: Combination of folding and overlapping operations. Estimators based on overlapping batches are always less variable than estimators based on nonoverlapping batches. Folded overlapping estimators can have smaller variance than unfolded overlapping analogues. Let s put these tricks together.

27 Estimators with Data Re-use Folded Overlapping Area Estimators Estimated Standard Deviations of Variance Estimators for the AR(1) Process for b = 32 Level-0 Folded Area Estimators m A (0) (f 0 ; b, m) A o (0)(f 0 ; b, m) A (0) (f 2 ; b, m) A o (0)(f 2 ; b, m) Level-1 Folded Area Estimators m A (1) (f 0; b, m) A o (1)(f 0; b, m) A (1) (f 2; b, m) A o (1)(f 2; b, m)

28 Estimators with Data Re-use Reflected Estimators Reflected Estimators Reflection Prniciple If W(t) is a Brownian motion on t [0, 1], then { Wc W(t) if t < c (t) = 2W(c) W(t) if t c is also a Brownian motion process, where c [0, 1] is any reflection point. 1 original reflected

29 Estimators with Data Re-use Reflected Estimators Reflected STS with Reflection Point c: Tn,c(t) nt ( X nt X n) σ. n (a indicates the reflected analogue of the original quantity) Reflected Brownian Bridge: Bc (t) = Wc (t) twc (1) { W(t) t[2w(c) W(1)] if 0 t c = W(t) + 2(1 t)w(c) + tw(1) if c < t 1.

30 Estimators with Data Re-use Reflected Estimators Under Assumptions A, T n,c(t) B c (t). Reflected weighted area estimator and limiting functional: A c(f; n) [ 1 n n j=1 f ( ] j ) 2 n σt n,c ( j n ) [ 1 2 A c(f) f(t)σbc (t) dt]. Expected values depend on reflection point c. 0

31 Estimators with Data Re-use Reflected Estimators Linear Combination of Reflected Area Estimators k To obtain the estimator α i A c i (f) with minimum variance i=1 among k reflected area estimators, we solve min α,c subject to [ k ] Var α i A c i (f) i=1 k α i = 1 i=1 0 c 1 c 2 c k 1, α j IR, 0 c j 1; j = 1,..., k, where α i and c i for i = 1,..., k are weights and reflection points respectively.

32 Estimators with Data Re-use Reflected Estimators Variance of Linear Combination Estimator for f 0 ( σ 4 ) Variance # of Estimators

33 Estimators with Data Re-use Reflected Estimators Estimated Expected Values and Variances of Linearly Combined Area Estimators for the AR(1) Process with n = 10, 000 f 0 f 2 Number of Expected Variance Expected Variance Estimators Value Value

34 Conclusions and Future Work Outline 1 Introduction 2 Background Basics and Assumptions Standardized Time Series Estimators Estimators Based on Batches Estimators Based on Overlapping Batches 3 Estimators with Data Re-use Folded Estimators Folded Overlapping Area Estimators Reflected Estimators 4 Conclusions and Future Work

35 Conclusions and Future Work Summary I Obtained estimators using data re-use techniques: Folding, overlapping, and reflection. Folding increases bias, but as m increases, bias levels decrease to those of unfolded counterparts. Linear combination of folded estimators reduces variance significantly. While having roughly the same bias, the FOA estimators have smaller variance for all weight functions. Variance reduction is 33% for the weight function f 2 compared to unfolded overlapping area estimators. All folded estimators can be computed in O(n) time. Linear combination of reflected STS estimators reduces variance significantly. Bias may increase due to reflection.

36 Conclusions and Future Work Future Work Higher levels of folding. Linear combinations of area and CvM estimators at different folding levels. Folded overlapping CvM estimators. Sequential procedures that deliver required batch and sample sizes. Algorithms that give better and quicker solutions to optimization problem for linear combination of reflected estimators. Combination of batching with reflection. Comprehensive comparison of variance parameter estimators in literature.

37 Conclusions and Future Work References I Alexopoulos, C., C. F. Antonini, D. Goldsman, M. Meterelliyoz. Performance of folded variance estimators for simulation. Submitted to ACM TOMACS. Alexopoulos, C., N. T. Argon, D. Goldsman, G. Tokol, J. R. Wilson. Overlapping variance estimators for simulations. Operations Research , Antonini C. F. Folded variance estimators for stationary time series. PhD thesis. H. Milton Stewart School of ISyE, Georgia Tech, Atlanta, GA, Calvin, J. M., and M. K. Nakayama. Permuted standardized time series for steady-state simulations. Mathematics of Operations Research , Glynn, P. W., and W. Whitt. Estimating the asymptotic variance with batch means. Operations Research Letters , 1991.

38 Conclusions and Future Work References II Meterelliyoz, M., C. Alexopoulos, D. Goldsman. Folded overlapping area estimators for simulation. Technical Report. H. Milton Stewart School of ISyE, Georgia Tech, Atlanta, GA, Schruben, L. W. Confidence interval estimation using standardized time series. Operations Research , Song, W. M. T., and B. W. Schmeiser. Variance of the sample mean: Properties and graphs of quadratic-form estimators. Operations Research , 1993.

39 Conclusions and Future Work THANK YOU! QUESTIONS AND COMMENTS?

REFLECTED VARIANCE ESTIMATORS FOR SIMULATION. Melike Meterelliyoz Christos Alexopoulos David Goldsman

REFLECTED VARIANCE ESTIMATORS FOR SIMULATION. Melike Meterelliyoz Christos Alexopoulos David Goldsman Proceedings of the 21 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. REFLECTE VARIANCE ESTIMATORS FOR SIMULATION Melike Meterelliyoz Christos Alexopoulos

More information

Folded standardized time series area variance estimators for simulation

Folded standardized time series area variance estimators for simulation Submitted to IIE Transactions. Folded standardized time series area variance estimators for simulation CLAUDIA ANTONINI 1 Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolivar, Sartenejas,

More information

A SEQUENTIAL PROCEDURE FOR ESTIMATING THE STEADY-STATE MEAN USING STANDARDIZED TIME SERIES. Christos Alexopoulos David Goldsman Peng Tang

A SEQUENTIAL PROCEDURE FOR ESTIMATING THE STEADY-STATE MEAN USING STANDARDIZED TIME SERIES. Christos Alexopoulos David Goldsman Peng Tang Proceedings of the 2013 Winter Simulation Conference R. Pasupathy, S.-H. Kim, A. Tolk, R. Hill, and M. E. Kuhl, eds. A SEQUENTIAL PROCEDURE FOR ESTIMATING THE STEADY-STATE MEAN USING STANDARDIZED TIME

More information

Online Supplement to Efficient Computation of Overlapping Variance Estimators for Simulation INFORMS Journal on Computing

Online Supplement to Efficient Computation of Overlapping Variance Estimators for Simulation INFORMS Journal on Computing Online Supplement to Efficient Computation of Overlapping Variance Estimators for Simulation INFORMS Journal on Computing Christos Alexopoulos H. Milton Stewart School of Industrial and Systems Engineering,

More information

Area variance estimators for simulation using folded standardized time series

Area variance estimators for simulation using folded standardized time series To appear, IIE Transactions. Area variance estimators for simulation using folded standardized time series CLAUDIA ANTONINI 1 Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas,

More information

Optimal Linear Combinations of Overlapping Variance Estimators for Steady-State Simulation

Optimal Linear Combinations of Overlapping Variance Estimators for Steady-State Simulation Optimal Linear Combinations of Overlapping Variance Estimators for Steady-State Simulation Tûba Aktaran-Kalaycı, Christos Alexopoulos, David Goldsman, and James R. Wilson Abstract To estimate the variance

More information

SIMULATION OUTPUT ANALYSIS

SIMULATION OUTPUT ANALYSIS 1 / 64 SIMULATION OUTPUT ANALYSIS Dave Goldsman School of ISyE Georgia Tech Atlanta, Georgia, USA sman@gatech.edu www.isye.gatech.edu/ sman April 15, 2016 Outline 1 Introduction 2 Finite-Horizon Simulation

More information

Proceedings of the 2008 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds.

Proceedings of the 2008 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. Proceedings of the 2008 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DISTRIBUTION-FREE TABULAR CUSUM CHART FOR CORRELATED DATA WITH AUTOMATED

More information

SPC Monitoring and Variance Estimation

SPC Monitoring and Variance Estimation SPC Monitoring and Variance Estimation C. Alexopoulos D. Goldsman K.-L. Tsui School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 W. Jiang INSIGHT, AT&T Labs

More information

SIMULATION OUTPUT ANALYSIS

SIMULATION OUTPUT ANALYSIS 1 / 71 SIMULATION OUTPUT ANALYSIS Dave Goldsman School of ISyE Georgia Tech Atlanta, Georgia, USA sman@gatech.edu www.isye.gatech.edu/ sman 10/19/17 2 / 71 Outline 1 Introduction 2 A Mathematical Interlude

More information

A New Model-Free CuSum Procedure for Autocorrelated Processes

A New Model-Free CuSum Procedure for Autocorrelated Processes A New Model-Free CuSum Procedure for Autocorrelated Processes Seong-Hee Kim, Christos Alexopoulos, David Goldsman, and Kwok-Leung Tsui School of Industrial and Systems Engineering Georgia Institute of

More information

CONFIDENCE INTERVALS FOR QUANTILES WITH STANDARDIZED TIME SERIES. James M. Calvin Marvin K. Nakayama

CONFIDENCE INTERVALS FOR QUANTILES WITH STANDARDIZED TIME SERIES. James M. Calvin Marvin K. Nakayama Proceedings of the 2013 Winter Simulation Conference R. Pasupathy, S.-H. Kim, A. Tolk, R. Hill, and M. E. Kuhl, eds. CONFIDENCE INTERVALS FOR QUANTILES WITH STANDARDIZED TIME SERIES James M. Calvin Marvin

More information

Monitoring Autocorrelated Processes Using A Distribution-Free Tabular CUSUM Chart With Automated Variance Estimation

Monitoring Autocorrelated Processes Using A Distribution-Free Tabular CUSUM Chart With Automated Variance Estimation To appear, IIE Transactions. Monitoring Autocorrelated Processes Using A Distribution-Free Tabular CUSUM Chart With Automated Variance Estimation JOONGSUP (JAY) LEE 1 CHRISTOS ALEXOPOULOS 2 DAVID GOLDSMAN

More information

Monitoring autocorrelated processes using a distribution-free tabular CUSUM chart with automated variance estimation

Monitoring autocorrelated processes using a distribution-free tabular CUSUM chart with automated variance estimation IIE Transactions (2009) 41, 979 994 Copyright C IIE ISSN: 0740-817X print / 1545-8830 online DOI: 10.1080/07408170902906035 Monitoring autocorrelated processes using a distribution-free tabular CUSUM chart

More information

I forgot to mention last time: in the Ito formula for two standard processes, putting

I forgot to mention last time: in the Ito formula for two standard processes, putting I forgot to mention last time: in the Ito formula for two standard processes, putting dx t = a t dt + b t db t dy t = α t dt + β t db t, and taking f(x, y = xy, one has f x = y, f y = x, and f xx = f yy

More information

A GENERAL FRAMEWORK FOR THE ASYMPTOTIC VALIDITY OF TWO-STAGE PROCEDURES FOR SELECTION AND MULTIPLE COMPARISONS WITH CONSISTENT VARIANCE ESTIMATORS

A GENERAL FRAMEWORK FOR THE ASYMPTOTIC VALIDITY OF TWO-STAGE PROCEDURES FOR SELECTION AND MULTIPLE COMPARISONS WITH CONSISTENT VARIANCE ESTIMATORS Proceedings of the 2009 Winter Simulation Conference M. D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin, and R. G. Ingalls, eds. A GENERAL FRAMEWORK FOR THE ASYMPTOTIC VALIDITY OF TWO-STAGE PROCEDURES

More information

Economics Division University of Southampton Southampton SO17 1BJ, UK. Title Overlapping Sub-sampling and invariance to initial conditions

Economics Division University of Southampton Southampton SO17 1BJ, UK. Title Overlapping Sub-sampling and invariance to initial conditions Economics Division University of Southampton Southampton SO17 1BJ, UK Discussion Papers in Economics and Econometrics Title Overlapping Sub-sampling and invariance to initial conditions By Maria Kyriacou

More information

On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation

On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation Seong-Hee Kim School of Industrial & Systems Engineering Georgia Institute of Technology Barry L. Nelson

More information

Proceedings of the 2015 Winter Simulation Conference L. Yilmaz, W. K. V. Chan, I. Moon, T. M. K. Roeder, C. Macal, and M. D. Rossetti, eds.

Proceedings of the 2015 Winter Simulation Conference L. Yilmaz, W. K. V. Chan, I. Moon, T. M. K. Roeder, C. Macal, and M. D. Rossetti, eds. Proceedings of the 2015 Winter Siulation Conference L. Yilaz, W. K. V. Chan, I. Moon, T. M. K. Roeder, C. Macal, and M. D. Rossetti, eds. JACKKNIFED VARIANCE ESTIMATORS FOR SIMULATION OUTPUT ANALYSIS Keal

More information

Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds.

Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds. Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds. SEQUEST: A SEQUENTIAL PROCEDURE FOR ESTIMATING STEADY-STATE QUANTILES

More information

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS Emily K. Lada Anup C. Mokashi SAS Institute Inc. 100 SAS Campus Drive, R5413 Cary, NC 27513-8617, USA James R. Wilson North Carolina

More information

Asummary and an analysis are given for an experimental performance evaluation of WASSP, an automated

Asummary and an analysis are given for an experimental performance evaluation of WASSP, an automated INFORMS Journal on Computing Vol. 19, No. 2, Spring 2007, pp. 150 160 issn 1091-9856 eissn 1526-5528 07 1902 0150 informs doi 10.1287/ijoc.1050.0161 2007 INFORMS Performance of a Wavelet-Based Spectral

More information

NEW ESTIMATORS FOR PARALLEL STEADY-STATE SIMULATIONS

NEW ESTIMATORS FOR PARALLEL STEADY-STATE SIMULATIONS roceedings of the 2009 Winter Simulation Conference M. D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin, and R. G. Ingalls, eds. NEW ESTIMATORS FOR ARALLEL STEADY-STATE SIMULATIONS Ming-hua Hsieh Department

More information

ESTIMATION AND OUTPUT ANALYSIS (L&K Chapters 9, 10) Review performance measures (means, probabilities and quantiles).

ESTIMATION AND OUTPUT ANALYSIS (L&K Chapters 9, 10) Review performance measures (means, probabilities and quantiles). ESTIMATION AND OUTPUT ANALYSIS (L&K Chapters 9, 10) Set up standard example and notation. Review performance measures (means, probabilities and quantiles). A framework for conducting simulation experiments

More information

The concentration of a drug in blood. Exponential decay. Different realizations. Exponential decay with noise. dc(t) dt.

The concentration of a drug in blood. Exponential decay. Different realizations. Exponential decay with noise. dc(t) dt. The concentration of a drug in blood Exponential decay C12 concentration 2 4 6 8 1 C12 concentration 2 4 6 8 1 dc(t) dt = µc(t) C(t) = C()e µt 2 4 6 8 1 12 time in minutes 2 4 6 8 1 12 time in minutes

More information

2WB05 Simulation Lecture 7: Output analysis

2WB05 Simulation Lecture 7: Output analysis 2WB05 Simulation Lecture 7: Output analysis Marko Boon http://www.win.tue.nl/courses/2wb05 December 17, 2012 Outline 2/33 Output analysis of a simulation Confidence intervals Warm-up interval Common random

More information

ISyE 6644 Fall 2014 Test 3 Solutions

ISyE 6644 Fall 2014 Test 3 Solutions 1 NAME ISyE 6644 Fall 14 Test 3 Solutions revised 8/4/18 You have 1 minutes for this test. You are allowed three cheat sheets. Circle all final answers. Good luck! 1. [4 points] Suppose that the joint

More information

Confidence Intervals of Prescribed Precision Summary

Confidence Intervals of Prescribed Precision Summary Confidence Intervals of Prescribed Precision Summary Charles Stein showed in 1945 that by using a two stage sequential procedure one could give a confidence interval for the mean of a normal distribution

More information

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS

ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS Proceedings of the 2013 Winter Simulation Conference R. Pasupathy, S.-H. Kim, A. Tolk, R. Hill, and M. E. Kuhl, eds. ARD: AN AUTOMATED REPLICATION-DELETION METHOD FOR SIMULATION ANALYSIS Emily K. Lada

More information

Lecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1

Lecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1 Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).

More information

A distribution-free tabular CUSUM chart for autocorrelated data

A distribution-free tabular CUSUM chart for autocorrelated data IIE Transactions (007) 39, 317 330 Copyright C IIE ISSN: 0740-817X print / 1545-8830 online DOI: 10.1080/07408170600743946 A distribution-free tabular CUSUM chart for autocorrelated data SEONG-HEE KIM

More information

HW 2 Solutions. The variance of the random walk is explosive (lim n Var (X n ) = ).

HW 2 Solutions. The variance of the random walk is explosive (lim n Var (X n ) = ). Stochastic Processews Prof Olivier Scaillet TA Adrien Treccani HW 2 Solutions Exercise. The process {X n, n } is a random walk starting at a (cf. definition in the course. [ n ] E [X n ] = a + E Z i =

More information

Initial Transient Phase of Steady state Simulation: Methods of Its Length Detection and Their Evaluation in Akaroa2

Initial Transient Phase of Steady state Simulation: Methods of Its Length Detection and Their Evaluation in Akaroa2 Initial Transient Phase of Steady state Simulation: Methods of Its Length Detection and Their Evaluation in Akaroa2 A Thesis Submitted in Partial Fulfilment of the Requirement for the Degree of Master

More information

PERFORMANCE OF VARIANCE UPDATING RANKING AND SELECTION PROCEDURES

PERFORMANCE OF VARIANCE UPDATING RANKING AND SELECTION PROCEDURES Proceedings of the 2005 Winter Simulation Conference M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joines, eds. PERFORMANCE OF VARIANCE UPDATING RANKING AND SELECTION PROCEDURES Gwendolyn J. Malone

More information

A SPACED BATCH MEANS PROCEDURE FOR SIMULATION ANALYSIS

A SPACED BATCH MEANS PROCEDURE FOR SIMULATION ANALYSIS Proceedings of the 2007 Winter Simulation Conference S. G. Henderson, B. Biller, M.-H. Hsieh, J. Shortle, J. D. Tew, and R. R. Barton, eds. SBatch: A SPACED BATCH MEANS PROCEDURE FOR SIMULATION ANALYSIS

More information

Estimation of the quantile function using Bernstein-Durrmeyer polynomials

Estimation of the quantile function using Bernstein-Durrmeyer polynomials Estimation of the quantile function using Bernstein-Durrmeyer polynomials Andrey Pepelyshev Ansgar Steland Ewaryst Rafaj lowic The work is supported by the German Federal Ministry of the Environment, Nature

More information

MA8109 Stochastic Processes in Systems Theory Autumn 2013

MA8109 Stochastic Processes in Systems Theory Autumn 2013 Norwegian University of Science and Technology Department of Mathematical Sciences MA819 Stochastic Processes in Systems Theory Autumn 213 1 MA819 Exam 23, problem 3b This is a linear equation of the form

More information

BROWNIAN BRIDGE HYPOTHESIS TESTING FOR THE INITIAL TRANSIENT PROBLEM

BROWNIAN BRIDGE HYPOTHESIS TESTING FOR THE INITIAL TRANSIENT PROBLEM Proceedings of the 211 Winter Simulation Conference S. Jain, R. R. Creasey, J. Himmelspach, K. P. White, and M. Fu, eds. BROWNIAN BRIGE HYPOTHESIS TESTING FOR THE INITIAL TRANSIENT PROBLEM Peter W. Glynn

More information

Modeling and testing long memory in random fields

Modeling and testing long memory in random fields Modeling and testing long memory in random fields Frédéric Lavancier lavancier@math.univ-lille1.fr Université Lille 1 LS-CREST Paris 24 janvier 6 1 Introduction Long memory random fields Motivations Previous

More information

ISyE 6650 Test 2 Solutions

ISyE 6650 Test 2 Solutions 1 NAME ISyE 665 Test 2 Solutions Summer 2 This test is open notes, open books. The test is two hours long. 1. Consider an M/M/3/4 queueing system in steady state with arrival rate λ = 3 and individual

More information

Optimal Jackknife for Unit Root Models

Optimal Jackknife for Unit Root Models Optimal Jackknife for Unit Root Models Ye Chen and Jun Yu Singapore Management University October 19, 2014 Abstract A new jackknife method is introduced to remove the first order bias in the discrete time

More information

The Semi-Regenerative Method of Simulation Output Analysis

The Semi-Regenerative Method of Simulation Output Analysis The Semi-Regenerative Method of Simulation Output Analysis JAMES M. CALVIN New Jersey Institute of Technology PETER W. GLYNN Stanford University and MARVIN K. NAKAYAMA New Jersey Institute of Technology

More information

Math 576: Quantitative Risk Management

Math 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 information

Model Specification Testing in Nonparametric and Semiparametric Time Series Econometrics. Jiti Gao

Model Specification Testing in Nonparametric and Semiparametric Time Series Econometrics. Jiti Gao Model Specification Testing in Nonparametric and Semiparametric Time Series Econometrics Jiti Gao Department of Statistics School of Mathematics and Statistics The University of Western Australia Crawley

More information

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA 1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient

More information

Notes on Random Vectors and Multivariate Normal

Notes on Random Vectors and Multivariate Normal MATH 590 Spring 06 Notes on Random Vectors and Multivariate Normal Properties of Random Vectors If X,, X n are random variables, then X = X,, X n ) is a random vector, with the cumulative distribution

More information

ECONOMETRICS II, FALL Testing for Unit Roots.

ECONOMETRICS II, FALL Testing for Unit Roots. ECONOMETRICS II, FALL 216 Testing for Unit Roots. In the statistical literature it has long been known that unit root processes behave differently from stable processes. For example in the scalar AR(1)

More information

Introduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued

Introduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued Introduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and

More information

FINDING THE BEST IN THE PRESENCE OF A STOCHASTIC CONSTRAINT. Sigrún Andradóttir David Goldsman Seong-Hee Kim

FINDING THE BEST IN THE PRESENCE OF A STOCHASTIC CONSTRAINT. Sigrún Andradóttir David Goldsman Seong-Hee Kim Proceedings of the 2005 Winter Simulation Conference M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joines, eds. FINDING THE BEST IN THE PRESENCE OF A STOCHASTIC CONSTRAINT Sigrún Andradóttir David

More information

Lecture 3 - Expectation, inequalities and laws of large numbers

Lecture 3 - Expectation, inequalities and laws of large numbers Lecture 3 - Expectation, inequalities and laws of large numbers Jan Bouda FI MU April 19, 2009 Jan Bouda (FI MU) Lecture 3 - Expectation, inequalities and laws of large numbersapril 19, 2009 1 / 67 Part

More information

Performance of Skart: A Skewness- and Autoregression-Adjusted Batch-Means Procedure for Simulation Analysis

Performance of Skart: A Skewness- and Autoregression-Adjusted Batch-Means Procedure for Simulation Analysis INFORMS Journal on Computing, to appear. Performance of Skart: A Skewness- and Autoregression-Adjusted Batch-Means Procedure for Simulation Analysis Ali Tafazzoli, James R. Wilson Edward P. Fitts Department

More information

Stationary independent increments. 1. Random changes of the form X t+h X t fixed h > 0 are called increments of the process.

Stationary independent increments. 1. Random changes of the form X t+h X t fixed h > 0 are called increments of the process. Stationary independent increments 1. Random changes of the form X t+h X t fixed h > 0 are called increments of the process. 2. If each set of increments, corresponding to non-overlapping collection of

More information

Overall Plan of Simulation and Modeling I. Chapters

Overall Plan of Simulation and Modeling I. Chapters Overall Plan of Simulation and Modeling I Chapters Introduction to Simulation Discrete Simulation Analytical Modeling Modeling Paradigms Input Modeling Random Number Generation Output Analysis Continuous

More information

Uniform Convergence Examples

Uniform Convergence Examples Uniform Convergence Examples James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 13, 2017 Outline 1 Example Let (x n ) be the sequence

More information

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA 1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient

More information

SEQUENTIAL ESTIMATION OF THE STEADY-STATE VARIANCE IN DISCRETE EVENT SIMULATION

SEQUENTIAL ESTIMATION OF THE STEADY-STATE VARIANCE IN DISCRETE EVENT SIMULATION SEQUENTIAL ESTIMATION OF THE STEADY-STATE VARIANCE IN DISCRETE EVENT SIMULATION Adriaan Schmidt Institute for Theoretical Information Technology RWTH Aachen University D-5056 Aachen, Germany Email: Adriaan.Schmidt@rwth-aachen.de

More information

Practical unbiased Monte Carlo for Uncertainty Quantification

Practical unbiased Monte Carlo for Uncertainty Quantification Practical unbiased Monte Carlo for Uncertainty Quantification Sergios Agapiou Department of Statistics, University of Warwick MiR@W day: Uncertainty in Complex Computer Models, 2nd February 2015, University

More information

Ranking and Selection Procedures for Bernoulli and Multinomial Data. Gwendolyn Joy Malone

Ranking and Selection Procedures for Bernoulli and Multinomial Data. Gwendolyn Joy Malone Ranking and Selection Procedures for Bernoulli and Multinomial Data A Thesis Presented to The Academic Faculty by Gwendolyn Joy Malone In Partial Fulfillment of the Requirements for the Degree Doctor of

More information

Part III. Hypothesis Testing. III.1. Log-rank Test for Right-censored Failure Time Data

Part III. Hypothesis Testing. III.1. Log-rank Test for Right-censored Failure Time Data 1 Part III. Hypothesis Testing III.1. Log-rank Test for Right-censored Failure Time Data Consider a survival study consisting of n independent subjects from p different populations with survival functions

More information

THE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION

THE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION THE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION JAINUL VAGHASIA Contents. Introduction. Notations 3. Background in Probability Theory 3.. Expectation and Variance 3.. Convergence

More information

Transformation of functions

Transformation of functions Transformation of functions Translations Dilations (from the x axis) Dilations (from the y axis) Reflections (in the x axis) Reflections (in the y axis) Summary Applying transformations Finding equations

More information

Fourier Sin and Cos Series and Least Squares Convergence

Fourier Sin and Cos Series and Least Squares Convergence Fourier and east Squares Convergence James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University May 7, 28 Outline et s look at the original Fourier sin

More information

Overflow Networks: Approximations and Implications to Call-Center Outsourcing

Overflow 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 information

NORTH CAROLINA STATE UNIVERSITY Raleigh, North Carolina

NORTH CAROLINA STATE UNIVERSITY Raleigh, North Carolina ...-... Testing a multivariate process for a unit root using unconditionallikdihood by Key-II Shin and David A. Dickey Institute of Statistics Mimco Series # l!'m8 :a ~'"'- North Carolina State University

More information

A Single-Pass Algorithm for Spectrum Estimation With Fast Convergence Han Xiao and Wei Biao Wu

A Single-Pass Algorithm for Spectrum Estimation With Fast Convergence Han Xiao and Wei Biao Wu 4720 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 7, JULY 2011 A Single-Pass Algorithm for Spectrum Estimation With Fast Convergence Han Xiao Wei Biao Wu Abstract We propose a single-pass algorithm

More information

Monte Carlo Integration

Monte Carlo Integration Monte Carlo Integration SCX5005 Simulação de Sistemas Complexos II Marcelo S. Lauretto www.each.usp.br/lauretto Reference: Robert CP, Casella G. Introducing Monte Carlo Methods with R. Springer, 2010.

More information

Gaussian, Markov and stationary processes

Gaussian, 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 information

Discussion of Bootstrap prediction intervals for linear, nonlinear, and nonparametric autoregressions, by Li Pan and Dimitris Politis

Discussion of Bootstrap prediction intervals for linear, nonlinear, and nonparametric autoregressions, by Li Pan and Dimitris Politis Discussion of Bootstrap prediction intervals for linear, nonlinear, and nonparametric autoregressions, by Li Pan and Dimitris Politis Sílvia Gonçalves and Benoit Perron Département de sciences économiques,

More information

ARIMA Modelling and Forecasting

ARIMA Modelling and Forecasting ARIMA Modelling and Forecasting Economic time series often appear nonstationary, because of trends, seasonal patterns, cycles, etc. However, the differences may appear stationary. Δx t x t x t 1 (first

More information

An Introduction to Malliavin calculus and its applications

An Introduction to Malliavin calculus and its applications An Introduction to Malliavin calculus and its applications Lecture 3: Clark-Ocone formula David Nualart Department of Mathematics Kansas University University of Wyoming Summer School 214 David Nualart

More information

Multivariate Normal-Laplace Distribution and Processes

Multivariate Normal-Laplace Distribution and Processes CHAPTER 4 Multivariate Normal-Laplace Distribution and Processes The normal-laplace distribution, which results from the convolution of independent normal and Laplace random variables is introduced by

More information

Covariance function estimation in Gaussian process regression

Covariance function estimation in Gaussian process regression Covariance function estimation in Gaussian process regression François Bachoc Department of Statistics and Operations Research, University of Vienna WU Research Seminar - May 2015 François Bachoc Gaussian

More information

B8.3 Mathematical Models for Financial Derivatives. Hilary Term Solution Sheet 2

B8.3 Mathematical Models for Financial Derivatives. Hilary Term Solution Sheet 2 B8.3 Mathematical Models for Financial Derivatives Hilary Term 18 Solution Sheet In the following W t ) t denotes a standard Brownian motion and t > denotes time. A partition π of the interval, t is a

More information

Advanced Statistics II: Non Parametric Tests

Advanced Statistics II: Non Parametric Tests Advanced Statistics II: Non Parametric Tests Aurélien Garivier ParisTech February 27, 2011 Outline Fitting a distribution Rank Tests for the comparison of two samples Two unrelated samples: Mann-Whitney

More information

Uniform Convergence Examples

Uniform Convergence Examples Uniform Convergence Examples James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 13, 2017 Outline More Uniform Convergence Examples Example

More information

ASSET PRICING MODELS

ASSET PRICING MODELS ASSE PRICING MODELS [1] CAPM (1) Some notation: R it = (gross) return on asset i at time t. R mt = (gross) return on the market portfolio at time t. R ft = return on risk-free asset at time t. X it = R

More information

Fully Sequential Selection Procedures with Control. Variates

Fully Sequential Selection Procedures with Control. Variates Fully Sequential Selection Procedures with Control Variates Shing Chih Tsai 1 Department of Industrial and Information Management National Cheng Kung University No. 1, University Road, Tainan City, Taiwan

More information

On Reaching Nirvana (a.k.a. on Reaching a Steady State) Moshe Pollak Joint work (in progress) with Tom Hope

On Reaching Nirvana (a.k.a. on Reaching a Steady State) Moshe Pollak Joint work (in progress) with Tom Hope On Reaching Nirvana (a.k.a. on Reaching a Steady State) Moshe Pollak Joint work (in progress) with Tom Hope 1 What is Nirvana? "ביקש יעקב אבינו לישב בשלוה" רש"י, בראשית לז 2 the Pursuit of Happiness (US

More information

Han-Ying Liang, Dong-Xia Zhang, and Jong-Il Baek

Han-Ying Liang, Dong-Xia Zhang, and Jong-Il Baek J. Korean Math. Soc. 41 (2004), No. 5, pp. 883 894 CONVERGENCE OF WEIGHTED SUMS FOR DEPENDENT RANDOM VARIABLES Han-Ying Liang, Dong-Xia Zhang, and Jong-Il Baek Abstract. We discuss in this paper the strong

More information

HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES

HEAVY-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 information

The diameter of a random Cayley graph of Z q

The diameter of a random Cayley graph of Z q The diameter of a random Cayley graph of Z q Gideon Amir Ori Gurel-Gurevich September 4, 009 Abstract Consider the Cayley graph of the cyclic group of prime order q with k uniformly chosen generators.

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

Introduction to Estimation Methods for Time Series models Lecture 2

Introduction to Estimation Methods for Time Series models Lecture 2 Introduction to Estimation Methods for Time Series models Lecture 2 Fulvio Corsi SNS Pisa Fulvio Corsi Introduction to Estimation () Methods for Time Series models Lecture 2 SNS Pisa 1 / 21 Estimators:

More information

Advanced Signal Processing Introduction to Estimation Theory

Advanced Signal Processing Introduction to Estimation Theory Advanced Signal Processing Introduction to Estimation Theory Danilo Mandic, room 813, ext: 46271 Department of Electrical and Electronic Engineering Imperial College London, UK d.mandic@imperial.ac.uk,

More information

Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )

Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( ) Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca October 22nd, 2014 E. Tanré (INRIA - Team Tosca) Mathematical

More information

Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama

Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Instructions This exam has 7 pages in total, numbered 1 to 7. Make sure your exam has all the pages. This exam will be 2 hours

More information

Numerical Algorithms as Dynamical Systems

Numerical Algorithms as Dynamical Systems A Study on Numerical Algorithms as Dynamical Systems Moody Chu North Carolina State University What This Study Is About? To recast many numerical algorithms as special dynamical systems, whence to derive

More information

High Dimensional Empirical Likelihood for Generalized Estimating Equations with Dependent Data

High Dimensional Empirical Likelihood for Generalized Estimating Equations with Dependent Data High Dimensional Empirical Likelihood for Generalized Estimating Equations with Dependent Data Song Xi CHEN Guanghua School of Management and Center for Statistical Science, Peking University Department

More information

First and Second Order Differential Equations Lecture 4

First and Second Order Differential Equations Lecture 4 First and Second Order Differential Equations Lecture 4 Dibyajyoti Deb 4.1. Outline of Lecture The Existence and the Uniqueness Theorem Homogeneous Equations with Constant Coefficients 4.2. The Existence

More information

Monte-Carlo MMD-MA, Université Paris-Dauphine. Xiaolu Tan

Monte-Carlo MMD-MA, Université Paris-Dauphine. Xiaolu Tan Monte-Carlo MMD-MA, Université Paris-Dauphine Xiaolu Tan tan@ceremade.dauphine.fr Septembre 2015 Contents 1 Introduction 1 1.1 The principle.................................. 1 1.2 The error analysis

More information

UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017)

UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017) UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, 208 Practice Final Examination (Winter 207) There are 6 problems, each problem with multiple parts. Your answer should be as clear and readable

More information

Lecture 12: Diffusion Processes and Stochastic Differential Equations

Lecture 12: Diffusion Processes and Stochastic Differential Equations Lecture 12: Diffusion Processes and Stochastic Differential Equations 1. Diffusion Processes 1.1 Definition of a diffusion process 1.2 Examples 2. Stochastic Differential Equations SDE) 2.1 Stochastic

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

Long-Run Covariability

Long-Run Covariability Long-Run Covariability Ulrich K. Müller and Mark W. Watson Princeton University October 2016 Motivation Study the long-run covariability/relationship between economic variables great ratios, long-run Phillips

More information

Part III Example Sheet 1 - Solutions YC/Lent 2015 Comments and corrections should be ed to

Part III Example Sheet 1 - Solutions YC/Lent 2015 Comments and corrections should be  ed to TIME SERIES Part III Example Sheet 1 - Solutions YC/Lent 2015 Comments and corrections should be emailed to Y.Chen@statslab.cam.ac.uk. 1. Let {X t } be a weakly stationary process with mean zero and let

More information

On variable bandwidth kernel density estimation

On variable bandwidth kernel density estimation JSM 04 - Section on Nonparametric Statistics On variable bandwidth kernel density estimation Janet Nakarmi Hailin Sang Abstract In this paper we study the ideal variable bandwidth kernel estimator introduced

More information

B. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (1)

B. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (1) B. Maddah INDE 504 Discrete-Event Simulation Output Analysis (1) Introduction The basic, most serious disadvantage of simulation is that we don t get exact answers. Two different runs of the same model

More information

Variance reduction techniques

Variance reduction techniques Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Simulation with a given accuracy; Variance reduction techniques;

More information

On Derivative Estimation of the Mean Time to Failure in Simulations of Highly Reliable Markovian Systems

On Derivative Estimation of the Mean Time to Failure in Simulations of Highly Reliable Markovian Systems On Derivative Estimation of the Mean Time to Failure in Simulations of Highly Reliable Markovian Systems Marvin K. Nakayama Department of Computer and Information Science New Jersey Institute of Technology

More information

Moment Properties of Distributions Used in Stochastic Financial Models

Moment Properties of Distributions Used in Stochastic Financial Models Moment Properties of Distributions Used in Stochastic Financial Models Jordan Stoyanov Newcastle University (UK) & University of Ljubljana (Slovenia) e-mail: stoyanovj@gmail.com ETH Zürich, Department

More information