The paper considers one of the standard processes for modeling returns in finance, the stochastic volatility process with regularly varying innovations. The aim of the paper is to show how point process techniques can be used to derive the asymptotic behavior of the sample autocorrelation function of this process with heavy-tailed marginal distributions. Unlike other non-linear models used in finance, such as GARCH and bilinear models, sample autocorrelations of a stochastic volatility process have attractive asymptotic properties. Specifically, in the infinite variance case, the sample autocorrelation function converges to zero in probability at a rate that is faster the heavier the tails of the marginal distribution. This behavior is analogous to the asymptotic behavior of the sample autocorrelations of independent identically distributed random variables.

During DNA replication, small fragments of DNA are formed. These have been observed experimentally and the mechanism of their formation modelled mathematically. Using the stochastic model of Cowan and Chiu (1992), (1994), we find the probability distribution of the number of fragments. A new discrete distribution arises. The work has interest as an application of the recent theory on quasirenewal equations in Piau (2000).

A class of non-negative alternating regenerative processes is considered, where the process stays at zero random time (waiting period), then it jumps to a random positive level and hits zero after some random period (life period), depending on the evolution of the process. It is assumed that the waiting time and the lifetime belong to the domain of attraction of stable laws with parameters in the interval (½,1]. An integral representation for the distribution functions of the regenerative process is obtained, using the spent time distributions of the corresponding alternating renewal process. Given the asymptotic behaviour of the process in the regenerative cycle, different types of limiting distributions are proved, applying some new results for the corresponding renewal process and two limit theorems for the convergence in distribution.

Let X = (X(t):t ≥ 0) be a Lévy process and X∊ the compensated sum of jumps not exceeding ∊ in absolute value, σ2(∊) = var(X∊(1)). In simulation, X - X∊ is easily generated as the sum of a Brownian term and a compound Poisson one, and we investigate here when X∊/σ(∊) can be approximated by another Brownian term. A necessary and sufficient condition in terms of σ(∊) is given, and it is shown that when the condition fails, the behaviour of X∊/σ(∊) can be quite intricate. This condition is also related to the decay of terms in series expansions. We further discuss error rates in terms of Berry-Esseen bounds and Edgeworth approximations.

Simulated annealing is a popular and much studied method for maximizing functions on finite or compact spaces. For noncompact state spaces, the method is still sound, but convergence results are scarce. We show here how to prove convergence in such cases, for Markov chains satisfying suitable drift and minorization conditions.

A time-series consisting of white noise plus Brownian motion sampled at equal intervals of time is exactly orthogonalized by a discrete cosine transform (DCT-II). This paper explores the properties of a version of spectral analysis based on the discrete cosine transform and its use in distinguishing between a stationary time-series and an integrated (unit root) time-series.

Many failure mechanisms can be traced to an underlying deterioration process, and stochastically changing covariates may influence this process. In this paper we propose an alternative model for assessing a system's reliability. The proposed model expresses the failure time of a system in terms of a deterioration process and covariates. When it is possible to measure deterioration as well as covariates, our model provides more information than failure time for the purpose of assessing and improving system reliability. We give several properties of our proposed model and also provide an example.

We consider Markov chains in the context of iterated random functions and show the existence and uniqueness of an invariant distribution under a local contraction condition combined with a drift condition, extending results of Diaconis and Freedman. From these we deduce various other topological stability properties of the chains. Our conditions are typically satisfied by, for example, queueing and storage models where the global Lipschitz condition used by Diaconis and Freedman normally fails.

General and unifying approaches are discussed for computing fundamental characteristics of both continuous-time and discrete-time birth-death processes. In particular, an exponential family framework is used to derive explicit expressions, in terms of continued fractions, for joint generating functions of first-passage times and a whole collection of associated random quantities, and a random sum representation is used to obtain formulae for means, variances and covariances of stopped reward functions defined on a birth-death process.

This paper studies the geometric convergence rate of a discrete renewal sequence to its limit. A general convergence rate is first derived from the hazard rates of the renewal lifetimes. This result is used to extract a good convergence rate when the lifetimes are ordered in the sense of new better than used or increasing hazard rate. A bound for the best possible geometric convergence rate is derived for lifetimes having a finite support. Examples demonstrating the utility and sharpness of the results are presented. Several of the examples study convergence rates for Markov chains.

