Juggler's exclusion process describes a system of particles on the positive integers where particles drift down to zero at unit speed. After a particle hits zero, it jumps into a randomly chosen unoccupied site. We model the system as a set-valued Markov process and show that the process is ergodic if the family of jump height distributions is uniformly integrable. In a special case where the particles jump according to a set-avoiding memoryless distribution, the process reaches its equilibrium in finite nonrandom time, and the equilibrium distribution can be represented as a Gibbs measure conforming to a linear gravitational potential.

In this paper we consider optimal stopping problems for a general class of reward functions under matrix-exponential jump-diffusion processes. Given an American call-type reward function in this class, following the averaging problem approach (see, for example, Alili and Kyprianou (2005), Kyprianou and Surya (2005), Novikov and Shiryaev (2007), and Surya (2007)), we give an explicit formula for solutions of the corresponding averaging problem. Based on this explicit formula, we obtain the optimal level and the value function for American call-type optimal stopping problems.

Upper deviation results are obtained for the split time of a supercritical continuous-time Markov branching process. More precisely, we establish the existence of logarithmic limits for the likelihood that the split times of the process are greater than an identified value and determine an expression for the limiting quantity. We also give an estimation for the lower deviation probability of the split times, which shows that the scaling is completely different from the upper deviations.

Let (Xt)0 ≤ t ≤ T be a one-dimensional stochastic process with independent and stationary increments, either in discrete or continuous time. In this paper we consider the problem of stopping the process (Xt) ‘as close as possible’ to its eventual supremum MT := sup0 ≤ t ≤ TXt, when the reward for stopping at time τ ≤ T is a nonincreasing convex function of MT - Xτ. Under fairly general conditions on the process (Xt), it is shown that the optimal stopping time τ takes a trivial form: it is either optimal to stop at time 0 or at time T. For the case of a random walk, the rule τ ≡ T is optimal if the steps of the walk stochastically dominate their opposites, and the rule τ ≡ 0 is optimal if the reverse relationship holds. An analogous result is proved for Lévy processes with finite Lévy measure. The result is then extended to some processes with nonfinite Lévy measure, including stable processes, CGMY processes, and processes whose jump component is of finite variation.

In this paper we introduce a variation on Glaser's method for determining the shape of the failure rate function of a mixture. It has often been seen that the shape of the failure rate depends on the mixing parameter q. Our method provides an explanation for this phenomenon. We then illustrate our technique with the mixture of an exponential and a gamma density for all possible cases.

In this paper, a moderate deviation theorem for one-dimensional stable random walks in random scenery is proved. The proof relies on the analysis of maximum local times of stable random walks, and the comparison of moments between random walks in random scenery and self-intersection local times of the underlying random walks.

The classical secretary problem for selecting the best item is studied when the actual values of the items are observed with noise. One of the main appeals of the secretary problem is that the optimal strategy is able to find the best observation with a nontrivial probability of about 0.37, even when the number of observations is arbitrarily large. The results are strikingly different when the qualities of the secretaries are observed with noise. If there is no noise then the only information that is needed is whether an observation is the best among those already observed. Since the observations are assumed to be independent and identically distributed, the solution to this problem is distribution free. In the case of noisy data, the results are no longer distribution free. Furthermore, we need to know the rank of the noisy observation among those already observed. Finally, the probability of finding the best secretary often goes to 0 as the number of observations, n, goes to ∞. The results heavily depend on the behavior of pn, the probability that the observation that is best among the noisy observations is also best among the noiseless observations. Results involving optimal strategies if all that is available is noisy data are described and examples are given to elucidate the results.

In this paper we determine the distributions of occupation times of a Markov-modulated Brownian motion (MMBM) in separate intervals before a first passage time or an exit from an interval. We derive the distributions in terms of their Laplace transforms, and we also distinguish between occupation times in different phases. For MMBMs with strictly positive variation parameters, we further propose scale functions.

In this paper we propose a class of financial market models which are based on telegraph processes with alternating tendencies and jumps. It is assumed that the jumps have random sizes and that they occur when the tendencies are switching. These models are typically incomplete, but the set of equivalent martingale measures can be described in detail. We provide additional suggestions which permit arbitrage-free option prices as well as hedging strategies to be obtained.

The Markovian arrival process generalizes the Poisson process by allowing for dependent and nonexponential interarrival times. We study the autocorrelation function of the two-state Markovian arrival process. Our findings show that the correlation structure of such a process has a very specific pattern, namely, it always converges geometrically to zero. Moreover, the signs of the autocorrelation coefficients are either constant or alternating.

