Inversion of the Renewal Density with Dead-time

Stationary renewal point processes are defined by the probability distribution of the distances between successive points (lifetimes) that are independent and identically distributed random variables. For some applications it is also interesting to define the properties of a renewal process by using the renewal density. There are well-known expressions of this density in terms of the probability density of the lifetimes. It is more difficult to solve the inverse problem consisting in the determination of the density of the lifetimes in terms of the renewal density. Theoretical expressions between their Laplace transforms are available but the inversion of these transforms is often very difficult to obtain in closed form. We show that this is possible for renewal processes presenting a dead-time property characterized by the fact that the renewal density is zero in an interval including the origin. We present the principle of a recursive method allowing the solution of this problem and we apply this method to the case of some processes with input dead-time. Computer simulations on Poisson and Erlang (2) processes show quite good agreement between theoretical calculations and experimental measurements on simulated data.     

Algorithms for Point Processes Analysis

A time point process can be defined either by the statistical properties of the time intervals between successive points or by those of the number of points in arbitrary time intervals. There are mathematical expressions to link up these two points of view, but they are in many cases too complicated to be used in practice. In this article, we present an algorithmic procedure to obtain the number of points of a stationary point process recorded in some time intervals by processing the values of the distances between successive points. We present some results concerning the statistical analysis of these numbers of points and when analytical calculations are possible the experimental results obtained with our algorithms are in excellent agreement with those predicted by the theory. Some properties of point processes in which theoretical calculations are almost impossible are also presented.     

Autoregressive moving-average convolution processes on the unit circle

ARMA convolution models for processes in continuous space (in this case the unit circle) and discrete time are derived as a natural extension of the usual Box-Jenkins models. Both weakly time-stationary and nonstationary processes are considered. Sufficient conditions for the existence of weakly time-stationary AR_cMA_c processes are derived, and the covariance functions for some processes are computed. It is demonstrated that the usual scalar and multivariate ARMA processes can be embedded within the larger class of AR_CMA_c models. A possible application of these models to sea-surface temperature prediction is discussed.     

Estimation for a first-order bifurcating autoregressive process with heavy-tail innovations

Asymptotics of an alternative extreme-value estimator for the autocorrelation parameter in a first-order bifurcating autoregressive (BAR) process with non-gaussian innovations are derived. This contrasts with traditional estimators whose asymptotic behavior depends on the central part of the innovation distribution. Within any BAR model, the main concern is addressing the complex dependency between generations. The inability of traditional methods to handle this dependency motivated an alternative procedure. With the combination of an extreme-value approach and a clever blocking argument, the dependency issue within the BAR process was resolved, which in turn allowed us to derive the limiting distribution for the proposed estimator through the use of regular variation and non-stationary point processes. Finally, the implications of our extreme-value approach are discussed with an extensive simulation study that not only assesses the reliability of our proposed estimate but also presents the findings for a new estimator of an unknown location parameter θ and its implications.     

Covariance analysis and associated spectra for classes of nonstationary processes

In 1951, Cramér introduced a class of nonstationary processes. This broad class of processes contains the important harmonizable and stationary classes of processes. The Cramér class can have additional structure imposed upon it through Cesàro summability considerations. These refined Cramér classes, termed (c,p)-summable Cramér, have recently been considered by Swift (in: M.M. Rao (Ed.), Real and Stochastic Analysis: Recent Advances, CRC Press, Boca Raton, FL, 1997, p. 303). In this paper, the relationship between the (c,p)-summable Cramér classes and the (KF,p) classes of processes introduced by Rao in 1985 is considered. The (KF,p) classes of processes are a generalization of the class of processes considered by Kampé de Feriet and Frenkiel. A continuity theorem for the (KF,p) classes is obtained. This result yields a spectral representation for the (KF,p) classes. Some (KF,p) class processes are shown to arise as the solution to a difference equation obtained from a linear model of a noisy communication channel.     

Some results on unilateral ARMA lattice processes

This paper presents several linked results on unilateral autoregressive moving average processes on a rectangular lattice. It is shown that axially symmetric two-dimensional quadrant processes must be separable. Exact forms for the inverse variance matrix are obtained in some cases, which allow exact Gaussian maximum likelihood estimation and simulation. It is shown that generating functions can be used for extrapolation. The herringbone simulation method is discussed.     

