We consider the problem of optimally maintaining an offshore wind farm in which major components progressively degrade over time due to normal usage and exposure to a randomly varying environment. The turbines exhibit both economic and stochastic dependence due to shared maintenance setup costs and their common environment. Our aim is to identify optimal replacement policies that minimize the expected total discounted setup, replacement, and lost power production costs over an infinite horizon. The problem is formulated using a Markov decision process (MDP) model from which we establish monotonicity of the cost function jointly in the degradation level and environment state and characterize the structure of the optimal replacement policy. For the special case of a two-turbine farm, we prove that the replacement threshold of one turbine depends not only on its own state of degradation but also on the state of degradation of the other turbine in the farm. This result yields a complete characterization of the replacement policy of both turbines by a monotone curve. The policies characterized herein can be used to optimally prescribe timely replacements of major components and suggest when it is most beneficial to share costly maintenance resources.

In this paper, a new point process is introduced. It combines the nonhomogeneous Poisson process with the generalized Polya process (GPP) studied in recent literature. In reliability interpretation, each event (failure) from this process is minimally repaired with a given probability and GPP-repaired with the complementary probability. Characterization of the new process via the corresponding bivariate point process is presented. The mean numbers of events for marginal processes are obtained via the corresponding rates, which are used for considering an optimal replacement problem as an application.

Omega ratio, a risk-return performance measure, is defined as the ratio of the expected upside deviation of return to the expected downside deviation of return from a predetermined threshold described by an investor. Motivated by finding a solution protected against sampling errors, in this paper, we focus on the worst-case Omega ratio under distributional uncertainty and its application to robust portfolio selection. The main idea is to deal with optimization problems with all uncertain parameters within an uncertainty set. The uncertainty set of the distribution of returns given characteristic information, including the first two orders of moments and the Wasserstein distance, can handle data problems with uncertainty while making the calculation feasible.

Finite state Markov processes and their aggregated Markov processes have been extensively studied, especially in ion channel modeling and reliability modeling. In reliability field, the asymptotic behaviors of repairable systems modeled by both processes have been paid much attention to. For a Markov process, it is well-known that limiting measures such as availability and transition probability do not depend on the initial state of the process. However, for an aggregated Markov process, it is difficult to directly know whether this conclusion holds true or not from the limiting measure formulas expressed by the Laplace transforms. In this paper, four limiting measures expressed by Laplace transforms are proved to be independent of the initial state through Tauber’s theorem. The proof is presented under the assumption that the rank of transition rate matrix is one less than the dimension of state space for the Markov process, which includes the case that all states communicate with each other. Some numerical examples and discussions based on these are presented to illustrate the results directly and to show future related research topics. Finally, the conclusion of the paper is given.

In this paper, we consider the friendship paradox in the context of random walks and paths. Among our results, we give an equality connecting long-range degree correlation, degree variability, and the degree-wise effect of additional steps for a random walk on a graph. Random paths are also considered, as well as applications to acquaintance sampling in the context of core-periphery structure.

We study site and bond percolation in simple directed random graphs with a given degree distribution. We derive the percolation threshold for the giant strongly connected component and the fraction of vertices in this component as a function of the percolation probability. The results are obtained for degree sequences in which the maximum degree may depend on the total number of nodes n, being asymptotically bounded by $n^{\frac{1}{9}}$.

Two-part framework and the Tweedie generalized linear model (GLM) have traditionally been used to model loss costs for short-term insurance contracts. For most portfolios of insurance claims, there is typically a large proportion of zero claims that leads to imbalances, resulting in lower prediction accuracy of these traditional approaches. In this article, we propose the use of tree-based methods with a hybrid structure that involves a two-step algorithm as an alternative approach. For example, the first step is the construction of a classification tree to build the probability model for claim frequency. The second step is the application of elastic net regression models at each terminal node from the classification tree to build the distribution models for claim severity. This hybrid structure captures the benefits of tuning hyperparameters at each step of the algorithm; this allows for improved prediction accuracy, and tuning can be performed to meet specific business objectives. An obvious major advantage of this hybrid structure is improved model interpretability. We examine and compare the predictive performance of this hybrid structure relative to the traditional Tweedie GLM using both simulated and real datasets. Our empirical results show that these hybrid tree-based methods produce more accurate and informative predictions.

