Searcharxiv⌕ Search

arXiv subjects

Frédéric Proïa

Publications and source records attributed to Frédéric Proïa.

14 recordsLinked to original sources

Testing for the extent of instability in nearly unstable processes

This paper deals with unit root issues in time series analysis. It has been known for a long time that unit root tests may be flawed when a series although stationary has a root close to unity. That motivated recent papers dedicated to autoregressive processes where the bridge between stability and instability is expressed by means of time-varying coefficients. The process we consider has a companion matrix $A_{n}$ with spectral radius $ρ(A_{n}) < 1$ satisfying $ρ(A_{n}) \rightarrow 1$, a situation described as `nearly-unstable'. The question we investigate is: given an observed path supposed to come from a nearly-unstable process, is it possible to test for the `extent of instability', i.e. to test how close we are to the unit root? In this regard, we develop a strategy to evaluate $α$ and to test for $\mathcal{H}_0 : ``α= α_0"$ against $\mathcal{H}_1 : ``α> α_0"$ when $ρ(A_{n})$ lies in an inner $O(n^{-α})$-neighborhood of the unity, for some $0 < α< 1$. Empirical evidence is given about the advantages of the flexibility induced by such a procedure compared to the common unit root tests. We also build a symmetric procedure for the usually left out situation where the dominant root lies around $-1$.

math.ST↗

Consistency and asymptotic normality in a class of nearly unstable processes

This paper deals with inference in a class of stable but nearly-unstable processes. Autoregressive processes are considered, in which the bridge between stability and instability is expressed by a time-varying companion matrix $A_{n}$ with spectral radius $ρ(A_{n}) < 1$ satisfying $ρ(A_{n}) \rightarrow 1$. This framework is particularly suitable to understand unit root issues by focusing on the inner boundary of the unit circle. Consistency is established for the empirical covariance and the OLS estimation together with asymptotic normality under appropriate hypotheses when $A$, the limit of $A_n$, has a real spectrum, and a particular case is deduced when $A$ also contains complex eigenvalues. The asymptotic process is integrated with either one unit root (located at 1 or $-1$), or even two unit roots located at 1 and $-1$. Finally, a set of simulations illustrate the asymptotic behavior of the OLS. The results are essentially proved by $L^2$ computations and the limit theory of triangular arrays of martingales.

math.ST↗

A Bayesian approach for partial Gaussian graphical models with sparsity

We explore various Bayesian approaches to estimate partial Gaussian graphical models. Our hierarchical structures enable to deal with single-output as well as multiple-output linear regressions, in small or high dimension, enforcing either no sparsity, sparsity, group sparsity or even sparse-group sparsity for a bi-level selection through partial correlations (direct links) between predictors and responses, thanks to spike-and-slab priors corresponding to each setting. Adaptative and global shrinkages are also incorporated in the Bayesian modeling of the direct links. An existing result for model selection consistency is reformulated to stick to our sparse and group-sparse settings, providing a theoretical guarantee under some technical assumptions. Gibbs samplers are developed and a simulation study shows the efficiency of our models which give very competitive results, especially in terms of support recovery. To conclude, a real dataset is investigated.

stat.ME↗

A partial graphical model with a structural prior on the direct links between predictors and responses

This paper is devoted to the estimation of a partial graphical model with a structural Bayesian penalization. Precisely, we are interested in the linear regression setting where the estimation is made through the direct links between potentially high-dimensional predictors and multiple responses, since it is known that Gaussian graphical models enable to exhibit direct links only, whereas coefficients in linear regressions contain both direct and indirect relations (due \textit{e.g.} to strong correlations among the variables). A smooth penalty reflecting a generalized Gaussian Bayesian prior on the covariates is added, either enforcing patterns (like row structures) in the direct links or regulating the joint influence of predictors. We give a theoretical guarantee for our method, taking the form of an upper bound on the estimation error arising with high probability, provided that the model is suitably regularized. Empirical studies on synthetic data and a real dataset are conducted.

math.ST↗

Moderate deviations in a class of stable but nearly unstable processes

We consider a stable but nearly unstable autoregressive process of any order. The bridge between stability and instability is expressed by a time-varying companion matrix $A_{n}$ with spectral radius $ρ(A_{n}) < 1$ satisfying $ρ(A_{n}) \rightarrow 1$. In that framework, we establish a moderate deviation principle for the empirical covariance only relying on the elements of $A_{n}$ through $1-ρ(A_{n})$ and, as a by-product, we establish a moderate deviation principle for the OLS estimator when $Γ$, the renormalized asymptotic variance of the process, is invertible. Finally, when $Γ$ is singular, we also provide a compromise in the form of a moderate deviation principle for a penalized version of the estimator. Our proofs essentially rely on truncations and deviations of $m_{n}$--dependent sequences, with an unbounded rate $(m_{n})$.

math.ST↗

Probabilistic reconstruction of genealogies for polyploid plant species

A probabilistic reconstruction of genealogies in a polyploid population (from 2x to 4x) is investigated, by considering genetic data analyzed as the probability of allele presence in a given genotype. Based on the likelihood of all possible crossbreeding patterns, our model enables us to infer and to quantify the whole potential genealogies in the population. We explain in particular how to deal with the uncertain allelic multiplicity that may occur with polyploids. Then we build an \textit{ad hoc} penalized likelihood to compare genealogies and to decide whether a particular individual brings sufficient information to be included in the taken genealogy. This decision criterion enables us in a next part to suggest a greedy algorithm in order to explore missing links and to rebuild some connections in the genealogies, retrospectively. As a by-product, we also give a way to infer the individuals that may have been favored by breeders over the years. In the last part we highlight the results given by our model and our algorithm, firstly on a simulated population and then on a real population of rose bushes. Most of the methodology relies on the maximum likelihood principle and on graph theory.

