arXiv subjects

Dimitris N. Politis

Publications and source records attributed to Dimitris N. Politis.

33 records · Page 2Linked to original sources

arXiv2018

Higher-order Accurate Spectral Density Estimation of Functional Time Series

Under the frequency domain framework for weakly dependent functional time series, a key element is the spectral density kernel which encapsulates the second-order dynamics of the process. We propose a class of spectral density kernel estimators based on the notion of a flat-top kernel. The new class of estimators employs the inverse Fourier transform of a flat-top function as the weight function employed to smooth the periodogram. It is shown that using a flat-top kernel yields a bias reduction and results in a higher-order accuracy in terms of optimizing the integrated mean square error (IMSE). Notably, the higher-order accuracy of flat-top estimation comes at the sacrifice of the positive semi-definite property. Nevertheless, we show how a flat-top estimator can be modified to become positive semi-definite (even strictly positive definite) in finite samples while retaining its favorable asymptotic properties. In addition, we introduce a data-driven bandwidth selection procedure realized by an automatic inspection of the estimated correlation structure. Our asymptotic results are complemented by a finite-sample simulation where the higher-order accuracy of flat-top estimators is manifested in practice.

math.ST↗

arXiv2018

$L_p$ and almost sure convergence of estimation on heavy tail index under random censoring

In this paper, we prove $L_p,\ p\geq 2$ and almost sure convergence of tail index estimator mentioned in \cite{grama2008} under random censoring and several assumptions. $p$th moment of the error of the estimator is proved to be of order $O\left(\frac{1}{\log^{mκ/2}n}\right)$ with given assumptions. We also perform several finite sample simulations to quantify performance of this estimator. Finite sample results show that the proposed estimator is effective in finding underlying tail index even when censor rate is high.

math.ST↗

arXiv2018

Monotone function estimator and its application

In this paper, the model $Y_i=g(Z_i),\ i=1,2,...,n$ with $Z_i$ being random variables with known distribution and $g(x)$ being unknown strictly increasing function is proposed and almost sure convergence of estimator for $g(x)$ is proved for i.i.d and short range dependent data. Confidence intervals and bands are constructed for i.i.d data theoretically and confidence intervals are introduced for short range dependent data through resampling. Besides, a test for equivalence of $g(x)$ to the desired function is proposed. Finite sample analysis and application of this model on an urban waste water treatment plant's data is demonstrated as well.

math.ST↗

arXiv2018

Predictive inference for locally stationary time series with an application to climate data

The Model-free Prediction Principle of Politis (2015) has been successfully applied to general regression problems, as well as problems involving stationary time series. However, with long time series, e.g. annual temperature measurements spanning over 100 years or daily financial returns spanning several years, it may be unrealistic to assume stationarity throughout the span of the dataset. In the paper at hand, we show how Model-free Prediction can be applied to handle time series that are only locally stationary, i.e., they can be assumed to be as stationary only over short time-windows. Surprisingly there is little literature on point prediction for general locally stationary time series even in model-based setups and there is no literature on the construction of prediction intervals of locally stationary time series. We attempt to fill this gap here as well. Both one-step-ahead point predictors and prediction intervals are constructed, and the performance of model-free is compared to model-based prediction using models that incorporate a trend and/or heteroscedasticity. Both aspects of the paper, model-free and model-based, are novel in the context of time-series that are locally (but not globally) stationary. We also demonstrate the application of our Model-based and Model-free prediction methods to speleothem climate data which exhibits local stationarity and show that our best model-free point prediction results outperform that obtained with the RAMPFIT algorithm previously used for analysis of this data.

stat.ME↗

arXiv2017

Convolved subsampling estimation with applications to block bootstrap

The block bootstrap approximates sampling distributions from dependent data by resampling data blocks. A fundamental problem is establishing its consistency for the distribution of a sample mean, as a prototypical statistic. We use a structural relationship with subsampling to characterize the bootstrap in a new and general manner. While subsampling and block bootstrap differ, the block bootstrap distribution of a sample mean equals that of a $k$-fold self-convolution of a subsampling distribution. Motivated by this, we provide simple necessary and sufficient conditions for a convolved subsampling estimator to produce a normal limit that matches the target of bootstrap estimation. These conditions may be linked to consistency properties of an original subsampling distribution, which are often obtainable under minimal assumptions. Through several examples, the results are shown to validate the block bootstrap for means under significantly weakened assumptions in many existing (and some new) dependence settings, which also addresses a standing conjecture of Politis, Romano and Wolf(1999). Beyond sample means, the convolved subsampling estimator may not match the block bootstrap, but instead provides a hybrid-resampling estimator of interest in its own right. For general statistics with normal limits, results also establish the consistency of convolved subsampling under minimal dependence conditions, including non-stationarity.