Consider an inhomogeneous Poisson process X on [0, T] whose unknown intensity function ‘switches' from a lower function g∗ to an upper function h∗ at some unknown point θ∗. What is known are continuous bounding functions g and h such that g∗(t) ≤ g(t) ≤ h(t) ≤ h∗(t) for 0 ≤ t ≤ T. It is shown that on the basis of n observations of the process X the maximum likelihood estimate of θ∗ is consistent for n →∞, and also that converges in law and in pth moment to limits described in terms of the unknown functions g∗ and h∗.

We consider a repairable system with a finite state space which evolves in time according to a Markov process as long as it is working. We assume that this system is getting worse and worse while running: if the up-states are ranked according to their degree of increasing degradation, this is expressed by the fact that the Markov process is assumed to be monotone with respect to the reversed hazard rate and to have an upper triangular generator. We study this kind of process and apply the results to derive some properties of the stationary availability of the system. Namely, we show that, if the duration of the repair is independent of its completeness degree, then the more complete the repair, the higher the stationary availability, where the completeness degree of the repair is measured with the reversed hazard rate ordering.

Let Xn, n ≥ 1 be a sequence of trials taking values in a given set A, let ∊ be a pattern (simple or compound), and let Xr,∊ be a random variable denoting the waiting time for the rth occurrence of ∊. In the present article a finite Markov chain imbedding method is developed for the study of Xr,∊ in the case of the non-overlapping and overlapping way of counting runs and patterns. Several extensions and generalizations are also discussed.

We consider the sum Sd of record values in a sequence of independent random variables that are uniformly distributed on 1,…,d. This sum can be interpreted as the total amount of time spent in record lifetimes in the standard renewal theoretic setup. We investigate the distributional limit of Sd and some related quantities as d→∞. Some explicit values are given for d=6, a case that can be interpreted as a simple game of chance.

We give a general construction of sequential games among multiple players, as well as a construction of the composition of sequential games. We obtain new properties of the optimal class of win-by-k games, including closure under composition and independence between the winner of the game and the number of points played. We obtain new results on the asymptotic efficiency of the n-point, win-by-k games.

This paper presents an algorithmic analysis of the busy period for the M/M/c queueing system. By setting the busy period equal to the time interval during which at least one server is busy, we develop a first step analysis which gives the Laplace-Stieltjes transform of the busy period as the solution of a finite system of linear equations. This approach is useful in obtaining a suitable recursive procedure for computing the moments of the length of a busy period and the number of customers served during it. The maximum entropy formalism is then used to analyse what is the influence of a given set of moments on the distribution of the busy period and to estimate the true busy period distribution. Our study supplements a recent work of Daley and Servi (1998) and other studies where the busy period of a multiserver queue follows a different definition, i.e., a busy period is the time interval during which all servers are engaged.

We study the convergence of certain matrix sequences that arise in quasi-birth-and-death (QBD) Markov chains and we identify their limits. In particular, we focus on a sequence of matrices whose elements are absorption probabilities into some boundary states of the QBD. We prove that, under certain technical conditions, that sequence converges. Its limit is either the minimal nonnegative solution G of the standard nonlinear matrix equation, or it is a stochastic solution that can be explicitly expressed in terms of G. Similar results are obtained relative to the standard matrix R that arises in the matrix-geometric solution of the QBD. We present numerical examples that clarify some of the technical issues of interest.

It is generally recognized that Alfred Lotka made the first application of standard Galton-Watson branching process theory to calculate an extinction probability in a specific population (using asexual reproduction). This note applies bisexual Galton-Watson branching process theory to the calculation of an extinction probability from Lotka's data, yielding a somewhat higher value.

The problem of discriminating between two Markov chains is considered. It is assumed that the common state space of the chains is finite and all the finite dimensional distributions are mutually absolutely continuous. The Bayes risk is expressed through large deviation probabilities for sums of random variables defined on an auxiliary Markov chain. The proofs are based on a large deviation theorem recently established by Z. Szewczak.

We prove the law of large numbers for random walks in random environments on the d-dimensional integer lattice Zd. The environment is described in terms of a stationary random field of transition probabilities on the lattice, possessing a certain drift property, modeled on the Kalikov condition. In contrast to the previously considered models, we admit possible correlation of transition probabilities at different sites, assuming however that they become independent at finite distances. The possible dependence of sites makes impossible a direct application of the renewal times technique of Sznitman and Zerner.