In the paper, we study general Markovian models of loss systems with random resource requirements, in which customers at arrival occupy random quantities of various resources and release them at departure. Customers may request negative quantities of resources, but total amount of resources allocated to customers should be nonnegative and cannot exceed predefined maximum levels. Allocating a negative volume of a resource to a customer leads to a temporary increase in its volume in the system. We derive necessary and sufficient conditions for the product-form of the stationary probability distribution of the Markov jump process describing the system.

In light of recent empirical research on jump activity, this article study the calibration of a new class of stochastic volatility models that include both jumps in return and volatility. Specifically, we consider correlated jump sizes and both contemporaneous and independent arrival of jumps in return and volatility. Based on the specifications of this model, we derive a closed-form relationship between the VIX index and latent volatility. Also, we propose a closed-form logarithmic likelihood formula by using the link to the VIX index. By estimating alternative models, we find that the general counting processes setting lead to better capturing of return jump behaviors. That is, the part where the return and volatility jump simultaneously and the part that jump independently can both be captured. In addition, the size of the jumps in volatility is, on average, positive for both contemporaneous and independent arrivals. However, contemporaneous jumps in the return are negative, but independent return jumps are positive. The sub-period analysis further supports above insight, and we find that the jumps in return and volatility increased significantly during the two recent economic crises.

We show that the kth order statistic from a heterogeneous sample of n ≥ k exponential random variables is larger than that from a homogeneous exponential sample in the sense of star ordering, as conjectured by Xu and Balakrishnan [14]. As a consequence, we establish hazard rate ordering for order statistics between heterogeneous and homogeneous exponential samples, resolving an open problem of Pǎltǎnea [11]. Extensions to general spacings are also presented.

This paper probabilistically explores a class of stationary count time series models built by superpositioning (or otherwise combining) independent copies of a binary stationary sequence of zeroes and ones. Superpositioning methods have proven useful in devising stationary count time series having prespecified marginal distributions. Here, basic properties of this model class are established and the idea is further developed. Specifically, stationary series with binomial, Poisson, negative binomial, discrete uniform, and multinomial marginal distributions are constructed; other marginal distributions are possible. Our primary goal is to derive the autocovariance function of the resulting series.

We introduce a Markov queueing system with Poisson arrivals, exponential services, and jockeying between two parallel and equivalent servers. An arriving customer admits to the shortest line. Every transition, of only the last customer in line, from the longer line to the shorter line may accompanied by a certain fixed cost. Thus, a transition from the longer queue to the shorter queue occurs whenever the difference between the lines reaches a certain discrete threshold (d = 2, 3, …). In this study, we focus on the stochastic analysis of the number of transitions of an arbitrary customer.

Two main methods are used to solve continuous-time quasi birth-and-death processes: matrix geometric (MG) and probability generating functions (PGFs). MG requires a numerical solution (via successive substitutions) of a matrix quadratic equation A0 + RA1 + R2A2 = 0. PGFs involve a row vector $\vec{G}(z)$ of unknown generating functions satisfying $H(z)\vec{G}{(z)^\textrm{T}} = \vec{b}{(z)^\textrm{T}},$ where the row vector $\vec{b}(z)$ contains unknown “boundary” probabilities calculated as functions of roots of the matrix H(z). We show that: (a) H(z) and $\vec{b}(z)$ can be explicitly expressed in terms of the triple A0, A1, and A2; (b) when each matrix of the triple is lower (or upper) triangular, then (i) R can be explicitly expressed in terms of roots of $\det [H(z)]$; and (ii) the stability condition is readily extracted.

This article considers the interval availability and instant availability of the k-system. A certain relationship between the two types of availability is established. Some lower and upper bounds to interval availability are derived. It also provides a couple of conditions under which the availability of two systems can be compared. Several examples are given to show the complexity of comparisons of availability.

Dielectric breakdown in a thin oxide is presented in terms of an interacting particle system on a two-dimensional lattice. All edges in the system are initially assumed to be closed. An edge between two adjacent vertices will open according to an exponentially distributed random variable. Breakdown occurs at the time an open path connects the top layer of the lattice to the bottom layer. Using the extreme value theory, we show that the time until breakdown is asymptotically Weibull distributed.

