Searcharxiv⌕ Search

arXiv subjects

Paul Doukhan

Publications and source records attributed to Paul Doukhan.

34 records · Page 2Linked to original sources

A nonlinear model for long memory conditional heteroscedasticity

We discuss a class of conditionally heteroscedastic time series models satisfying the equation $r_t= ζ_t σ_t$, where $ζ_t$ are standardized i.i.d. r.v.'s and the conditional standard deviation $σ_t$ is a nonlinear function $Q$ of inhomogeneous linear combination of past values $r_s, s<t$ with coefficients $b_j$. The existence of stationary solution $r_t$ with finite $p$th moment, $0< p < \infty $ is obtained under some conditions on $Q, b_j$ and $p$th moment of $ζ_0$. Weak dependence properties of $r_t$ are studied, including the invariance principle for partial sums of Lipschitz functions of $r_t$. In the case of quadratic $Q^2$, we prove that $r_t$ can exhibit a leverage effect and long memory, in the sense that the squared process $r^2_t$ has long memory autocorrelation and its normalized partial sums process converges to a fractional Brownian motion.

math.ST↗

Phantom distribution functions for some stationary sequences

The notion of a phantom distribution function (phdf) was introduced by O'Brien (1987). We show that the existence of a phdf is a quite common phenomenon for stationary weakly dependent sequences. It is proved that any $α$-mixing stationary sequence with continuous marginals admits a continuous phdf. Sufficient conditions are given for stationary sequences exhibiting weak dependence, what allows the use of attractive models beyond mixing. The case of discontinuous marginals is also discussed for $α$-mixing. Special attention is paid to examples of processes which admit a continuous phantom distribution function while their extremal index is zero. We show that Asmussen (1998) and Roberts et al. (2006) provide natural examples of such processes. We also construct a non-ergodic stationary process of this type.

math.PR↗

Inference and testing for structural change in time series of counts model

We consider here together the inference questions and the change-point problem in Poisson autoregressions (see Tjøstheim, 2012). The conditional mean (or intensity) of the process is involved as a non-linear function of it past values and the past observations. Under Lipschitz-type conditions, it is shown that the conditional mean can be written as a function of lagged observations. In the latter model, assume that the link function depends on an unknown parameter $θ_0$. The consistency and the asymptotic normality of the maximum likelihood estimator of the parameter are proved. These results are used to study change-point problem in the parameter $θ_0$. We propose two tests based on the likelihood of the observations. Under the null hypothesis (i.e. no change), it is proved that both those test statistics converge to an explicit distribution. Consistencies under alternatives are proved for both tests. Simulation results show how those procedure work practically, and an application to real data is also processed.

math.ST↗

Rates of convergence in the strong invariance principle under projective criteria

We give rates of convergence in the strong invariance principle for stationary sequences satisfying some projective criteria. The conditions are expressed in terms of conditional expectations of partial sums of the initial sequence. Our results apply to a large variety of examples, including mixing processes of different kinds. We present some applications to symmetric random walks on the circle, to functions of dependent sequences, and to a reversible Markov chain.

math.PR↗

Sparsity considerations for dependent observations

The aim of this paper is to provide a comprehensive introduction for the study of L1-penalized estimators in the context of dependent observations. We define a general $\ell_{1}$-penalized estimator for solving problems of stochastic optimization. This estimator turns out to be the LASSO in the regression estimation setting. Powerful theoretical guarantees on the statistical performances of the LASSO were provided in recent papers, however, they usually only deal with the iid case. Here, we study our estimator under various dependence assumptions.

math.ST↗

Subsampling weakly dependent times series and application to extremes

This paper provides extensions of the work on subsampling by Bertail et al. (2004) for strongly mixing case to weakly dependent case by application of the results of Doukhan and Louhichi (1999). We investigate properties of smooth and rough subsampling estimators for distributions of converging and extreme statistics when the underlying time series is η or λ-weakly dependent.

math.ST↗

Estimation of the autocovariance function with missing observations

We propose a novel estimator of the autocorrelation function in presence of missing observations. We establish the consistency, the asymptotic normality, and we derive deviation bounds for various classes of weakly dependent stationary time series, including causal or non causal models. In addition, we introduce a modified version periodogram defined from these autocorrelation estimators and derive asymptotic distribution of linear functionals of this estimator.

stat.ME↗

