SlideShare a Scribd company logo
Some real life data analysis on stationary and non-stationary Time Series
Ajay Shankar Bidyarthy
b.ajay@iitg.ernet.in
Abhishek Kumar
kumar.ak@iitg.ernet
Mohit Yadav
y.mohit@iitg.ernet.in
April 3, 2012
Abstract
Now days there are several applications of block bootstrap method in stationary and non stationary time
series models. One of the well known application of this method is in case of IGARCH time series models.
Bootstrap confidence intervals also play mazor role in finding out confidence intervals of given any time
series data. First we have presented how block bootstrap method works in stationary and non stationary
time series models. Then we have presented the two bootstrap confidence interval methods one is bootstrap
percentile confidence interval method and second is bootstrap-t confidence interval method.
For any time series data using Autoregressinve AR(1) and AR(2) time series model to analyze the data
set and then find out the bootstrap confidence interval using percentile confidence interval method and
bootstrap-t confidence interval method.
1 Block bootstrap method
The bootstrap is a simulation approach to estimate the distribution of test statistics. The original method is
to create bootstrap samples by resampling the data randomly, and then constructs the associated empirical
distribution function. Often, the original bootstrap method provides improvements to the poor asymptotic
approximations when data are independently and identically distributed. However, the performance of the
original procedure can be far from satisfactory for time series data with serial correlation and heteroscedasticity
of unknown form.
The block bootstrap is the most general method to improve the accuracy of bootstrap for time series data.
By dividing the data into several blocks, it can preserve the original time series structure within a block.
However, the accuracy of the block bootstrap is sensitive to the choice of block length, and the optimal block
length depends on the sample size, the data generating process, and the statistic considered. To date, there is
1
no proper diagnostic tool to choose the optimal block lengths and it still remains as an unsolved question for
future study.
The detail of the block bootstrap procedure in our Monte Carlo experiment takes the following steps:
Step 1. Choose the block length which increases with the sample size. In our block bootstrap procedure,
we choose the block length (l) by the criterion l = T1/3 , where T is the sample size. Hall and Horowitz (1996)
use two block lengths l = 5 and l = 10 for both two sample sizes (T = 50, 100) and Inoue and Shintani (2001)
select the block length by an automatic procedures, which result in an average block length of 3.5 for sample
size 64 and 6 for sample size 128. Here we use a simple rule, which the block length in our simulations is
similar to the average block length of Inoue and Shintani (2001).
Step 2. Resample the blocks and generate the bootstrap sample. The blocks may be overlapping or
non-overlapping. According to Lahiri (1999), and Andrews (2002), there is little difference in performance for
these two methods. For the overlapping method, we divide the data into T − l + 1 blocks, which block 1 being
{y1, y2, ..., yl}, block 2 being {y2, y3, ..., yl+1}, , etc. For the non-overlapping method, we divide the data into
T/l blocks, which block 1 being {y1, y2, ..., yl}, block 2 being {yl+1, yl+2, ..., yl+l}, , etc. In our Monte Carlo
experiments, we adopt the overlapping method and resample yt , xt and zt together which is called the pairs
bootstrap. The block bootstrap sample can be generated as follows:
(y∗
t , x∗
t , z∗
t ) = (yi+j, xi+j, zi+j)
where t = 1,2,3,...T, i is iid uniform random variable on {1, 2, 3, ...T − l + 1} and j = 1,2,3,...l.
Step 3. Calculate the efficient bootstrap GMM estimator and the test statistic. First, estimate the
bootstrap TSLS estimator
ˆβ∗
TSLS = (X∗ Z∗(Z∗ Z∗)−1Z∗ X∗)−1(X∗ Z∗(Z∗ Z∗)−1Z∗ y∗)
and use the residual ˆe∗
t = y∗
t − x∗
t
ˆβ∗
TSLS to construct the efficient weighting matrix
W∗
t = ( 1
T
T
t=1ˆg∗
t
ˆg∗
t )−1
where ˆg∗
t = z∗
t ˆe∗
t . Second, calculate the efficient bootstrap GMM estimator and the bootstrap variance
ˆβ∗
GMM = (X∗ Z∗W∗
T Z∗ X∗)−1(X∗ Z ∗ W∗
T Z∗ y∗)
(ˆσ∗)2 = (X∗ Z∗W∗
T Z∗ X∗)−1
In the sense, the bootstrap GMM estimator ˆβ∗
GMM is a consistent estimator of β. However, because the
bootstrap sample can not satisfy the same moment condiation as the population distribution, it fails to achieve
an asymptotic refinement. A correlation suggested by Hall and Horowitz (1996) is to re-center the bootstrap
version of the moment functions. Therefore, in the linear model, the revised bootstrap GMM estimator derived
by Hansen (2004) is
2
ˆβ∗
GMM = (X∗ Z∗W∗
T Z∗ X∗)−1((X∗ Z ∗ W∗
T Z∗ y∗ − Z ˆu))
where ˆu are residuals of GMM estimation from original data. Finally, calculate the bootstrap test statistic
t∗ =
ˆβ∗
GMM −β
ˆσ∗ .
and the final step is :
Step 4. Calculate the bootstrap critical values of the test statistic and test the null hypothesis. First,
construct the empirical distribution of the test statistic by repeating step2 and step3 for sufficient amount of
times and sorting the bootstrap test statistic t∗ from the smallest to the largest. Usually, we set the (1 − α
2 )
quantile and the (α
2 ) quantile of the distribution of t∗ for our bootstrap critical values, where is significance
level. However, when t∗ does not have a symmetric distribution, the bootstrap critical values outlined above
may perform quite poorly. This problem can be circumvented by an alternative method. For the two sided
hypothesis testing, the upper bootstrap critical value q∗
n(α) is the (1 − α) quantile of the distribution of |t∗|,
and the lower bootstrap critical value is −q∗
n(α). Reject the null hypothesis if the test statistic of original data
is between two bootstrap critical values. Otherwise, we cannot reject null hypothesis.
2 Bootstrap confidence intervals method
There are different types of bootstrap confidence intervals method available. Although we are looking for only
two types:
1. Bootstrap percentile confidence interval method
2. Bootstrap-t confidence interval method
Suppose we have samples {X1, X2, ..., Xn} the estimator ˆθ = ¯Xn = n
i=1
Xi
n , and we have
V ˆFn
(ˆθ) = ˆσ2
n = 1
n
1
n
n
i=1(Xi − ¯Xn)2
let we want to generate B bootstrap samples then the bootstrap procedure follows:
1. For b = 1,2,3,...,B
2. Draw X∗
1 , ..., X∗
n ∼ ˆFn
3. Compute ˆθ∗
b = T(X∗
1 , ..., X∗
n)
4. Compute vboot = 1
B
B
b=1(ˆθ∗
b − 1
B
B
c=1
ˆθ∗
c )2
3 Bootstrap percentile confidence interval:
1. Draw X∗
1 , ..., X∗
n ∼ ˆFn
2. Compute ˆastb = T(X∗
1 , ..., X∗
n) for b = 1(1)B
3. Compute non-parametric confidence interval based on ˆ∗
b points
4. let ˆθ∗
(r) is the r-th order statistics
5. Therefore the 100(1−α)% confidence interval will be [ˆθ∗
k, ˆθ∗
k ] where k = [α
2 b] if [α
2 b] is integer and k = [α
2 b]+1
if [α
2 b] is not an integer. Similarly, k = [(1 − α
2 )b] if [(1 − α
2 )b] is integer and k = [(1 − α
2 )b] + 1 if [(1 − α
2 )b] is
not an integer.
3
4 Bootstrap-t confidence interval
Before applying resampling to time series analysis, we look the simpler problem. Suppose we wish to construct
a confidence interval for the time series data based on a given sample. One way to start with the so called
t-statistic which is
t = µ− ¯X
s√
n
where s√
n
is standard error of the mean.
If we are sampling from a normally distributed sample, then the probability distribution of t is known to be
the t-distribution with n-1 degrees of freedom. We denote by tα/2 the α/2 upper t-value, that is the 1 − α/2
quantile of this distribution. Thus t has probability α/2 of exceeding tα/2 . Because of symmetry of the
t-distribution, the probability is also α/2 that t is less than −tα/2.
therefore for normally distributed data, the probability is 1 − α that
−tα/2 ≤ t ≤ −tα/2
after substituting the value of t we get
¯X − tα/2
s√
n
≤ µ ≤ ¯X + tα/2
s√
n
which shows that
¯X ± s√
n
tα/2
is a 1 − α confidence interval for µ, assuming normally distributed data.
What if we are not sampling from a normal distribution ?? In that case, the distribution of t not is t-
distribution, but rather some other distribution that is not known to us. there are two problems. first we do
not know the distribution of given sample. Second, even if sample distribution were known it is a difficult,
ussually intractable, probability calculation to get the distribution of the t-statistic from the distribution of
the given sample. This calculation has only been done for normal given sample. Considering the difficulty of
these two problems, we can still get a confidence interval by resampling. we can take a large number, say B,
of resamples from the original sample.
Let ¯Xboot,b and sboot,b be the sample mean and standard deviation of the bth resample, b=1,2,...,B.
We define
tboot,b =
¯X− ¯Xboot,b
sboot,b√
n
The resamples are independent of each other, the collection tboot,b, tboot,b, ... can be treated as a random
sample from the distribution of the t-statistic. After B values of tboot,b have been calculated, one from each re-
sample, we find the 100α% and 100(1−α)% percentiles of this collection of tboot,b values. Call these percentiles
tL and tU . We find tL and tU as follows:
1. The B values of tboot,b are sorted from smallest to largest
2. Then we calculate Bα/2 and round to the nearest integer. suppose the result is KL.
4
3. The kLth sorted value of tboot,b is tL.
4. Similarly, let KU be B(1−α/2) , rounded to the nearest integer and then tU is the KU th sorted value of tboot,b.
If the original sample is skewed, then there is no reason to suspect that the 100α% percentile is minus the
100(1 − α)% percentile, as happens for symmetric samples such as t-distribution. In other words, we do not
necessarily expect that tL = tU . However, this fact causes us no problem, since the bootstrap allows us to
estimate tL and tU without assuming any relationship between them. Now, we replace −tα/2 and tα/2 in the
confidence interval by tL and tU , respectively.
Finally the bootstrap confidence interval for µ is :
( ¯X + tL
s√
n
, ¯X + tU
s√
n
)
The bootstrap has solved both problems mentioned above. we do not need to know the give data distribu-
tion since we can estimate it by the sample. Also we do not need to calculate the distribution of the t-statistic
using probability theory. Instead we simulate from this distribution.
We use the notation
SE = s√
n
and
SEboot = sboot√
n
******************* END ********************
5