math.ST↗

arXiv2017

Nonparametric estimation of the conditional distribution at regression boundary points

Nonparametric regression is a standard statistical tool with increased importance in the Big Data era. Boundary points pose additional difficulties but local polynomial regression can be used to alleviate them. Local linear regression, for example, is easy to implement and performs quite well both at interior as well as boundary points. Estimating the conditional distribution function and/or the quantile function at a given regressor point is immediate via standard kernel methods but problems ensue if local linear methods are to be used. In particular, the distribution function estimator is not guaranteed to be monotone increasing, and the quantile curves can "cross". In the paper at hand, a simple method of correcting the local linear distribution estimator for monotonicity is proposed, and its good performance is demonstrated via simulations and real data examples.

stat.OT↗

arXiv2015

Covariance matrix estimation and linear process bootstrap for multivariate time series of possibly increasing dimension

Multivariate time series present many challenges, especially when they are high dimensional. The paper's focus is twofold. First, we address the subject of consistently estimating the autocovariance sequence; this is a sequence of matrices that we conveniently stack into one huge matrix. We are then able to show consistency of an estimator based on the so-called flat-top tapers; most importantly, the consistency holds true even when the time series dimension is allowed to increase with the sample size. Second, we revisit the linear process bootstrap (LPB) procedure proposed by McMurry and Politis [J. Time Series Anal. 31 (2010) 471-482] for univariate time series. Based on the aforementioned stacked autocovariance matrix estimator, we are able to define a version of the LPB that is valid for multivariate time series. Under rather general assumptions, we show that our multivariate linear process bootstrap (MLPB) has asymptotic validity for the sample mean in two important cases: (a) when the time series dimension is fixed and (b) when it is allowed to increase with sample size. As an aside, in case (a) we show that the MLPB works also for spectral density estimators which is a novel result even in the univariate case. We conclude with a simulation study that demonstrates the superiority of the MLPB in some important cases.

math.ST↗

arXiv2012

TFT-bootstrap: Resampling time series in the frequency domain to obtain replicates in the time domain

A new time series bootstrap scheme, the time frequency toggle (TFT)-bootstrap, is proposed. Its basic idea is to bootstrap the Fourier coefficients of the observed time series, and then to back-transform them to obtain a bootstrap sample in the time domain. Related previous proposals, such as the "surrogate data" approach, resampled only the phase of the Fourier coefficients and thus had only limited validity. By contrast, we show that the appropriate resampling of phase and magnitude, in addition to some smoothing of Fourier coefficients, yields a bootstrap scheme that mimics the correct second-order moment structure for a large class of time series processes. As a main result we obtain a functional limit theorem for the TFT-bootstrap under a variety of popular ways of frequency domain bootstrapping. Possible applications of the TFT-bootstrap naturally arise in change-point analysis and unit-root testing where statistics are frequently based on functionals of partial sums. Finally, a small simulation study explores the potential of the TFT-bootstrap for small samples showing that for the discussed tests in change-point analysis as well as unit-root testing, it yields better results than the corresponding asymptotic tests if measured by size and power.

math.ST↗

arXiv2012

Fixed-b Subsampling and Block Bootstrap: Improved Confidence Sets Based on P-value Calibration

Subsampling and block-based bootstrap methods have been used in a wide range of inference problems for time series. To accommodate the dependence, these resampling methods involve a bandwidth parameter, such as subsampling window width and block size in the block-based bootstrap. In empirical work, using different bandwidth parameters could lead to different inference results, but the traditional first order asymptotic theory does not capture the choice of the bandwidth. In this article, we propose to adopt the fixed-b approach, as advocated by Kiefer and Vogelsang (2005) in the heteroscedasticity-autocorrelation robust testing context, to account for the influence of the bandwidth on the inference. Under the fixed-b asymptotic framework, we derive the asymptotic null distribution of the p-values for subsampling and the moving block bootstrap, and further propose a calibration of the traditional small-b based confidence intervals (regions, bands) and tests. Our treatment is fairly general as it includes both finite dimensional parameters and infinite dimensional parameters, such as marginal distribution function and normalized spectral distribution function. Simulation results show that the fixed-b approach is more accurate than the traditional small-b approach in terms of approximating the finite sample distribution, and that the calibrated confidence sets tend to have smaller coverage errors than the uncalibrated counterparts.

