Searcharxiv⌕ Search

arXiv subjects

Philippe Soulier

Publications and source records attributed to Philippe Soulier.

34 records · Page 2Linked to original sources

Estimation of limiting conditional distributions for the heavy tailed long memory stochastic volatility process

We consider Stochastic Volatility processes with heavy tails and possible long memory in volatility. We study the limiting conditional distribution of future events given that some present or past event was extreme (i.e. above a level which tends to infinity). Even though extremes of stochastic volatility processes are asymptotically independent (in the sense of extreme value theory), these limiting conditional distributions differ from the i.i.d. case. We introduce estimators of these limiting conditional distributions and study their asymptotic properties. If volatility has long memory, then the rate of convergence and the limiting distribution of the centered estimators can depend on the long memory parameter (Hurst index).

math.ST↗

Monotone spectral density estimation

We propose two estimators of a monotone spectral density, that are based on the periodogram. These are the isotonic regression of the periodogram and the isotonic regression of the log-periodogram. We derive pointwise limit distribution results for the proposed estimators for short memory linear processes and long memory Gaussian processes and also that the estimators are rate optimal.

math.ST↗

The tail empirical process for some long memory sequences

This paper describes limiting behaviour of tail empirical process associated with long memory stochastic volatility models. We show that such process has dichotomous behaviour, according to an interplay between a Hurst parameter and a tail index. In particular, the limit may be non-Gaussian and/or degenerate, indicating an influence of long memory. On the other hand, tail empirical process with random levels never suffers from long memory. This is very desirable from a practical point of view, since such the process may be used to construct Hill estimator of the tail index. To prove our results we need to establish several new results for regularly varying distribution functions, which may be of independent interest.

math.ST↗

Estimation of conditional laws given an extreme component

Let $(X,Y)$ be a bivariate random vector. The estimation of a probability of the form $P(Y\leq y \mid X >t) $ is challenging when $t$ is large, and a fruitful approach consists in studying, if it exists, the limiting conditional distribution of the random vector $(X,Y)$, suitably normalized, given that $X$ is large. There already exists a wide literature on bivariate models for which this limiting distribution exists. In this paper, a statistical analysis of this problem is done. Estimators of the limiting distribution (which is assumed to exist) and the normalizing functions are provided, as well as an estimator of the conditional quantile function when the conditioning event is extreme. Consistency of the estimators is proved and a functional central limit theorem for the estimator of the limiting distribution is obtained. The small sample behavior of the estimator of the conditional quantile function is illustrated through simulations.

math.ST↗

Limit conditional distributions for bivariate vectors with polar representation

We investigate conditions for the existence of the limiting conditional distribution of a bivariate random vector when one component becomes large. We revisit the existing literature on the topic, and present some new sufficient conditions. We concentrate on the case where the conditioning variable belongs to the maximum domain of attraction of the Gumbel law, and we study geometric conditions on the joint distribution of the vector. We show that these conditions are of a local nature and imply asymptotic independence when both variables belong to the domain of attraction of an extreme value distribution. The new model we introduce can also be useful for simulations.

math.PR↗

Best attainable rates of convergence for the estimation of the memory parameter

The purpose of this note is to prove a lower bound for the estimation of the memory parameter of a stationary long memory process. The memory parameter is defined here as the index of regular variation of the spectral density at 0. The rates of convergence obtained in the literature assume second order regular variation of the spectral density at zero. In this note, we do not make this assumption, and show that the rates of convergence in this case can be extremely slow. We prove that the log-periodogram regression (GPH) estimator achieves the optimal rate of convergence for Gaussian long memory processes.

math.ST↗

Estimation of bivariate excess probabilities for elliptical models

Let $(X,Y)$ be a random vector whose conditional excess probability $θ(x,y):=P(Y\leq y | X>x)$ is of interest. Estimating this kind of probability is a delicate problem as soon as $x$ tends to be large, since the conditioning event becomes an extreme set. Assume that $(X,Y)$ is elliptically distributed, with a rapidly varying radial component. In this paper, three statistical procedures are proposed to estimate $θ(x,y)$ for fixed $x,y$, with $x$ large. They respectively make use of an approximation result of Abdous et al. (cf. Canad. J. Statist. 33 (2005) 317--334, Theorem 1), a new second order refinement of Abdous et al.'s Theorem 1, and a non-approximating method. The estimation of the conditional quantile function $θ(x,\cdot)^{\leftarrow}$ for large fixed $x$ is also addressed and these methods are compared via simulations. An illustration in the financial context is also given.

math.ST↗

Log-average periodogram estimator of the memory parameter

This paper introduces a semiparametric regression estimator of the memory parameter for long-memory time series process. It is based on the regression in a neighborhood of the zero-frequency of the periodogram averaged over epochs. The proposed estimator is theoretically justified and empirical Monte Carlo investigation gives evidence that the method is very promising to estimate the long-memory parameter.

math.ST↗

Estimation of the Memory Parameter of the Infinite Source Poisson Process

