We introduce a new point process, the dynamic contagion process, by generalising the Hawkes process and the Cox process with shot noise intensity. Our process includes both self-excited and externally excited jumps, which could be used to model the dynamic contagion impact from endogenous and exogenous factors of the underlying system. We have systematically analysed the theoretical distributional properties of this new process, based on the piecewise-deterministic Markov process theory developed in Davis (1984), and the extension of the martingale methodology used in Dassios and Jang (2003). The analytic expressions of the Laplace transform of the intensity process and the probability generating function of the point process have been derived. An explicit example of specified jumps with exponential distributions is also given. The object of this study is to produce a general mathematical framework for modelling the dependence structure of arriving events with dynamic contagion, which has the potential to be applicable to a variety of problems in economics, finance, and insurance. We provide an application of this process to credit risk, and a simulation algorithm for further industrial implementation and statistical analysis.

In a fork-join network each incoming job is split into K tasks and the K tasks are simultaneously assigned to K parallel service stations for processing. For the distributions of response times and queue lengths of fork-join networks, no explicit formulae are available. Existing methods provide only analytic approximations for the response time and the queue length distributions. The accuracy of such approximations may be difficult to justify for some complicated fork-join networks. In this paper we propose a perfect simulation method based on coupling from the past to generate exact realisations from the equilibrium of fork-join networks. Using the simulated realisations, Monte Carlo estimates for the distributions of response times and queue lengths of fork-join networks are obtained. Comparisons of Monte Carlo estimates and theoretical approximations are also provided. The efficiency of the sampling algorithm is shown theoretically and via simulation.

A two-dimensional random vector in the domain of attraction of an extreme value distribution G is said to be asymptotically independent (i.e. in the tail) if G is the product of its marginal distribution functions. Ledford and Tawn (1996) discussed a form of residual dependence in this case. In this paper we give a characterization of this phenomenon (see also Ramos and Ledford (2009)), and offer extensions to higher-dimensional spaces and stochastic processes. Systemic risk in the banking system is treated in a similar framework.

Motivated by the pricing of lookback options in exponential Lévy models, we study the difference between the continuous and discrete supremums of Lévy processes. In particular, we extend the results of Broadie, Glasserman and Kou (1999) to jump diffusion models. We also derive bounds for general exponential Lévy models.

We consider a stochastic control model for a queueing system driven by a two-dimensional fractional Brownian motion with Hurst parameter 0 < H < 1. In particular, when H > ½, this model serves to approximate a controlled two-station tandem queueing model with heavy-tailed ON/OFF sources in heavy traffic. We establish the weak convergence results for the distribution of the state process and construct an explicit stationary state process associated with given controls. Based on suitable coupling arguments, we show that each state process couples with its stationary counterpart and we use it to represent the long-run average cost functional in terms of the stationary process. Finally, we establish the existence result of an optimal control, which turns out to be independent of the initial data.

We consider the asymptotic variance of the departure counting process D(t) of the GI/G/1 queue; D(t) denotes the number of departures up to time t. We focus on the case where the system load ϱ equals 1, and prove that the asymptotic variance rate satisfies limt→∞varD(t) / t = λ(1–2/π)(ca2 + cs2), where λ is the arrival rate, and ca2 and cs2 are squared coefficients of variation of the interarrival and service times, respectively. As a consequence, the departures variability has a remarkable singularity in the case in which ϱ equals 1, in line with the BRAVO (balancing reduces asymptotic variance of outputs) effect which was previously encountered in finite-capacity birth-death queues. Under certain technical conditions, our result generalizes to multiserver queues, as well as to queues with more general arrival and service patterns. For the M/M/1 queue, we present an explicit expression of the variance of D(t) for any t.

We consider the problem of estimation in a partially observed discrete-time Galton-Watson branching process, focusing on the first two moments of the offspring distribution. Our study is motivated by modelling the counts of new cases at the onset of a stochastic epidemic, allowing for the facts that only a part of the cases is detected, and that the detection mechanism may affect the evolution of the epidemic. In this setting, the offspring mean is closely related to the spreading potential of the disease, while the second moment is connected to the variability of the mean estimators. Inference for branching processes is known for its nonstandard characteristics, as compared with classical inference. When, in addition, the true process cannot be directly observed, the problem of inference suffers significant further perturbations. We propose nonparametric estimators related to those used when the underlying process is fully observed, but suitably modified to take into account the intricate dependence structure induced by the partial observation and the interaction scheme. We show consistency, derive the limiting laws of the estimators, and construct asymptotic confidence intervals, all valid conditionally on the explosion set.

