Infinite Variation Tempered Stable Ornstein–Uhlenbeck Processes with Discrete Observations

We investigate transition law between consecutive observations of Ornstein–Uhlenbeck processes of infinite variation with tempered stable stationary distribution. Thanks to the Markov autoregressive structure, the transition law can be written in the exact sense as a convolution of three random components; a compound Poisson distribution and two independent tempered stable distributions, one with stability index in (0, 1) and the other with index in (1, 2). We discuss simulation techniques for those three random elements. With the exact transition law and proposed simulation techniques, sample paths simulation proves significantly more efficient, relative to the known approximative technique based on infinite shot noise series representation of tempered stable Lévy processes.     

ON THE NUMBER OF RECORDS NEAR THE MAXIMUM

Recent work has considered properties of the number of observations X_j, independently drawn from a discrete law, which equal the sample maximum X_(n) The natural analogue for continuous laws is the number K_n(a) of observations in the interval (X_(n)–a, X_(n)], where a > 0. This paper derives general expressions for the law, first moment, and probability generating function of K_n(a), mentioning examples where evaluations can be given. It seeks limit laws for n→ and finds a central limit result when a is fixed and the population law has a finite right extremity. Whenever the population law is attracted to an extremal law, a limit theorem can be found by letting a depend on n in an appropriate manner; thus the limit law is geometric when the extremal law is the Gumbel type. With these results, the paper obtains limit laws for ‘top end’ spacings X_(n) - X_(n-j) with j fixed.     

Decomposition for multivariate extremal processes

The probability distribution of an extremal process in R^d with independent max-increments is completely determined by its distribution function. The df of an extremal process is similar to the cdf of a random vector. It is a monotone function on (0, ∞) × R^d with values in the interval [0,1]. On the other hand the probability distribution of an extremal process is a probability measure on the space of sample functions. That is the space of all increasing right continuous functions y: (0, ∞) → R^d with the topology of weak convergence. A sequence of extremal processes converges in law if the probability distributions converge weakly. This is shown to be equivalent to weak convergence of the df's.

An extremal process Y: [0, ∞) → R^d is generated by a point process on the space [0, ∞) × [-∞, ∞)^d and has a decomposition Y = X v Z as the maximum of two independent extremal processes with the same lower curve as the original process. The process X is the continuous part and Z contains the fixed discontinuities of the process Y. For a real valued extremal process the decomposition is unique: for a multivariate extremal process uniqueness breaks down due to blotting.     

Multi-class M/PH/1 queues with deterministic impatience times

This article considers computational procedures for the waiting time and queue length distributions in stationary multi-class first-come, first-served single-server queues with deterministic impatience times. There are several classes of customers, which are distinguished by deterministic impatience times (i.e., maximum allowable waiting times). We assume that customers in each class arrive according to an independent Poisson process and a single server serves customers on a first-come, first-served basis. Service times of customers in each class are independent and identically distributed according to a phase-type distribution that may differ for different classes. We first consider the stationary distribution of the virtual waiting time and then derive numerically feasible formulas for the actual waiting time distribution and loss probability. We also analyze the joint queue length distribution and provide an algorithmic procedure for computing the probability mass function of the stationary joint queue length.     

A class of neutral to the right priors induced by superposition of beta processes

A random distribution function on the positive real line which belongs to the class of neutral to the right priors is defined. It corresponds to the superposition of independent beta processes at the cumulative hazard level. The definition is constructive and starts with a discrete time process with random probability masses obtained from suitably defined products of independent beta random variables. The continuous time version is derived as the corresponding infinitesimal weak limit and is described in terms of completely random measures. It takes the interpretation of the survival distribution resulting from independent competing failure times. We discuss prior specification and illustrate posterior inference on a real data example.     

Equivalence of Gaussian measures for some nonstationary random fields

Gaussian random fields whose covariance structures are described by a power law model provide a simple and flexible class of models for isotropic random fields. This class includes fractional Brownian fields as a special case. Because these random fields are nonstationary, the extensive results available on equivalence of Gaussian measures for stationary models do not apply to them. This work shows that results on equivalence for two stationary Gaussian random field models extend in a natural way to the equivalence of a stationary model and a power law model. This result is used to show that if we use a power law model for predicting a random field at unobserved locations when in fact the random field is stationary, we can obtain asymptotically optimal predictions as long as the high frequency behavior of the true spectral density is sufficiently close to the high frequency behavior of the spectral density of the power law model.     

A Retrial Queue with a Constant Retrial Rate,Server Downs and Impatient Customers

ABSTRACT