Evaluation for moments of a ratio with application to regression estimation

Ratios of random variables often appear in probability and statistical applications. We aim to approximate the moments of such ratios under several dependence assumptions. Extending the ideas in Collomb [C. R. Acad. Sci. Paris 285 (1977) 289--292], we propose sharper bounds for the moments of randomly weighted sums and for the $L^p$-deviations from the asymptotic normal law when the central limit theorem holds. We indicate suitable applications in finance and censored data analysis and focus on the applications in the field of functional estimation.

math.ST↗

The notion of $ψ$-weak dependence and its applications to bootstrapping time series

We give an introduction to a notion of weak dependence which is more general than mixing and allows to treat for example processes driven by discrete innovations as they appear with time series bootstrap. As a typical example, we analyze autoregressive processes and their bootstrap analogues in detail and show how weak dependence can be easily derived from a contraction property of the process. Furthermore, we provide an overview of classes of processes possessing the property of weak dependence and describe important probabilistic results under such an assumption.

math.PR↗

Weakly dependent chains with infinite memory

We prove the existence of a weakly dependent strictly stationary solution of the equation $ X_t=F(X_{t-1},X_{t-2},X_{t-3},...;ξ_t)$ called {\em chain with infinite memory}. Here the {\em innovations} $ξ_t$ constitute an independent and identically distributed sequence of random variables. The function $F$ takes values in some Banach space and satisfies a Lipschitz-type condition. We also study the interplay between the existence of moments and the rate of decay of the Lipschitz coefficients of the function $F$. With the help of the weak dependence properties, we derive Strong Laws of Large Number, a Central Limit Theorem and a Strong Invariance Principle.

math.PR↗

An invariance principle for weakly dependent stationary general models

The aim of this article is to refine a weak invariance principle for stationary sequences given by Doukhan & Louhichi (1999). Since our conditions are not causal our assumptions need to be stronger than the mixing and causal $θ$-weak dependence assumptions used in Dedecker & Doukhan (2003). Here, if moments of order $>2$ exist, a weak invariance principle and convergence rates in the CLT are obtained; Doukhan & Louhichi (1999) assumed the existence of moments with order $>4$. Besides the previously used $η$- and $κ$-weak dependence conditions, we introduce a weaker one, $λ$, which fits the Bernoulli shifts with dependent inputs.

math.ST↗

A functional central limit theorem for interacting particle systems on transitive graphs

A finite range interacting particle system on a transitive graph is considered. Assuming that the dynamics and the initial measure are invariant, the normalized empirical distribution process converges in distribution to a centered diffusion process. As an application, a central limit theorem for certain hitting times, interpreted as failure times of a coherent system in reliability, is derived.

math-ph↗

Dependent Lindeberg central limit theorem and some applications

In this paper, a very useful lemma (in two versions) is proved: it simplifies notably the essential step to establish a Lindeberg central limit theorem for dependent processes. Then, applying this lemma to weakly dependent processes introduced in Doukhan and Louhichi (1999), a new central limit theorem is obtained for sample mean or kernel density estimator. Moreover, by using the subsampling, extensions under weaker assumptions of these central limit theorems are provided. All the usual causal or non causal time series: Gaussian, associated, linear, ARCH($\infty$), bilinear, Volterra processes,$...$, enter this frame.

math.ST↗

Uniform limit theorems for the integrated periodogram of weakly dependent time series and their applications to Whittle's estimate

We prove uniform convergence results for the integrated periodogram of a weakly dependent time series, namely a law of large numbers and a central limit theorem. These results are applied to Whittle's parametric estimation. Under general weak-dependence assumptions we derive uniform limit theorems and asymptotic normality of Whittle's estimate for a large class of models. For instance the causal $θ$-weak dependence property allows a new and unified proof of those results for ARCH($\infty$) and bilinear processes. Non causal $η$-weak dependence yields the same limit theorems for two-sided linear (with dependent inputs) or Volterra processes.

math.ST↗

Zero-one laws for binary random fields

A set of binary random variables indexed by a lattice torus is considered. Under a mixing hypothesis, the probability of any proposition belonging to the first order logic of colored graphs tends to 0 or 1, as the size of the lattice tends to infinity. For the particular case of the Ising model with bounded pair potential and surface potential tending to $-\infty$, the threshold functions of local propositions are computed, and sufficient conditions for the zero-one law are given.

math.PR↗