Exit times for ARMA processes

2018 ◽  
Vol 50 (A) ◽  
pp. 191-195
Author(s):  
Timo Koski ◽  
Brita Jung ◽  
Göran Högnäs

Abstract We study the asymptotic behaviour of the expected exit time from an interval for the ARMA process, when the noise level approaches 0.

1988 ◽  
Vol 20 (4) ◽  
pp. 822-835 ◽  
Author(s):  
Ed Mckenzie

A family of models for discrete-time processes with Poisson marginal distributions is developed and investigated. They have the same correlation structure as the linear ARMA processes. The joint distribution of n consecutive observations in such a process is derived and its properties discussed. In particular, time-reversibility and asymptotic behaviour are considered in detail. A vector autoregressive process is constructed and the behaviour of its components, which are Poisson ARMA processes, is considered. In particular, the two-dimensional case is discussed in detail.


1987 ◽  
Vol 1 (4) ◽  
pp. 367-381 ◽  
Author(s):  
Julian Keilson ◽  
Ravi Ramaswamy

The relaxation time for an ergodic Markov process is a measure of the time until ergodicity is reached from its initial state. In this paper the relaxation time for an ergodic truncated birth-death process is studied. It is shown that the relaxation time for such a process on states {0,1, …, N} is the quasi-stationary exit time from the set {,2, …, N{0,1,…, N, N + 1} with two-sided absorption at states 0 and N + 1. The existence of such a dual process has been observed by Siegmund [15] for stochastically monotone Markov processes on the real line. Exit times for birth- death processes with two absorbing states are studied and an efficient algorithm for the numerical evaluation of mean exit times is presented. Simple analytical lower bounds for the relaxation times are obtained. These bounds are numerically accessible. Finally, the sensitivity of the relaxation time to variations in birth and death rates is studied.


1985 ◽  
Vol 17 (04) ◽  
pp. 810-840 ◽  
Author(s):  
Jürgen Franke

The maximum-entropy approach to the estimation of the spectral density of a time series has become quite popular during the last decade. It is closely related to the fact that an autoregressive process of order p has maximal entropy among all time series sharing the same autocovariances up to lag p. We give a natural generalization of this result by proving that a mixed autoregressive-moving-average process (ARMA process) of order (p, q) has maximal entropy among all time series sharing the same autocovariances up to lag p and the same impulse response coefficients up to lag q. The latter may be estimated from a finite record of the time series, for example by using a method proposed by Bhansali (1976). By the way, we give a result on the existence of ARMA processes with prescribed autocovariances up to lag p and impulse response coefficients up to lag q.


1974 ◽  
Vol 6 (04) ◽  
pp. 747-756 ◽  
Author(s):  
J. Keilson

To treat the transient behavior of a system modeled by a stationary Markov process in continuous time, the state space is partitioned into good and bad states. The distribution of sojourn times on the good set and that of exit times from this set have a simple renewal theoretic relationship. The latter permits useful bounds on the exit time survival function obtainable from the ergodic distribution of the process. Applications to reliability theory and communication nets are given.


1974 ◽  
Vol 6 (4) ◽  
pp. 747-756 ◽  
Author(s):  
J. Keilson

To treat the transient behavior of a system modeled by a stationary Markov process in continuous time, the state space is partitioned into good and bad states. The distribution of sojourn times on the good set and that of exit times from this set have a simple renewal theoretic relationship. The latter permits useful bounds on the exit time survival function obtainable from the ergodic distribution of the process. Applications to reliability theory and communication nets are given.


2004 ◽  
Vol 41 (A) ◽  
pp. 375-382 ◽  
Author(s):  
Peter J. Brockwell

Using the kernel representation of a continuous-time Lévy-driven ARMA (autoregressive moving average) process, we extend the class of nonnegative Lévy-driven Ornstein–Uhlenbeck processes employed by Barndorff-Nielsen and Shephard (2001) to allow for nonmonotone autocovariance functions. We also consider a class of fractionally integrated Lévy-driven continuous-time ARMA processes obtained by a simple modification of the kernel of the continuous-time ARMA process. Asymptotic properties of the kernel and of the autocovariance function are derived.


2020 ◽  
Vol 54 (3) ◽  
pp. 811-844
Author(s):  
Samuel Herrmann ◽  
Cristina Zucca

The simulation of exit times for diffusion processes is a challenging task since it concerns many applications in different fields like mathematical finance, neuroscience, reliability… The usual procedure is to use discretization schemes which unfortunately introduce some error in the target distribution. Our aim is to present a new algorithm which simulates exactly the exit time for one-dimensional diffusions. This acceptance-rejection algorithm requires to simulate exactly the exit time of the Brownian motion on one side and the Brownian position at a given time, constrained not to have exit before, on the other side. Crucial tools in this study are the Girsanov transformation, the convergent series method for the simulation of random variables and the classical rejection sampling. The efficiency of the method is described through theoretical results and numerical examples.


2020 ◽  
Vol 57 (2) ◽  
pp. 477-496
Author(s):  
Yuri Bakhtin ◽  
Zsolt Pajor-Gyulai

AbstractFor a one-dimensional smooth vector field in a neighborhood of an unstable equilibrium, we consider the associated dynamics perturbed by small noise. We give a revealing elementary proof of a result proved earlier using heavy machinery from Malliavin calculus. In particular, we obtain precise vanishing noise asymptotics for the tail of the exit time and for the exit distribution conditioned on atypically long exits. We also discuss our program on rare transitions in noisy heteroclinic networks.


2019 ◽  
Vol 56 (3) ◽  
pp. 701-722 ◽  
Author(s):  
Christel Geiss ◽  
Antti Luoto ◽  
Paavo Salminen

AbstractFor a Brownian bridge from 0 to y, we prove that the mean of the first exit time from the interval $\left( -h,h \right),h>0$ , behaves as ${\mathrm{O}}(h^2)$ when $h \downarrow 0$ . Similar behaviour is also seen to hold for the three-dimensional Bessel bridge. For the Brownian bridge and three-dimensional Bessel bridge, this mean of the first exit time has a puzzling representation in terms of the Kolmogorov distribution. The result regarding the Brownian bridge is applied to provide a detailed proof of an estimate needed by Walsh to determine the convergence of the binomial tree scheme for European options.


2004 ◽  
Vol 41 (A) ◽  
pp. 375-382 ◽  
Author(s):  
Peter J. Brockwell

Using the kernel representation of a continuous-time Lévy-driven ARMA (autoregressive moving average) process, we extend the class of nonnegative Lévy-driven Ornstein–Uhlenbeck processes employed by Barndorff-Nielsen and Shephard (2001) to allow for nonmonotone autocovariance functions. We also consider a class of fractionally integrated Lévy-driven continuous-time ARMA processes obtained by a simple modification of the kernel of the continuous-time ARMA process. Asymptotic properties of the kernel and of the autocovariance function are derived.


Sign in / Sign up

Export Citation Format

Share Document