More Related Content

What's hot

MT2
MT2MT2
Ch2 probability and random variables pg 81
Ch2 probability and random variables pg 81Ch2 probability and random variables pg 81
Ch2 probability and random variables pg 81
Prateek Omer
 
Pre- and Post-Selection Paradoxes, Measurement-Disturbance and Contextuality ...
Pre- and Post-Selection Paradoxes, Measurement-Disturbance and Contextuality ...Pre- and Post-Selection Paradoxes, Measurement-Disturbance and Contextuality ...
Pre- and Post-Selection Paradoxes, Measurement-Disturbance and Contextuality ...
Matthew Leifer
 
On problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-objectOn problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-object
Cemal Ardil
 
Dynamics of structures with uncertainties
Dynamics of structures with uncertaintiesDynamics of structures with uncertainties
Dynamics of structures with uncertainties
University of Glasgow
 
83662164 case-study-1
83662164 case-study-183662164 case-study-1
83662164 case-study-1
homeworkping3
 
Comparisons
ComparisonsComparisons
Comparisons
Zifirio
 
Molecular Solutions For The Set-Partition Problem On Dna-Based Computing
Molecular Solutions For The Set-Partition Problem On Dna-Based ComputingMolecular Solutions For The Set-Partition Problem On Dna-Based Computing
Molecular Solutions For The Set-Partition Problem On Dna-Based Computing
ijcsit
 

What's hot (8)

MT2
MT2MT2
MT2
 
Ch2 probability and random variables pg 81
Ch2 probability and random variables pg 81Ch2 probability and random variables pg 81
Ch2 probability and random variables pg 81
 
Pre- and Post-Selection Paradoxes, Measurement-Disturbance and Contextuality ...
Pre- and Post-Selection Paradoxes, Measurement-Disturbance and Contextuality ...Pre- and Post-Selection Paradoxes, Measurement-Disturbance and Contextuality ...
Pre- and Post-Selection Paradoxes, Measurement-Disturbance and Contextuality ...
 
On problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-objectOn problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-object
 
Dynamics of structures with uncertainties
Dynamics of structures with uncertaintiesDynamics of structures with uncertainties
Dynamics of structures with uncertainties
 
83662164 case-study-1
83662164 case-study-183662164 case-study-1
83662164 case-study-1
 
Comparisons
ComparisonsComparisons
Comparisons
 
