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}}$.

In this paper, we establish some stochastic comparison results for largest claim amounts of two sets of independent and also for interdependent portfolios under the setup of the proportional odds model. We also establish stochastic comparison results for aggregate claim amounts of two sets of independent portfolios. Further, stochastic comparisons for largest claim amounts from two sets of independent multiple-outlier claims have also been studied. The results we obtained apply to the whole family of extended distributions, also known as the Marshall–Olkin family of distributions. We have given many numerical examples to illustrate the results obtained.

We consider a model of binary opinion dynamics where one opinion is inherently “superior” than the other, and social agents exhibit a “bias” toward the superior alternative. Specifically, it is assumed that an agent updates its choice to the superior alternative with probability α > 0 irrespective of its current opinion and opinions of other agents. With probability $1-\alpha$, it adopts majority opinion among two randomly sampled neighbors and itself. We are interested in the time it takes for the network to converge to a consensus on the superior alternative. In a complete graph of size n, we show that irrespective of the initial configuration of the network, the average time to reach consensus scales as $\Theta(n\,\log n)$ when the bias parameter α is sufficiently high, that is, $\alpha \gt \alpha_c$ where αc is a threshold parameter that is uniquely characterized. When the bias is low, that is, when $\alpha \in (0,\alpha_c]$, we show that the same rate of convergence can only be achieved if the initial proportion of agents with the superior opinion is above certain threshold $p_c(\alpha)$. If this is not the case, then we show that the network takes $\Omega(\exp(\Theta(n)))$ time on average to reach consensus.

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.

The principle of maximum entropy is a well-known approach to produce a model for data-generating distributions. In this approach, if partial knowledge about the distribution is available in terms of a set of information constraints, then the model that maximizes entropy under these constraints is used for the inference. In this paper, we propose a new three-parameter lifetime distribution using the maximum entropy principle under the constraints on the mean and a general index. We then present some statistical properties of the new distribution, including hazard rate function, quantile function, moments, characterization, and stochastic ordering. We use the maximum likelihood estimation technique to estimate the model parameters. A Monte Carlo study is carried out to evaluate the performance of the estimation method. In order to illustrate the usefulness of the proposed model, we fit the model to three real data sets and compare its relative performance with respect to the beta generalized Weibull family.

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.

In this paper, we study the estimation of a scale parameter from a sample of lifetimes of coherent systems with a fixed structure. We assume that the components are independent and identically distributed having a common distribution which belongs to a scale parameter family. Some results are obtained as well for dependent (exchangeable) components. To this end, we will use the representations for the distribution function of a coherent system based on signatures. We prove that the efficiency of the estimators depends on the structure of the system and on the scale parameter family. In the dependence case, it also depends on the baseline copula function.

We introduce a broad class of multi-hooking networks, wherein multiple copies of a seed are hooked at each step at random locations, and the number of copies follows a predetermined building sequence of numbers. We analyze the degree profile in random multi-hooking networks by tracking two kinds of node degrees—the local average degree of a specific node over time and the global overall average degree in the graph. The former experiences phases and the latter is invariant with respect to the type of building sequence and is somewhat similar to the average degree in the initial seed. We also discuss the expected number of nodes of the smallest degree. Additionally, we study distances in the network through the lens of the average total path length, the average depth of a node, the eccentricity of a node, and the diameter of the graph.

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.

In this work, we establish a connection between the cumulative residual entropy and the Gini mean difference (GMD). Some relationships between the extropy and the GMD, and the truncated GMD and dynamic versions of the cumulative past extropy are also established. We then show that several entropy and extropy measures discussed here can be brought into the framework of probability weighted moments, which would facilitate finding estimators of these measures.

This paper extends the standard double-exponential jump-diffusion (DEJD) model to allow for successive jumps to bring about different effects on the asset price process. The double-exponentially distributed jump sizes are no longer assumed to have the same parameters; instead, we assume that these parameters may take a series of different values to reflect growing or diminishing effects from these jumps. The mathematical analysis of the stock price requires an introduction of a number of distributions that are extended from the hypoexponential (HE) distribution. Under such a generalized setting, the European option price is derived in closed-form which ensures its computational convenience. Through our numerical examples, we examine the effects on the return distributions from the growing and diminishing severity of the upcoming jumps expected in the near future, and investigate how the option prices and the shapes of the implied volatility smiles are influenced by the varying severity of jumps. These results demonstrate the benefits of the modeling flexibility provided by our extension.

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.

In this paper, we investigate the pricing of vulnerable European options in a market where the underlying stocks are not perfectly liquid. A liquidity discount factor is used to model the effect of liquidity risk in the market, and the default risk of the option issuer is incorporated into the model using a reduced-form model, where the default intensity process is correlated with the liquidity risk. We obtain a semiclosed-form pricing formula of vulnerable options through the inverse Fourier transform. Finally, we illustrate the effects of default risk and liquidity risk on option prices numerically.

Motivated by Ahmadi-Javid (Journal of Optimization Theory Applications, 155(3), 2012, 1105–1123) and Ahmadi-Javid and Pichler (Mathematics and Financial Economics, 11, 2017, 527–550), the concept of Tsallis Value-at-Risk (TsVaR) based on Tsallis entropy is introduced in this paper. TsVaR corresponds to the tightest possible upper bound obtained from the Chernoff inequality for the Value-at-Risk. The main properties and analogous dual representation of TsVaR are investigated. These results partially generalize the Entropic Value-at-Risk by involving Tsallis entropies. Three spaces, called the primal, dual, and bidual Tsallis spaces, corresponding to TsVaR are fully studied. It is shown that these spaces equipped with the norm induced by TsVaR are Banach spaces. The Tsallis spaces are related to the $L^p$ spaces, as well as specific Orlicz hearts and Orlicz spaces. Finally, we derive explicit formula for the dual TsVaR norm.

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.