In this paper we consider an inventory system with increasing concave ordering cost and average cost optimization criterion. The demand process is modeled as a Brownian motion. Porteus (1971) studied a discrete-time version of this problem and under the strong condition that the demand distribution belongs to the class of densities that are finite convolutions of uniform and/or exponential densities (note that normal density does not belong to this class), an optimal control policy is a generalized (s, S) policy consisting of a sequence of (s_i, S_i). Using a lower bound approach, we show that an optimal control policy for the Brownian inventory model is determined by a single pair (s, S).

As a class of optimal stopping problems with monotone thresholds, we define the candidate-choice problem (CCP) and derive two formulae for calculating its expected payoff. We apply the first formula to a particular CCP, i.e. the best-choice duration problem treated by Ferguson et al. (1992). The recall case is also examined as a comparison. We also derive the distribution of the stopping time of the CCP and find, as a by-product, that the best-choice problem has a remarkable feature in that the optimal probability of choosing the best is just the expected value of the (proportional) stopping time. The similarity between the best-choice duration problem and the best-choice problem with uniform freeze studied by Samuel-Cahn (1996) is recognized.

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before him/her have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed customers in the system, and the number of customers in service at time t are obtained in closed form. Distributions of the sojourn times and departure delays of customers are also obtained explicitly. Both transient and steady state solutions are derived first for Poisson arrivals, and then extended to cases with batch Poisson and non\-stationary Poisson arrival processes. Finally, we report several stochastic ordering results on how system performance measures are affected by arrival and service processes.

Predictability of revenue and costs to both operators and users is critical for payment schemes. We study the issue of the design of payment schemes in networks with bandwidth sharing. The model we consider is a processor sharing system that is accessed by various classes of users with different processing requirements or file sizes. The users are charged according to a Vickrey-Clarke-Groves mechanism because of its efficiency and fairness when logarithmic utility functions are involved. Subject to a given mean revenue for the operator, we study whether it is preferable for a user to pay upon arrival, depending on the congestion level, or whether the user should opt to pay at the end. This leads to a study of the volatility of payment schemes and we show that opting for prepayment is preferable from a user point of view. The analysis yields new results on the asymptotic behavior of conditional response times for processor sharing systems and connections to associated orthogonal polynomials.

In this paper we give an extension of the results of the generalized waiting time problem given by El-Desouky and Hussen (1990). An urn contains m types of balls of unequal numbers, and balls are drawn with replacement until first duplication. In the case of finite memory of order k, let n_i be the number of type i, i = 1, 2, . . ., m. The probability of success p_i = n_i / N, i = 1, 2, . . ., m, where n_i is a positive integer and N = ∑_i=1^mn_i. Let Y_m,k be the number of drawings required until first duplication. We obtain some new expressions of the probability function, in terms of Stirling numbers, symmetric polynomials, and generalized harmonic numbers. Moreover, some special cases are investigated. Finally, some important new combinatorial identities are obtained.

In this paper we consider an M/M/c queue modified to allow both mass arrivals when the system is empty and the workload to be removed. Properties of queues which terminate when the server becomes idle are firstly developed. Recurrence properties, equilibrium distribution, and equilibrium queue-size structure are studied for the case of resurrection and no mass exodus. All of these results are then generalized to allow for the removal of the entire workload. In particular, we obtain the Laplace transformation of the transition probability for the absorptive M/M/c queue.

The Ginibre point process (GPP) is one of the main examples of determinantal point processes on the complex plane. It is a recurring distribution of random matrix theory as well as a useful model in applied mathematics. In this paper we briefly overview the usual methods for the simulation of the GPP. Then we introduce a modified version of the GPP which constitutes a determinantal point process more suited for certain applications, and we detail its simulation. This modified GPP has the property of having a fixed number of points and having its support on a compact subset of the plane. See Decreusefond et al. (2013) for an extended version of this paper.

Superposition is a mapping on point configurations that sends the n-tuple (x₁, . . ., x_n) ∈ Xⁿ into the n-point configuration {x₁, . . ., x_n} ⊂ X, counted with multiplicity. It is an additive set operation such that the superposition of a k-point configuration in Xⁿ is a kn-point configuration in X. A Poisson superposition process is the superposition in X of a Poisson process in the space of finite-length X-valued sequences. From properties of Poisson processes as well as some algebraic properties of formal power series, we obtain an explicit expression for the Janossy measure of Poisson superposition processes, and we study their law under domain restriction. Examples of well-known Poisson superposition processes include compound Poisson, negative binomial, and permanental (boson) processes.

In this paper we consider point processes N^f(t), t > 0, with independent increments and integer-valued jumps whose distribution is expressed in terms of Bernštein functions f with Lévy measure ν. We obtain the general expression of the probability generating functions G^f of N^f, the equations governing the state probabilities p_k^f of N^f, and their corresponding explicit forms. We also give the distribution of the first-passage times T_k^f of N^f, and the related governing equation. We study in detail the cases of the fractional Poisson process, the relativistic Poisson process, and the gamma-Poisson process whose state probabilities have the form of a negative binomial. The distribution of the times τ_j^l_j of jumps with height l_j (∑_j=1^rl_j = k) under the condition N(t) = k for all these special processes is investigated in detail.

We present some correlated fractional counting processes on a finite-time interval. This will be done by considering a slight generalization of the processes in Borges et al. (2012). The main case concerns a class of space-time fractional Poisson processes and, when the correlation parameter is equal to 0, the univariate distributions coincide with those of the space-time fractional Poisson process in Orsingher and Polito (2012). On the one hand, when we consider the time fractional Poisson process, the multivariate finite-dimensional distributions are different from those presented for the renewal process in Politi et al. (2011). We also consider a case concerning a class of fractional negative binomial processes.