Molecular Solutions For The Set-Partition Problem On Dna-Based Computing
Molecular Solutions For The Set-Partition Problem On Dna-Based ComputingMolecular Solutions For The Set-Partition Problem On Dna-Based Computing
Molecular Solutions For The Set-Partition Problem On Dna-Based Computing
 

Viewers also liked

presentación de la imagen fija
presentación de la imagen fijapresentación de la imagen fija
presentación de la imagen fija
kitopa
 
Algorithm
AlgorithmAlgorithm
Algorithm
sultanarun
 
Latest Items from Europe 2016
Latest Items from Europe 2016Latest Items from Europe 2016
Latest Items from Europe 2016
Flourish Promotional Marketing
 
Clout januari 2014
Clout januari 2014Clout januari 2014
Clout januari 2014
BenjaminJocic
 
Riley james johnstone presentation
Riley james johnstone presentationRiley james johnstone presentation
Riley james johnstone presentation
warjohnstone
 
Info2 sec 2_-_data__information
Info2 sec 2_-_data__informationInfo2 sec 2_-_data__information
Info2 sec 2_-_data__information
saltashict
 
Comunicato attività polisportiva - Pallavolo N°10 del 14 dicembre
Comunicato attività polisportiva - Pallavolo N°10 del 14 dicembreComunicato attività polisportiva - Pallavolo N°10 del 14 dicembre
Comunicato attività polisportiva - Pallavolo N°10 del 14 dicembre
Giuliano Ganassi
 
Building blocks for a tangible marketing plan
Building blocks for a tangible marketing planBuilding blocks for a tangible marketing plan
Building blocks for a tangible marketing plan
Flourish Promotional Marketing
 
WL TelPay Tutorial ENGLISH
WL TelPay Tutorial ENGLISHWL TelPay Tutorial ENGLISH
WL TelPay Tutorial ENGLISH
Claudia Baha
 
las herramientas
las herramientaslas herramientas
las herramientas
Sara Hernandez
 
Presentatie 3 februari Buisleidingenstraat
Presentatie 3 februari BuisleidingenstraatPresentatie 3 februari Buisleidingenstraat
Presentatie 3 februari Buisleidingenstraat
marusjkalestrade
 
Õppematerjalide loomine LeMill keskkonnas
Õppematerjalide loomine LeMill keskkonnasÕppematerjalide loomine LeMill keskkonnas
Õppematerjalide loomine LeMill keskkonnas
Hans Põldoja
 
justatemplate_test
justatemplate_testjustatemplate_test
justatemplate_test
Scott Peterson
 
Buen uso de la red y el internet
Buen uso de la red y el internetBuen uso de la red y el internet
Buen uso de la red y el internet
CamiloRodriguez123
 
Oltre Tata: lean startup all'italiana
Oltre Tata: lean startup all'italianaOltre Tata: lean startup all'italiana
Oltre Tata: lean startup all'italianaFrancesco Trucchia
 
Using Practice Fusion for PQRS EHR Reporting in 2014
Using Practice Fusion for PQRS EHR Reporting in 2014Using Practice Fusion for PQRS EHR Reporting in 2014
Using Practice Fusion for PQRS EHR Reporting in 2014
Practice Fusion
 
Solar Chimney
Solar ChimneySolar Chimney
Solar Chimney
Ahmed Amin
 
Solar chimney
Solar chimneySolar chimney
Solar chimney
Suchit Gupta
 
παραβολή
παραβολήπαραβολή
παραβολήKozalakis
 

Viewers also liked (20)

New account
New accountNew account
New account
 
presentación de la imagen fija
presentación de la imagen fijapresentación de la imagen fija
presentación de la imagen fija
 
Algorithm
AlgorithmAlgorithm
Algorithm
 
Latest Items from Europe 2016
Latest Items from Europe 2016Latest Items from Europe 2016
Latest Items from Europe 2016
 
Clout januari 2014
Clout januari 2014Clout januari 2014
Clout januari 2014
 
Riley james johnstone presentation
Riley james johnstone presentationRiley james johnstone presentation
Riley james johnstone presentation
 
Info2 sec 2_-_data__information
Info2 sec 2_-_data__informationInfo2 sec 2_-_data__information
Info2 sec 2_-_data__information
 
Comunicato attività polisportiva - Pallavolo N°10 del 14 dicembre
Comunicato attività polisportiva - Pallavolo N°10 del 14 dicembreComunicato attività polisportiva - Pallavolo N°10 del 14 dicembre
Comunicato attività polisportiva - Pallavolo N°10 del 14 dicembre
 
Building blocks for a tangible marketing plan
Building blocks for a tangible marketing planBuilding blocks for a tangible marketing plan
Building blocks for a tangible marketing plan
 
WL TelPay Tutorial ENGLISH
WL TelPay Tutorial ENGLISHWL TelPay Tutorial ENGLISH
WL TelPay Tutorial ENGLISH
 
las herramientas
las herramientaslas herramientas
las herramientas
 
Presentatie 3 februari Buisleidingenstraat
Presentatie 3 februari BuisleidingenstraatPresentatie 3 februari Buisleidingenstraat
Presentatie 3 februari Buisleidingenstraat
 
Õppematerjalide loomine LeMill keskkonnas
Õppematerjalide loomine LeMill keskkonnasÕppematerjalide loomine LeMill keskkonnas
Õppematerjalide loomine LeMill keskkonnas
 
justatemplate_test
justatemplate_testjustatemplate_test
justatemplate_test
 
Buen uso de la red y el internet
Buen uso de la red y el internetBuen uso de la red y el internet
Buen uso de la red y el internet
 
Oltre Tata: lean startup all'italiana
Oltre Tata: lean startup all'italianaOltre Tata: lean startup all'italiana
Oltre Tata: lean startup all'italiana
 
Using Practice Fusion for PQRS EHR Reporting in 2014
Using Practice Fusion for PQRS EHR Reporting in 2014Using Practice Fusion for PQRS EHR Reporting in 2014
Using Practice Fusion for PQRS EHR Reporting in 2014
 
Solar Chimney
Solar ChimneySolar Chimney
Solar Chimney
 
Solar chimney
Solar chimneySolar chimney
Solar chimney
 
παραβολή
παραβολήπαραβολή
παραβολή
 

Similar to Some real life data analysis on stationary and non-stationary Time Series

Talk 5
Talk 5Talk 5
Bootstrap2up
Bootstrap2upBootstrap2up
Bootstrap2up
Devinder Prasad
 
Lecture-6.pdf
Lecture-6.pdfLecture-6.pdf
Lecture-6.pdf
RochelleGomez4
 
Introduction to Bootstrap and elements of Markov Chains
Introduction to Bootstrap and elements of Markov ChainsIntroduction to Bootstrap and elements of Markov Chains
Introduction to Bootstrap and elements of Markov Chains
University of Salerno
 
