We formulate a centrally planned portfolio selection problem with the investor and the manager having S-shaped utilities under a recently popular first-loss contract. We solve for the closed-form optimal portfolio, which shows that a first-loss contract can sometimes behave like an option contract. We propose an asymptotic approach to investigate the portfolio. This approach can be adopted to illustrate economic insights, including the fact that the portfolio under a convex contract becomes more conservative when the market state is better. Furthermore, we discover a means of Pareto improvement by simultaneously considering the investor’s utility and increasing the manager’s incentive rate. This is achieved by establishing the collection of Pareto points of a single contract, proving that it is a strictly decreasing and strictly concave frontier, and comparing the Pareto frontiers of different contracts. These results may be helpful for the illustration of risk choices and the design of Pareto-optimal contracts.

We study homogenization for a class of non-symmetric pure jump Feller processes. The jump intensity involves periodic and aperiodic constituents, as well as oscillating and non-oscillating constituents. This means that the noise can come both from the underlying periodic medium and from external environments, and is allowed to have different scales. It turns out that the Feller process converges in distribution, as the scaling parameter goes to zero, to a Lévy process. As special cases of our result, some homogenization problems studied in previous works can be recovered. We also generalize the approach to the homogenization of symmetric stable-like processes with variable order. Moreover, we present some numerical experiments to demonstrate the usage of our homogenization results in the numerical approximation of first exit times.

There has been substantial interest in developing Markov chain Monte Carlo algorithms based on piecewise deterministic Markov processes. However, existing algorithms can only be used if the target distribution of interest is differentiable everywhere. The key to adapting these algorithms so that they can sample from densities with discontinuities is to define appropriate dynamics for the process when it hits a discontinuity. We present a simple condition for the transition of the process at a discontinuity which can be used to extend any existing sampler for smooth densities, and give specific choices for this transition which work with popular algorithms such as the bouncy particle sampler, the coordinate sampler, and the zigzag process. Our theoretical results extend and make rigorous arguments that have been presented previously, for instance constructing samplers for continuous densities restricted to a bounded domain, and we present a version of the zigzag process that can work in such a scenario. Our novel approach to deriving the invariant distribution of a piecewise deterministic Markov process with boundaries may be of independent interest.

The purpose of this study is to present a subgeometric convergence formula for the stationary distribution of the finite-level M/G/1-type Markov chain when taking its infinite-level limit, where the upper boundary level goes to infinity. This study is carried out using the fundamental deviation matrix, which is a block-decomposition-friendly solution to the Poisson equation of the deviation matrix. The fundamental deviation matrix provides a difference formula for the respective stationary distributions of the finite-level chain and the corresponding infinite-level chain. The difference formula plays a crucial role in the derivation of the main result of this paper, and the main result is used, for example, to derive an asymptotic formula for the loss probability in the MAP/GI/1/N queue.

We study the large-volume asymptotics of the sum of power-weighted edge lengths $\sum_{e \in E}|e|^\alpha$ in Poisson-based spatial random networks. In the regime $\alpha > d$, we provide a set of sufficient conditions under which the upper-large-deviation asymptotics are characterized by a condensation phenomenon, meaning that the excess is caused by a negligible portion of Poisson points. Moreover, the rate function can be expressed through a concrete optimization problem. This framework encompasses in particular directed, bidirected, and undirected variants of the k-nearest-neighbor graph, as well as suitable $\beta$-skeletons.

We consider an SIR (susceptible $\to$ infective $\to$ recovered) epidemic in a closed population of size n, in which infection spreads via mixing events, comprising individuals chosen uniformly at random from the population, which occur at the points of a Poisson process. This contrasts sharply with most epidemic models, in which infection is spread purely by pairwise interaction. A sequence of epidemic processes, indexed by n, and an approximating branching process are constructed on a common probability space via embedded random walks. We show that under suitable conditions the process of infectives in the epidemic process converges almost surely to the branching process. This leads to a threshold theorem for the epidemic process, where a major outbreak is defined as one that infects at least $\log n$ individuals. We show further that there exists $\delta \gt 0$, depending on the model parameters, such that the probability that a major outbreak has size at least $\delta n$ tends to one as $n \to \infty$.