Long-range dependence induced by heavy tails is a widely reported feature of internet traffic. Long-range dependence can be defined as the regular variation of the variance of the integrated process, and half the index of regular variation is then referred to as the Hurst index. The infinite-source Poisson process (a particular case of which is the $M/G/\infty$ queue) is a simple and popular model with this property, when the tail of the service time distribution is regularly varying. The Hurst index of the infinite-source Poisson process is then related to the index of regular variation of the service times. In this paper, we present a wavelet-based estimator of the Hurst index of this process, when it is observed either continuously or discretely over an increasing time interval. Our estimator is shown to be consistent and robust to some form of non-stationarity. Its rate of convergence is investigated.

math.ST↗

Long Memory in Nonlinear Processes

It is generally accepted that many time series of practical interest exhibit strong dependence, i.e., long memory. For such series, the sample autocorrelations decay slowly and log-log periodogram plots indicate a straight-line relationship. This necessitates a class of models for describing such behavior. A popular class of such models is the autoregressive fractionally integrated moving average (ARFIMA) which is a linear process. However, there is also a need for nonlinear long memory models. For example, series of returns on financial assets typically tend to show zero correlation, whereas their squares or absolute values exhibit long memory. Furthermore, the search for a realistic mechanism for generating long memory has led to the development of other nonlinear long memory models. In this chapter, we will present several nonlinear long memory models, and discuss the properties of the models, as well as associated parametric andsemiparametric estimators.

math.ST↗

Subgeometric ergodicity of Markov chains

The goal of this paper is to give a short and self contained proof of general bounds for subgeometric rates of convergence, under practical conditions. The main result whose proof, based on coupling, provides an intuitive understanding of the results of Nummelin and Tuominen (1983) and Tuominen and Tweedie (1994). To obtain practical rates, a very general drift condition, recently introduced in Douc et al (2004) is used.

math.ST↗

Asymptotics for Duration-Driven Long Range Dependent Processes

We consider processes with second order long range dependence resulting from heavy tailed durations. We refer to this phenomenon as duration-driven long range dependence (DDLRD), as opposed to the more widely studied linear long range dependence based on fractional differencing of an $iid$ process. We consider in detail two specific processes having DDLRD, originally presented in Taqqu and Levy (1986), and Parke (1999). For these processes, we obtain the limiting distribution of suitably standardized discrete Fourier transforms (DFTs) and sample autocovariances. At low frequencies, the standardized DFTs converge to a stable law, as do the standardized sample autocovariances at fixed lags. Finite collections of standardized sample autocovariances at a fixed set of lags converge to a degenerate distribution. The standardized DFTs at high frequencies converge to a Gaussian law. Our asymptotic results are strikingly similar for the two DDLRD processes studied. We calibrate our asymptotic results with a simulation study which also investigates the properties of the semiparametric log periodogram regression estimator of the memory parameter.

math.ST↗

On the existence of some ARCH($\infty$) processes

A new sufficient condition for the existence of a stationary causal solution of an ARCH($\infty$) equation is provided. This condition allows to consider polynomially decaying coefficients, so that it can be applied to the so-called FIGARCH processes, whose existence is thus proved.

math.ST↗

Propagation of Memory Parameter from Durations to Counts

We establish sufficient conditions on durations that are stationary with finite variance and memory parameter $d \in [0,1/2)$ to ensure that the corresponding counting process $N(t)$ satisfies $\textmd{Var} N(t) \sim C t^{2d+1}$ ($C>0$) as $t \to \infty$, with the same memory parameter $d \in [0,1/2)$ that was assumed for the durations. Thus, these conditions ensure that the memory in durations propagates to the same memory parameter in counts and therefore in realized volatility. We then show that any utoregressive Conditional Duration ACD(1,1) model with a sufficient number of finite moments yields short memory in counts, while any Long Memory Stochastic Duration model with $d>0$ and all finite moments yields long memory in counts, with the same $d$.

math.ST↗

Computable Convergence Rates for Subgeometrically Ergodic Markov Chains

In this paper, we give quantitative bounds on the $f$-total variation distance from convergence of an Harris recurrent Markov chain on an arbitrary under drift and minorisation conditions implying ergodicity at a sub-geometric rate. These bounds are then specialized to the stochastically monotone case, covering the case where there is no minimal reachable element. The results are illustrated on two examples from queueing theory and Markov Chain Monte Carlo.

math.PR↗

Practical drift conditions for subgeometric rates of convergence

We present a new drift condition which implies rates of convergence to the stationary distribution of the iterates of a ψ-irreducible aperiodic and positive recurrent transition kernel. This condition, extending a condition introduced by Jarner and Roberts [Ann. Appl. Probab. 12 (2002) 224-247] for polynomial convergence rates, turns out to be very convenient to prove subgeometric rates of convergence. Several applications are presented including nonlinear autoregressive models, stochastic unit root models and multidimensional random walk Hastings-Metropolis algorithms.

math.PR↗