Resampling methods
Resampling methodsResampling methods
Resampling methods
Setia Pramana
 
Project Paper
Project PaperProject Paper
Project Paper
Brian Whetter
 
fb69b412-97cb-4e8d-8a28-574c09557d35-160618025920
fb69b412-97cb-4e8d-8a28-574c09557d35-160618025920fb69b412-97cb-4e8d-8a28-574c09557d35-160618025920
fb69b412-97cb-4e8d-8a28-574c09557d35-160618025920
Karl Rudeen
 
Undetermined Mixing Matrix Estimation Base on Classification and Counting
Undetermined Mixing Matrix Estimation Base on Classification and CountingUndetermined Mixing Matrix Estimation Base on Classification and Counting
Undetermined Mixing Matrix Estimation Base on Classification and Counting
IJRESJOURNAL
 
Selection of bin width and bin number in histograms
Selection of bin width and bin number in histogramsSelection of bin width and bin number in histograms
Selection of bin width and bin number in histograms
Kushal Kumar Dey
 
Project2
Project2Project2
Project2
Linjun Li
 
The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)
theijes
 
Chapter_09_ParameterEstimation.pptx
Chapter_09_ParameterEstimation.pptxChapter_09_ParameterEstimation.pptx
Chapter_09_ParameterEstimation.pptx
VimalMehta19
 
Master_Thesis_Harihara_Subramanyam_Sreenivasan
Master_Thesis_Harihara_Subramanyam_SreenivasanMaster_Thesis_Harihara_Subramanyam_Sreenivasan
Master_Thesis_Harihara_Subramanyam_Sreenivasan
Harihara Subramanyam Sreenivasan
 
Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
Clock Skew Compensation Algorithm Immune to Floating-Point Precision LossClock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
Xi'an Jiaotong-Liverpool University
 
Confidence Intervals––Exact Intervals, Jackknife, and Bootstrap
Confidence Intervals––Exact Intervals, Jackknife, and BootstrapConfidence Intervals––Exact Intervals, Jackknife, and Bootstrap
Confidence Intervals––Exact Intervals, Jackknife, and Bootstrap
Francesco Casalegno
 
A non local linear dynamical system and violation of Bell’s inequality.
A non local linear dynamical system and violation of Bell’s inequality.A non local linear dynamical system and violation of Bell’s inequality.
A non local linear dynamical system and violation of Bell’s inequality.
Fausto Intilla
 
MARZULLO's agreement algorithm and DTSS intersection algorithm in Golang
MARZULLO's agreement algorithm and DTSS intersection algorithm in GolangMARZULLO's agreement algorithm and DTSS intersection algorithm in Golang
MARZULLO's agreement algorithm and DTSS intersection algorithm in Golang
Romain Jacotin
 
Arellano bond
Arellano bondArellano bond
Unit3
Unit3Unit3
My data are incomplete and noisy: Information-reduction statistical methods f...
My data are incomplete and noisy: Information-reduction statistical methods f...My data are incomplete and noisy: Information-reduction statistical methods f...
My data are incomplete and noisy: Information-reduction statistical methods f...
Umberto Picchini
 

Similar to Some real life data analysis on stationary and non-stationary Time Series (20)

Talk 5
Talk 5Talk 5
Talk 5
 
Bootstrap2up
Bootstrap2upBootstrap2up
Bootstrap2up
 
Lecture-6.pdf
Lecture-6.pdfLecture-6.pdf
Lecture-6.pdf
 
Introduction to Bootstrap and elements of Markov Chains
Introduction to Bootstrap and elements of Markov ChainsIntroduction to Bootstrap and elements of Markov Chains
Introduction to Bootstrap and elements of Markov Chains
 
Resampling methods
Resampling methodsResampling methods
Resampling methods
 
Project Paper
Project PaperProject Paper
Project Paper
 
fb69b412-97cb-4e8d-8a28-574c09557d35-160618025920
fb69b412-97cb-4e8d-8a28-574c09557d35-160618025920fb69b412-97cb-4e8d-8a28-574c09557d35-160618025920
fb69b412-97cb-4e8d-8a28-574c09557d35-160618025920
 
Undetermined Mixing Matrix Estimation Base on Classification and Counting
Undetermined Mixing Matrix Estimation Base on Classification and CountingUndetermined Mixing Matrix Estimation Base on Classification and Counting
Undetermined Mixing Matrix Estimation Base on Classification and Counting
 
Selection of bin width and bin number in histograms
Selection of bin width and bin number in histogramsSelection of bin width and bin number in histograms
Selection of bin width and bin number in histograms
 
Project2
Project2Project2
Project2
 
The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)
 
Chapter_09_ParameterEstimation.pptx
Chapter_09_ParameterEstimation.pptxChapter_09_ParameterEstimation.pptx
Chapter_09_ParameterEstimation.pptx
 
Master_Thesis_Harihara_Subramanyam_Sreenivasan
Master_Thesis_Harihara_Subramanyam_SreenivasanMaster_Thesis_Harihara_Subramanyam_Sreenivasan
Master_Thesis_Harihara_Subramanyam_Sreenivasan
 
Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
Clock Skew Compensation Algorithm Immune to Floating-Point Precision LossClock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss
 
Confidence Intervals––Exact Intervals, Jackknife, and Bootstrap
Confidence Intervals––Exact Intervals, Jackknife, and BootstrapConfidence Intervals––Exact Intervals, Jackknife, and Bootstrap
Confidence Intervals––Exact Intervals, Jackknife, and Bootstrap
 
A non local linear dynamical system and violation of Bell’s inequality.
A non local linear dynamical system and violation of Bell’s inequality.A non local linear dynamical system and violation of Bell’s inequality.
A non local linear dynamical system and violation of Bell’s inequality.
 
MARZULLO's agreement algorithm and DTSS intersection algorithm in Golang
MARZULLO's agreement algorithm and DTSS intersection algorithm in GolangMARZULLO's agreement algorithm and DTSS intersection algorithm in Golang
MARZULLO's agreement algorithm and DTSS intersection algorithm in Golang
 
Arellano bond
Arellano bondArellano bond
Arellano bond
 
Unit3
Unit3Unit3
Unit3
 
My data are incomplete and noisy: Information-reduction statistical methods f...
My data are incomplete and noisy: Information-reduction statistical methods f...My data are incomplete and noisy: Information-reduction statistical methods f...
My data are incomplete and noisy: Information-reduction statistical methods f...
 

More from Ajay Bidyarthy

Student Database Management System
Student Database Management SystemStudent Database Management System
Student Database Management System
Ajay Bidyarthy
 