q-bio.PE↗

On the Bickel-Rosenblatt test of goodness-of-fit for the residuals of autoregressive processes

We investigate in this paper a Bickel-Rosenblatt test of goodness-of-fit for the density of the noise in an autoregressive model. Since the seminal work of Bickel and Rosenblatt, it is well-known that the integrated squared error of the Parzen-Rosenblatt density estimator, once correctly renormalized, is asymptotically Gaussian for independent and identically distributed (i.i.d.) sequences. We show that the result still holds when the statistic is built from the residuals of general stable and explosive autoregressive processes. In the univariate unstable case, we prove that the result holds when the unit root is located at $-1$ whereas we give further results when the unit root is located at $1$. In particular, we establish that except for some particular asymmetric kernels leading to a non-Gaussian limiting distribution and a slower convergence, the statistic has the same order of magnitude. We also study some common unstable cases, like the integrated seasonal process. Finally we build a goodness-of-fit Bickel-Rosenblatt test for the true density of the noise together with its empirical properties on the basis of a simulation study.

math.ST↗

A test of correlation in the random coefficients of an autoregressive process

A random coefficient autoregressive process is deeply investigated in which the coefficients are correlated. First we look at the existence of a strictly stationary causal solution, we give the second-order stationarity conditions and the autocorrelation function of the process. Then we study some asymptotic properties of the empirical mean and the usual estimators of the process, such as convergence, asymptotic normality and rates of convergence, supplied with the appropriate assumptions on the driving perturbations. Our objective is to get an overview of the influence of correlated coefficients in the estimation step, through a simple model. In particular, the lack of consistency is shown for the estimation of the autoregressive parameter when the independence hypothesis is violated in the random coefficients. Finally, a consistent estimation is given together with a testing procedure for the existence of correlation in the coefficients. While convergence properties rely on the ergodicity, we use a martingale approach to reach most of the results.

math.ST↗

Testing for residual correlation of any order in the autoregressive process

We are interested in the implications of a linearly autocorrelated driven noise on the asymptotic behavior of the usual least squares estimator in a stable autoregressive process. We show that the least squares estimator is not consistent and we suggest a sharp analysis of its almost sure limiting value as well as its asymptotic normality. We also establish the almost sure convergence and the asymptotic normality of the estimated serial correlation parameter of the driven noise. Then, we derive a statistical procedure enabling to test for correlation of any order in the residuals of an autoregressive modelling, giving clearly better results than the commonly used portmanteau tests of Ljung-Box and Box-Pierce, and appearing to outperform the Breusch-Godfrey procedure on small-sized samples.

math.ST↗

On the characterization of flowering curves using Gaussian mixture models

In this paper, we develop a statistical methodology applied to the characterization of flowering curves using Gaussian mixture models. Our study relies on a set of rosebushes flowering data, and Gaussian mixture models are mainly used to quantify the reblooming properties of each one. In this regard, we also suggest our own selection criterion to take into account the lack of symmetry of most of the flowering curves. Three classes are created on the basis of a principal component analysis conducted on a set of reblooming indicators, and a subclassification is made using a longitudinal $k$--means algorithm which also highlights the role played by the precocity of the flowering. In this way, we obtain an overview of the correlations between the features we decided to retain on each curve. In particular, results suggest the lack of correlation between reblooming and flowering precocity. The pertinent indicators obtained in this study will be a first step towards the comprehension of the environmental and genetic control of these biological processes.

q-bio.QM↗

Further results on the H-Test of Durbin for stable autoregressive processes

The purpose of this paper is to investigate the asymptotic behavior of the Durbin-Watson statistic for the stable $p-$order autoregressive process when the driven noise is given by a first-order autoregressive process. It is an extension of the previous work of Bercu and Proïa devoted to the particular case $p=1$. We establish the almost sure convergence and the asymptotic normality for both the least squares estimator of the unknown vector parameter of the autoregressive process as well as for the serial correlation estimator associated with the driven noise. In addition, the almost sure rates of convergence of our estimates are also provided. Then, we prove the almost sure convergence and the asymptotic normality for the Durbin-Watson statistic and we derive a two-sided statistical procedure for testing the presence of a significant first-order residual autocorrelation that appears to clarify and to improve the well-known \textit{h-test} suggested by Durbin. Finally, we briefly summarize our observations on simulated samples.

math.ST↗

A SARIMAX coupled modelling applied to individual load curves intraday forecasting

A dynamic coupled modelling is investigated to take temperature into account in the individual energy consumption forecasting. The objective is both to avoid the inherent complexity of exhaustive SARIMAX models and to take advantage of the usual linear relation between energy consumption and temperature for thermosensitive customers. We first recall some issues related to individual load curves forecasting. Then, we propose and study the properties of a dynamic coupled modelling taking temperature into account as an exogenous contribution and its application to the intraday prediction of energy consumption. Finally, these theoretical results are illustrated on a real individual load curve. The authors discuss the relevance of such an approach and anticipate that it could form a substantial alternative to the commonly used methods for energy consumption forecasting of individual customers.

stat.AP↗

Moderate deviations for the Durbin-Watson statistic related to the first-order autoregressive process

The purpose of this paper is to investigate moderate deviations for the Durbin-Watson statistic associated with the stable first-order autoregressive process where the driven noise is also given by a first-order autoregressive process. We first establish a moderate deviation principle for both the least squares estimator of the unknown parameter of the autoregressive process as well as for the serial correlation estimator associated with the driven noise. It enables us to provide a moderate deviation principle for the Durbin-Watson statistic in the easy case where the driven noise is normally distributed and in the more general case where the driven noise satisfies a less restrictive Chen-Ledoux type condition.

math.PR↗