Expectiles have received increasing attention as a risk measure in risk management because of their coherency and elicitability at the level $\alpha\geq1/2$. With a view to practical risk assessments, this paper delves into the worst-case expectile, where only partial information on the underlying distribution is available and there is no closed-form representation. We explore the asymptotic behavior of the worst-case expectile on two specified ambiguity sets: one is through the Wasserstein distance from a reference distribution and transforms this problem into a convex optimization problem via the well-known Kusuoka representation, and the other is induced by higher moment constraints. We obtain precise results in some special cases; nevertheless, there are no unified closed-form solutions. We aim to fully characterize the extreme behaviors; that is, we pursue an approximate solution as the level $\alpha $ tends to 1, which is aesthetically pleasing. As an application of our technique, we investigate the ambiguity set induced by higher moment conditions. Finally, we compare our worst-case expectile approach with a more conservative method based on stochastic order, which is referred to as ‘model aggregation’.

We consider linear preferential attachment trees with additive fitness, where fitness is the random initial vertex attractiveness. We show that when the fitnesses are independent and identically distributed and have positive bounded support, the local weak limit can be constructed using a sequence of mixed Poisson point processes. We also provide a rate of convergence for the total variation distance between the r-neighbourhoods of a uniformly chosen vertex in the preferential attachment tree and the root vertex of the local weak limit. The proof uses a Pólya urn representation of the model, for which we give new estimates for the beta and product beta variables in its construction. As applications, we obtain limiting results and convergence rates for the degrees of the uniformly chosen vertex and its ancestors, where the latter are the vertices that are on the path between the uniformly chosen vertex and the initial vertex.

Continuous-time Markov chains are frequently used to model the stochastic dynamics of (bio)chemical reaction networks. However, except in very special cases, they cannot be analyzed exactly. Additionally, simulation can be computationally intensive. An approach to address these challenges is to consider a more tractable diffusion approximation. Leite and Williams (Ann. Appl. Prob. 29, 2019) proposed a reflected diffusion as an approximation for (bio)chemical reaction networks, which they called the constrained Langevin approximation (CLA) as it extends the usual Langevin approximation beyond the first time some chemical species becomes zero in number. Further explanation and examples of the CLA can be found in Anderson et al. (SIAM Multiscale Modeling Simul. 17, 2019).

In this paper, we extend the approximation of Leite and Williams to (nearly) density-dependent Markov chains, as a first step to obtaining error estimates for the CLA when the diffusion state space is one-dimensional, and we provide a bound for the error in a strong approximation. We discuss some applications for chemical reaction networks and epidemic models, and illustrate these with examples. Our method of proof is designed to generalize to higher dimensions, provided there is a Lipschitz Skorokhod map defining the reflected diffusion process. The existence of such a Lipschitz map is an open problem in dimensions more than one.

Consider the following migration process based on a closed network of N queues with $K_N$ customers. Each station is a $\cdot$/M/$\infty$ queue with service (or migration) rate $\mu$. Upon departure, a customer is routed independently and uniformly at random to another station. In addition to migration, these customers are subject to a susceptible–infected–susceptible (SIS) dynamics. That is, customers are in one of two states: I for infected, or S for susceptible. Customers can swap their state either from I to S or from S to I only in stations. More precisely, at any station, each susceptible customer becomes infected with the instantaneous rate $\alpha Y$ if there are Y infected customers in the station, whereas each infected customer recovers and becomes susceptible with rate $\beta$. We let N tend to infinity and assume that $\lim_{N\to \infty} K_N/N= \eta $, where $\eta$ is a positive constant representing the customer density. The main problem of interest concerns the set of parameters of such a system for which there exists a stationary regime where the epidemic survives in the limiting system. The latter limit will be referred to as the thermodynamic limit. We use coupling and stochastic monotonicity arguments to establish key properties of the associated Markov processes, which in turn allow us to give the structure of the phase transition diagram of this thermodynamic limit with respect to $\eta$. The analysis of the Kolmogorov equations of this SIS model reduces to that of a wave-type PDE for which we have found no explicit solution. This plain SIS model is one among several companion stochastic processes that exhibit both random migration and contagion. Two of them are discussed in the present paper as they provide variants to the plain SIS model as well as some bounds and approximations. These two variants are the departure-on-change-of-state (DOCS) model and the averaged-infection-rate (AIR) model, which both admit closed-form solutions. The AIR system is a classical mean-field model where the infection mechanism based on the actual population of infected customers is replaced by a mechanism based on some empirical average of the number of infected customers in all stations. The latter admits a product-form solution. DOCS features accelerated migration in that each change of SIS state implies an immediate departure. This model leads to another wave-type PDE that admits a closed-form solution. In this text, the main focus is on the closed stochastic networks and their limits. The open systems consisting of a single station with Poisson input are instrumental in the analysis of the thermodynamic limits and are also of independent interest. This class of SIS dynamics has incarnations in virtually all queueing networks of the literature.