Solving Quadratic Assignment Problems (QAP) using Ant Colony System
Solving Quadratic Assignment Problems (QAP) using Ant Colony SystemSolving Quadratic Assignment Problems (QAP) using Ant Colony System
Solving Quadratic Assignment Problems (QAP) using Ant Colony System
Ajay Bidyarthy
 
Skip Graphs and its Applications
Skip Graphs and its ApplicationsSkip Graphs and its Applications
Skip Graphs and its Applications
Ajay Bidyarthy
 
Implementation of parallel randomized algorithm for skew-symmetric matrix game
Implementation of parallel randomized algorithm for skew-symmetric matrix gameImplementation of parallel randomized algorithm for skew-symmetric matrix game
Implementation of parallel randomized algorithm for skew-symmetric matrix game
Ajay Bidyarthy
 
Environmental clearance procedure in India: Principal of Governance
Environmental clearance procedure in India: Principal of GovernanceEnvironmental clearance procedure in India: Principal of Governance
Environmental clearance procedure in India: Principal of Governance
Ajay Bidyarthy
 
DOW JONES INDUSTRIAL AVERAGE Time series Data Analysis: Analysis and Results ...
DOW JONES INDUSTRIAL AVERAGE Time series Data Analysis: Analysis and Results ...DOW JONES INDUSTRIAL AVERAGE Time series Data Analysis: Analysis and Results ...
DOW JONES INDUSTRIAL AVERAGE Time series Data Analysis: Analysis and Results ...
Ajay Bidyarthy
 
Design and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation AlgorithmsDesign and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation Algorithms
Ajay Bidyarthy
 
Design and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation AlgorithmsDesign and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation Algorithms
Ajay Bidyarthy
 
Optimization Techniques
Optimization TechniquesOptimization Techniques
Optimization Techniques
Ajay Bidyarthy
 

More from Ajay Bidyarthy (9)

Student Database Management System
Student Database Management SystemStudent Database Management System
Student Database Management System
 
Solving Quadratic Assignment Problems (QAP) using Ant Colony System
Solving Quadratic Assignment Problems (QAP) using Ant Colony SystemSolving Quadratic Assignment Problems (QAP) using Ant Colony System
Solving Quadratic Assignment Problems (QAP) using Ant Colony System
 
Skip Graphs and its Applications
Skip Graphs and its ApplicationsSkip Graphs and its Applications
Skip Graphs and its Applications
 
Implementation of parallel randomized algorithm for skew-symmetric matrix game
Implementation of parallel randomized algorithm for skew-symmetric matrix gameImplementation of parallel randomized algorithm for skew-symmetric matrix game
Implementation of parallel randomized algorithm for skew-symmetric matrix game
 
Environmental clearance procedure in India: Principal of Governance
Environmental clearance procedure in India: Principal of GovernanceEnvironmental clearance procedure in India: Principal of Governance
Environmental clearance procedure in India: Principal of Governance
 
DOW JONES INDUSTRIAL AVERAGE Time series Data Analysis: Analysis and Results ...
DOW JONES INDUSTRIAL AVERAGE Time series Data Analysis: Analysis and Results ...DOW JONES INDUSTRIAL AVERAGE Time series Data Analysis: Analysis and Results ...
DOW JONES INDUSTRIAL AVERAGE Time series Data Analysis: Analysis and Results ...
 
Design and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation AlgorithmsDesign and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation Algorithms
 
Design and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation AlgorithmsDesign and Implementation of Parallel and Randomized Approximation Algorithms
Design and Implementation of Parallel and Randomized Approximation Algorithms
 
Optimization Techniques
Optimization TechniquesOptimization Techniques
Optimization Techniques
 

Recently uploaded

一比一原版澳洲西澳大学毕业证(uwa毕业证书)如何办理
一比一原版澳洲西澳大学毕业证(uwa毕业证书)如何办理一比一原版澳洲西澳大学毕业证(uwa毕业证书)如何办理
一比一原版澳洲西澳大学毕业证(uwa毕业证书)如何办理
aguty
 
Econ3060_Screen Time and Success_ final_GroupProject.pdf
Econ3060_Screen Time and Success_ final_GroupProject.pdfEcon3060_Screen Time and Success_ final_GroupProject.pdf
Econ3060_Screen Time and Success_ final_GroupProject.pdf
blueshagoo1
 
DSSML24_tspann_CodelessGenerativeAIPipelines
DSSML24_tspann_CodelessGenerativeAIPipelinesDSSML24_tspann_CodelessGenerativeAIPipelines
DSSML24_tspann_CodelessGenerativeAIPipelines
Timothy Spann
 
Drownings spike from May to August in children
Drownings spike from May to August in childrenDrownings spike from May to August in children
Drownings spike from May to August in children
Bisnar Chase Personal Injury Attorneys
 
一比一原版爱尔兰都柏林大学毕业证(本硕)ucd学位证书如何办理
一比一原版爱尔兰都柏林大学毕业证(本硕)ucd学位证书如何办理一比一原版爱尔兰都柏林大学毕业证(本硕)ucd学位证书如何办理
一比一原版爱尔兰都柏林大学毕业证(本硕)ucd学位证书如何办理
hqfek
 
一比一原版加拿大渥太华大学毕业证(uottawa毕业证书)如何办理
一比一原版加拿大渥太华大学毕业证(uottawa毕业证书)如何办理一比一原版加拿大渥太华大学毕业证(uottawa毕业证书)如何办理
一比一原版加拿大渥太华大学毕业证(uottawa毕业证书)如何办理
uevausa
 
Digital Marketing Performance Marketing Sample .pdf
Digital Marketing Performance Marketing  Sample .pdfDigital Marketing Performance Marketing  Sample .pdf
Digital Marketing Performance Marketing Sample .pdf
Vineet
 
Sample Devops SRE Product Companies .pdf
Sample Devops SRE  Product Companies .pdfSample Devops SRE  Product Companies .pdf
Sample Devops SRE Product Companies .pdf
Vineet
 
一比一原版(曼大毕业证书)曼尼托巴大学毕业证如何办理
一比一原版(曼大毕业证书)曼尼托巴大学毕业证如何办理一比一原版(曼大毕业证书)曼尼托巴大学毕业证如何办理
一比一原版(曼大毕业证书)曼尼托巴大学毕业证如何办理
ytypuem
 
一比一原版(lbs毕业证书)伦敦商学院毕业证如何办理
一比一原版(lbs毕业证书)伦敦商学院毕业证如何办理一比一原版(lbs毕业证书)伦敦商学院毕业证如何办理
一比一原版(lbs毕业证书)伦敦商学院毕业证如何办理
ywqeos
 