We give an account of the characteristics that result from reflecting a drifting local martingale (i.e. the sum of a local martingale and a multiple of its quadratic variation process) in 0 and b > 0. We present conditions which guarantee the existence of finite moments of what is required to keep the reflected process within its boundaries. Also, we derive an associated law of large numbers and a central limit theorem which apply when the input is continuous. Similar results for integrals of the paths of the reflected process are also presented. These results are in close agreement to what has previously been shown for Brownian motion.

We develop a new Monte Carlo variance reduction method to estimate the expectation of two commonly encountered path-dependent functionals: first-passage times and occupation times of sets. The method is based on a recursive approximation of the first-passage time probability and expected occupation time of sets of a Lévy bridge process that relies in part on a randomisation of the time parameter. We establish this recursion for general Lévy processes and derive its explicit form for mixed-exponential jump-diffusions, a dense subclass (in the sense of weak approximation) of Lévy processes, which includes Brownian motion with drift, Kou's double-exponential model, and hyper-exponential jump-diffusion models. We present a highly accurate numerical realisation and derive error estimates. By way of illustration the method is applied to the valuation of range accruals and barrier options under exponential Lévy models and Bates-type stochastic volatility models with exponential jumps. Compared with standard Monte Carlo methods, we find that the method is significantly more efficient.

Shot-noise processes are used in applied probability to model a variety of physical systems in, for example, teletraffic theory, insurance and risk theory, and in the engineering sciences. In this paper we prove a large deviation principle for the sample-paths of a general class of multidimensional state-dependent Poisson shot-noise processes. The result covers previously known large deviation results for one-dimensional state-independent shot-noise processes with light tails. We use the weak convergence approach to large deviations, which reduces the proof to establishing the appropriate convergence of certain controlled versions of the original processes together with relevant results on existence and uniqueness.

We consider a stochastic evolutionary model for a phenotype developing amongst n related species with unknown phylogeny. The unknown tree is modelled by a Yule process conditioned on n contemporary nodes. The trait value is assumed to evolve along lineages as an Ornstein-Uhlenbeck process. As a result, the trait values of the n species form a sample with dependent observations. We establish three limit theorems for the sample mean corresponding to three domains for the adaptation rate. In the case of fast adaptation, we show that for large n the normalized sample mean is approximately normally distributed. Using these limit theorems, we develop novel confidence interval formulae for the optimal trait value.

Let f be an integrable function on an infinite measure space (S, S, π). We show that if a regenerative sequence {X_n}_n≥0 with canonical measure π could be generated then a consistent estimator of λ ≡ ∫_Sfdπ can be produced. We further show that under appropriate second moment conditions, a confidence interval for λ can also be derived. This is illustrated with estimating countable sums and integrals with respect to absolutely continuous measures on R^d using a simple symmetric random walk on Z.

It is well known that the central limit theorem holds for partial sums of a stationary sequence (X_i) of m-dependent random variables with finite variance; however, the limit may be degenerate with variance 0 even if var(X_i) ≠ 0. We show that this happens only in the case when X_i - EX_i = Y_i - Y_i-1 for an (m - 1)-dependent stationary sequence (Y_i) with finite variance (a result implicit in earlier results), and give a version for block factors. This yields a simple criterion that is a sufficient condition for the limit not to be degenerate. Two applications to subtree counts in random trees are given.

Given two absolutely continuous nonnegative independent random variables, we define the reversed relevation transform as dual to the relevation transform. We first apply such transforms to the lifetimes of the components of parallel and series systems under suitably proportionality assumptions on the hazard rates. Furthermore, we prove that the (reversed) relevation transform is commutative if and only if the proportional (reversed) hazard rate model holds. By repeated application of the reversed relevation transform we construct a decreasing sequence of random variables which leads to new weighted probability densities. We obtain various relations involving ageing notions and stochastic orders. We also exploit the connection of such a sequence to the cumulative entropy and to an operator that is dual to the Dickson-Hipp operator. Iterative formulae for computing the mean and the cumulative entropy of the random variables of the sequence are finally investigated.

We analyze copulas with a nontrivial singular component by using their Markov kernel representation. In particular, we provide existence results for copulas with a prescribed singular component. The constructions not only help to deal with problems related to multivariate stochastic systems of lifetimes when joint defaults can occur with a nonzero probability, but even provide a copula maximizing the probability of joint default.

We have found a mistake in the proofs of Navarro (2008, Theorem 2.3(b) and 2.3(c)) due to misapplication of properties of hazard rate and likelihood ratio orders. In this paper we show with an example that the stated results do not hold. This example is interesting since it proves some unexpected properties for these orderings under the formation of coherent systems. The result stated in Navarro (2008, Theorem 2.3(a)) for the usual stochastic order is correct.

In an optimal variance stopping problem the goal is to determine the stopping time at which the variance of a sequentially observed stochastic process is maximized. A solution method for such a problem has been recently provided by Pedersen (2011). Using the methodology developed by Pedersen and Peskir (2012), our aim is to show that the solution to the initial problem can be equivalently obtained by constraining the variance stopping problem to the expected size of the stopped process and then by maximizing the solution to the latter problem over all the admissible constraints. An application to a diffusion process used for modeling the dynamics of interest rates illustrates the proposed technique.

We give an exponential tail approximation for the extinction time of a subcritical multitype branching process arising from the SIR epidemic model on a random graph with given degrees, where the type corresponds to the vertex degree. As a corollary we obtain a Gumbel limit law for the extinction time, when beginning with a large population. Our contribution is to allow countably many types (this corresponds to unbounded degrees in the random graph epidemic model, as the number of vertices tends to ∞). We only require a second moment for the offspring-type distribution featuring in our model.