In this paper, we consider a retrial queueing system consisting of a waiting line of infinite capacity in front of a single server subject to breakdowns. A customer upon arrival may join the queue (waiting line) or go to the retrial orbit (another queue) to retry for service after a random time. Only the customer at the head of the retrial orbit is allowed to retry for service. Upon retrial, the customer enters the service if the server is idle; otherwise, it may go back to the retrial orbit or leave the system (become impatient). All the interarrival times, service times, server up times, server down times and retrial times are exponential, and all the necessary independence conditions in these variables are assumed. For this system, we provide sufficient conditions under which, for any given number of customers in the orbit, the stationary probability of the number of customers in the waiting line decays geometrically. We also provide explicitly an expression for the decay parameter.     

Steady-state behaviour of serial queueing processes with impatient customers

This paper considers the steady-state behaviour of serial queueing processes with impatient customers having random selection for service, Poisson arrivals and exponential service times where the waiting space is infinite as well as finite. The expressions for the steady-state solution and mean queue length have been derived whenever the queue-discipline is first-come,first-served     

Modelling extremes of time-dependent data by Markov-switching structures

We investigate the extremal clustering behaviour of stationary time series that possess two regimes, where the switch is governed by a hidden two-state Markov chain. We also suppose that the process is conditionally Markovian in each latent regime. We prove under general assumptions that above high thresholds these models behave approximately as a random walk in one (called dominant) regime and as a stationary autoregression in the other (dominated) regime. Based on this observation, we propose an estimation and simulation scheme to analyse the extremal dependence structure of such models, taking into account only observations above high thresholds. The properties of the estimation method are also investigated. Finally, as an application, we fit a model to high-level exceedances of water discharge data, simulate extremal events from the fitted model, and show that the (model-based) flood peak, flood duration and flood volume distributions match their observed counterparts.     

A Two‐Queue Polling Model with Regularly Varying Service and/or Switchover Times

Abstract

We consider the cyclic polling system with two queues. One queue is severed according to the exhaustive discipline, and the other queue is served according to the 1‐limited discipline. At least one of the service and/or switchover times has a regularly varying tail. We obtain the tail behavior of the waiting time distributions. When one of the service and/or switchover times has an infinite second moment, we derive the heavy‐traffic behavior of the waiting time distribution at the 1‐limited queue.     

Max‐infinitely divisible models and inference for spatial extremes

For many environmental processes, recent studies have shown that the dependence strength is decreasing when quantile levels increase. This implies that the popular max‐stable models are inadequate to capture the rate of joint tail decay, and to estimate joint extremal probabilities beyond observed levels. We here develop a more flexible modeling framework based on the class of max‐infinitely divisible processes, which extend max‐stable processes while retaining dependence properties that are natural for maxima. We propose two parametric constructions for max‐infinitely divisible models, which relax the max‐stability property but remain close to some popular max‐stable models obtained as special cases. The first model considers maxima over a finite, random number of independent observations, while the second model generalizes the spectral representation of max‐stable processes. Inference is performed using a pairwise likelihood. We illustrate the benefits of our new modeling framework on Dutch wind gust maxima calculated over different time units. Results strongly suggest that our proposed models outperform other natural models, such as the Student‐t copula process and its max‐stable limit, even for large block sizes.     

Matrix–geometric analysis of the discrete time Gi/G/1 system

In this paper, we show that the discrete GI/G/1 system can be analysed as a QBD process with infinite blocks. Most importantly, we show that Matrix–geometric method can be used for analyzing this general queue system including establishing its stability criterion and for obtaining the explicit stationary probability and the waiting time distributions. This also settles the unwritten myth that Matrix–geometric method is limited to cases with at least one Markov based characterizing parameter, i.e. either interarrival or service times, in the case of queueing systems.     

The multitype branching random walk,I

The limiting behaviour of the multitype branching random walk is studied. A limit theorem is proven for the supercritical process. Steady-state distributions are shown to exist for the subcritical process with immigration, and for the critical transient process beginning with Poisson random fields. An analogue of the exponential limit law is proven for the critical process whose migration process is Brownian motion in two dimensions.     

Simultaneous arrival of customers to two different queues and modeling dependence via copula approach

ABSTRACT

In classical queueing systems, a customer is allowed to wait only in one queue to receive the service. In practice, when there exist a number of queues rendering the same service, some customers may tend to simultaneously take turn in more than one queue with the aim to receive the service sooner and thus reduce their waiting time. In this article, we introduce such a model and put forward a methodology to deal with the situation. In this regard, we consider two queues and assume that if a customer, who has turn in both queues, receives the service from one of the queues, the other turn is automatically withdrawn. This circumstance for the model brings about some abandonment in each queue as some customers receive the service from the other one. We study the customer’s waiting time in the mentioned model, which is defined as the minimum of waiting times in both queues and obtain probability density function of this random variable. Our approach to obtain probability density function of each of the waiting time random variables is to rely on the existing results for the abandonment case. We examine the situation for the cases of independence and dependence of the waiting time random variables. The latter is treated via a copula approach.     