Consider a random graph where the mean degree is given and fixed. In this paper we derive the maximal size of the largest connected component in the graph. We also study the related question of the largest possible outbreak size of an epidemic occurring ‘on’ the random graph (the graph describing the social structure in the community). More precisely, we look at two different classes of random graphs. First, the Poissonian random graph in which each node i is given an independent and identically distributed (i.i.d.) random weight Xi with E(Xi)=µ, and where there is an edge between i and j with probability 1-e-XiXj/(µ n), independently of other edges. The second model is the thinned configuration model in which the n vertices of the ground graph have i.i.d. ground degrees, distributed as D, with E(D) = µ. The graph of interest is obtained by deleting edges independently with probability 1-p. In both models the fraction of vertices in the largest connected component converges in probability to a constant 1-q, where q depends on X or D and p. We investigate for which distributions X and D with given µ and p, 1-q is maximized. We show that in the class of Poissonian random graphs, X should have all its mass at 0 and one other real, which can be explicitly determined. For the thinned configuration model, D should have all its mass at 0 and two subsequent positive integers.

We consider a multivariate distributional recursion of sum type, as arises in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the Laplace transform. The problem is traced back to the corresponding problem for binary search trees by stochastic domination. The result obtained is applied to the internal path length and Wiener index of random b-ary recursive trees with weighted edges and random linear recursive trees. Finally, lower tail bounds for the Wiener index of these trees are given.

We study the dynamic assignment of cross-trained workers in serial production lines characterized by stochastic process times and inventory buffers between stations. Throughput maximization is the objective. Each worker is trained for a subset of tasks, where emphasis is placed on systems with each worker trained for a zone of stations with stations near the zone boundaries being served (shared) by one or more other workers as well. Using sample path comparisons, we identify structural properties of optimal worker allocation policies. We identify when (i) a worker can prioritize the job in the most downstream station (last-buffer-first-served), and (ii) only the downstream (as opposed to upstream) server should serve a single task.

In this paper we study the distribution of the location, at time t, of a particle moving U time units upwards, V time units downwards, and W time units of no movement (idle). These are repeated cyclically, according to independent alternating renewals. The distributions of U, V, and W are absolutely continuous. The velocities are v = +1 upwards, v = -1 downwards, and v = 0 during idle periods. Let Y+(t), Y−(t), and Y0(t) denote the total time in (0, t) of movements upwards, downwards, and no movements, respectively. The exact distribution of Y+(t) is derived. We also obtain the probability law of X(t) = Y+(t) - Y−(t), which describes the particle's location at time t. Explicit formulae are derived for the cases of exponential distributions with equal rates, with different rates, and with linear rates (leading to damped processes).

Markovian systems with multiple interacting subsystems under the influence of a control unit are considered. The state spaces of the subsystems are countably infinite, whereas that of the control unit is finite. A recent infinite level-dependent quasi-birth-and-death model for such systems is extended by facilitating the automatic representation and generation of the nonzero blocks in its underlying infinitesimal generator matrix with sums of Kronecker products. Experiments are performed on systems of stochastic chemical kinetics having two or more countably infinite state space subsystems. Results indicate that, even though more memory is consumed, there are many cases where a matrix-analytic solution coupled with Lyapunov theory yields a faster and more accurate steady-state measure compared to that obtained with simulation.

Tankov (2011) improved the Fréchet bounds for a bivariate copula when its values on a compact subset of [0, 1]2 are given. He showed that the best possible bounds are quasi-copulas and gave a sufficient condition for these bounds to be copulas. In this note we give weaker sufficient conditions to ensure that the bounds are copulas. We also show how this can be useful in portfolio selection. It turns out that finding a copula as a lower bound plays a key role in determining optimal investment strategies explicitly for investors with some type of state-dependent constraints.

The Asmussen–Kroese Monte Carlo estimators of P(Sn > u) and P(SN > u) are known to work well in rare event settings, where SN is the sum of independent, identically distributed heavy-tailed random variables X1,…,XN and N is a nonnegative, integer-valued random variable independent of the Xi. In this paper we show how to improve the Asmussen–Kroese estimators of both probabilities when the Xi are nonnegative. We also apply our ideas to estimate the quantity E[(SN-u)+].

A widely used model of carcinogenesis assumes that cells must go through a process of acquiring several mutations before they become cancerous. This implies that at any time there will be several populations of cells at different stages of mutation. In this paper we give exact expressions for the expectations and variances of the number of cells in each stage of such a stochastic multistage cancer model.

In this paper we deal with an M/G/1 vacation system with the sojourn time (wait plus service) limit and two typical vacation rules, i.e. multiple and single vacation rules. Using the level crossing approach, we derive recursive equations for the steady-state distributions of the virtual waiting times in M/G/1 vacation systems with a general vacation time and two vacation rules.