一比一原版卡尔加里大学毕业证(uc毕业证)如何办理
一比一原版卡尔加里大学毕业证(uc毕业证)如何办理一比一原版卡尔加里大学毕业证(uc毕业证)如何办理
一比一原版卡尔加里大学毕业证(uc毕业证)如何办理
oaxefes
 
[VCOSA] Monthly Report - Cotton & Yarn Statistics March 2024
[VCOSA] Monthly Report - Cotton & Yarn Statistics March 2024[VCOSA] Monthly Report - Cotton & Yarn Statistics March 2024
[VCOSA] Monthly Report - Cotton & Yarn Statistics March 2024
Vietnam Cotton & Spinning Association
 
一比一原版加拿大麦吉尔大学毕业证(mcgill毕业证书)如何办理
一比一原版加拿大麦吉尔大学毕业证(mcgill毕业证书)如何办理一比一原版加拿大麦吉尔大学毕业证(mcgill毕业证书)如何办理
一比一原版加拿大麦吉尔大学毕业证(mcgill毕业证书)如何办理
agdhot
 
一比一原版莱斯大学毕业证(rice毕业证)如何办理
一比一原版莱斯大学毕业证(rice毕业证)如何办理一比一原版莱斯大学毕业证(rice毕业证)如何办理
一比一原版莱斯大学毕业证(rice毕业证)如何办理
zsafxbf
 
社内勉強会資料_Hallucination of LLMs               .
社内勉強会資料_Hallucination of LLMs               .社内勉強会資料_Hallucination of LLMs               .
社内勉強会資料_Hallucination of LLMs               .
NABLAS株式会社
 
一比一原版(UofT毕业证)多伦多大学毕业证如何办理
一比一原版(UofT毕业证)多伦多大学毕业证如何办理一比一原版(UofT毕业证)多伦多大学毕业证如何办理
一比一原版(UofT毕业证)多伦多大学毕业证如何办理
exukyp
 
Overview IFM June 2024 Consumer Confidence INDEX Report.pdf
Overview IFM June 2024 Consumer Confidence INDEX Report.pdfOverview IFM June 2024 Consumer Confidence INDEX Report.pdf
Overview IFM June 2024 Consumer Confidence INDEX Report.pdf
nhutnguyen355078
 
Discovering Digital Process Twins for What-if Analysis: a Process Mining Appr...
Discovering Digital Process Twins for What-if Analysis: a Process Mining Appr...Discovering Digital Process Twins for What-if Analysis: a Process Mining Appr...
Discovering Digital Process Twins for What-if Analysis: a Process Mining Appr...
Marlon Dumas
 
ML-PPT-UNIT-2 Generative Classifiers Discriminative Classifiers
ML-PPT-UNIT-2 Generative Classifiers Discriminative ClassifiersML-PPT-UNIT-2 Generative Classifiers Discriminative Classifiers
ML-PPT-UNIT-2 Generative Classifiers Discriminative Classifiers
MastanaihnaiduYasam
 
DATA COMMS-NETWORKS YR2 lecture 08 NAT & CLOUD.docx
DATA COMMS-NETWORKS YR2 lecture 08 NAT & CLOUD.docxDATA COMMS-NETWORKS YR2 lecture 08 NAT & CLOUD.docx
DATA COMMS-NETWORKS YR2 lecture 08 NAT & CLOUD.docx
SaffaIbrahim1
 

Recently uploaded (20)

一比一原版澳洲西澳大学毕业证(uwa毕业证书)如何办理
一比一原版澳洲西澳大学毕业证(uwa毕业证书)如何办理一比一原版澳洲西澳大学毕业证(uwa毕业证书)如何办理
一比一原版澳洲西澳大学毕业证(uwa毕业证书)如何办理
 
Econ3060_Screen Time and Success_ final_GroupProject.pdf
Econ3060_Screen Time and Success_ final_GroupProject.pdfEcon3060_Screen Time and Success_ final_GroupProject.pdf
Econ3060_Screen Time and Success_ final_GroupProject.pdf
 
DSSML24_tspann_CodelessGenerativeAIPipelines
DSSML24_tspann_CodelessGenerativeAIPipelinesDSSML24_tspann_CodelessGenerativeAIPipelines
DSSML24_tspann_CodelessGenerativeAIPipelines
 
Drownings spike from May to August in children
Drownings spike from May to August in childrenDrownings spike from May to August in children
Drownings spike from May to August in children
 
一比一原版爱尔兰都柏林大学毕业证(本硕)ucd学位证书如何办理
一比一原版爱尔兰都柏林大学毕业证(本硕)ucd学位证书如何办理一比一原版爱尔兰都柏林大学毕业证(本硕)ucd学位证书如何办理
一比一原版爱尔兰都柏林大学毕业证(本硕)ucd学位证书如何办理
 
一比一原版加拿大渥太华大学毕业证(uottawa毕业证书)如何办理
一比一原版加拿大渥太华大学毕业证(uottawa毕业证书)如何办理一比一原版加拿大渥太华大学毕业证(uottawa毕业证书)如何办理
一比一原版加拿大渥太华大学毕业证(uottawa毕业证书)如何办理
 
Digital Marketing Performance Marketing Sample .pdf
Digital Marketing Performance Marketing  Sample .pdfDigital Marketing Performance Marketing  Sample .pdf
Digital Marketing Performance Marketing Sample .pdf
 
Sample Devops SRE Product Companies .pdf
Sample Devops SRE  Product Companies .pdfSample Devops SRE  Product Companies .pdf
Sample Devops SRE Product Companies .pdf
 
一比一原版(曼大毕业证书)曼尼托巴大学毕业证如何办理
一比一原版(曼大毕业证书)曼尼托巴大学毕业证如何办理一比一原版(曼大毕业证书)曼尼托巴大学毕业证如何办理
一比一原版(曼大毕业证书)曼尼托巴大学毕业证如何办理
 
一比一原版(lbs毕业证书)伦敦商学院毕业证如何办理
一比一原版(lbs毕业证书)伦敦商学院毕业证如何办理一比一原版(lbs毕业证书)伦敦商学院毕业证如何办理
一比一原版(lbs毕业证书)伦敦商学院毕业证如何办理
 
一比一原版卡尔加里大学毕业证(uc毕业证)如何办理
一比一原版卡尔加里大学毕业证(uc毕业证)如何办理一比一原版卡尔加里大学毕业证(uc毕业证)如何办理
一比一原版卡尔加里大学毕业证(uc毕业证)如何办理
 