The Input Evaluation of Generalized Bernoulli Processes for Salary Lines Construction by Means of Continuous Time Generalized Non-Homogeneous Semi-Markov Processes

Salary line forecasting assumes a relevant role in manpower and in pension funds Previously, the authors presented a generalized Bernoulli process, useful for forecasting the evolution of salary lines, taking into account the salary costs, the number of workers at each rank and the probability transitions between the ranks. The problem with applying this model is constructing the probability of transition between the grades. In this article, we will present a model that allows obtaining these probabilities by means of the solution of the evolution equation of a generalization of continuous time non-homogeneous semi-Markov processes.     

Estimating the probability of simultaneous rainfall extremes within a region: a spatial approach

In this paper we investigate the impact of model mis-specification, in terms of the dependence structure in the extremes of a spatial process, on the estimation of key quantities that are of interest to hydrologists and engineers. For example, it is often the case that severe flooding occurs as a result of the observation of rainfall extremes at several locations in a region simultaneously. Thus, practitioners might be interested in estimates of the joint exceedance probability of some high levels across these locations. It is likely that there will be spatial dependence present between the extremes, and this should be properly accounted for when estimating such probabilities. We compare the use of standard models from the geostatistics literature with max-stables models from extreme value theory. We find that, in some situations, using an incorrect spatial model for our extremes results in a significant under-estimation of these probabilities which – in flood defence terms – could lead to substantial under-protection.     

Some comments on sample quantiles for dependent observations

Sample quantiles obtained from a linear process are examined and their asymptotic properties are derived by using simple elementary arguments.     

Exponential families of markov processes -part II: birth- and death processes

A common prior distribution and loss structure are set up to be appropriate for the sorting of batches using sampling inspection by variable and by attribute. Approxi¬mations to the exact optimal sampling plans are derived to gain a better understanding of BAYEsian sampling plans and to compare the plans using variable sampling and attribute sampling. It is assumed that the process quality distribution is normal with a known variance     

On Random and Gibbsian Particle Motions for Point Processes Evolving in Space and Time

This article presents an analysis of space-time interdependencies of spatial point processes considering random and deterministic Gibbsian point motions caused by repulsion effects between particles. Two deterministic models of Gibbsian motions are considered by formulating a constant (i.e., Strauss-like) and a linear interaction motion functions. Given that theoretical development of continuous space-time stochastic processes are mathematically intractable, we have mainly based our analysis on numerical simulations. Our results suggest that to fully understand such complex dynamics, the analysis of purely spatial patterns should be combined with their interactions in the space-time domain. Otherwise, analysis of pure spacial patterns may not fully explain the real mechanism generating such dynamical configurations. We highlight that adding movement to sedentary points opens new areas of application and research to study biological phenomena, where particles not only evolve through time but also can change spatial positions in terms of their neighbor locations.     

Interacting neighbour point processes: Some models for clustering

We introduce a class of spatial point processesinteracting neighbour point (INP) processes, where the density of the process can be written by means of local interactions between a point and subsets of its neighbourhood but where the processes may not be Ripley-Kelly Markov processes with respect to this neighbourhood. We show that the processes are iterated Markov processes defined by Hayat and Gubner (1996). Furthermore, we pay special attention to a subclass of interacting neighbour processes, where the density belongs to the exponential family and all neighbours of a point affect it simultaneously. A simulation study is presented to show that some simple processes of this subclass can produce clustered patterns of great variety. Finally, an empirical example is given.     

Optimal Alarm Systems for Count Processes

In many phenomena described by stochastic processes, the implementation of an alarm system becomes fundamental to predict the occurrence of future events. In this work we develop an alarm system to predict whether a count process will upcross a certain level and give an alarm whenever the upcrossing level is predicted. We consider count models with parameters being functions of covariates of interest and varying on time. This article presents classical and Bayesian methodology for producing optimal alarm systems. Both methodologies are illustrated and their performance compared through a simulation study. The work finishes with an empirical application to a set of data concerning the number of sunspot on the surface of the sun.     

Markov Systems in a General State Space