The modeling of random bi-phasic, or porous, media has been, and still is, under active investigation by mathematicians, physicists, and physicians. In this paper we consider a thresholded random process X as a source of the two phases. The intervals when X is in a given phase, named chords, are the subject of interest. We focus on the study of the tails of the chord length distribution functions. In the literature concerned with real data, different types of tail behavior have been reported, among them exponential-like or power-like decay. We look for the link between the dependence structure of the underlying thresholded process X and the rate of decay of the chord length distribution. When the process X is a stationary Gaussian process, we relate the latter to the rate at which the covariance function of X decays at large lags. We show that exponential, or nearly exponential, decay of the tail of the distribution of the chord lengths is very common, perhaps surprisingly so.

Radix Sort is a sorting algorithm based on analyzing digital data. We study the number of swaps made by Radix Select (a one-sided version of Radix Sort) to find an element with a randomly selected rank. This kind of grand average provides a smoothing over all individual distributions for specific fixed-order statistics. We give an exact analysis for the grand mean and an asymptotic analysis for the grand variance, obtained by poissonization, the Mellin transform, and depoissonization. The digital data model considered is the Bernoulli(p). The distributions involved in the swaps experience a phase change between the biased cases (p ≠ ½) and the unbiased case (p = ½). In the biased cases, the grand distribution for the number of swaps (when suitably scaled) converges to that of a perpetuity built from a two-point distribution. The tool for this proof is contraction in the Wasserstein metric space, and identifying the limit as the fixed-point solution of a distributional equation. In the unbiased case the same scaling for the number of swaps gives a limiting constant in probability.

We propose an approximation for the inverse first passage time problem. It is similar in spirit and method to the tangent approximation for the original first passage time problem. We provide evidence that the technique is quite accurate in many cases. We also identify some cases where the approximation performs poorly.

In the so-called lightbulb process, on days r = 1,…,n, out of n lightbulbs, all initially off, exactly r bulbs, selected uniformly and independent of the past, have their status changed from off to on, or vice versa. With X the number of bulbs on at the terminal time n, an even integer, and μ = n/2, σ2 = var(X), we have supz ∈ R | P((X - μ)/σ ≤ z) - P(Z ≤ z) | ≤ nΔ̅0/2σ2 + 1.64n/σ3 + 2/σ, where Z is a standard normal random variable and Δ̅0 = 1/2√n + 1/2n + e−n/2/3 for n ≥ 6, yielding a bound of order O(n−1/2) as n → ∞. A similar, though slightly larger bound, holds for odd n. The results are shown using a version of Stein's method for bounded, monotone size bias couplings. The argument for even n depends on the construction of a variable Xs on the same space as X that has the X-size bias distribution, that is, which satisfies E[Xg(X)] = μE[g(Xs)] for all bounded continuous g, and for which there exists a B ≥ 0, in this case B = 2, such that X ≤ Xs ≤ X + B almost surely. The argument for odd n is similar to that for even n, but one first couples X closely to V, a symmetrized version of X, for which a size bias coupling of V to Vs can proceed as in the even case. In both the even and odd cases, the crucial calculation of the variance of a conditional expectation requires detailed information on the spectral decomposition of the lightbulb chain.

We consider a feed-forward network with a single-server station serving jobs with multiple levels of priority. The service discipline is preemptive in that the server always serves a job with the current highest level of priority. For this system with discontinuous dynamics, we establish the sample path large deviation principle using a weak convergence argument. In the special case where jobs have two different levels of priority, we also explicitly identify the exponential decay rate of the total population overflow probabilities by examining the geometry of the zero-level sets of the system Hamiltonians.

We consider a branching process with Poissonian immigration where individuals have inheritable types. At rate θ, new individuals singly enter the total population and start a new population which evolves like a supercritical, homogeneous, binary Crump-Mode-Jagers process: individuals have independent and identically distributed lifetime durations (nonnecessarily exponential) during which they give birth independently at a constant rate b. First, using spine decomposition, we relax previously known assumptions required for almost-sure convergence of the total population size. Then, we consider three models of structured populations: either all immigrants have a different type, or types are drawn in a discrete spectrum or in a continuous spectrum. In each model, the vector (P1, P2,…) of relative abundances of surviving families converges almost surely. In the first model, the limit is the GEM distribution with parameter θ / b.

We study optimal control problems for (time-)delayed stochastic differential equations with jumps. We establish sufficient and necessary stochastic maximum principles for an optimal control of such systems. The associated adjoint processes are shown to satisfy a (time-)advanced backward stochastic differential equation (ABSDE). Several results on existence and uniqueness of such ABSDEs are shown. The results are illustrated by an application to optimal consumption from a cash flow with delay.