Imagine, you enter a grocery store to buy food. How many people do you overlap with in this store? How much time do you overlap with each person in the store? In this paper, we answer these questions by studying the overlap times between customers in the infinite server queue. We compute in closed form the steady-state distribution of the overlap time between a pair of customers and the distribution of the number of customers that an arriving customer will overlap with. Finally, we define a residual process that counts the number of overlapping customers that overlap in the queue for at least $\delta$ time units and compute its distribution.

Commodity spot prices tend to revert to some long-term mean level and most commodity derivatives are based on futures prices, not on spot prices. So, we consider spread options on futures instead of spot or spot index, where the log spot price follows a mean-reverting process. The volatility of the mean-reverting process is driven by two different (fast and slow) scale factors. We use asymptotic analysis to obtain a closed-form approximation of the futures prices and a closed-form formula for the approximate prices of spread options on the futures. The overall improvement of our analytic formula over the classical Kirk–Bjerksund–Sternsland (KBS) formula is discussed via numerical experiments.

This paper studies a Pareto-optimal reinsurance problem when the contract is subject to default of the reinsurer. We assume that the reinsurer can invest a share of its wealth in a risky asset and default occurs when the reinsurer's end-of-period wealth is insufficient to cover the indemnity. We show that without the solvency regulation, the optimal indemnity function is of excess-of-loss form, regardless of the investment decision. Under the solvency regulation constraint, by assuming the investment decision remains unchanged, the optimal indemnity function is characterized element-wisely. Partial results are derived when both the indemnity function and investment decision are impacted by the solvency regulation. Numerical examples are provided to illustrate the implications of our results and the sensitivity of solution to the model parameters.

In this study, we consider a class of multiple-drawing opposite-reinforcing urns with time-dependent replacement rules. The class has the symmetric property of a Friedman-type urn. We divide the class into a small-increment regime and a large-increment regime. For small-increment schemes, we prove almost-sure convergence and a central limit theorem for the proportion of white balls by stochastic approximation. For large-increment schemes, by assuming the affinity condition, we show almost-sure convergence of the proportion of white balls by martingale theory and present a way to identify the limit distribution of the proportion of white balls.

We consider a two-stage service system with two types of servers, namely subordinates who perform the first-stage service and supervisors who have their own responsibilities in addition to collaborating with the subordinates on the second-stage service. Rewards are earned when first- or second-stage service is completed and when supervisors finish one of their own responsibilities. Costs are incurred when impatient customers abandon without completing the second-stage service. Our problem is to determine how the supervisors should distribute their time between their joint work with the subordinates and their own responsibilities. Under the assumptions that service times at both stages are exponentially distributed and that the customers waiting for second-stage service abandon after an exponential amount of time, we prove that one of two policies will maximize the long-run average profit. Namely, it is optimal for supervisors to start collaborating with subordinates either when subordinates can no longer serve new customers or as soon as there is a customer ready for second-stage service. Furthermore, we show that the optimality condition is a simple threshold on the system parameters. We conclude by proving that pooling supervisors (and their associated subordinates) improves system performance, but with limited returns as more supervisors are pooled.

One way to model telecommunication networks are static Boolean models. However, dynamics such as node mobility have a significant impact on the performance evaluation of such networks. Consider a Boolean model in $\mathbb {R}^d$ and a random direction movement scheme. Given a fixed time horizon $T>0$, we model these movements via cylinders in $\mathbb {R}^d \times [0,T]$. In this work, we derive central limit theorems for functionals of the union of these cylinders. The volume and the number of isolated cylinders and the Euler characteristic of the random set are considered and give an answer to the achievable throughput, the availability of nodes, and the topological structure of the network.

We consider the assignment of servers to two phases of service in a two-stage tandem queueing system when customers can abandon from each stage of service. New jobs arrive at both stations. Jobs arriving at station 1 may go through both phases of service and jobs arriving at station 2 may go through only one phase of service. Stage-dependent holding and lump-sum abandonment costs are incurred. Continuous-time Markov decision process formulations are developed that minimize discounted expected and long-run average costs. Because uniformization is not possible, we use the continuous-time framework and sample path arguments to analyze control policies. Our main results are conditions under which priority rules are optimal for the single-server model. We then propose and evaluate threshold policies for allocating one or more servers between the two stages in a numerical study. These policies prioritize a phase of service before “switching” to the other phase when total congestion exceeds a certain number. Results provide insight into how to adjust the switching rule to significantly reduce costs for specific input parameters as well as more general multi-server situations when neither preemption or abandonments are allowed during service and service and abandonment times are not exponential.