Stationary distributions of the R[X]/R/1 cross-correlated queue

We consider an infinite buffer single server queue wherein batch interarrival and service times are correlated having a bivariate mixture of rational (R) distributions, where R denotes the class of distributions with rational Laplace–Stieltjes transform (LST), i.e., ratio of a polynomial of degree at most n to a polynomial of degree n. The LST of actual waiting time distribution has been obtained using Wiener–Hopf factorization of the characteristic equation. The virtual waiting time, idle period (actual and virtual) distributions, as well as inter-departure time distribution between two successive customers have been presented. We derive an approximate stationary queue-length distribution at different time epochs using the Markovian assumption of the service time distribution. We also derive the exact steady-state queue-length distribution at an arbitrary epoch using distributional form of Little’s law. Finally, some numerical results have been presented in the form of tables and figures.     

Estimating the causal effects in randomized trials for survival data with a cure fraction and non compliance

We consider causal inference in randomized studies for survival data with a cure fraction and all-or-none treatment non compliance. To describe the causal effects, we consider the complier average causal effect (CACE) and the complier effect on survival probability beyond time t (CESP), where CACE and CESP are defined as the difference of cure rate and non cured subjects’ survival probability between treatment and control groups within the complier class. These estimands depend on the distributions of survival times in treatment and control groups. Given covariates and latent compliance type, we model these distributions with transformation promotion time cure model whose parameters are estimated by maximum likelihood. Both the infinite dimensional parameter in the model and the mixture structure of the problem create some computational difficulties which are overcome by an expectation-maximization (EM) algorithm. We show the estimators are consistent and asymptotically normal. Some simulation studies are conducted to assess the finite-sample performance of the proposed approach. We also illustrate our method by analyzing a real data from the Healthy Insurance Plan of Greater New York.     

Ruin problem of a two-dimensional fractional Brownian motion risk process

This paper investigates ruin probability and ruin time of a two-dimensional fractional Brownian motion risk process. The net loss process of an insurance company is modeled by a fractional Brownian motion. The two-dimensional fractional Brownian motion risk process models the surplus processes of an insurance and a reinsurance company, where the net loss is divided between them in some specified proportions. The ruin problem considered is that of the two-dimensional risk process first entering the negative quadrant, that is, the simultaneous ruin problem. We derive both asymptotics of the ruin probability and approximations of the scaled conditional ruin time as the initial capital tends to infinity.     

M‐estimation for general ARMA Processes with Infinite Variance

Abstract. General autoregressive moving average (ARMA) models extend the traditional ARMA models by removing the assumptions of causality and invertibility. The assumptions are not required under a non‐Gaussian setting for the identifiability of the model parameters in contrast to the Gaussian setting. We study M‐estimation for general ARMA processes with infinite variance, where the distribution of innovations is in the domain of attraction of a non‐Gaussian stable law. Following the approach taken by Davis et al. (1992) and Davis (1996) , we derive a functional limit theorem for random processes based on the objective function, and establish asymptotic properties of the M‐estimator. We also consider bootstrapping the M‐estimator and extend the results of Davis & Wu (1997) to the present setting so that statistical inferences are readily implemented. Simulation studies are conducted to evaluate the finite sample performance of the M‐estimation and bootstrap procedures. An empirical example of financial time series is also provided.     

On k-match problems

Several waiting time random variables for a duplication within a memory window of size k in a sequence of {1,2,…,m}-valued random variables are investigated. The exact distributions of the waiting time random variables are derived by the method of conditional probability generating functions. In particular, the exact distribution of the waiting time for the first k-match is obtained when the underlying sequence is generated by higher order Markov dependent trials. Examples for numerical calculations are also given.     

Asymptotic random extremal ratio and product based on generalized order statistics and its dual

The extremal ratio has been used in several fields, most notably in industrial quality control, life testing, small-area variation analysis, and the classical heterogeneity of variance situation. In many biological, agricultural, military activity problems and in some quality control problems, it is almost impossible to have a fixed sample size, because some observations are always lost for various reasons. Therefore, the sample size itself is considered frequently to be an random variable (rv). Generalized order statistics (GOS) have been introduced as a unifying theme for several models of ascendingly ordered rvs. The concept of dual generalized order statistics (DGOS) is introduced to enable a common approach to descendingly ordered rvs. In this article, the limit dfs are obtained for the extremal ratio and product with random indices under non random normalization based on GOS and DGOS. Moreover, this article considers the conditions under which the cases of random and non random indices give the same asymptotic results. Some illustrative examples are obtained, which lend further support to our theoretical results.