We consider the problem of obtaining effective representations for the solutions of linear, vector-valued stochastic differential equations (SDEs) driven by non-Gaussian pure-jump Lévy processes, and we show how such representations lead to efficient simulation methods. The processes considered constitute a broad class of models that find application across the physical and biological sciences, mathematics, finance, and engineering. Motivated by important relevant problems in statistical inference, we derive new, generalised shot-noise simulation methods whenever a normal variance-mean (NVM) mixture representation exists for the driving Lévy process, including the generalised hyperbolic, normal-gamma, and normal tempered stable cases. Simple, explicit conditions are identified for the convergence of the residual of a truncated shot-noise representation to a Brownian motion in the case of the pure Lévy process, and to a Brownian-driven SDE in the case of the Lévy-driven SDE. These results provide Gaussian approximations to the small jumps of the process under the NVM representation. The resulting representations are of particular importance in state inference and parameter estimation for Lévy-driven SDE models, since the resulting conditionally Gaussian structures can be readily incorporated into latent variable inference methods such as Markov chain Monte Carlo, expectation-maximisation, and sequential Monte Carlo.

Developed sequential order statistics (DSOS) are very useful in modeling the lifetimes of systems with dependent components, where the failure of one component affects the performance of remaining surviving components. We study some stochastic comparison results for DSOS in both one-sample and two-sample scenarios. Furthermore, we study various ageing properties of DSOS. We state many useful results for generalized order statistics as well as ordinary order statistics with dependent random variables. At the end, some numerical examples are given to illustrate the proposed results.

In this paper, we propose two new optimal reinsurance models in which both premium budget constraints and the reinsurer’s risk limits are taken into account. To be precise, we assume that the reinsurance premium has an upper bound, and that the admissible ceded loss functions have a pre-specified upper limit. Moreover, we assume that the reinsurance premium principle is calculated by the expected value premium principle. Under the optimality criteria of minimizing the value at risk and conditional value at risk of the insurer’s total risk exposure, we derive the explicit optimal reinsurance treaties, which are layer reinsurance treaties. A new approach is developed to construct the optimal reinsurance treaties. Comparisons with existing studies are also made. Finally, we provide a numerical study based on real data and an example to illustrate the proposed models and results. Our work provides a novel generalization of several known achievements in the literature.

Motivated by applications to COVID dynamics, we describe a model of a branching process in a random environment $\{Z_n\}$ whose characteristics change when crossing upper and lower thresholds. This introduces a cyclical path behavior involving periods of increase and decrease leading to supercritical and subcritical regimes. Even though the process is not Markov, we identify subsequences at random time points $\{(\tau_j, \nu_j)\}$—specifically the values of the process at crossing times, viz. $\{(Z_{\tau_j}, Z_{\nu_j})\}$—along which the process retains the Markov structure. Under mild moment and regularity conditions, we establish that the subsequences possess a regenerative structure and prove that the limiting normal distributions of the growth rates of the process in supercritical and subcritical regimes decouple. For this reason, we establish limit theorems concerning the length of supercritical and subcritical regimes and the proportion of time the process spends in these regimes. As a byproduct of our analysis, we explicitly identify the limiting variances in terms of the functionals of the offspring distribution, threshold distribution, and environmental sequences.

We use Stein’s method to establish the rates of normal approximation in terms of the total variation distance for a large class of sums of score functions of samples arising from random events driven by a marked Poisson point process on $\mathbb{R}^d$. As in the study under the weaker Kolmogorov distance, the score functions are assumed to satisfy stabilisation and moment conditions. At the cost of an additional non-singularity condition, we show that the rates are in line with those under the Kolmogorov distance. We demonstrate the use of the theorems in four applications: Voronoi tessellations, k-nearest-neighbours graphs, timber volume, and maximal layers.

