Let X be an Ornstein–Uhlenbeck process driven by a Brownian motion. We propose an expression for the joint density / distribution function of the process and its running supremum. This law is expressed as an expansion involving parabolic cylinder functions. Numerically, we obtain this law faster with our expression than with a Monte Carlo method. Numerical applications illustrate the interest of this result.

Hermite processes are a class of self-similar processes with stationary increments. They often arise in limit theorems under long-range dependence. We derive new representations of Hermite processes with multiple Wiener–Itô integrals, whose integrands involve the local time of intersecting stationary stable regenerative sets. The proof relies on an approximation of regenerative sets and local times based on a scheme of random interval covering.

In this paper the behaviour of the failure rate and reversed failure rate of an n-component coherent system is studied, where it is assumed that the lifetimes of the components are independent and have a common cumulative distribution function F. Sufficient conditions are provided under which the system failure rate is increasing and the corresponding reversed failure rate is decreasing. We also study the stochastic and ageing properties of doubly truncated random variables for coherent systems.

Branching processes $(Z_n)_{n \ge 0}$ in a varying environment generalize the Galton–Watson process, in that they allow time dependence of the offspring distribution. Our main results concern general criteria for almost sure extinction, square integrability of the martingale $(Z_n/\mathrm E[Z_n])_{n \ge 0}$, properties of the martingale limit W and a Yaglom-type result stating convergence to an exponential limit distribution of the suitably normalized population size $Z_n$, conditioned on the event $Z_n \gt 0$. The theorems generalize/unify diverse results from the literature and lead to a classification of the processes.

We show that a point process of hard spheres exhibits long-range orientational order. This process is designed to be a random perturbation of a three-dimensional lattice that satisfies a specific rigidity property; examples include the FCC and HCP lattices. We also define two-dimensional near-lattice processes by local geometry-dependent hard disk conditions. Earlier results about the existence of long-range orientational order carry over, and we obtain the existence of infinite-volume measures on two-dimensional point configurations that turn out to follow the orientation of a fixed triangular lattice arbitrarily closely.

We explore the first passage problem for sticky reflecting diffusion processes with double exponential jumps. The joint Laplace transform of the first passage time to an upper level and the corresponding overshoot is studied. In particular, explicit solutions are presented when the diffusion part is driven by a drifted Brownian motion and by an Ornstein–Uhlenbeck process.

We consider a supercritical branching Lévy process on the real line. Under mild moment assumptions on the number of offspring and their displacements, we prove a second-order limit theorem on the empirical mean position.

We introduce a class of non-uniform random recursive trees grown with an attachment preference for young age. Via the Chen–Stein method of Poisson approximation, we find that the outdegree of a node is characterized in the limit by ‘perturbed’ Poisson laws, and the perturbation diminishes as the node index increases. As the perturbation is attenuated, a pure Poisson limit ultimately emerges in later phases. Moreover, we derive asymptotics for the proportion of leaves and show that the limiting fraction is less than one half. Finally, we study the insertion depth in a random tree in this class. For the insertion depth, we find the exact probability distribution, involving Stirling numbers, and consequently we find the exact and asymptotic mean and variance. Under appropriate normalization, we derive a concentration law and a limiting normal distribution. Some of these results contrast with their counterparts in the uniform attachment model, and some are similar.

We study a class of load-balancing algorithms for many-server systems (N servers). Each server has a buffer of size $b-1$ with $b=O(\sqrt{\log N})$, i.e. a server can have at most one job in service and $b-1$ jobs queued. We focus on the steady-state performance of load-balancing algorithms in the heavy traffic regime such that the load of the system is $\lambda = 1 - \gamma N^{-\alpha}$ for $0<\alpha<0.5$ and $\gamma > 0,$ which we call the sub-Halfin–Whitt regime ($\alpha=0.5$ is the so-called Halfin–Whitt regime). We establish a sufficient condition under which the probability that an incoming job is routed to an idle server is 1 asymptotically (as $N \to \infty$) at steady state. The class of load-balancing algorithms that satisfy the condition includes join-the-shortest-queue, idle-one-first, join-the-idle-queue, and power-of-d-choices with $d\geq \frac{r}{\gamma}N^\alpha\log N$ (r a positive integer). The proof of the main result is based on the framework of Stein’s method. A key contribution is to use a simple generator approximation based on state space collapse.

We study a stationary Gibbs particle process with deterministically bounded particles on Euclidean space defined in terms of an activity parameter and non-negative interaction potentials of finite range. Using disagreement percolation, we prove exponential decay of the correlation functions, provided a dominating Boolean model is subcritical. We also prove this property for the weighted moments of a U-statistic of the process. Under the assumption of a suitable lower bound on the variance, this implies a central limit theorem for such U-statistics of the Gibbs particle process. A by-product of our approach is a new uniqueness result for Gibbs particle processes.