In this article, we introduce and study Markov systems on general spaces (MSGS) as a first step of an entire theory on the subject. Also, all the concepts and basic results needed for this scope are given and analyzed. This could be thought of as an extension of the theory of a non homogeneous Markov system (NHMS) and that of a non homogeneous semi-Markov system on countable spaces, which has realized an interesting growth in the last thirty years. In addition, we study the asymptotic behaviour or ergodicity of Markov systems on general state spaces. The problem of asymptotic behaviour of Markov chains has been central for finite or countable spaces since the foundation of the subject. It has also been basic in the theory of NHMS and NHSMS. Two basic theorems are provided in answering the important problem of the asymptotic distribution of the population of the memberships of a Markov system that lives in the general space (X, ?(X)). Finally, we study the total variability from the invariant measure of the Markov system given that there exists an asymptotic behaviour. We prove a theorem which states that the total variation is finite. This problem is known also as the coupling problem.     

Convergence analysis of parametric identification methods for jump processes

The asymptotic properties of recursive estimate for the parameter of the signal process of a jump process are investigated. When increasing the observation period, conditions are proposed that guarantee the consistency and asymptotic normality of the estimate. An estimate of the unknown parameter for the random intensity of an extended gamma process model is discussed by way of example.     

The generalized linear chirp process

The linear chirp process is an important class of time series for which the instantaneous frequency changes linearly in time. Linear chirps have been used extensively to model a variety of physical signals such as radar, sonar, and whale clicks (see 1, 5 and 6). We introduce the stochastic linear chirp model and then define the generalized linear chirp (GLC) process as a special case of the G-stationary process studied by Jiang et al. (2006) to model data with time-varying frequencies. We then define GLC(p,q) processes and show that the relationship between stochastic linear chirp processes and GLC(p,q) processes is analogous to that between harmonic and ARMA models. The new methods are then applied to both simulated and actual data sets.     

Moment method estimation of first-order continuous-time bilinear processes

In the present paper, we propose an estimation method of the first order continuous-time bilinear (COBL) process based on Euler-Maruyama discretization of the Itô solution asociated with the stochastic differerential equation (SDE) defining the process, and we suggest a standard moment method (MM) estimates of the unknown parameters involving in COBL process. So, some relationships linking the parameters and the theoretical moments of the process and its quadratic version are given. These relationships we allow to construct two algorithms to estimate the parameters based on MM. Using the fact that the incremented processes are strongly mixing with exponential rate whenever certain conditions are fulfilled, we show that the resulting estimators are strongly consistent and asymptotically normal. The theory can be applied to the COGARCH(1, 1), Gaussian Ornstein-Uhlenbeck (OU) models and among other specifications. Finite sample properties are also considered throught Monte-Carlo experimencts. In end, this algorithm is then used to model the exchanges rate of the Algerian Dinar against the US-dollar and against the single European currency.     

Empirical and rank processes of observations and residuals

Empirical and rank processes of a sample are shown to converge under weak conditions. These results are then extended to analogous empirical and rank processes formed from the residuals of a linear model. Representations of the limiting processes are obtained by means of a special construction. The technicalities are honed to require few regularity conditions.     

On the Posterior Consistency of Mixtures of Dirichlet Process Priors with Censored Data

Mixtures of Dirichlet process priors offer a reasonable compromise between purely parametric and purely non‐parametric models, and are popularly used in survival analysis and for testing problems with non‐parametric alternatives. In this paper, we study large sample properties of the posterior distribution with a mixture of Dirichlet process priors. We show that the posterior distribution of the survival function is consistent with right censored data.     

Uniform hypothesis testing for finite-valued stationary processes

Given a discrete-valued sample X₁, …, X_n, we wish to decide whether it was generated by a distribution belonging to a family H₀, or it was generated by a distribution belonging to a family H₁. In this work, we assume that all distributions are stationary ergodic, and do not make any further assumptions (e.g. no independence or mixing rate assumptions). We would like to have a test whose probability of error (both Types I and II) is uniformly bounded. More precisely, we require that for each ? there exists a sample size n such that probability of error is upper-bounded by ? for samples longer than n. We find some necessary and some sufficient conditions on H₀ and H₁ under which a consistent test (with this notion of consistency) exists. These conditions are topological, with respect to the topology of distributional distance.