We study the asymptotic growth rate of the labels of high-degree vertices in weighted recursive graphs (WRGs) when the weights are independent, identically distributed, almost surely bounded random variables, and as a result confirm a conjecture by Lodewijks and Ortgiese (‘The maximal degree in random recursive graphs with random weights’, preprint, 2020). WRGs are a generalisation of the random recursive tree and directed acyclic graph models, in which vertices are assigned vertex-weights and where new vertices attach to $m\in\mathbb{N}$ predecessors, each selected independently with a probability proportional to the vertex-weight of the predecessor. Prior work established the asymptotic growth rate of the maximum degree of the WRG model, and here we show that there exists a critical exponent $\mu_m$ such that the typical label size of the maximum-degree vertex equals $n^{\mu_m(1+o(1))}$ almost surely as n, the size of the graph, tends to infinity. These results extend results on the asymptotic behaviour of the location of the maximum degree, formerly only known for the random recursive tree model, to the more general weighted multigraph case of the WRG model. Moreover, for the weighted recursive tree model, that is, the WRG model with $m=1$, we prove the joint convergence of the rescaled degree and label of high-degree vertices under additional assumptions on the vertex-weight distribution, and also extend results on the growth rate of the maximum degree obtained by Eslava, Lodewijks, and Ortgiese (Stoch. Process. Appl. 158, 2023).

In 2008, Tóth and Vető defined the self-repelling random walk with directed edges as a non-Markovian random walk on $\unicode{x2124}$: in this model, the probability that the walk moves from a point of $\unicode{x2124}$ to a given neighbor depends on the number of previous crossings of the directed edge from the initial point to the target, called the local time of the edge. Tóth and Vető found that this model exhibited very peculiar behavior, as the process formed by the local times of all the edges, evaluated at a stopping time of a certain type and suitably renormalized, converges to a deterministic process, instead of a random one as in similar models. In this work, we study the fluctuations of the local times process around its deterministic limit, about which nothing was previously known. We prove that these fluctuations converge in the Skorokhod $M_1$ topology, as well as in the uniform topology away from the discontinuities of the limit, but not in the most classical Skorokhod topology. We also prove the convergence of the fluctuations of the aforementioned stopping times.

A bootstrap percolation process on a graph with n vertices is an ‘infection’ process evolving in rounds. Let $r \ge 2$ be fixed. Initially, there is a subset of infected vertices. In each subsequent round, every uninfected vertex that has at least r infected neighbors becomes infected as well and remains so forever.

We consider this process in the case where the underlying graph is an inhomogeneous random graph whose kernel is of rank one. Assuming that initially every vertex is infected independently with probability $p \in (0,1]$, we provide a law of large numbers for the size of the set of vertices that are infected by the end of the process. Moreover, we investigate the case $p = p(n) = o(1)$, and we focus on the important case of inhomogeneous random graphs exhibiting a power-law degree distribution with exponent $\beta \in (2,3)$. The first two authors have shown in this setting the existence of a critical $p_c =o(1)$ such that, with high probability, if $p =o(p_c)$, then the process does not evolve at all, whereas if $p = \omega(p_c)$, then the final set of infected vertices has size $\Omega(n)$. In this work we determine the asymptotic fraction of vertices that will eventually be infected and show that it also satisfies a law of large numbers.

We study heterogeneously interacting diffusive particle systems with mean-field-type interaction characterized by an underlying graphon and their finite particle approximations. Under suitable conditions, we obtain exponential concentration estimates over a finite time horizon for both 1- and 2-Wasserstein distances between the empirical measures of the finite particle systems and the averaged law of the graphon system.

We determine almost sure limits of rescaled intrinsic volumes of the construction steps of fractal percolation in ${\mathbb R}^d$ for any dimension $d\geq 1$. We observe a factorization of these limit variables which allows one, in particular, to determine their expectations and covariance structure. We also show the convergence of the rescaled expectations and variances of the intrinsic volumes of the construction steps to the expectations and variances of the limit variables, and we give rates for this convergence in some cases. These results significantly extend our previous work, which addressed only limits of expectations of intrinsic volumes.