[VCOSA] Monthly Report - Cotton & Yarn Statistics March 2024
[VCOSA] Monthly Report - Cotton & Yarn Statistics March 2024[VCOSA] Monthly Report - Cotton & Yarn Statistics March 2024
[VCOSA] Monthly Report - Cotton & Yarn Statistics March 2024
 
一比一原版加拿大麦吉尔大学毕业证(mcgill毕业证书)如何办理
一比一原版加拿大麦吉尔大学毕业证(mcgill毕业证书)如何办理一比一原版加拿大麦吉尔大学毕业证(mcgill毕业证书)如何办理
一比一原版加拿大麦吉尔大学毕业证(mcgill毕业证书)如何办理
 
一比一原版莱斯大学毕业证(rice毕业证)如何办理
一比一原版莱斯大学毕业证(rice毕业证)如何办理一比一原版莱斯大学毕业证(rice毕业证)如何办理
一比一原版莱斯大学毕业证(rice毕业证)如何办理
 
社内勉強会資料_Hallucination of LLMs               .
社内勉強会資料_Hallucination of LLMs               .社内勉強会資料_Hallucination of LLMs               .
社内勉強会資料_Hallucination of LLMs               .
 
一比一原版(UofT毕业证)多伦多大学毕业证如何办理
一比一原版(UofT毕业证)多伦多大学毕业证如何办理一比一原版(UofT毕业证)多伦多大学毕业证如何办理
一比一原版(UofT毕业证)多伦多大学毕业证如何办理
 
Overview IFM June 2024 Consumer Confidence INDEX Report.pdf
Overview IFM June 2024 Consumer Confidence INDEX Report.pdfOverview IFM June 2024 Consumer Confidence INDEX Report.pdf
Overview IFM June 2024 Consumer Confidence INDEX Report.pdf
 
Discovering Digital Process Twins for What-if Analysis: a Process Mining Appr...
Discovering Digital Process Twins for What-if Analysis: a Process Mining Appr...Discovering Digital Process Twins for What-if Analysis: a Process Mining Appr...
Discovering Digital Process Twins for What-if Analysis: a Process Mining Appr...
 
ML-PPT-UNIT-2 Generative Classifiers Discriminative Classifiers
ML-PPT-UNIT-2 Generative Classifiers Discriminative ClassifiersML-PPT-UNIT-2 Generative Classifiers Discriminative Classifiers
ML-PPT-UNIT-2 Generative Classifiers Discriminative Classifiers
 
DATA COMMS-NETWORKS YR2 lecture 08 NAT & CLOUD.docx
DATA COMMS-NETWORKS YR2 lecture 08 NAT & CLOUD.docxDATA COMMS-NETWORKS YR2 lecture 08 NAT & CLOUD.docx
DATA COMMS-NETWORKS YR2 lecture 08 NAT & CLOUD.docx
 