This paper deals with stochastic comparisons of the largest order statistics arising from two sets of independent and heterogeneous gamma samples. It is shown that the weak supermajorization order between the vectors of scale parameters together with the weak submajorization order between the vectors of shape parameters imply the reversed hazard rate ordering between the corresponding maximum order statistics. We also establish sufficient conditions of the usual stochastic ordering in terms of the p-larger order between the vectors of scale parameters and the weak submajorization order between the vectors of shape parameters. Numerical examples and applications in auction theory and reliability engineering are provided to illustrate these results.

In this paper, the problem of goodness of fit test for the inverse Rayleigh distribution based on progressively Type-II censored samples is studied. We develop two test statistics via entropy and propose one new non-entropy test statistic via a pivotal method. We also study the properties of these test statistics. Critical values are obtained by simulations. Then, we do power analysis of these test statistics against various alternatives under different censoring schemes. We conclude that the tests we proposed perform well against various alternatives, especially for non-monotone hazard alternatives. Finally, one real data set is analyzed.

This paper presents the distribution of the number of customers served during a busy period for special cases of the Geo/G/1 queue when initiated with m customers. We analyze the system under the assumptions of a late arrival system with delayed access and early arrival system policies. It is not easy to invert the functional equation for the number of customers served during a busy period except for the simple case Geo/Geo/1 queue, as stated by several researchers. Using the Lagrange inversion theorem, we give an elegant solution to this equation. We find the distribution of the number of customers served during a busy period for various service-time distributions such as geometric, deterministic, binomial, negative binomial, uniform, Delaporte, discrete phase-type and interrupted Bernoulli process. We compute the mean and variance of these distributions and also give numerical results. Due to the clarity of the expressions, the computations are very fast and robust. We also show that in the limiting case, the results tend to the analogous continuous-time counterparts.

Reliability theory and survival analysis, the residual entropy is known as a measure suitable to describe the dynamic information content in stochastic systems conditional on survival. Aiming to analyze the variability of such information content, in this paper we introduce the variance of the residual lifetimes, “residual varentropy” in short. After a theoretical investigation of some properties of the residual varentropy, we illustrate certain applications related to the proportional hazards model and the first-passage times of an Ornstein–Uhlenbeck jump-diffusion process.

We discuss a new stochastic ordering for the sequence of independent random variables. It generalizes the stochastic precedence (SP) order that is defined for two random variables to the case n > 2. All conventional stochastic orders are transitive, whereas the SP order is not. Therefore, a new approach to compare the sequence of random variables had to be developed that resulted in the notion of the sequential precedence order. A sufficient condition for this order is derived and some examples are considered.

Markov processes play an important role in reliability analysis and particularly in modeling the stochastic evolution of survival/failure behavior of systems. The probability law of Markov processes is described by its generator or the transition rate matrix. In this paper, we suppose that the process is doubly stochastic in the sense that the generator is also stochastic. In our model, we suppose that the entries in the generator change with respect to the changing states of yet another Markov process. This process represents the random environment that the stochastic model operates in. In fact, we have a Markov modulated Markov process which can be modeled as a bivariate Markov process that can be analyzed probabilistically using Markovian analysis. In this setting, however, we are interested in Bayesian inference on model parameters. We present a computationally tractable approach using Gibbs sampling and demonstrate it by numerical illustrations. We also discuss cases that involve complete and partial data sets on both processes.

Consider a regenerative storage process with a nondecreasing Lévy input (subordinator) such that every cycle may be split into two periods. In the first (off), the output is shut off and the workload accumulates. This continues until some stopping time. In the second (on), the process evolves like a subordinator minus a positive drift (output rate) until it hits the origin. In addition, we assume that the output rate of every on period is a random variable, which is determined at the beginning of this period. For example, at each period, the output rate may depend on the workload level at the beginning of the corresponding busy period. We derive the Laplace–Stieltjes transform of the steady-state distribution of the workload process and then apply this result to solve a steady-state cost minimization problem with holding, setup and output capacity costs. It is shown that the optimal output rate is a nondecreasing deterministic function of the workload level at the beginning of the corresponding on period.