We introduce a multivariate class of distributions with support I, a k-orthotope in $[0,\infty)^{k}$ , which is dense in the set of all k-dimensional distributions with support I. We call this new class ‘multivariate finite-support phase-type distributions’ (MFSPH). Though we generally define MFSPH distributions on any finite k-orthotope in $[0,\infty)^{k}$ , here we mainly deal with MFSPH distributions with support $[0,1)^{k}$ . The distribution function of an MFSPH variate is computed by using that of a variate in the MPH $^{*} $ class, the multivariate class of distributions introduced by Kulkarni (1989). The marginal distributions of MFSPH variates are found as FSPH distributions, the class studied by Ramaswami and Viswanath (2014). Some properties, including the mixture property, of MFSPH distributions are established. Estimates of the parameters of a particular class of bivariate finite-support phase-type distributions are found by using the expectation-maximization algorithm. Simulated samples are used to demonstrate how this class could be used as approximations for bivariate finite-support distributions.

A critical branching process with immigration which evolves in a random environment is considered. Assuming that immigration is not allowed when there are no individuals in the population, we investigate the tail distribution of the so-called life period of the process, i.e. the length of the time interval between the moment when the process is initiated by a positive number of particles and the moment when there are no individuals in the population for the first time.

The ruin probability in the classical Brownian risk model can be explicitly calculated for both finite and infinite time horizon. This is not the case for the simultaneous ruin probability in the two-dimensional Brownian risk model. Relying on asymptotic theory, we derive in this contribution approximations for both simultaneous ruin probability and simultaneous ruin time for the two-dimensional Brownian risk model when the initial capital increases to infinity.

A set of data with positive values follows a Pareto distribution if the log–log plot of value versus rank is approximately a straight line. A Pareto distribution satisfies Zipf’s law if the log–log plot has a slope of $-1$. Since many types of ranked data follow Zipf’s law, it is considered a form of universality. We propose a mathematical explanation for this phenomenon based on Atlas models and first-order models, systems of strictly positive continuous semimartingales with parameters that depend only on rank. We show that the stationary distribution of an Atlas model will follow Zipf’s law if and only if two natural conditions, conservation and completeness, are satisfied. Since Atlas models and first-order models can be constructed to approximate systems of time-dependent rank-based data, our results can explain the universality of Zipf’s law for such systems. However, ranked data generated by other means may follow non-Zipfian Pareto distributions. Hence, our results explain why Zipf’s law holds for word frequency, firm size, household wealth, and city size, while it does not hold for earthquake magnitude, cumulative book sales, and the intensity of wars, all of which follow non-Zipfian Pareto distributions.

In this paper we study first passage percolation on a random graph model, the configuration model. We first introduce the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two vertices in the graph, and the flooding time, which represents the time (weighted length) needed to reach all the vertices in the graph starting from a uniformly chosen vertex. Our result consists in describing the asymptotic behavior of the diameter and the flooding time, as the number of vertices n tends to infinity, in the case where the weight distribution G has an exponential tail behavior, and proving that this category of distributions is the largest possible for which the asymptotic behavior holds.

By a random process with immigration at random times we mean a shot noise process with a random response function (response process) in which shots occur at arbitrary random times. Such random processes generalize random processes with immigration at the epochs of a renewal process which were introduced in Iksanov et al. (2017) and bear a strong resemblance to a random characteristic in general branching processes and the counting process in a fixed generation of a branching random walk generated by a general point process. We provide sufficient conditions which ensure weak convergence of finite-dimensional distributions of these processes to certain Gaussian processes. Our main result is specialised to several particular instances of random times and response processes.

In a classical, continuous-time, optimal stopping problem, the agent chooses the best time to stop a stochastic process in order to maximise the expected discounted return. The agent can choose when to stop, and if at any moment they decide to stop, stopping occurs immediately with probability one. However, in many settings this is an idealistic oversimplification. Following Strack and Viefers we consider a modification of the problem in which stopping occurs at a rate which depends on the relative values of stopping and continuing: there are several different solutions depending on how the value of continuing is calculated. Initially we consider the case where stopping opportunities are constrained to be event times of an independent Poisson process. Motivated by the limiting case as the rate of the Poisson process increases to infinity, we also propose a continuous-time formulation of the problem where stopping can occur at any instant.

We investigate the long-time behavior of the Ornstein–Uhlenbeck process driven by Lévy noise with regime switching. We provide explicit criteria on the transience and recurrence of this process. Contrasted with the Ornstein–Uhlenbeck process driven simply by Brownian motion, whose stationary distribution must be light-tailed, both the jumps caused by the Lévy noise and the regime switching described by a Markov chain can derive the heavy-tailed property of the stationary distribution. The different role played by the Lévy measure and the regime-switching process is clearly characterized.

This work proposes and analyzes a family of spatially inhomogeneous epidemic models. This is our first effort to use stochastic partial differential equations (SPDEs) to model epidemic dynamics with spatial variations and environmental noise. After setting up the problem, the existence and uniqueness of solutions of the underlying SPDEs are examined. Then, definitions of permanence and extinction are given, and certain sufficient conditions are provided for permanence and extinction. Our hope is that this paper will open up windows for investigation of epidemic models from a new angle.

Matérn hard-core processes are classical examples for point processes obtained by dependent thinning of (marked) Poisson point processes. We present a generalization of the Matérn models which encompasses recent extensions of the original Matérn hard-core processes. It generalizes the underlying point process, the thinning rule, and the marks attached to the original process. Based on our model, we introduce processes with a clear interpretation in the context of max-stable processes. In particular, we prove that one of these processes lies in the max-domain of attraction of a mixed moving maxima process.