math.ST↗

arXiv2012

On the range of validity of the autoregressive sieve bootstrap

We explore the limits of the autoregressive (AR) sieve bootstrap, and show that its applicability extends well beyond the realm of linear time series as has been previously thought. In particular, for appropriate statistics, the AR-sieve bootstrap is valid for stationary processes possessing a general Wold-type autoregressive representation with respect to a white noise; in essence, this includes all stationary, purely nondeterministic processes, whose spectral density is everywhere positive. Our main theorem provides a simple and effective tool in assessing whether the AR-sieve bootstrap is asymptotically valid in any given situation. In effect, the large-sample distribution of the statistic in question must only depend on the first and second order moments of the process; prominent examples include the sample mean and the spectral density. As a counterexample, we show how the AR-sieve bootstrap is not always valid for the sample autocovariance even when the underlying process is linear.

math.ST↗

arXiv2009

CDF and Survival Function Estimation with Infinite-Order Kernels

A reduced-bias nonparametric estimator of the cumulative distribution function (CDF) and the survival function is proposed using infinite-order kernels. Fourier transform theory on generalized functions is utilized to obtain the improved bias estimates. The new estimators are analyzed in terms of their relative deficiency to the empirical distribution function and Kaplan-Meier estimator, and even improvements in terms of asymptotic relative efficiency (ARE) are present under specified assumptions on the data. The deficiency analysis introduces a deficiency rate which provides a continuum between the classical deficiency analysis and an efficiency analysis. Additionally, an automatic bandwidth selection algorithm, specially tailored to the infinite-order kernels, is incorporated into the estimators. In small sample sizes these estimators can significantly improve the estimation of the CDF and survival function as is illustrated through the deficiency analysis and computer simulations.

stat.ME↗

arXiv2007

Computer-intensive rate estimation, diverging statistics and scanning

A general rate estimation method is proposed that is based on studying the in-sample evolution of appropriately chosen diverging/converging statistics. The proposed rate estimators are based on simple least squares arguments, and are shown to be accurate in a very general setting without requiring the choice of a tuning parameter. The notion of scanning is introduced with the purpose of extracting useful subsamples of the data series; the proposed rate estimation method is applied to different scans, and the resulting estimators are then combined to improve accuracy. Applications to heavy tail index estimation as well as to the problem of estimating the long memory parameter are discussed; a small simulation study complements our theoretical results.

math.ST↗

arXiv2007

Stable marked point processes

In many contexts such as queuing theory, spatial statistics, geostatistics and meteorology, data are observed at irregular spatial positions. One model of this situation involves considering the observation points as generated by a Poisson process. Under this assumption, we study the limit behavior of the partial sums of the marked point process $\{(t_i,X(t_i))\}$, where X(t) is a stationary random field and the points t_i are generated from an independent Poisson random measure $\mathbb{N}$ on $\mathbb{R}^d$. We define the sample mean and sample variance statistics and determine their joint asymptotic behavior in a heavy-tailed setting, thus extending some finite variance results of Karr [Adv. in Appl. Probab. 18 (1986) 406--422]. New results on subsampling in the context of a marked point process are also presented, with the application of forming a confidence interval for the unknown mean under an unknown degree of heavy tails.

math.ST↗

arXiv2007

Bagging multiple comparisons from microarray data

The problem of large-scale simultaneous hypothesis testing is re-visited. Bagging and subagging procedures are put forth with the purpose of improving the discovery power of the tests. The procedures are implemented in both simulated and real data. It is shown that bagging and subagging significantly improve power at the cost of a small increase in false discovery rate with the proposed `maximum contrast' subagging having an edge over bagging, i.e., yielding similar power but significantly smaller false discovery rates.

stat.ME↗

arXiv2004

Entropy Maximization as a Holistic Design Principle for Complex Optimal Networks and the Emergence of Power Laws

We present a general holistic theory for the organization of complex networks, both human-engineered and naturally-evolved. Introducing concepts of value of interactions and satisfaction as generic network performance measures, we show that the underlying organizing principle is to meet an overall performance target for wide-ranging operating or environmental conditions. This design or survival requirement of reliable performance under uncertainty leads, via the maximum entropy principle, to the emergence of a power law vertex degree distribution. The theory also predicts exponential or Poisson degree distributions depending on network redundancy, thus explaining all three regimes as different manifestations of a common underlying phenomenon within a unified theoretical framework.

nlin.AO↗