Page 1

Displaying 1 – 2 of 2

Showing per page

Complete convergence theorems for normed row sums from an array of rowwise pairwise negative quadrant dependent random variables with application to the dependent bootstrap

Andrew Rosalsky, Yongfeng Wu (2015)

Applications of Mathematics

Let { X n , j , 1 j m ( n ) , n 1 } be an array of rowwise pairwise negative quadrant dependent mean 0 random variables and let 0 < b n . Conditions are given for j = 1 m ( n ) X n , j / b n 0 completely and for max 1 k m ( n ) | j = 1 k X n , j | / b n 0 completely. As an application of these results, we obtain a complete convergence theorem for the row sums j = 1 m ( n ) X n , j * of the dependent bootstrap samples { { X n , j * , 1 j m ( n ) } , n 1 } arising from a sequence of i.i.d. random variables { X n , n 1 } .

Computational intensive methods for prediction and imputation in time series analysis

Maria Manuela Neves, Clara Cordeiro (2011)

Discussiones Mathematicae Probability and Statistics

One of the main goals in times series analysis is to forecast future values. Many forecasting methods have been developed and the most successful are based on the concept of exponential smoothing, based on the principle of obtaining forecasts as weighted combinations of past observations. Classical procedures to obtain forecast intervals assume a known distribution for the error process, what is not true in many situations. A bootstrap methodology can be used to compute distribution free forecast...

Currently displaying 1 – 2 of 2

Page 1