In this paper, we discuss a generalization of the classical compound Poisson model with claim sizes following a compound distribution. As applications, we consider models involving zero-truncated geometric, zero-truncated negative-binomial and zero-truncated binomial batch-claim arrivals. We also provide some ruin-related quantities under the resulting risk models. Finally, through numerical examples, we visualize the behavior of these quantities.

We consider an extreme renewal process with no-mean heavy-tailed Pareto(II) inter-renewals and shape parameter $\alpha$ where $0\lt\alpha \leq 1$. Two steps are required to derive integral expressions for the analytic probability density functions (pdfs) of the fixed finite time $t$ excess, age, and total life, and require extensive computations. Step 1 creates and solves a Volterra integral equation of the second kind for the limiting pdf of a basic underlying regenerative process defined in the text, which is used for all three fixed finite time $t$ pdfs. Step 2 builds the aforementioned integral expressions based on the limiting pdf in the basic underlying regenerative process. The limiting pdfs of the fixed finite time $t$ pdfs as $t\rightarrow \infty$ do not exist. To reasonably observe the large $t$ pdfs in the extreme renewal process, we approximate them using the limiting pdfs having simple well-known formulas, in a companion renewal process where inter-renewals are right-truncated Pareto(II) variates with finite mean; this does not involve any computations. The distance between the approximating limiting pdfs and the analytic fixed finite time large $t$ pdfs is given by an $L_{1}$ metric taking values in $(0,1)$, where “near $0$” means “close” and “near $1$” means “far”.

Let $X_1, \ldots, X_n$ be mutually independent exponential random variables with distinct hazard rates $\lambda _1, \ldots, \lambda _n$ and let $Y_1, \ldots, Y_n$ be a random sample from the exponential distribution with hazard rate $\bar \lambda = \sum _{i=1}^{n} \lambda _i/n$. Also let $X_{1:n} \lt \cdots \lt X_{n:n}$ and $Y_{1:n} \lt \cdots \lt Y_{n:n}$ be their associated order statistics. It is proved that for $1\le i \lt j \le n$, the generalized spacing $X_{j:n} - X_{i:n}$ is more dispersed than $Y_{j:n} - Y_{i:n}$ according to dispersive ordering and for $2\le i \le n$, the dependence of $X_{i:n}$ on $X_{1:n}$ is less than that of $Y_{i:n}$ on $Y_{1 :n}$, in the sense of the more stochastically increasing ordering. This dependence result is also extended to the proportional hazard rates (PHR) model. This extends the earlier work of Genest et al. [(2009)]. On the range of heterogeneous samples. Journal of Multivariate Analysis 100: 1587–1592] who proved this result for $i =n$.

This paper concentrates on the fundamental concepts of entropy, information and divergence to the case where the distribution function and the respective survival function play the central role in their definition. The main aim is to provide an overview of these three categories of measures of information and their cumulative and survival counterparts. It also aims to introduce and discuss Csiszár's type cumulative and survival divergences and the analogous Fisher's type information on the basis of cumulative and survival functions.

Innovations in medicine provide us longer and healthier life, leading lower mortality. Sooner rather than later, much greater longevity would be possible for us due to artificial intelligence advances in health care. Similarly, Advanced Driver Assistance Systems (ADAS) in highly automated vehicles may reduce or even eventually eliminate accidents by perceiving dangerous situations, which would minimize the number of accidents and lead to fewer loss claims for insurance companies. To model the survivor function capturing greater longevity as well as the number of claims reflecting less accidents in the long run, in this paper, we study a Cox process whose intensity process is piecewise-constant and decreasing. We derive its ultimate distributional properties, such as the Laplace transform of intensity integral process, the probability generating function of point process, their associated moments and cumulants, and the probability of no more claims for a given time point. In general, this simple model may be applicable in many other areas for modeling the evolution of gradually disappearing events, such as corporate defaults, dividend payments, trade arrivals, employment of a certain job type (e.g., typists) in the labor market, and release of particles. In particular, we discuss some potential applications to insurance.

This paper is concerned with developing low variance simulation estimators of probabilities related to the sum of Bernoulli random variables. It shows how to utilize an identity used in the Chen-Stein approach to bounding Poisson approximations to obtain low variance estimators. Applications and numerical examples in such areas as pattern occurrences, generalized coupon collecting, system reliability, and multivariate normals are presented. We also consider the problem of estimating the probability that a positive linear combination of Bernoulli random variables is greater than some specified value, and present a simulation estimator that is always less than the Markov inequality bound on that probability.