A simple robust estimator of correlations for Gaussian stationary random sequences
A spectral characterization of the behavior of discrete time AR–representations over a finite time interval
In this paper we investigate the behavior of the discrete time AR (Auto Regressive) representations over a finite time interval, in terms of the finite and infinite spectral structure of the polynomial matrix involved in the AR-equation. A boundary mapping equation and a closed formula for the determination of the solution, in terms of the boundary conditions, are also gived.
A square root filter for real time multivariate regression
A survey of sequential estimation in processes with independent increments
A tutorial on nonlinear time-series data mining in engineering asset health and reliability prediction: concepts, models, and algorithms.
A unified approach to multivariable discrete-time filtering based on the Wiener theory
A uniform central limit theorem for dependent variables
Niemiro and Zieliński (2007) have recently obtained uniform asymptotic normality for the Bernoulli scheme. This paper concerns a similar problem. We show the uniform central limit theorem for a sequence of stationary random variables.
A zero-inflated geometric INAR(1) process with random coefficient
Many real-life count data are frequently characterized by overdispersion, excess zeros and autocorrelation. Zero-inflated count time series models can provide a powerful procedure to model this type of data. In this paper, we introduce a new stationary first-order integer-valued autoregressive process with random coefficient and zero-inflated geometric marginal distribution, named ZIGINAR process, which contains some sub-models as special cases. Several properties of the process are established....
About the maximum information and maximum likelihood principles
Neural networks with radial basis functions are considered, and the Shannon information in their output concerning input. The role of information- preserving input transformations is discussed when the network is specified by the maximum information principle and by the maximum likelihood principle. A transformation is found which simplifies the input structure in the sense that it minimizes the entropy in the class of all information-preserving transformations. Such transformation need not be unique...
Adaptive control for discrete-time Markov processes with unbounded costs: Discounted criterion
We study the adaptive control problem for discrete-time Markov control processes with Borel state and action spaces and possibly unbounded one-stage costs. The processes are given by recurrent equations with i.i.d. -valued random vectors whose density is unknown. Assuming observability of we propose the procedure of statistical estimation of that allows us to prove discounted asymptotic optimality of two types of adaptive policies used early for the processes with bounded costs.
Adaptive density estimation under weak dependence
Assume that (Xt)t∈Z is a real valued time series admitting a common marginal density f with respect to Lebesgue's measure. [Donoho et al. Ann. Stat.24 (1996) 508–539] propose near-minimax estimators based on thresholding wavelets to estimate f on a compact set in an independent and identically distributed setting. The aim of the present work is to extend these results to general weak dependent contexts. Weak dependence assumptions are expressed as decreasing bounds of covariance terms and are...
Adaptive estimation of the stationary density of discrete and continuous time mixing processes
In this paper, we study the problem of non parametric estimation of the stationary marginal density of an or a -mixing process, observed either in continuous time or in discrete time. We present an unified framework allowing to deal with many different cases. We consider a collection of finite dimensional linear regular spaces. We estimate using a projection estimator built on a data driven selected linear space among the collection. This data driven choice is performed via the minimization...
Adaptive estimation of the stationary density of discrete and continuous time mixing processes
In this paper, we study the problem of non parametric estimation of the stationary marginal density f of an α or a β-mixing process, observed either in continuous time or in discrete time. We present an unified framework allowing to deal with many different cases. We consider a collection of finite dimensional linear regular spaces. We estimate f using a projection estimator built on a data driven selected linear space among the collection. This data driven choice is performed via the minimization...
Adaptive estimation of the transition density of a Markov chain
Adaptive tests of homogeneity for a Poisson process
We propose to test the homogeneity of a Poisson process observed on a finite interval. In this framework, we first provide lower bounds for the uniform separation rates in -norm over classical Besov bodies and weak Besov bodies. Surprisingly, the obtained lower bounds over weak Besov bodies coincide with the minimax estimation rates over such classes. Then we construct non-asymptotic and non-parametric testing procedures that are adaptive in the sense that they achieve, up to a possible logarithmic...
Adaptive wavelet estimation of the diffusion coefficient under additive error measurements
We study nonparametric estimation of the diffusion coefficient from discrete data, when the observations are blurred by additional noise. Such issues have been developed over the last 10 years in several application fields and in particular in high frequency financial data modelling, however mainly from a parametric and semiparametric point of view. This paper addresses the nonparametric estimation of the path of the (possibly stochastic) diffusion coefficient in a relatively general setting. By...
Algebraic methods in discrete linear estimation
Algorithm 27. Statistical prediction by the method of harmonical weights
Algunas características de los modelos agregados MC-MN de modelos MA.
Se estudian algunas propiedades de los modelos agregados de mínimos cuadrados y mínima norma de procesos MA. Dichos agregados MC-MN se obtienen mediante una metodología matricial desarrollada por el autor, que es aquí brevemente esbozadas. Las características analizadas se refieren a la multiplicatividad de las estructuras componentes del modelo y la invertibilidad del modelo agregado.
Aliasing in the sampling restoration of non-band-limited homogeneous random fields.