Some real life data analysis on stationary and non-stationary Time Series

  • 1. Some real life data analysis on stationary and non-stationary Time Series Ajay Shankar Bidyarthy b.ajay@iitg.ernet.in Abhishek Kumar kumar.ak@iitg.ernet Mohit Yadav y.mohit@iitg.ernet.in April 3, 2012 Abstract Now days there are several applications of block bootstrap method in stationary and non stationary time series models. One of the well known application of this method is in case of IGARCH time series models. Bootstrap confidence intervals also play mazor role in finding out confidence intervals of given any time series data. First we have presented how block bootstrap method works in stationary and non stationary time series models. Then we have presented the two bootstrap confidence interval methods one is bootstrap percentile confidence interval method and second is bootstrap-t confidence interval method. For any time series data using Autoregressinve AR(1) and AR(2) time series model to analyze the data set and then find out the bootstrap confidence interval using percentile confidence interval method and bootstrap-t confidence interval method. 1 Block bootstrap method The bootstrap is a simulation approach to estimate the distribution of test statistics. The original method is to create bootstrap samples by resampling the data randomly, and then constructs the associated empirical distribution function. Often, the original bootstrap method provides improvements to the poor asymptotic approximations when data are independently and identically distributed. However, the performance of the original procedure can be far from satisfactory for time series data with serial correlation and heteroscedasticity of unknown form. The block bootstrap is the most general method to improve the accuracy of bootstrap for time series data. By dividing the data into several blocks, it can preserve the original time series structure within a block. However, the accuracy of the block bootstrap is sensitive to the choice of block length, and the optimal block length depends on the sample size, the data generating process, and the statistic considered. To date, there is 1
  • 2. no proper diagnostic tool to choose the optimal block lengths and it still remains as an unsolved question for future study. The detail of the block bootstrap procedure in our Monte Carlo experiment takes the following steps: Step 1. Choose the block length which increases with the sample size. In our block bootstrap procedure, we choose the block length (l) by the criterion l = T1/3 , where T is the sample size. Hall and Horowitz (1996) use two block lengths l = 5 and l = 10 for both two sample sizes (T = 50, 100) and Inoue and Shintani (2001) select the block length by an automatic procedures, which result in an average block length of 3.5 for sample size 64 and 6 for sample size 128. Here we use a simple rule, which the block length in our simulations is similar to the average block length of Inoue and Shintani (2001). Step 2. Resample the blocks and generate the bootstrap sample. The blocks may be overlapping or non-overlapping. According to Lahiri (1999), and Andrews (2002), there is little difference in performance for these two methods. For the overlapping method, we divide the data into T − l + 1 blocks, which block 1 being {y1, y2, ..., yl}, block 2 being {y2, y3, ..., yl+1}, , etc. For the non-overlapping method, we divide the data into T/l blocks, which block 1 being {y1, y2, ..., yl}, block 2 being {yl+1, yl+2, ..., yl+l}, , etc. In our Monte Carlo experiments, we adopt the overlapping method and resample yt , xt and zt together which is called the pairs bootstrap. The block bootstrap sample can be generated as follows: (y∗ t , x∗ t , z∗ t ) = (yi+j, xi+j, zi+j) where t = 1,2,3,...T, i is iid uniform random variable on {1, 2, 3, ...T − l + 1} and j = 1,2,3,...l. Step 3. Calculate the efficient bootstrap GMM estimator and the test statistic. First, estimate the bootstrap TSLS estimator ˆβ∗ TSLS = (X∗ Z∗(Z∗ Z∗)−1Z∗ X∗)−1(X∗ Z∗(Z∗ Z∗)−1Z∗ y∗) and use the residual ˆe∗ t = y∗ t − x∗ t ˆβ∗ TSLS to construct the efficient weighting matrix W∗ t = ( 1 T T t=1ˆg∗ t ˆg∗ t )−1 where ˆg∗ t = z∗ t ˆe∗ t . Second, calculate the efficient bootstrap GMM estimator and the bootstrap variance ˆβ∗ GMM = (X∗ Z∗W∗ T Z∗ X∗)−1(X∗ Z ∗ W∗ T Z∗ y∗) (ˆσ∗)2 = (X∗ Z∗W∗ T Z∗ X∗)−1 In the sense, the bootstrap GMM estimator ˆβ∗ GMM is a consistent estimator of β. However, because the bootstrap sample can not satisfy the same moment condiation as the population distribution, it fails to achieve an asymptotic refinement. A correlation suggested by Hall and Horowitz (1996) is to re-center the bootstrap version of the moment functions. Therefore, in the linear model, the revised bootstrap GMM estimator derived by Hansen (2004) is 2
  • 3. ˆβ∗ GMM = (X∗ Z∗W∗ T Z∗ X∗)−1((X∗ Z ∗ W∗ T Z∗ y∗ − Z ˆu)) where ˆu are residuals of GMM estimation from original data. Finally, calculate the bootstrap test statistic t∗ = ˆβ∗ GMM −β ˆσ∗ . and the final step is : Step 4. Calculate the bootstrap critical values of the test statistic and test the null hypothesis. First, construct the empirical distribution of the test statistic by repeating step2 and step3 for sufficient amount of times and sorting the bootstrap test statistic t∗ from the smallest to the largest. Usually, we set the (1 − α 2 ) quantile and the (α 2 ) quantile of the distribution of t∗ for our bootstrap critical values, where is significance level. However, when t∗ does not have a symmetric distribution, the bootstrap critical values outlined above may perform quite poorly. This problem can be circumvented by an alternative method. For the two sided hypothesis testing, the upper bootstrap critical value q∗ n(α) is the (1 − α) quantile of the distribution of |t∗|, and the lower bootstrap critical value is −q∗ n(α). Reject the null hypothesis if the test statistic of original data is between two bootstrap critical values. Otherwise, we cannot reject null hypothesis. 2 Bootstrap confidence intervals method There are different types of bootstrap confidence intervals method available. Although we are looking for only two types: 1. Bootstrap percentile confidence interval method 2. Bootstrap-t confidence interval method Suppose we have samples {X1, X2, ..., Xn} the estimator ˆθ = ¯Xn = n i=1 Xi n , and we have V ˆFn (ˆθ) = ˆσ2 n = 1 n 1 n n i=1(Xi − ¯Xn)2 let we want to generate B bootstrap samples then the bootstrap procedure follows: 1. For b = 1,2,3,...,B 2. Draw X∗ 1 , ..., X∗ n ∼ ˆFn 3. Compute ˆθ∗ b = T(X∗ 1 , ..., X∗ n) 4. Compute vboot = 1 B B b=1(ˆθ∗ b − 1 B B c=1 ˆθ∗ c )2 3 Bootstrap percentile confidence interval: 1. Draw X∗ 1 , ..., X∗ n ∼ ˆFn 2. Compute ˆastb = T(X∗ 1 , ..., X∗ n) for b = 1(1)B 3. Compute non-parametric confidence interval based on ˆ∗ b points 4. let ˆθ∗ (r) is the r-th order statistics 5. Therefore the 100(1−α)% confidence interval will be [ˆθ∗ k, ˆθ∗ k ] where k = [α 2 b] if [α 2 b] is integer and k = [α 2 b]+1 if [α 2 b] is not an integer. Similarly, k = [(1 − α 2 )b] if [(1 − α 2 )b] is integer and k = [(1 − α 2 )b] + 1 if [(1 − α 2 )b] is not an integer. 3
  • 4. 4 Bootstrap-t confidence interval Before applying resampling to time series analysis, we look the simpler problem. Suppose we wish to construct a confidence interval for the time series data based on a given sample. One way to start with the so called t-statistic which is t = µ− ¯X s√ n where s√ n is standard error of the mean. If we are sampling from a normally distributed sample, then the probability distribution of t is known to be the t-distribution with n-1 degrees of freedom. We denote by tα/2 the α/2 upper t-value, that is the 1 − α/2 quantile of this distribution. Thus t has probability α/2 of exceeding tα/2 . Because of symmetry of the t-distribution, the probability is also α/2 that t is less than −tα/2. therefore for normally distributed data, the probability is 1 − α that −tα/2 ≤ t ≤ −tα/2 after substituting the value of t we get ¯X − tα/2 s√ n ≤ µ ≤ ¯X + tα/2 s√ n which shows that ¯X ± s√ n tα/2 is a 1 − α confidence interval for µ, assuming normally distributed data. What if we are not sampling from a normal distribution ?? In that case, the distribution of t not is t- distribution, but rather some other distribution that is not known to us. there are two problems. first we do not know the distribution of given sample. Second, even if sample distribution were known it is a difficult, ussually intractable, probability calculation to get the distribution of the t-statistic from the distribution of the given sample. This calculation has only been done for normal given sample. Considering the difficulty of these two problems, we can still get a confidence interval by resampling. we can take a large number, say B, of resamples from the original sample. Let ¯Xboot,b and sboot,b be the sample mean and standard deviation of the bth resample, b=1,2,...,B. We define tboot,b = ¯X− ¯Xboot,b sboot,b√ n The resamples are independent of each other, the collection tboot,b, tboot,b, ... can be treated as a random sample from the distribution of the t-statistic. After B values of tboot,b have been calculated, one from each re- sample, we find the 100α% and 100(1−α)% percentiles of this collection of tboot,b values. Call these percentiles tL and tU . We find tL and tU as follows: 1. The B values of tboot,b are sorted from smallest to largest 2. Then we calculate Bα/2 and round to the nearest integer. suppose the result is KL. 4
  • 5. 3. The kLth sorted value of tboot,b is tL. 4. Similarly, let KU be B(1−α/2) , rounded to the nearest integer and then tU is the KU th sorted value of tboot,b. If the original sample is skewed, then there is no reason to suspect that the 100α% percentile is minus the 100(1 − α)% percentile, as happens for symmetric samples such as t-distribution. In other words, we do not necessarily expect that tL = tU . However, this fact causes us no problem, since the bootstrap allows us to estimate tL and tU without assuming any relationship between them. Now, we replace −tα/2 and tα/2 in the confidence interval by tL and tU , respectively. Finally the bootstrap confidence interval for µ is : ( ¯X + tL s√ n , ¯X + tU s√ n ) The bootstrap has solved both problems mentioned above. we do not need to know the give data distribu- tion since we can estimate it by the sample. Also we do not need to calculate the distribution of the t-statistic using probability theory. Instead we simulate from this distribution. We use the notation SE = s√ n and SEboot = sboot√ n ******************* END ******************** 5